This preview shows pages 1–6. 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 Document
Unformatted text preview: Rediscovered by Sollin in 1960s 2. Prims algorithm [1957] First discovered by Vojtch Jarnk in 1930 Similar to Djikstras algorithm 3. Kruskals algorithm [1956] By Prof. Clyde Kruskals uncle 5 MST Kruskals 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 N1 edges Keeps track of lightest edge remaining whether adding edge to MST creates cycle Optimal solution computed with greedy algorithm 6 MST Kruskals Algorithm Example...
View
Full
Document
 Fall '08
 PADUAPEREZ

Click to edit the document details