Graph Algorithms Playground

← Back to Projects

Current Mode: Add Node

Click on empty space to add a new node

Load Example:
Graph Building:
Algorithm:
Unvisited
Current/Frontier
Visited
Start Node
End Node
Path
Algorithm Status: Ready
Nodes Visited: 0
Path Length: -
Time Complexity: -
Quick Instructions
  • Click empty space to add nodes
  • Click two nodes to connect
  • Use Set Start/End buttons
  • Load presets for quick start
Algorithms
  • BFS/DFS: Graph traversal
  • Dijkstra: Shortest path
  • Kruskal/Prim: Min spanning tree