Flow networks and Max-Flow Min-Cut explained in 40 seconds

Branch and Bound - Algorithms Part 13

Ford-Fulkerson and Edmonds-Karp - Flow Networks - Algorithms Part 12

Floyd-Warshall and Johnson's Algorithm - Graph Algorithms - Algorithms Part 11

Dijkstra's Algorithm and Bellman Ford - Graph Algorithms - Algorithms Part 10

Breadth First Search and Depth First Search - Graph Algorithms - Algorithms Part 9

Minimum Spanning Trees (Kruskal's + Prim's Algorithms) - Graph Algorithms - Algorithms Part 8

Matroids - Greedy Algorithms - Algorithms Part 7

Greedy Algorithms - Algorithms Part 6

Convolution and FFT - Divide and Conquer - Algorithms Part 5

Sorting Algorithms - Divide and Conquer - Algorithms Part 4

Master Theorem - Divide and Conquer - Algorithms Part 3

Dynamic Programming - Algorithms Part 2