Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Edmond-Karp 最大流算法详解 - 一瓜 #83

Open
Desgard opened this issue Aug 30, 2020 · 0 comments
Open

Edmond-Karp 最大流算法详解 - 一瓜 #83

Desgard opened this issue Aug 30, 2020 · 0 comments
Labels
Gitalk max-flow-edmond-karp

Comments

@Desgard
Copy link
Owner

Desgard commented Aug 30, 2020

https://www.desgard.com/2020/04/28/max-flow-edmond-karp.html

知识梳理 在「初识最大流问题」中，我们了解了什么是流网络模型、什么是最大流问题、以及在流网络中 的增广路（Augmenting Path）概念； 在「Ford-Fulkerson 最大流求解方法」中，我们学习了 Ford-Fulkerson 的最大流问题求解方法和思路：不断的深度优先搜索，直到没有增广路为止则...
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Gitalk max-flow-edmond-karp
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Desgard