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

Details: OPTGRAPH Procedure

Subsections:

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

Previous Page
|
Next Page
|
Top of Page