CS 4349: Algorithms
Spring 2008
Assignment 8

Due: Wednesday, April 23 (in class)


1. Ex. 24.1-1 (page 591).  Bellman-Ford example.

2. Ex. 24.2-3 (page 594).  DAG shortest paths.

3. Ex. 24.3-1 (page 600).  Dijkstra's algorithm example.

4. Ex. 24.3-2 (page 600).  Counterexample with negative weights.

5. Ex. 25.2-4 (pages 634-635).  Floyd-Warshall using O(n^2) space.


Extra credit problems
---------------------
6. Modify the single-source shortest paths algorithms so that
   the encodings of the shortest paths they output correspond
   to (simple) shortest paths that use the most edges.  In other
   words, if the shortest path from u to v is achieved by
   multiple paths, we want to find one that uses the
   most number of edges (among all the shortest paths from u to v).

7. Problem 23-1 (page 575).  Second best MST.
8. Problem 24-5 (page 617).  Min mean cycle.