Notes / Slides from Class:

• Jan 10, 12: BFS, DFS, Shortest Path, MST
• Jan 17: Floyd-Warshall
• Jan 19: Floyd-Warshall
• Jan 24: Dynamic Programming
• Jan 26: Knapsack Problem
• Jan 31: Knapsack Problem, Weighted Interval Scheduling, and Sequence Partitioning
• Feb 2: Weighted Interval Scheduling, and Least Squares
• Feb 7: Shortest Path (mod 10)
• Feb 7/9: Huffman Code
• Feb 9: Hu-Tucker Algorithm
• Feb 14: Max Flow