Learn · Getting Started With Competitive Programming
Lecture 47 of 54Week 8
Maximum Matching via MaxFlow
Prof. Neeldhara Misra · IIT Gandhinagar
Credits and licence
- From
- Getting Started With Competitive Programming, IIT Gandhinagar (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Madras.
- Who can watch
- Teens profiles and older. How courses are placed
All the lectures
- Welcome and Initial Setup
- Reversort
- Engineering Reversort
- Number Game
- Will It Stop?
- Trouble Sort
- The Meeting Place Cannot Be Changed
- Magic Ship
- Simple Skewness
- Pancake Flipping
- Islands War
- Stable Marriage - I
- Stable Marriage - II
- When Greedy Does Not Work - Coin Change
- When Greedy Does Not Work - Guarding a Museum
- When Greedy Does Not Work - Traveling Salesman
- DSU - Definition and Motivation
- DSU via Union by Rank and Path Compression
- DSU - Implementation
- Destroying Array - I (Problem Statement and Solution)
- Destroying Array - II (Implementation)
- War - I (Problem Statement)
- War - II (Solution)
- War - III (Implementation)
- Graph Foundations
- BFS and DFS
- Mahmoud and Ehab and the bipartiteness
- Cover It!
- Diamond Inheritance
- SSSP - Overview BFS Revisited
- SSSP and Dijkstra's Algorithm
- Sending Email
- SSSP and Modified Dijkstra
- SSSP with Negative Cycles - Bellman-Ford
- Wormholes
- APSP and Floyd-Warshall
- Page Hopping
- Introduction to MSTs
- Prim's Algorithm
- Kruskal's Algorithm
- Cherries Mesh
- Heirarchy
- Island Hopping
- Introduction to MaxFlow
- Ford-Fulkerson for MaxFlow
- Implementing Edmonds-Karp
- Maximum Matching via MaxFlow
- Sport Elimination via MaxFlow
- Maxflow-Mincut Duality
- Police Chase
- Sam I AM and Vertex Covers
- Top-Down Dynamic Programming with Frog 1_Part A
- Top-Down Dynamic Programming with Frog 1_Part B
- Bottom-Up Dynamic Programming with Dice Combinations