chapter23.ppt
Download as PPT, PDF1 like1,015 views
The document discusses minimum spanning trees and Kruskal's algorithm. A minimum spanning tree is a subset of edges in a connected, undirected graph that connects all vertices with the minimum total weight. Kruskal's algorithm finds a minimum spanning tree by growing a forest of trees while ensuring each added edge connects two different trees without forming a cycle. It uses a disjoint-set data structure to keep track of the connected components in the forest as edges are added from lowest to highest weight.
chapter23.ppt
- 1. Introduction to Algorithms Second Edition by Cormen, Leiserson, Rivest & Stein Chapter 23
- 2. Minimum Spanning Tree We then wish to find an acyclic subset T є E that connects all of the vertices and whose total weight is minimized.
- 3. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 4. Minimum Spanning Tree Assume that we have a connected, undirected graph G = ( V, E ) with a weight function w : E -> R , and we wish to find a minimum spanning tree for G . At each step, we determine an edge ( u, v ) that can be added to A without violating this invariant, in the sense that A U {( u, v )} is also a subset of a minimum spanning tree.
- 5. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 6. Minimum Spanning Tree A cut ( S, V - S ) of an undirected graph G = ( V , E ) is a partition of V . We say that an edge ( u , v ) ε E crosses the cut ( S , V - S ) if one of its endpoints is in S and the other is in V - S .
- 7. Minimum Spanning Tree We say that a cut respects a set A of edges if no edge in A crosses the cut. An edge is a light edge crossing a cut if its weight is the minimum of any edge crossing the cut.
- 8. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 9. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 10. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 11. Minimum Spanning Tree It finds a safe edge to add to the growing forest by finding, of all the edges that connect any two trees in the forest, an edge ( u , v ) of least weight.
- 12. Kruskal’s Algorithm It uses a disjoint-set data structure to maintain several disjoint sets of elements. Each set contains the vertices in a tree of the current forest. The operation FIND-SET( u ) returns a representative element from the set that contains u . Thus, we can determine whether two vertices u and v belong to the same tree by testing whether FIND-SET( u ) equals FIND-SET( v ). The combining of trees is accomplished by the UNION procedure.
- 13. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 14. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 15. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- 16. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.