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.