Graph Traversal Visualizer

Mode: Add Nodes

Algorithm

Mode

Graph Type

Animation Speed

500ms

Nodes

Edges

Unvisited

In Queue

Current

Visited

Start Node

Instructions:
• Click canvas to add nodes
• Switch to "Add Edges" and click two nodes
• Set a start node before traversing
• For Dijkstra, enter edge weights

Traversal Order

Breadth-First Search (BFS)

BFS explores all neighbors at the current depth before moving to nodes at the next depth level. It uses a queue data structure and guarantees the shortest path in unweighted graphs. Time Complexity: O(V + E) | Space Complexity: O(V)