Data Structures & Algorithms · Core algorithms
Graphs & BFS
Graphs model anything connected: networks, dependencies, counterparties. Breadth-first search explores in layers and finds shortest paths in unweighted graphs.
Step 1 of 7 · Overview30 min read ·
Key idea
Prereqs: Stacks & queues, Hash maps. Next: System design / DFS & Dijkstra (later). MIT 6.006 Lecture 9 (BFS).Next: 1. What a graph is