- Grokking Algorithms
- (Chapter 6 and 7)

- Tree Traversal
- (wiki)

- DFS/BFS
- (Visual Algorithm)

- Another Topological sort visualization
- (Visual Algorithm)

For now I am linking code samples here: Github Code Repository for the course

- Topological Sort
- (wiki page)

- tsort
- (Unix application for performing topological sort)

- Depth-First Search Maze Solver
- (for fun)

- Seven Bridges of Konigsberg
- (Famous Graph Theory problem)

- Greedy Algorithm
- (wiki page)

- [Direct Link to Slides]
- (Available to follow along during class)

- In-Class Activity Link
- This is graded, and only your first response is graded
- This is an evaluation of what was learned in lecture.
- Due one week from when the lecture takes place

In this module we will learn about graphs.

None given, consider this a 'beta' product for common questions I may revise later.

Please do not redistribute or host any materials without e-mailing me first. I generally am happy to share the latest .pdf or slide presentation with those who ask. Thank you for your time!