tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 41 - Dr. Sohail Aslam

Dijkstra’s single-source shortest path algorithm works if all edges weights are non-negative and there are no negative cost cycles. Bellman-Ford allows negative weights edges and no negative cost cycles. The algorithm is slower than Dijkstra’s, running in Θ(VE) time. In this lecture, you find clear explanations of Bellman-Ford Algorithm. |