Add Flow
Opened this issue · 1 comments
Pixeleston commented
Outlines
- Introduction to Network Flow and definition of some terms
- State and prove The Max-flow Min-cut Theorem
- Ford-Fulkerson's algorithm
- Introduction to Augmenting path
- A common wrong method of finding max-flow
- Detail process of the algorithm
- Time complexity and the correctness of the algorithm
- Template code
- Edmonds-Karp's algorithm
- The flaw of Ford-Fulkerson's algorithm and the method of optimization
- Detail process of the algorithm
- Time complexity and the correctness of the algorithm
- Template code
- Solving some related problems
References
harry900831 commented
Reading more references can help you create higher quality content.