Posted by: atri | December 7, 2010

## Lect 39: Bellman-Ford Algorithm

In today’s lecture, we finished the description and analysis of the Bellman-Ford algorithm. The slides have been uploaded.

Next lecture, we will consider the following special case of the longest path problem: given an undirected graph and two nodes, is there a path of length $n-1$ between them?

Here is a link to John Montemorano‘s blog post for the lecture.