The OPTGRAPH Procedure
Details: OPTGRAPH Procedure
- 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 Detection
- 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
Copyright © SAS Institute Inc. All rights reserved.
Last updated: November 04, 2020