Directed Graph Component and Condensation Review
Identify mutual-reachability components and return their acyclic dependency condensation with a checked topological order.
Loading tool…
How to use Directed Graph Component and Condensation Review
Compute bounded reachability, group nodes that can reach each other, and collapse cross-component edges into a duplicate-free directed graph. A topological order of that condensation makes cyclic regions visible without pretending the original graph is a DAG.
- Enter model json (schema and units below).
- Choose the stated convention and check the units and supported model.
- Calculate, inspect the result, then copy or download it.
Good to know
- 1–50 distinct labels and 0–500 distinct ordered edges. Self edges are allowed; no edge weights, dynamic graph edits, source-code dependency discovery or execution. Output component identifiers are zero-based and stable by original node order.
- Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.
Common questions
Can the condensed graph contain a directed cycle?
No. Mutually reachable nodes belong to the same component. A directed cycle among distinct components would contradict that definition.
Is the input uploaded or saved?
No. The tool calculates inside this browser tab and provides a local download; it does not persist your input.
Keep going with related tools
All math →Project Critical Path Planner
Calculate earliest and latest task timing, exact total slack and critical connections in a task network.
EducationWeighted Shortest Path Workbench
Inspect a shortest-path witness and distances from one source in your own nonnegative weighted graph.
MathMinimum Spanning Forest Workbench
Connect every reachable undirected component at minimum total edge weight while preserving isolated nodes and source-edge provenance.
EducationCourse Prerequisite Evidence Workbench
Check authored course prerequisites against completed-course and placement facts, preserving alternative sets, missing scores and exact completed-credit evidence.