Posted by: atri | October 3, 2011

Lect 15: Implementation of BFS

In today’s lecture, we saw a linear time implementation of BFS and an outline of the linear time implementation of DFS. Next lecture, we will work with directed graphs and topological sorting, which is in Sec 3.6 in the textbook. Sections 3.4 and 3.5 are highly recommended reading assignments.

The slides have been uploaded.

Below are links to the student blog posts:

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: