The following will be discussed in this chapter: Leader Election, Maximal independent set, breadth-first spanning trees, shortest paths trees (started), shortest paths trees (finish), breadth-first spanning trees, shortest paths trees. | Lecture Design and Analysis of Algorithms - Lecture 20 Distributed Algorithms Part 2