DSAOps Lab
D
Walkthrough
How Graph Algorithms Work
Step-by-step from graph representation to traversal
1
Graph Representation
A graph G = (V, E) consists of vertices (nodes) connected by edges. Graphs can be directed (one-way) or undirected (two-way), weighted or unweighted.
1
2
3
4
1 / 5
Algorithms
3D Graph View
Drag to rotate · Scroll to zoom
Controls
Algorithm Controls
History
0/0Run an algorithm to see traversal history
Analysis
| Algorithm | Time Complexity | Space Complexity |
|---|---|---|
| BFS | O(V + E) | O(V) |
| DFS | O(V + E) | O(V) |
| Dijkstra | O((V+E) log V) | O(V) |
| A* | O(E) | O(V) |
| Prim | O(E log V) | O(V) |
| Kruskal | O(E log V) | O(V + E) |
| Union Find | O(α(N)) | O(N) |