#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/minimum-cut

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/minimum-cut

Lessons

1. Intro

2. What is a Cut?

3. Cut Capacity

Ready to start learning?

4. s-t Cut

5. Minimum s-t Cut

6. Max-Flow Min-Cut Theorem

7. Theorem Intuition

8. Finding the Min Cut

9. Algorithm - Find Min Cut

10. Why Residual Graph Works

11. Example - Finding Min Cut

12. Global Minimum Cut

13. Stoer-Wagner Algorithm

14. Edge Connectivity

15. Vertex Connectivity

16. Application - Network Reliability

17. Application - Image Segmentation

18. Application - Clustering

19. Problem - Police Chase

20. Problem - Police Chase - Read Statement

21. Important idea - Max Flow with Unit Capacities

22. Important idea - Extracting the Cut Edges

23. Handling Bidirectional Roads

24. Implementation - Police Chase

25. Implementation - Police Chase - Implement Solution

26. Lessons - Min Cut Applications

27. Problem - Distinct Routes

28. Problem - Distinct Routes - Read Statement

29. Important idea - Max Flow Equals Path Count

30. Important idea - Flow Decomposition

31. Algorithm - Path Decomposition

32. Implementation - Distinct Routes

33. Implementation - Distinct Routes - Implement Solution

34. Lessons - Flow Decomposition

35. Problem - Network Segmentation

36. Important idea - Try All Pairs

37. Important idea - Stoer-Wagner Basics

38. Maximum Adjacency Ordering

39. Algorithm - Stoer-Wagner

40. Implementation - Network Segmentation

41. Lessons - Global vs Local Cuts

42. Section 33 Recap