NETWORK Procedure OverviewGetting StartedSyntaxDetailsExamplesReferences Details: NETWORK Procedure Subsections: Graph Input and Output Data Determinism Execution Modes and Data Movement Persistent Data Structures (In-Memory Graphs) Numeric Limitations Size Limitations Common Notation and Assumptions Examples Statement and Option Cross-Reference Biconnected Components and Articulation Points Centrality Clique Enumeration Community Detection Connected Components Core Decomposition Cycle Enumeration Node Similarity Path Enumeration Pattern Matching Network Projection Reach (Ego) Network Shortest Path Summary Statistics Topological Sort Transitive Closure Macro Variable _NETWORK_ ODS Table Names The %PlotGraph Macro Last updated: October 12, 2026