+1 vote
in Data Structures & Algorithms I by (88.2k points)
Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________

(a) O(V*V)

(b) O(V*V*V)

(c) O(E*V)

(d) O(E*E)

This key question is from Directed Graph topic in section Graph of Data Structures & Algorithms I

The question was posed to me in examination.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right choice is (b) O(V*V*V)

The best explanation: The Algorithm uses Dynamic Programming and checks for every possible path.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.