Lectures Help
Having trouble viewing lectures? Try changing players. Your current player format is html5. Change to flash.
- Introduction to Graphs (9:32)
- Graph API (14:47)
- Depth-First Search (26:22)
- Breadth-First Search (13:34)
- Connected Components (18:56)
- Graph Challenges (14:29)
- Introduction to Digraphs (8:30)
- Digraph API (4:56)
- Digraph Search (20:56)
- Topological Sort (12:54)
- Strong Components (20:22)
- Introduction to MSTs (4:04)
- Greedy Algorithm (12:56)
- Edge-Weighted Graph API (11:15)
- Kruskal's Algorithm (12:28)
- Prim's Algorithm (33:15)
- MST Context (10:34)
- Shortest Paths APIs (10:51)
- Shortest Path Properties (14:46)
- Dijkstra's Algorithm (18:58)
- Edge-Weighted DAGs (19:23)
- Negative Weights (21:01)
- Introduction to Maxflow (10:33)
- Ford-Fulkerson Algorithm (6:32)
- Maxflow-Mincut Theorem (9:38)
- Running Time Analysis (8:49)
- Java Implementation (14:29)
- Maxflow Applications (22:20)
- Strings in Java (17:43)
- Key-Indexed Counting (12:06)
- LSD Radix Sort (15:00)
- MSD Radix Sort (13:41)
- 3-way Radix Quicksort (7:22)
- Suffix Arrays (19:25)
- Introduction to Substring Search (6:42)
- Brute-Force Substring Search (10:11)
- Knuth-Morris-Pratt (33:14)
- Boyer-Moore (8:36)
- Rabin-Karp (16:13)
- Regular Expressions (20:03)
- REs and NFAs (13:14)
- NFA Simulation (18:27)
- NFA Construction (11:42)
- Regular Expression Applications (20:09)
- Introduction to Data Compression (22:27)
- Run-Length Coding (5:59)
- Huffman Compression (24:14)
- LZW Compression (27:33)
- Introduction to Reductions (9:25)
- Designing Algorithms (8:13)
- Establishing Lower Bounds (9:16)
- Classifying Problems (12:45)