lec9 - CS575 Parallel Processing Lecture nine: Graph...

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

View Full Document Right Arrow Icon
CS575 Parallel Processing Lecture nine: Graph Algorithms Wim Bohm, Colorado State University Except as otherwise noted, the content of this presentation is licensed under the Creative Commons Attribution 2.5 license.
Background image of page 1

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

View Full DocumentRight Arrow Icon
CS575 lecture 9 2 Definitions Graph G = (V, E) V : set of nodes or vertices E : set of edges (pairs of nodes) In an undirected graph, edges are unordered pairs of nodes In a directed graph edges are ordered pairs of nodes Path : sequence of nodes (v 0 ..v n ) s.t. 2200 i: (v i ,v i+1 ) is an edge Path length: number of edges in the path Simple path: all nodes distinct Cycle: path with first and last node equal Acyclic graph: graph without cycles
Background image of page 2
CS575 lecture 9 3 Definitions cont’ Adjacency Two nodes are adjacent if there is a path of length 1 between them Complete graph all nodes in the graph are adjacent Undirected graph is connected if for all nodes v i and v j there is a path from v i to v j Sub-graph G’(V’, E’) is a sub-graph of G(V,E) if V’ V and E’ E Sub-graph of G induced by V’ has all the edges (u,v) E such that u V’, v V’ Weighted graph edges have a weight (cost, length,. .) associated with them
Background image of page 3

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

View Full DocumentRight Arrow Icon
CS575 lecture 9 4 Representations Nodes: structures with pointers to other nodes Good representation when nodes have limited degree Adjacency matrix A ij = 1 if (v i ,v j ) is an edge, 0 otherwise Alternative: A ij = weight(v i ,v j ) or if no edge, A ii = 0 Good representation for dense graphs (many edges) Adjacency lists n lists (one for each node) Lists contain (representations of) the adjacent nodes Good representation for sparse graphs (few edges)
Background image of page 4
CS575 lecture 9 5 Minimal Spanning Tree (MST) Spanning tree of an undirected graph G A tree that is a sub-graph of G containing ALL vertices Minimal spanning tree of a weighted graph G Spanning tree with minimal total weight G must be a connected graph Applications Lowest cost set of roads connecting a set of towns Shortest cable connecting a set of computers
Background image of page 5

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

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

This note was uploaded on 09/24/2009 for the course CS 525 taught by Professor Rjyosy during the Winter '09 term at Central Mich..

Page1 / 22

lec9 - CS575 Parallel Processing Lecture nine: Graph...

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

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