EECE 537            Fall 2001
Homework Set 6

Due Wednesday, November 7, 2001

Do the following problems from Cormen, Leiserson,
Rivest, and Stein [CLR+S], Introduction to Algorithms, Second Edition:

 22.2-3  (Breadth-first search with adjacency matrix)
 22.2-6  (professional wrestlers!)
 22.3-4  (tree, back, cross edges in DFS)
 22.3-11 (connected components)
 22.4-3  (determine if undirected graph contains a cycle)
 22.4-5  (another topological sort algorithm)