Transitive closure. Write a Digraph client TransitiveClosure whose constructor takes a Digraph as an argument and whose method isReachable(v, w) returns true if there exists some directed path from v to w, and false otherwise. Hint: Run breadth-first search from each vertex.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.