In this video, we explore how to solve two classic problems in graph theory: Maximum Flow and Shortest Path. We walk through detailed examples, using algorithms such as Ford-Fulkerson, Edmonds-Karp, and others for Maximum Flow, and Dijkstra's Algorithm for Shortest Path, explaining the key concepts and steps involved. Whether you're a beginner or looking to refine your skills, this video provides a clear and comprehensive guide.
0:00 Introduction
0:14 Maximum Flow Problem #1
1:29 Maximum Flow Problem #2
2:40 Maximum Flow Problem #3
4:15 Maximum Flow Problem #4
5:39 Shortest Path Problem #1
6:49 Shortest Path Problem #2
8:32 Shortest Path Problem #3
9:51 Shortest Path Problem #4