CSCI 3104 - Algorithms - Summer 2015

Problem Set #3

Due: Wed, Jun 24th



1. Text problem 4.1.

2. Text problem 4.4.

3. Text problem 4.8.

4. Text problem 4.9. (Assume that the graph has no negative-weight cycles.)

5. Text problem 4.11. (Hard; be sure and attend recitation for additional info.)

6. Text problem 4.18.

7. Text problem 4.19.

8. Consider the digraph given by this graph where each line of the file indicates an edge. There are 77,360 nodes and 905,468 directed edges. What is the number of nodes in the largest SCC? What is the number of edges in the largest SCC? Include your code with your answer.