Homework problem S on Strongly Connected Components

Due Nov 25.

Do either one, just one, of the following two problems:

  1. CLR exercise 22.5-3. Prove or give counterexample.

  2. CLR exercise 22.5-5. Write algorithm, prove (informally) correctness and run time bound.