ConceptTheory & Algos
Asynchronous breadth-first spanning tree algorithm (first Attempt)
An asynchronous adaptation of the synchronous BFS algorithm where nodes adopt the sender of the first received search message as their parent and propagate search messages without correction mechanisms.
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.
Asynchronous network model1Synchronous BFS algorithm1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.