How to run a query 01 Load a graph. The DAG preset is a 7-node directed acyclic graph; the bridge preset has an undirected triangle plus a chain; the Cycle C₅ preset plus the Directed toggle makes a single directed ring. 02 Choose an algorithm in the Order & connectivity tab. Topological sort refuses undirected graphs outright and explains why. 03 Read the rows. Topological sort prints the order, the layer count and one row per layer; the connectivity algorithms print component lists, cut vertices, bridges or an edge-component count. 04 Watch the walk. Topological sort steps through in-degrees and removals; cycle detection highlights the closing edge in the canvas.
Worked readouts
Graph · algorithm
Readout
DAG preset · Topological sort
order A → B → C → D → E → F → G ; layers 5 — L1 A , L2 B, C , L3 D , L4 E, F , L5 G
Bridge preset · Cut vertices & bridges
cut vertices B, D, E ; bridges D–E, B–D ; edge components 3 — A, B, C · D · E, F, G
Cycle C₅ + Directed · Strongly connected
component count 1 , holding E, D, C, B, A
DAG preset · Strongly connected
component count 7 , one singleton per node
Default graph · Cycle detection
has cycle Yes ; cycle A → B → C → A ; reason Back edge C – A
DAG preset · Cycle detection
has cycle No ; reason No back edge ⇒ directed acyclic graph
The DAG layers are a scheduling plan: A first, then B and C in any order, then D, then E and F, then G. The bridge preset shows why a single bridge can split the graph in three: B–D and D–E are the only connections between the triangle A–B–C, the single node D and the triangle E–F–G.
Why the toggle changes the answer The default graph contains the triangle A–B–C, and Cycle detection reports A → B → C → A with the reason Back edge C – A . Switch Directed on and the same three edges only point forward (A→B, B→C, A→C): the detector now answers No , reason No back edge ⇒ directed acyclic graph , and Topological sort — which previously returned "Topological sort is defined for directed graphs only — switch the graph to directed first" — succeeds with the order A → B → C → D → E → F in 6 layers. One toggle, two opposite verdicts; the direction of the edges is the whole question.
Limits
Topological sort is directed-only. It refuses undirected input rather than guessing an orientation. Strong connectivity is defined for directed graphs too; on an undirected graph the same panel's Components answers the reachability question. Bridges are two-edge connectivity, not n-connectivity. The panel reports cut vertices, bridges and the count of two-edge-connected groups; it does not compute vertex connectivity, minimum cuts or planarity — minimum cuts live in flow & matching , and structural counts in metrics & centrality .
What it doesn't do. It does not schedule weighted tasks, colour graphs or produce multiple topological orders; the canvas shows one valid order, and editing edges is the way to explore others.
Where it is useful Build and dependency order The DAG preset reads like a small build plan; the layer rows tell you what can run in parallel (B, C , then E, F ) and what is serialised behind them (D , then G ). If a new dependency closes a loop, Cycle detection names the back edge instead of returning a broken order.
Fragility review On the bridge preset, losing B–D or D–E disconnects three groups, and the single node D becomes unreachable. Run Components on a graph with an isolated node to see the other failure mode: build the default graph, add one node, and the component count reads 2 with the largest component at 6 — the traversal panel lists the same node as unreachable from A.
Privacy All ordering and connectivity work runs in your browser; the graph never leaves the page.
References
Wikipedia, Topological sorting , en.wikipedia.org (访问日期:2026-10-07)— DAG orders and layering.
Wikipedia, Strongly connected component , en.wikipedia.org (访问日期:2026-10-07)— mutual reachability in directed graphs.
Wikipedia, Biconnected component , en.wikipedia.org (访问日期:2026-10-07)— cut vertices, bridges and edge components.
Wikipedia, Cycle detection , en.wikipedia.org (访问日期:2026-10-07)— back edges as cycle witnesses.
Calculators in this hub
Hand-picked tools, one click away. The mini versions compute live and carry your values into the full calculator.
Sources & review
Reviewed by CalcX Editorial Team
Updated 2026-10-07