Posted by: atri | October 9, 2010

Lect 17: Representing Graphs

In today’s lecture, we looked at the adjacency matrix and adjacency list representations of graphs. The slides have been posted.

Next lecture, we will implement the BFS algorithm and show that it can be implemented in O(m+n) time. This material will be from Section 3.3 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: