spanning
play

Spanning G is a subgraph that has all the vertices of G. Trees - PowerPoint PPT Presentation

Nov 10, 2022 •612 likes •692 views

SpanningSubgraphs MathematicsforComputerScience MIT6.042J/18.062J A spanning subgraph of graph Spanning G is a subgraph that has all the vertices of G. Trees Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 spanning.1

  1. Spanning Subgraphs Mathematics for Computer Science MIT 6.042J/18.062J A spanning subgraph of graph Spanning G is a subgraph that has all the vertices of G. Trees Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 spanning.1 spanning.2 Spanning Subgraphs Spanning Trees A spanning subgraph of graph G is a subgraph that has all the vertices of G. A spanning tree is a spanning subgraph that is a tree. Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 spanning.3 spanning.4 1

  2. Spanning Trees Spanning Trees another spanning tree a spanning tree (can have many) Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 spanning.5 spanning.6 Spanning Trees Minimum Weight Spanning Trees Suppose edges have weights: Lemma: G connected implies 3 G has a spanning tree 4 1 4 Pf: Namely, any minimum edge 9 7 2 6 connected spanning graph. 1 Find min weight spanning tree? Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 spanning.7 min-tree.9 2

  3. Build MST using gray edges Minimum Spanning Trees color components • Start with vertices • Color components black & white 3 4 4 1 • gray edge ::= 9 7 2 • add min weight gray edge 6 1 Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 min-tree.10 min-tree.11 Minimum Spanning Trees Minimum Spanning Trees color components gray edges 3 3 4 4 1 1 4 4 9 9 7 7 2 2 6 6 1 1 Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 min-tree.12 min-tree.13 3

  4. Minimum Spanning Trees Minimum Spanning Trees gray edges: min weight re-color components 3 3 4 4 4 1 4 1 9 9 7 7 2 2 6 6 1 1 Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 min-tree.14 min-tree.15 Minimum Spanning Trees Minimum Spanning Trees re-color components gray edges 3 3 4 4 1 1 4 4 9 9 7 7 2 2 6 6 1 1 Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 min-tree.16 min-tree.17 4

  5. Minimum Spanning Trees Minimum Spanning Trees gray edges: min weight re-color components 3 3 4 4 4 1 4 1 9 9 7 7 2 2 6 6 1 1 Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 min-tree.18 min-tree.19 Minimum Spanning Trees Minimum Spanning Trees re-color components etc 3 3 4 4 1 1 4 4 9 9 7 7 2 2 6 6 1 1 Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 min-tree.20 min-tree.21 5

  6. Ways to grow an MST • start at any vertex, keep building one tree. (Prim) • keep choosing min weight edge between diff components (Kruskal) • grow trees in parallel (Meyer) Albert R Meyer, April 8, 2013 min-tree.22 6

  7. MIT OpenCourseWare http://ocw.mit.edu 6.042J / 18.062J Mathematics for Computer Science Spring 20 15 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

Recommend

Spanning and weighted spanning trees A different kind of optimization (graph theory is cool.)

Spanning and weighted spanning trees A different kind of optimization (graph theory is cool.)

Spanning and weighted spanning trees A different kind of optimization (graph theory is cool.) Spanning and weighted spanning trees courtesy of dr. sarah-marie belcastro, http://www.mathily.org Spanning and weighted spanning trees A different

213 views • 20 slides
The spanning laceability of k-ary The spanning laceability of k ary n-cubes when k is even

The spanning laceability of k-ary The spanning laceability of k ary n-cubes when k is even

The spanning laceability of k-ary The spanning laceability of k ary n-cubes when k is even : : 1 Outline Introd ction Introduction Preliminaries Definition Theorem 1

618 views • 35 slides
Constructing a spanning tree Toni Kylml toni.kylmala@tkk.fi 1 Constructing a spanning tree

Constructing a spanning tree Toni Kylml toni.kylmala@tkk.fi 1 Constructing a spanning tree

T-79.4001 Seminar on Theoretical Computer Science Spring 2007 Distributed Computation Constructing a spanning tree Toni Kylml toni.kylmala@tkk.fi 1 Constructing a spanning tree Spanning tree To construct a spanning tree we must get

467 views • 18 slides
Minimum Spanning Tree 11/26/2003 9:54 AM Minimum Spanning Trees 2704 BOS 867 849 PVD ORD

Minimum Spanning Tree 11/26/2003 9:54 AM Minimum Spanning Trees 2704 BOS 867 849 PVD ORD

