Posted by: atri | October 5, 2010

Lect 15: BFS

In today’s lecture, we studied the Breath First Search (BFS) algorithm. The slides are now online.

Next lecture, we will consider a more general class of algorithms for computing the connected component of a vertex that includes BFS. We will prove the correctness of this more general algorithm (and hence, of the BFS algorithm). Then we will consider another special case of this general algorithm: depth first search (DFS). This material is from Section 3.2 in the book.

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: