1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. What is the running time of Bellmann For...
Q.

What is the running time of Bellmann Ford Algorithm?

A. o(v)
B. o(v2)
C. o(elogv)
D. o(ve)
Answer» D. o(ve)
Explanation: bellmann ford algorithm runs in time o(ve), since the initialization takes o(v) for each of v-1 passes and the for loop in the algorithm takes o(e) time. hence the total time taken by the algorithm is o(ve).

Discussion