Previous Page
|
Next Page
The OPTGRAPH Procedure
Overview
Getting Started
Road Network Shortest Path
Authority in U.S. Supreme Court Precedence
Syntax
Functional Summary
PROC OPTGRAPH Statement
BICONCOMP Statement
CENTRALITY Statement
CLIQUE Statement
COMMUNITY Statement
CONCOMP Statement
CORE Statement
CYCLE Statement
DATA_LINKS_VAR Statement
DATA_MATRIX_VAR Statement
DATA_NODES_VAR Statement
EIGENVECTOR Statement
LINEAR_ASSIGNMENT Statement
MINCOSTFLOW Statement
MINCUT Statement
MINSPANTREE Statement
PERFORMANCE Statement
REACH Statement
SHORTPATH Statement
SUMMARY Statement
TRANSITIVE_CLOSURE Statement
TSP Statement
Details
Graph Input Data
Matrix Input Data
Data Input Order
Parallel Processing
Numeric Limitations
Size Limitations
Common Notation and Assumptions
Biconnected Components and Articulation Points
Centrality
Clique
Community
Connected Components
Core Decomposition
Cycle
Eigenvector Problem
Linear Assignment (Matching)
Minimum-Cost Network Flow
Minimum Cut
Minimum Spanning Tree
Reach (Ego) Network
Shortest Path
Summary
Transitive Closure
Traveling Salesman Problem
Macro Variables
ODS Table Names
Examples
Articulation Points in a Terrorist Network
Influence Centrality for Project Groups in a Research Department
Betweenness and Closeness Centrality for Computer Network Topology
Betweenness and Closeness Centrality for Project Groups in a Research Department
Eigenvector Centrality for Word Sense Disambiguation
Centrality Metrics for Project Groups in a Research Department
Community Detection on Zachary’s Karate Club Data
Recursive Community Detection on Zachary’s Karate Club Data
Cycle Detection for Kidney Donor Exchange
Linear Assignment Problem for Minimizing Swim Times
Linear Assignment Problem, Sparse Format versus Dense Format
Minimum Spanning Tree for Computer Network Topology
Transitive Closure for Identification of Circular Dependencies in a Bug Tracking System
Reach Networks for Computation of Market Coverage of a Terrorist Network
Traveling Salesman Tour through US Capital Cities
References
Examples: OPTGRAPH Procedure
Subsections:
1.1 Articulation Points in a Terrorist Network
1.2 Influence Centrality for Project Groups in a Research Department
1.3 Betweenness and Closeness Centrality for Computer Network Topology
1.4 Betweenness and Closeness Centrality for Project Groups in a Research Department
1.5 Eigenvector Centrality for Word Sense Disambiguation
1.6 Centrality Metrics for Project Groups in a Research Department
1.7 Community Detection on Zachary’s Karate Club Data
1.8 Recursive Community Detection on Zachary’s Karate Club Data
1.9 Cycle Detection for Kidney Donor Exchange
1.10 Linear Assignment Problem for Minimizing Swim Times
1.11 Linear Assignment Problem, Sparse Format versus Dense Format
1.12 Minimum Spanning Tree for Computer Network Topology
1.13 Transitive Closure for Identification of Circular Dependencies in a Bug Tracking System
1.14 Reach Networks for Computation of Market Coverage of a Terrorist Network
1.15 Traveling Salesman Tour through US Capital Cities
Previous Page
|
Next Page
|
Top of Page