Vidyalelo
Data Structure · Q71

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 71

Q71

What is the running time of Bellmann Ford Algorithm?

A.
O(V)
B.
O(V2)
C.
O(ElogV)
D.
O(VE)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board