Ryan Knopp

Graphs

Breadth-first search fans out one layer at a time. Watch its queue grow and see why the first route it finds through an unweighted graph is always a shortest path.