| Q. |
Floyd Warshall Algorithm can be used for finding |
| A. | single source shortest path |
| B. | topological sort |
| C. | minimum spanning tree |
| D. | transitive closure |
| Answer» D. transitive closure | |
| Explanation: one of the ways to compute the transitive closure of a graph in theta(n3) time is to assign a weight of 1 to each edge of e and then run the floyd warshall algorithm. | |
Login to Continue
It will take less than 2 minutes