Which one of the following statements about Floyd's algorithm running on a graph with V nodes...

• 
  
  • 
    
    

Transcribed Image Text:

Which one of the following statements about Floyd's algorithm running on a graph with V nodes and E edges is correct? Group of answer choices The iterative (dynamic programming) version finds the shortest path between all pairs of nodes in time 0(V³) The recursive version finds the transitive closure of a graph in O(3) time. The iterative (dynamic programming) version finds the shortest path between all pairs of nodes in 0(3) time The iterative (dynamic programming) version always finds a minimal spanning tree rooted at every node in O(V³) time. Which one of the following statements about Floyd's algorithm running on a graph with V nodes and E edges is correct? Group of answer choices The iterative (dynamic programming) version finds the shortest path between all pairs of nodes in time 0(V³) The recursive version finds the transitive closure of a graph in O(3) time. The iterative (dynamic programming) version finds the shortest path between all pairs of nodes in 0(3) time The iterative (dynamic programming) version always finds a minimal spanning tree rooted at every node in O(V³) time.

Answer rating: 100% (QA)

Answer Explanation The running time of the Floyd Warshall algorithm is dete... View the full answer