1. Trace the DFS topological sorting algorithm topSort2 , and indicate the resulting topological order of the vertices for each graph in Figure 20-37 . 2. Revise the topological sorting algorithm...

1. Trace the DFS topological sorting algorithm topSort2 , and indicate the resulting topological order of the vertices for each graph in Figure 20-37 .

2. Revise the topological sorting algorithm topSort1 by removing predecessors instead of successors. Trace the new algorithm for each graph in Figure 20-37 .