CSC 2300 Data Structures

1
CSC 2300Data Structures Algorithms

• April 20, 2007
• Chapter 9. Graph Algorithms

2
Today

• Graph traversal
• Depth-first search
• Breadth-first search
• Articulation Points

3
Graph Traversal
4
Depth-First Search
5
Breadth-First Search
6
Example

• An undirected graph and its depth-first search

7
Biconnectivity

• A connected undirected graph is biconnected if
  there are no vertices whose removal disconnects
  the rest of the graph.
• Applications computer network, mass transit
  system.
• Example

8
Articulation Points
9
Example

• Depth-first tree with Num and Low

10
Example

• Depth-first tree if search starts at C

11
Another Example
12
Pseudo-code
13
Exercises