Construct the transitive closure graph of a simple directed graph and visualize the two graphs.
>
|
|
>
|
|
| (1) |
| (2) |
>
|
|
Construct the transitive closure graph with edge weights corresponding to the path lengths in the original graph. For example, because the shortest path in G from 1 to 5 has 3 steps (1→2→4→5), the arc in TCW has weight 3.
>
|
|
| (3) |
>
|
|