For 1/26 Dijkstra's algorithm: min-cost paths in weighted digraphs with non-negative edge weights
For 1/13 GraphTheory: Depth First Search Cormen Chapter 22, Sections 22.3, 22.4, 22.5.