Upload File

minimum spanning tree (mst)

Download Minimum Spanning Tree (MST)

If you can't read please download the document

Upload: damia

Post on 09-Jan-2016

55 views

Category:

Documents


3 download

Report

Tags:

DESCRIPTION

Minimum Spanning Tree (MST). Motivation. For an electrical circuit certain pins have to be grounded. Finding the arrangement of wires (connecting those pins) that uses the least amount of wire. - PowerPoint PPT Presentation

TRANSCRIPT

  • Minimum Spanning Tree (MST)

  • Motivation

    For an electrical circuit certain pins have to be grounded. Finding the arrangement of wires (connecting those pins) that uses the least amount of wire.Let a G(V,E) be a graph such that (u, v) E and a weight w(u,v) corresponding to wire needed to join u and v.We are looking for an acyclic subset T E that connects all vertices and whose total weight w(T) is minimized.

  • MotivationSince T is acyclic and connects all the vertices, it must form a tree.

    Since it spans the graph, it is called a spanning tree.

    MST or actually means Minimum Weight Spanning Tree.

  • Minimum Spanning TreeProblem: given a connected, undirected, weighted graph:1410364529158

  • Minimum Spanning TreeProblem: given a connected, undirected, weighted graph, find a spanning tree using edges that minimize the total weight

  • Minimum Spanning TreeWhich edges form the minimum spanning tree (MST) of the following graph?HBCGEDFA1410364529158

  • Minimum Spanning TreeAnswer:HBCGEDFA1410364529158

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);1410364529158Run on example graph

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);1410364529158Run on example graph

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);01410364529158Pick a start vertex rr

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);01410364529158Black vertices have been removed from Qu

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);031410364529158Black arrows indicate parent pointersu

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);14031410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);14031410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);140831410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);100831410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);100831410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);1020831410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);102081531410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);102081531410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);1020815341410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);520815341410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);5290815341410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);5290815341410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);5290815341410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);5290815341410364529158u

  • Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);5290815341410364529158u

  • Review: Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);

    What is the hidden cost in this code?

  • Review: Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; DecreaseKey(v, w(u,v));

  • Review: Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; DecreaseKey(v, w(u,v));

    How often is ExtractMin() called?How often is DecreaseKey() called?

  • Review: Prims AlgorithmMST-Prim(G, w, r) Q = V[G]; for each u Q key[u] = ; key[r] = 0; p[r] = NULL; while (Q not empty) u = ExtractMin(Q); for each v Adj[u] if (v Q and w(u,v) < key[v]) p[v] = u; key[v] = w(u,v);What will be the running time? A: Depends on queue binary heap: O(E lg V) Fibonacci heap: O(V lg V + E)


Minimum Spanning Trees - Carleton Universitysbtajali/2002/slides/11-4 Graphs...Minimum spanning tree (MST) n Spanning tree of a weighted graph with minimum total edge weight Applications

Minimum Spanning Trees (MSTs) and Minimum Cost Spanning Trees (MCSTs)

ก ำหนดว·ธ¸คลัสเตอร์ร่งinstructor.ru.ac.th/urai/cos4351/cos4351_6.pdf · Minimum Spanning Tree หรือ MST ตน้ไมท้ี่ไดจ้ากสัมประสิทธ์ิความไม่คลา้ยคลึงกนัเหมือนกบั

Minimum Spanning Tree What is a Minimum Spanning Tree. Constructing Minimum Spanning Trees. What is a Minimum-Cost Spanning Tree. Applications of Minimum

1 Graph Algorithms Minimum Spanning Trees (MST) Union - Find Dana Shapira

11 Minimum Spanning Trees 7 9 6 3 2 4 - Max Planck Societymehlhorn/ftp/NewToolbox/... · 2019-03-10 · 336 11 Minimum Spanning Trees Lemma 11.3. The generic MST algorithm is correct

What is a MST (Minimum Spanning Tree) and how to …olympiad.cs.uct.ac.za/presentations/camp2_2008/mst.pdf · Minimum Spanning Trees What is a MST (Minimum Spanning Tree) and how

Minimum Spanning Treesarashr/lecture8.pdf · Minimum spanning trees (MST) One of the most famous greedy algorithms Given undirected graph G = (V;E), connected ... Growing a minimum

The Minimum Spanning Tree (MST) problem in graphs with selfish edges

