ConceptTheory & Algos
Breadth-first spanning trees
A distributed procedure where processes produce a breadth-first spanning tree rooted at a distinguished vertex.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Nancy Ann Lynch
Connections
7The lectures that define it or assume it, and the concepts next to it.