ConceptTheory & Algos
Breadth-first search (BFS) distance computation
Computing the least number of steps to get from a start vertex to all other vertices in a graph using BFS.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.