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 Document
Unformatted text preview: Rediscovered by Sollin in 1960s 2. Prim’s algorithm [1957] First discovered by Vojtěch Jarník in 1930 Similar to Djikstra’s algorithm 3. Kruskal’s algorithm [1956] By Prof. Clyde Kruskal’s uncle 5 MST – Kruskal’s Algorithm sort edges by weight (from least to most) tree = for each edge (X,Y) in order if it does not create a cycle add (X,Y) to tree stop when tree has N–1 edges Keeps track of lightest edge remaining whether adding edge to MST creates cycle Optimal solution computed with greedy algorithm 6 MST – Kruskal’s Algorithm Example...
View
Full Document
 Fall '08
 PADUAPEREZ
 Graph Theory, Greedy algorithm, Kruskal's algorithm, Prof. Clyde Kruskal

Click to edit the document details