This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: e in E S = {s}, T = While S is not the same as V Among edges e= (u,w) with u in S and w not in S , pick one with minimum cost Add w to S , e to T (Old) History of MST algorithms 1920: Otakar Borvka 1930: Vojtch Jarnk 1956: Kruskal 1957: Prim 1959: Dijkstra Same algo! Same algo! Some modern Algo Researchers Can you guess the common link? Todays agenda Prove correctness of Kruskals and Prims algorithms...
View
Full
Document
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.
 Fall '11
 RUDRA
 Sort

Click to edit the document details