CASLLuaPythonR Network Optimization Action Set SyntaxDetailsExamplesReferences Examples Subsections: 2.1 Finding the Biconnected Components of an Undirected Graph 2.2 Finding the Block-Cut Tree of an Undirected Graph 2.3 Finding the Maximal Cliques of an Undirected Graph 2.4 Finding the Connected Components of an Undirected Graph 2.5 Enumerating the Cycles of a Directed Graph 2.6 Solving the Linear Assignment Problem to Minimize Relay Times 2.7 Finding Shortest Paths in a Road Network Using Persistent Data Structures 2.8 Calculating the Maximum Network Flow for a Directed Graph 2.9 Calculating the Minimum-Cost Network Flow for a Directed Graph 2.10 Calculating a Minimum Cut for an Undirected Graph 2.11 Calculating a Minimum Spanning Forest for an Undirected Graph 2.12 Enumerating the Paths of a Directed Graph 2.13 Reading a Directed Graph 2.14 Finding the Shortest Paths for All Source-Sink Pairs 2.15 Inputting a Molecular Graph 2.16 Calculating the Summary Statistics of a Directed Graph 2.17 Topological Ordering of a Directed Graph 2.18 Calculating the Transitive Closure of a Directed Graph 2.19 Solving the Traveling Salesman Problem for an Undirected Graph 2.20 Solving the Vehicle Routing Problem for an Undirected Graph Last updated: March 06, 2026