Minimum Spanning Tree 11/26/2003 9:54 AM Minimum Spanning Trees 2704 BOS 867 849 PVD ORD 187 740 144 1846 JFK 621 184 1258 802 SFO BWI 1391 1464 337 1090 DFW 946 LAX 1235 1121 MIA 2342 Minimum Spanning Trees v1.3 1

532 views • 12 slides
Minimum Spanning Tree spanning tree of minimum total weight e.g., connect all the

Minimum Spanning Tree spanning tree of minimum total weight e.g., connect all the

M INIMUM S PANNING T REE Prim-Jarnik algorithm Kruskal algorithm 1500 SEA MSN PVD 1000 800 SFO 800 LGA 400 1800 STL 1200 LAX LAX 1500 400 1500 DFW 1000 MIA Minimum Spanning Tree 1 Minimum Spanning Tree spanning

797 views • 10 slides
Minimum Spanning Trees and Kruskal's Algorithm Steve Tanimoto Winter 2016 This lecture material

Minimum Spanning Trees and Kruskal's Algorithm Steve Tanimoto Winter 2016 This lecture material

2/5/2016 Minimum Spanning Trees The minimum-spanning-tree problem Given a weighted undirected graph, compute a spanning tree of minimum weight CSE373: Data Structures and Algorithms Minimum Spanning Trees and Kruskal's Algorithm Steve

87 views • 4 slides
Minimum Spanning Trees CONTENTS Introduction to Minimum Spanning Trees Applications of

Minimum Spanning Trees CONTENTS Introduction to Minimum Spanning Trees Applications of

Minimum Spanning Trees CONTENTS Introduction to Minimum Spanning Trees Applications of Minimum Spanning Trees Optimality Conditions Kruskal's Algorithm Prim's Algorithm Sollin's Algorithm Reference: Sections 13.1 to

736 views • 19 slides
Minimum Spanning Trees Chapter 23 1 CPTR 430 Algorithms Minimum Spanning Trees Motivation

Minimum Spanning Trees Chapter 23 1 CPTR 430 Algorithms Minimum Spanning Trees Motivation

Minimum Spanning Trees Chapter 23 1 CPTR 430 Algorithms Minimum Spanning Trees Motivation Electonic circuitry design Make the pins of multiple components electrically equivalent Wire them together: use n 1 wires to

665 views • 37 slides
Minimum Spanning Trees 2704 BOS 867 849 PVD ORD 187 740 144 JFK 1846 621 1258 184

Minimum Spanning Trees 2704 BOS 867 849 PVD ORD 187 740 144 JFK 1846 621 1258 184

Minimum Spanning Trees 2704 BOS 867 849 PVD ORD 187 740 144 JFK 1846 621 1258 184 802 SFO BWI 1391 1464 337 1090 DFW 946 LAX 1235 1121 MIA 2342 Minimum Spanning Trees 1 Outline and Reading Minimum Spanning Trees

767 views • 32 slides
Exchange operations on noncrossing spanning trees Csaba D. T oth Cal State Northridge, Los

Exchange operations on noncrossing spanning trees Csaba D. T oth Cal State Northridge, Los

Exchange operations on noncrossing spanning trees Csaba D. T oth Cal State Northridge, Los Angeles, CA and Tufts University, Medford, MA Spanning Trees Elementary Operations abstract spanning tree = connected graph on n vertices that

786 views • 65 slides
Outline and Reading Minimum Spanning Trees ( 12.7.3) Minimum Spanning Tree n Definitions n A

Outline and Reading Minimum Spanning Trees ( 12.7.3) Minimum Spanning Tree n Definitions n A

Minimum Spanning Tree 7/8/03 12:53 Outline and Reading Minimum Spanning Trees ( 12.7.3) Minimum Spanning Tree n Definitions n A crucial fact Prim-Jarniks Algorithm ( 12.7.3.2) Kruskals Algorithm ( 12.7.3.1) 7/8/03 12:53 Minimum

238 views • 5 slides
Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

1 Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed trees in graphs for shortest path to anywhere else (from vertex is the root) Minimum spanning trees instead want to connect every node with the

660 views • 51 slides
Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

1 Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed trees in graphs for shortest path to anywhere else (from vertex is the root) Minimum spanning trees instead want to connect every node with the

628 views • 18 slides
Minimum Spanning Trees Shortest Paths Cormen et. al. VI 23,24 Minimum Spanning Tree Given a set

