← DSA Lab
Graph Visualizer
Visualize Graph traversals (BFS & DFS) on an adjacency list representation.
Traversal Path: —
Graph Traversal Complexity
| Algorithm | Time | Space |
|---|---|---|
| Breadth-First Search (BFS) | O(V + E) | O(V) |
| Depth-First Search (DFS) | O(V + E) | O(V) |
V = Vertices (Nodes), E = Edges
