Outline:

1. Questions?
2. Adjacency matrices
   • overview
   • example code
   • comparison to adjacency lists
3. DFS traversal
   • overview
   • example code
4. Time complexity of BFS and DFS
5. Practice with graphs
6. Wrap-up

What’s next

Upcoming assignments:

• Assignment 7 is due tonight
• Assignment 8 is online now
• Assignment 6 resubmissions are due Friday night (feedback online today), finalized Monday

Upcoming events:

• CS Bits & Bytes this week will be a Town Hall – come hear about the state of the department and ask any questions you have, then write up two paragraphs to earn a token for an extra assignment resubmission

What you should do now:

• The readings (see below)
• Submit Assignment 7
• Finish Assignment 6 if your code wasn’t working

Reading assignment (to be completed by the next class):

Graphs and DFS (from today):

• Adjacency matrices
• Depth-first search

Graphs and DFS (for next time):

• 2-3 Trees