Index

Module 01 · DSAThe toolbox

Graphs (BFS, DFS, Dijkstra, topological sort)

Graphs
Graphs · Open board

Dots and the lines between them, the shape this whole lesson is built on. The same picture backs routing in Networking (How a parcel finds any house on earth), the graph data model in Data Models and Query Languages, and the dataflow DAGs in Batch Processing.

Before you start. You need only arrays: a numbered list where you can jump straight to slot i. Nothing about graphs is assumed here - every new word below is shown doing something before it gets named.

Continue reading with a plan

The first three lessons of every track are free. This lesson is included with a plan, which unlocks every lesson, board, video, lab and paper for one price.

View plans →Already a member? Sign in

Lab

Every find walks a chain of houses up to the root. In the worst order, how long can that chain get, and what keeps it short?

Drag Cables joined to the end, then switch The habits and watch Tallest chain fall from 31 to 5.

Open The short chains →

Review DSA →

Saved in this browser, and to your account when you sign in.