Algorithms — Dasgupta, Papadimitriou & Vazirani

Sanjoy Dasgupta, Christos Papadimitriou & Umesh Vazirani

Graph algorithms, dynamic programming, greedy algorithms, divide-and-conquer, linear programming, and NP-completeness. Used in Week 8 for graph search and dynamic programming as a planning abstraction.

Chapters

Exercises added as I work through each chapter.