CASLLuaPythonRNetwork Action SetSyntaxDetailsExamplesReferencesExamplesSubsections:22.1 Finding the Biconnected Components of an Undirected Graph22.2 Calculating the Centrality of a Directed Graph22.3 Finding the Maximal Cliques of an Undirected Graph22.4 Detecting Communities for an Undirected Graph22.5 Finding the Connected Components of an Undirected Graph22.6 Calculating the Core Decomposition of an Undirected Graph22.7 Enumerating the Cycles of a Directed Graph22.8 Finding Shortest Paths in a Road Network Using Persistent Data Structures22.9 Node Similarity in an Undirected Graph22.10 Enumerating the Paths of a Directed Graph22.11 Pattern Matching of a Directed Graph22.12 Network Projection of a Bipartite Graph22.13 Finding the Reach Networks of a Directed Graph22.14 Reading a Directed Graph22.15 Finding the Shortest Paths for All Source-Sink Pairs22.16 Calculating the Summary Statistics of a Directed Graph22.17 Calculating the Transitive Closure of a Directed GraphCopyright © SAS Institute Inc. All rights reserved.Last updated: November 04, 2020