3.2-3.6:

===== Brief summary

3.2 covered graph connectivity and graph traversal, including breadth-first and depth-first searches.

Motivations

Algorithms: brief sketches, intuitions, implementations, runtimes

Questions:

Stuff I want to remember:

How readable / interesting the section was: