fa26-cs577 cs577
Discussion 5: Borůvka’s Algorithm Discussion 5: Borůvka’s Algorithm
Content locked
The catalog is public. Reading this content requires approved access.
Sign in to readDiscussion 5: Borůvka’s Algorithm
Problem 1: Building a minimum spanning tree in rounds
Worked example: eight vertices become one component
(a) Why does the algorithm return an MST?
(b) How many rounds, and how much time?
(c) Bonus: combine Borůvka with Prim