Graph Traversal Visualizer
Graph Traversal Visualizer 🕸️
Define Graph
Text Input
Enter Edges (e.g., "1 2" or "1 2 6" per line):
Traversal
Start Node:
End Node (for Dijkstra):
Breadth-First Search (BFS)
Depth-First Search (DFS)
Dijkstra's Algorithm
Bellman-Ford Algorithm
Run Traversal
Pause
Continue
Reset Visuals
Animation Speed:
Graph Visualization
Path Information
◀ Previous
1/1
Next ▶