Minimum Spanning Trees Shortest Paths Cormen et. al. VI 23,24 Minimum Spanning Tree Given a set

Minimum Spanning Trees Shortest Paths Cormen et. al. VI 23,24 Minimum Spanning Tree Given a set of locations, with positive distances to each other, we want to create a sub-graph that connects all nodes to each other with the minimum sum of

356 views • 21 slides
Shared Spanning Trees GOAL Continue operating without loops in any physical connection

Shared Spanning Trees GOAL Continue operating without loops in any physical connection

Shared Spanning Trees GOAL Continue operating without loops in any physical connection topology including shared spanning tree switches, 802.1Q mono spanning tree switches, and others. Shared Spanning Trees January 27, 1999 1/11 IEEE

126 views • 11 slides
Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G

Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G

Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G connecting all vertices in G. A sub- forest of G is an acyclic subset of edges of G. Minimum spanning trees (MST) 1 Def: 15 7 8 A spanning

505 views • 25 slides
Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G

Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G

Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G connecting all vertices in G. A sub- forest of G is an acyclic subset of edges of G. Minimum spanning trees (MST) 1 Def: 15 7 8 A spanning

444 views • 23 slides
Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G

Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G

Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G connecting all vertices in G. A sub- forest of G is an acyclic subset of edges of G. Minimum spanning trees (MST) 1 Def: 15 7 8 A spanning

1.14k views • 24 slides
A Prins's algorithm repeatedly adds the minimum one endpoint in T weight edge w PRIM G YE E

A Prins's algorithm repeatedly adds the minimum one endpoint in T weight edge w PRIM G YE E

Minimum Spanning Trees Kent by Quanrud f EE Kkk G EYE Undirected graph Input f mn Ff IR E edge weights w A spanning tree G is tree in a containing all of V leg n t edges compute the Goal minimum weight abbr MST spanning tree

561 views • 31 slides
Minimum-Cost Spanning Tree weighted connected undirected graph spanning tree cost of

Minimum-Cost Spanning Tree weighted connected undirected graph spanning tree cost of

Minimum-Cost Spanning Tree weighted connected undirected graph spanning tree cost of spanning tree is sum of edge costs find spanning tree that has minimum cost Example 8 10 14 1 3 5 7 3 7 12 6 4 2 2 4 6 8 9

384 views • 11 slides
Spanning Trees Recall the definitions of: - graphs, the vertex set V={0,1,2,,n-1}, the edge

Spanning Trees Recall the definitions of: - graphs, the vertex set V={0,1,2,,n-1}, the edge

[Section 1.1] Spanning Trees Recall the definitions of: - graphs, the vertex set V={0,1,2,,n-1}, the edge set E - n = |V|, m = |E| - adjacency matrix - spanning tree [Section 1.1] Spanning Trees Thm 1.1 (Kirchhoff): Let A be the

502 views • 10 slides
Minimum spanning tree Minimum spanning tree Given. Undirected graph G with positive edge weights

Minimum spanning tree Minimum spanning tree Given. Undirected graph G with positive edge weights

BBM 202 - ALGORITHMS T ODAY Minimum Spanning Trees Greedy algorithm D EPT . OF C OMPUTER E NGINEERING Edge-weighted graph API Kruskal's algorithm Prim's algorithm Context M INIMUM S PANNING T REES Apr. 5, 2016

1.02k views • 39 slides
Undirected connected weighted graph ( G , W ) Input: An MST of G Output: A&DS Lecture 11 1

Undirected connected weighted graph ( G , W ) Input: An MST of G Output: A&DS Lecture 11 1

Minimum Spanning Trees ( G , W ) undirected connected weighted graph Definition 11.1 A minimum spanning tree (MST) of G is a connected spanning subgraph T of G of minimum weight. The minimum spanning tree problem : Undirected connected weighted

304 views • 28 slides
ECE 242 Data Structures Lecture 32 Minimum Spanning Trees December 2, 2009 ECE242 L32:

ECE 242 Data Structures Lecture 32 Minimum Spanning Trees December 2, 2009 ECE242 L32:

ECE 242 Data Structures Lecture 32 Minimum Spanning Trees December 2, 2009 ECE242 L32: Minimum Spanning Trees Overview Problem: What is the minimum cost edges to connect all vertices in a graph? Spanning Tree Connects all vertices

356 views • 7 slides

More recommend