Graph Algorithm Solver
One edge per line: A-B (undirected) or A->B (directed), add a weight like A-B:3; a lone node name marks an isolated node. Node names are case-sensitive.
Graph type:
Algorithm:
Weighted edges:
Adjacency matrix:
Calculation Result
Download CSV
| No. | Result type | Item | Value | Note |
|---|
Introduction to the tool and how to use it
Enter one edge per line (A-B, A->B, or A-B:3 for a weighted edge) and get the adjacency list, BFS/DFS traversal, shortest paths, connected components, topological sort and minimum spanning tree in one run, with undirected/directed modes and an optional adjacency matrix. Cycles, self loops, duplicate edges, isolated nodes and unknown start nodes are reported clearly, and the result table can be exported as CSV.
Message board
All messages →-
No one has spoken up yet — want to go first?