EECE 537            Fall 2001
Homework Set 7

Due Wednesday, November 28, 2001

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

 23.2-2 (Prim's MST alg. using adjacency matrix)
 23.2-3 (Prim's MST with Fibonacci-heap vs. binary-heap)
 23.2-4 (Kruskal's MST with integer edge weights)
 23.2-5 (Prim's MST with integer edge weights)
 
 24.1-1 (Bellman-Ford single-source shortest-path example)
 24.1-3 (terminating Bellman-Ford in m+1 passes)

 24.3-1 (Dijkstra's single-source shortest-path example)