What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
as we know time complexity of bellman-ford is O(En) where E is no of edges and n is no of vertices
and in complete graph no of edges is E=n(n-1)/2 where n is no of vertices
so time complexity of bellman-ford algorithm on complete graph with n vertices is O(n3)
so ans is C.)
Please elucidate this really important...
There is one more problem. Ppl who have...