Tool guide

Topological Sort and Connectivity: Cycles, Bridges and SCCs

Five algorithms share the Order & connectivity panel. Topological sort gives a linear order and a layer assignment for a directed acyclic graph. Strongly connected finds the mutually reachable groups of a directed graph; Components finds the connected groups of any graph. Cut vertices & bridges names the nodes and edges whose removal disconnects a component, and Cycle detection reports whether a cycle exists, with the back edge that proves it. The graph is the shared canvas from the graph workbench.

Updated Reviewed by CalcX Editorial Team4 sources4 min read