Lecture18 - Algorithms in Systems Engineering IE170 Lecture...

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

View Full Document Right Arrow Icon
Algorithms in Systems Engineering IE170 Lecture 18 Dr. Ted Ralphs
Background image of page 1

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

View Full DocumentRight Arrow Icon
IE170 Lecture 18 1 References for Today’s Lecture Required reading CLRS Chapter 23 References R. Sedgewick, Algorithms in C++ (Third Edition), 1998.
Background image of page 2
IE170 Lecture 18 2 Spanning Trees Given a connected undirected graph G = ( V,E ) , a spanning tree T of G is a subgraph that is a tree and whose vertex set is all of V . Since the vertex set of any such spanning tree is V , we will sometimes equate the edge set of a spanning tree with the spanning tree itself. Every minimal connected subgraph is a spanning tree (and vice versa). In other words, a subgraph is a spanning tree if and only if it is connected and removing any edge will disconnect it. If we are looking for the most inexpensive set of links that connect a set of geographically dispersed points, we want a spanning tree. Spanning trees arise frequently in applications, especially those with a network design component.
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/29/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .

Page1 / 6

Lecture18 - Algorithms in Systems Engineering IE170 Lecture...

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

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