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 weighted A-B:3) to compute in one click: adjacency list, BFS/DFS traversal, shortest path, connected components, topological sort, and minimum spanning tree; choose undirected or directed and output the adjacency matrix. Cycles, self-loops, parallel edges, isolated nodes, and invalid start points all receive clear notices, and result tables support CSV export.
How to use
- Paste each edge on its own line into the input box.
- Choose graph type and algorithm, enter start and end points, and toggle the adjacency matrix as needed.
- Click Run.
- Review traversal, shortest path, connected components, and other results; copy or export them.
Message board
All messages →-
No one has spoken up yet — want to go first?