Posted by: atri | September 26, 2011

Lect 12: Breadth First Search

In today’s lecture, we proved an interesting property about BFS trees and then started proving the correctness of the BFS algorithm (by proving the correctness of a more general algorithm). Next lecture, we will study Depth First Search (DFS). The material will be from Sec 3.1 in the textbook.

The slides have been uploaded.

Below are links to the student blog 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: