Posted by: atri | December 5, 2012

Lect 38: Bellman-Ford Algorithm

In today’s lecture, we finished talking about the Bellman-Ford algorithm. The material is from Section 6.8 in the textbook. We also very briefly talked about the P vs. NP question.

The slides and notes have been uploaded.

Advertisements

Leave a Reply

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

WordPress.com Logo

You are commenting using your WordPress.com 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 )

Google+ photo

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

Connecting to %s

Categories

%d bloggers like this: