The OPTGRAPH Procedure

Common Notation and Assumptions

This section introduces some common notation and assumptions used throughout the chapter.

A complete graph, denoted $K(N)$, is a graph in which every pair of nodes in N is connected by a link. The number of links in $K(N)$ is described in Table 1.55.

Table 1.55: Formulas for Number of Links in $K(N)$

Graph Direction

Default

INCLUDE_SELFLINK

Directed

$|N|^2 - |N|$

$|N|^2$

Undirected

$\frac{|N|^2 - |N|}{2}$

$\frac{|N|^2 + |N|}{2}$