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.

Section 6.8 in the textbook is your reading assignment.

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.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s


%d bloggers like this: