Kruskal - Rediscovered by Sollin in 1960s 2. Prims...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Spanning Tree Set of edges connecting all nodes in graph need N-1 edges for N nodes no cycles, can be thought of as a tree Can build tree during traversal
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Minimum Spanning Tree (MST) Spanning tree with minimum total edge weight
Background image of page 2
3 Minimum Spanning Tree (MST) Possible to have multiple MSTs Different spanning trees with same weight Example applications Minimize length of telephone lines for neighborhood Minimize distance of airplane routes serving cities
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Algorithms for Finding MST Three well known algorithms 1. Borůvka’s algorithm [1926] For constructing efficient electricity network
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
This is the end of the preview. Sign up to access the rest of the 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

Page1 / 6

Kruskal - Rediscovered by Sollin in 1960s 2. Prims...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online