The OPTGRAPH Procedure

Overview: OPTGRAPH Procedure

The OPTGRAPH procedure includes a number of graph theory, combinatorial optimization, and network analysis algorithms. The algorithm classes are listed in Table 1.

Table 1: Algorithm Classes in PROC OPTGRAPH

Algorithm Class PROC OPTGRAPH Statement
Biconnected components BICONCOMP
Centrality metrics CENTRALITY
Maximal cliques CLIQUE
Community detection COMMUNITY
Connected components CONCOMP
Core decomposition CORE
Cycle detection CYCLE
Eigenvector problem EIGENVECTOR
Weighted matching LINEAR_ASSIGNMENT
Minimum-cost network flow MINCOSTFLOW
Minimum cut MINCUT
Minimum spanning tree MINSPANTREE
Reach networks REACH
Shortest path SHORTPATH
Graph summary SUMMARY
Transitive closure TRANSITIVE_CLOSURE
Traveling salesman TSP


You can use the OPTGRAPH procedure to analyze relationships between entities. These relationships are typically defined by using a graph. A graph upper G equals left-parenthesis upper N comma upper A right-parenthesis is defined over a set N of nodes and a set A of arcs. A node is an abstract representation of some entity (or object), and an arc defines some relationship (or connection) between two nodes. The terms node and vertex are often interchanged in describing an entity. The term arc is often interchanged with the term edge or link when describing a connection.

You can check the SAS log for the version number being used in any invocation of PROC OPTGRAPH. The following statements check the version:

proc optgraph;
run;

Then the log displays the version number as shown in Figure 1.

Figure 1: Version Number Displayed in Log

NOTE: ------------------------------------------------------------------------------------------
NOTE: Running OPTGRAPH version 15.1.                                                            
NOTE: ------------------------------------------------------------------------------------------
NOTE: The OPTGRAPH procedure is executing in single-machine mode.                               
NOTE: ------------------------------------------------------------------------------------------


Last updated: August 06, 2020