Graph Algorithms - Interactive Visualization

Graph algorithms are the building blocks of network analysis. BFS explores level by level (shortest paths in unweighted graphs). DFS explores as deep as possible (cycle detection, topological sort). Dijkstra finds shortest weighted paths. PageRank computes node importance from link structure. This visualization steps through all four algorithms, coloring nodes by state.

• Step through BFS level by level: frontier nodes turn orange, visited turn indigo
• Step through DFS stack-based exploration with recursive coloring
• Watch Dijkstra's priority queue update distances at each step
• See PageRank values converge through power iteration
• Foundation for GNNs, knowledge graphs, and recommendation systems

Part of the EngineersOfAI Interactive 3D - free interactive visualizations covering every major concept in machine learning and AI engineering. Hover any element for a plain-English explanation. No code required.