Problem
1. Discuss how Warshall's algorithm compares with the transitive closure algorithm derived by using the depth-first search technique described in the text, but using the adjacency-matrix form of visit and removing the recursion.
2. Give the topological ordering produced for the dag given in Figure 32.8 when the suggested method is used with an adjacency matrix representation, but dfs scans the vertices in reverse order (from V down to 1) when looking for unvisited vertices.
