Graph Algorithms
Overviews and popular problems for Graph Algorithms.
Contents
Overview
Graph representations, Depth-First Search (DFS), Breadth-First Search (BFS), and shortest path algorithms.
Breadth-First Search (BFS)
Level-by-level traversal of unweighted graphs using a queue.
Depth-First Search (DFS)
Deep-dive traversal of graphs using a stack.
Dijkstra's Shortest Path
Finding the shortest path in a weighted graph from a single source node.