APLIKASI PEMBELAJARAN MATERI MST (MINIMUM SPANNING … · APLIKASI PEMBELAJARAN MATERI MST (MINIMUM SPANNING TREE) SKRIPSI Diajukan Untuk Memenuhi Salah Satu Syarat Memperoleh Gelar

Em ingl^es, Minimum Spanning Trees (MST) Minimum Spanning … · Exemplo de uma MST Custo: 6 + 5 + 9 + 7 + 15 + 8 + 3 = 53 3/39 Propriedades de uma MST Tem jV j 1 arestas. N~ao tem

Algorithms - Princeton University Computer Science€¦ · Output. A spanning tree of minimum weight. Brute force. Try all spanning trees? Minimum spanning tree problem minimum spanning

Minimum Spanning Trees and Prim's AlgorithmOutline Spanning treesand minimum spanning trees (MST). Tools for solving the MST problem. Prim’s algorithmfor the MST problem. The idea

Chapter 23 Minimum Spanning Trees - UTKweb.eecs.utk.edu › ~leparker › Courses › CS581-spring14 › Lectures › … · Minimum Spanning Trees • A minimum spanning tree is

Minimum Spanning Trees Analysis of Algorithms. Minimum Spanning Tree The minimum spanning tree (MST) of a weighted connected graph is a subgraph that

A fast minimum spanning tree algorithm based on …cs.uef.fi/sipu/pub/FastMST_INS2015.pdfA minimum spanning tree (MST) is a spanning tree of an undirected and weighted graph such that

Minimum Spanning Trees - University of Texas at San …bylander/cs3343/notes/mst.pdf · Minimum Spanning Tree Definition ⊲ Definition Example MST Safe Edges 1 Safe Edges 2 Safe

The probabilistic minimum spanning tree problemweb.mit.edu/dbertsim/www/papers/Vehicle Routing/The probabilistic... · spanning tree problem (MST), which we call the probabilistic

Minimum Spanning Tree · MST Structure 14 Spanning Tree MST. Given connected graph G with positive edge weights, find a min weight set of edges that connects all of the vertices

Midwestern State University Minimum Spanning Trees Definition of MST Generic MST algorithm Kruskal's algorithm Prim's algorithm 1

Minimum Spanning Tree: MST

Minimum Spanning Treesenos.itcollege.ee/~jpoial/algorithms/GT/Goodrich_6e_Ch14...Minimum spanning tree (MST) ! Spanning tree of a weighted graph with minimum total edge weight " Applications

Applications of Minimum Spanning Trees - Virginia Techcourses.cs.vt.edu/cs5114/spring2009/lectures/lecture08-mst... · Applications of Minimum Spanning Trees T. M. Murali February

External-Memory MST (Arge, Brodal, Toma). Minimum-Spanning Tree Given a weighted, undirected graph G=(V,E), the minimum-spanning tree (MST) problem is

A graph-theoretical clustering method based on two rounds ...cs.uef.fi/sipu/pub/2-round-MST-PatternRecognition.pdf · based methods take advantage of minimum spanning trees (MST)

4.5 Minimum Spanning Tree...2 Minimum Spanning Tree (MST) Minimum spanning tree.Given a connected graph G = (V, E) with real-valued edge weights c e, an MST is a subset of the edges

Applications of Minimum Spanning Treescourses.cs.vt.edu/.../lecture08-mst-applications.pdf · Minimum Bottleneck Spanning Trees Clustering Minimum Spanning Trees I We motivated MSTs

Algorithms: Minimum Spanning Treesamotz/BC-ALGORITHMS/PRESENTATIONS/mst.pdf · A spanning tree: A connected sub-graph with n 1 edges. A minimum spanning tree (MST): A spanning tree

Minimum Spanning Tree - SKKU · 2019-12-07 · 2. Minimum Spanning Tree (MST)-The spanning tree of the graph whose sum of weights of edges is minimum. •A graph may have more than

APLIKASI PEMBELAJARAN MATERI MST (MINIMUM …repository.usd.ac.id/32469/2/055314121_Full.pdfAPLIKASI PEMBELAJARAN MATERI MST (MINIMUM SPANNING TREE) SKRIPSI Diajukan Untuk Memenuhi

Minimum Spanning Tree - Princeton University Computer · PDF file13 MST Structure 14 Spanning Tree MST. Given connected graph G with positive edge weights, find a min weight set of

Prim’s Minimum Spanning Tree Algorithm...Prim’s Minimum Spanning Tree Algorithm Algorithm 19 Prim-MST G V;E;d ;s2 V 1: Input: weighted graph G V;E;d ; start vertex s; 2: Output:

Minimum Spanning Trees in Temporal Graphsadafu/Pub/MST-sigmod2015.pdf · time in a static graph, but is NP-complete in a temporal graph [4]. The computation of minimum spanning trees

Minimum Spanning Trees - SKKU › files › algorithm_chap23-MST.pdf · A spanning tree whose weight is minimum over all spanning trees is called a minimum spanning tree, or MST

Hop-constrained Minimum Spanning Tree …...The Minimum Spanning Tree (MST) problem is a very well-known combina torial optimization problem where the objective is to find a tree