Presentation is loading. Please wait.

Presentation is loading. Please wait.

Minimum Spanning Tree.

Published byDewi Sudjarwadi Modified over 5 years ago

Similar presentations

Presentation on theme: "Minimum Spanning Tree."— Presentation transcript:

1 Minimum Spanning Tree

2 Minimum Spanning Tree Weight on edge; find set of edges that minimize connecting everything Kruskal’s algorithm: Sort edges from lowest weight to highest Add edges by doing a union-find set combination each Done when you have just one set (i.e. have added n-1 edges, thus joining all n vertices)

3 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

4 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

5 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

6 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

7 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

8 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

9 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

10 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

11 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

12 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

13 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

14 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

15 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

16 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

17 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

18 Minimum Spanning Tree Weight on edge; find set of edges that minimize connecting everything Prim’s algorithm: For each node, mark as “in” or “out”. Start with any node as the only one “in” Priority queue of edges, based on weight. Add the edges for the “in” node Repeatedly get next edge from queue. If one of the nodes is “out”, then: Mark that node “in” Add its edges to the priority queue.

19 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

20 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

21 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

22 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

23 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

24 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

25 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

26 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

27 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

28 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

29 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

30 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

31 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

32 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

33 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

34 10 9 21 17 14 7 6 8 3 11 9 15 4 1 5 19 16 2 20

35 MST variants Maximum spanning tree
Use Kruskal’s with edges sorted greatest to smallest Minimum spanning subgraph (some edges already included) Run Kruskal’s but with some stuff already merged Minimum forest (can have up to x components) Run Kruskal’s until just x sets Second-best tree Get MST, then try removing a link, and find first link to connect Repeat for all links Minimax – minimum of maximum edge weights along any path i to j Just a subset of the MST – path from i to j in the MST.

Download ppt "Minimum Spanning Tree."

Similar presentations

Lecture 15. Graph Algorithms

Lecture 15. Graph Algorithms
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Minimum Spanning Trees (MSTs) Prim's Algorithm For each vertex not in the tree, keep track of the lowest cost edge that would connect it to the tree This.

Minimum Spanning Trees (MSTs) Prim's Algorithm For each vertex not in the tree, keep track of the lowest cost edge that would connect it to the tree This.
10.4 Spanning Trees. Def Def: Let G be a simple graph. A spanning tree of G is a subgraph of G that is a tree containing every vertex of G See handout.

10.4 Spanning Trees. Def Def: Let G be a simple graph. A spanning tree of G is a subgraph of G that is a tree containing every vertex of G See handout.
1 Greedy 2 Jose Rolim University of Geneva. Algorithmique Greedy 2Jose Rolim2 Examples Greedy  Minimum Spanning Trees  Shortest Paths Dijkstra.

1 Greedy 2 Jose Rolim University of Geneva. Algorithmique Greedy 2Jose Rolim2 Examples Greedy  Minimum Spanning Trees  Shortest Paths Dijkstra.
Graph Algorithms: Minimum Spanning Tree 1 2 3 4 6 5 10 1 5 4 3 2 6 1 1 8 We are given a weighted, undirected graph G = (V, E), with weight function w:

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
CSE 780 Algorithms Advanced Algorithms Minimum spanning tree Generic algorithm Kruskal’s algorithm Prim’s algorithm.

CSE 780 Algorithms Advanced Algorithms Minimum spanning tree Generic algorithm Kruskal’s algorithm Prim’s algorithm.
Spanning Trees.

Spanning Trees.
Spanning Trees. 2 Spanning trees Suppose you have a connected undirected graph Connected: every node is reachable from every other node Undirected: edges.

Spanning Trees. 2 Spanning trees Suppose you have a connected undirected graph Connected: every node is reachable from every other node Undirected: edges.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 11 Instructor: Paul Beame.

1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 11 Instructor: Paul Beame.
Spanning Trees. Spanning trees Suppose you have a connected undirected graph –Connected: every node is reachable from every other node –Undirected: edges.

Spanning Trees. Spanning trees Suppose you have a connected undirected graph –Connected: every node is reachable from every other node –Undirected: edges.
More Chapter 7: Greedy Algorithms Kruskal’s Minimum Spanning Tree Algorithm.

More Chapter 7: Greedy Algorithms Kruskal’s Minimum Spanning Tree Algorithm.
Minimum Spanning Trees

Minimum Spanning Trees
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.

Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Minimum Spanning Tree By Jonathan Davis.

Minimum Spanning Tree By Jonathan Davis.
Minimum Spanning Trees What is a MST (Minimum Spanning Tree) and how to find it with Prim’s algorithm and Kruskal’s algorithm.

Minimum Spanning Trees What is a MST (Minimum Spanning Tree) and how to find it with Prim’s algorithm and Kruskal’s algorithm.
Minimum Spanning Tree in Graph - Week 13. 2 Problem: Laying Telephone Wire Central office.

Minimum Spanning Tree in Graph - Week Problem: Laying Telephone Wire Central office.
Minimum Spanning Tree Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2008.

Minimum Spanning Tree Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2008.
Graphs CS 400/600 – Data Structures. Graphs2 Graphs  Used to represent all kinds of problems Networks and routing State diagrams Flow and capacity.

Graphs CS 400/600 – Data Structures. Graphs2 Graphs  Used to represent all kinds of problems Networks and routing State diagrams Flow and capacity.
WEIGHTED GRAPHS. Weighted Graphs zGraph G = (V,E) such that there are weights/costs associated with each edge Õw((a,b)): cost of edge (a,b) Õrepresentation:

WEIGHTED GRAPHS. Weighted Graphs zGraph G = (V,E) such that there are weights/costs associated with each edge Õw((a,b)): cost of edge (a,b) Õrepresentation:

Similar presentations

Ads by Google