Algorithms
Dijkstra's Shortest Path
Visual guide to Dijkstra's algorithm: finding shortest paths in weighted graphs. See distance updates and relaxation.
Algorithms
Graph Traversal: DFS & BFS
Visual guide to graph traversal: DFS explores deep, BFS explores wide. Watch both algorithms visit nodes.
Algorithms
Graph Traversal
Learn graph representations (adjacency matrix/list), Depth-First Search, Breadth-First Search, cycle detection, and topological sorting fundamentals.