CASLLuaPythonR Network Action Set SyntaxDetailsExamplesReferences Examples Subsections: 28.1 Finding the Biconnected Components of an Undirected Graph 28.2 Finding the Block-Cut Tree of an Undirected Graph 28.3 Calculating the Centrality of a Directed Graph 28.4 Finding the Maximal Cliques of an Undirected Graph 28.5 Detecting Communities for an Undirected Graph 28.6 Finding the Connected Components of an Undirected Graph 28.7 Calculating the Core Decomposition of an Undirected Graph 28.8 Enumerating the Cycles of a Directed Graph 28.9 Finding Shortest Paths in a Road Network Using Persistent Data Structures 28.10 Node Similarity in an Undirected Graph 28.11 Enumerating the Paths of a Directed Graph 28.12 Pattern Matching of a Directed Graph 28.13 Pattern Matching of an Undirected Graph Using FCMP Filter Functions 28.14 Network Projection of a Bipartite Graph 28.15 Finding the Reach Networks of a Directed Graph 28.16 Reading a Directed Graph 28.17 Finding the Shortest Paths for All Source-Sink Pairs 28.18 Inputting a Molecular Graph 28.19 Calculating the Summary Statistics of a Directed Graph 28.20 Topological Ordering of a Directed Graph 28.21 Calculating the Transitive Closure of a Directed Graph Last updated: March 12, 2026