shortest path: videos

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Spanning treesFundamental Algorithms, Spring 2025Notes
   +Watch later
2. 2▶NP-CompletenessFundamental Algorithms, Spring 2025Notes
   +Watch later
3. 3▶Independent set and coloringFundamental Algorithms, Spring 2025Notes
   +Watch later
4. 4▶The longest pathFundamental Algorithms, Spring 2025Notes
   +Watch later
5. 5▶Subset sum and the secret language of numbersFundamental Algorithms, Spring 2025Notes
   +Watch later
6. 6▶2-SAT vs Max 2-SATFundamental Algorithms, Spring 2025Notes
   +Watch later
7. 7▶SAT - A different kind of search problemFundamental Algorithms, Spring 2025Notes
   +Watch later
8. 8▶Negative edge lengths and all pairs shortest pathsFundamental Algorithms, Spring 2025Notes
   +Watch later
9. 9▶Shortest pathsFundamental Algorithms, Spring 2025Notes
   +Watch later
10. 10▶Searching and sorting graphsFundamental Algorithms, Spring 2025Notes
    +Watch later
11. 11▶Edit distance and matrix chain multiplicationFundamental Algorithms, Spring 2025Notes
    +Watch later
12. 12▶Fast multiplication and Fourier transformFundamental Algorithms, Spring 2025Notes
    +Watch later
13. 13▶Selection and closest pairFundamental Algorithms, Spring 2025Notes
    +Watch later
14. 14▶InductionFundamental Algorithms, Spring 2025Notes
    +Watch later
15. 15▶Searching and sortingFundamental Algorithms, Spring 2025Notes
    +Watch later
16. 16▶Graph coloringFundamental Algorithms, Spring 2024Notes
    +Watch later
17. 17▶Polynomial time is a flat circleFundamental Algorithms, Spring 2024Notes
    +Watch later
18. 18▶Independent setFundamental Algorithms, Spring 2024Notes
    +Watch later
19. 19▶The longest pathFundamental Algorithms, Spring 2024Notes
    +Watch later
20. 20▶Subset sum and the secret language of numbersFundamental Algorithms, Spring 2024Notes
    +Watch later
21. 21▶2-SAT and Max 2-SATFundamental Algorithms, Spring 2024Notes
    +Watch later
22. 22▶Boolean satisfiabilityFundamental Algorithms, Spring 2024Notes
    +Watch later
23. 23▶Negative edge weights and all pairs shortest pathsFundamental Algorithms, Spring 2024Notes
    +Watch later
24. 24▶Shortest pathsFundamental Algorithms, Spring 2024Notes
    +Watch later
25. 25▶Searching and sorting graphsFundamental Algorithms, Spring 2024Notes
    +Watch later
26. 26▶Sequential optimization with cachingFundamental Algorithms, Spring 2024Notes
    +Watch later
27. 27▶Multiplication and the Fast Fourier TransformFundamental Algorithms, Spring 2024Notes
    +Watch later
28. 28▶Selection and closest pairFundamental Algorithms, Spring 2024Notes
    +Watch later
29. 29▶Searching and sortingFundamental Algorithms, Spring 2024Notes
    +Watch later
30. 30▶InductionFundamental Algorithms, Spring 2024Notes
    +Watch later
31. 31▶Spanning trees (Fundamental algorithms, Spring 2023, Lecture 15)Fundamental Algorithms, Spring 2023Notes
    +Watch later
32. 32▶NP-Complete (Fundamental algorithms, Spring 2023, Lecture 14)Fundamental Algorithms, Spring 2023Notes
    +Watch later
33. 33▶Independent set (Fundamental algorithms, Spring 2023, Lecture 13)Fundamental Algorithms, Spring 2023Notes
    +Watch later
34. 34▶The longest path (Fundamental algorithms, Spring 2023, Lecture 12)Fundamental Algorithms, Spring 2023Notes
    +Watch later
35. 35▶2-SAT and max 2-SAT (Fundamental algorithms, Spring 2023, Lecture 10)Fundamental Algorithms, Spring 2023Notes
    +Watch later
36. 36▶Subset sum (Fundamental algorithms, Spring 2023, Lecture 11)Fundamental Algorithms, Spring 2023Notes
    +Watch later
37. 37▶SAT (Fundamental algorithms, Spring 2023, Lecture 9)Fundamental Algorithms, Spring 2023Notes
    +Watch later
38. 38▶Negative edge lengths and all pairs shortest paths (Fundamental algorithms, Spring 2023, Lecture 8)Fundamental Algorithms, Spring 2023Notes
    +Watch later
39. 39▶Shortest paths (Fundamental algorithms, Spring 2023, Lecture 7)Fundamental Algorithms, Spring 2023Notes
    +Watch later
40. 40▶Searching and sorting graphs (Fundamental algorithms, Spring 2023, Lecture 6)Fundamental Algorithms, Spring 2023Notes
    +Watch later
41. 41▶Edit distance and matrix chain multiplication (Fundamental algorithms, Spring 2023, Lecture 5)Fundamental Algorithms, Spring 2023Notes
    +Watch later
42. 42▶Fast integer multiplication and Fourier transform (Fundamental algorithms, Spring 2023, Lecture 4)Fundamental Algorithms, Spring 2023Notes
    +Watch later
43. 43▶Selection and closest pair of points (Fundamental algorithms, Spring 2023, Lecture 3)Fundamental Algorithms, Spring 2023Notes
    +Watch later
44. 44▶Induction and recursion (Fundamental algorithms, Spring 2023, Lecture 2)Fundamental Algorithms, Spring 2023Notes
    +Watch later
45. 45▶Searching and sorting (Fundamental algorithms, Spring 2023, Lecture 1)Fundamental Algorithms, Spring 2023Notes
    +Watch later
46. 46▶CSE201, Lec 15: Karatsuba multiplication and Strassen's matrix multiplicationCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
47. 47▶CSE201, Lec 14: Linear time selection using divide and conquerCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
48. 48▶CSE201, Lec 13: Introduction to divide and conquer, Mergesort and the stock market problemCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
49. 49▶CSE201, Lec 12: Dijkstra's algorithms, All Pairs Shortest Paths, and matrix multiplicationCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
50. 50▶CSE201, Lec 11: Single source shortest paths and the Bellman-Ford algorithmCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later