Posted by: atri | October 25, 2011

Lect 23: Shortest Path Problem

We looked at Dijkstra’s algorithm for shortest path problem in class today. On Wednesday, we will prove its correctness and analyze its run time. The material will be from Section 4.4 in the textbook.

The slides have been uploaded.

Below are the student posts for the lecture:

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: