Graph Theory Playground
Mode
Add Node
Add Edge
Move Node
Delete
Example Graphs
Simple Path (A→B→C→D)
Cycle Graph (C₅)
Complete Graph (K₄)
Binary Tree
Weighted Graph
Petersen-like
Pathfinding
— Select Algorithm —
Dijkstra (Weighted)
BFS (Fewest Edges)
From
To
Run
Graph Info
Nodes
0
Edges
0
Connected
—
Clear Canvas
Click to add a node