Homework 3

1. We'll use the digraph of Figure 22.6 on page 548 of CLRS.

1. Execute Gabow's high-level strong components algorithm on that digraph as follows.
   • Whenever there's a choice of vertices to explore, choose the vertex that alphabetically comes first.
   • Whenever there's a choice of edges to scan, choose the edge that goes to the vertex that alphabetically comes first.
   • Draw the dfs path right before each cycle contraction, and right before each strong component is to be marked, labelling which strong component is marked.
   • Don't draw any other dfs path.
2. Draw G^SCC, where G is the input digraph.