What is the time complexity of Bellman-Ford single-source shortest path…
GATE · 2013 · CS · Computer Science & ITBARC · Computer Science · 2013
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of \(n\) vertices?
- A.
\(Θ(n^2)\) - B.
\( Θ(n^2 \ log \ n) \) - C.
\(Θ(n^3)\) - D.
\( Θ(n^3 \ log \ n) \)
Attempted by 890 students.
Show answer
Correct answer: C
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…