CASLLuaPythonRThe Network Action SetSyntaxDetailsExamplesExamples16.1 Finding the Biconnected Components of a Simple Undirected Graph16.2 Calculating the Centrality of a Simple Directed Graph16.3 Finding the Maximal Cliques of a Simple Undirected Graph16.4 Detecting Communities for a Simple Undirected Graph16.5 Finding the Connected Components of a Simple Undirected Graph16.6 Calculating the Core Decomposition of a Simple Undirected Graph16.7 Enumerating the Cycles of a Simple Directed Graph16.8 Node Similarity in an Undirected Graph16.9 Enumerating the Paths of a Simple Directed Graph16.10 Pattern Matching of a Simple Directed Graph16.11 Finding the Reach Networks of a Simple Directed Graph16.12 Reading a Simple Directed Graph16.13 Finding the Shortest Paths for All Source-Sink Pairs16.14 Calculating the Summary Statistics of a Simple Directed Graph16.15 Calculating the Transitive Closure of a Simple Directed GraphCopyright © SAS Institute Inc. All rights reserved.Last updated: June 07, 2018