文件名称:main
介绍说明－－下载内容均来自于网络，请自行研究使用
SAP算法:求最大流有一种经典的算法，就是每次找增广路时用BFS找，保证找到的增广路是弧数最少的，也就是所谓的Edmonds-Karp算法。-
SAP algorithm for the maximum flow is a classical algorithm, is each for augmenting path with BFS can guarantee the augmented way to find the minimum number of arcs, which is also called the Edmonds-Karp algorithm.
SAP algorithm for the maximum flow is a classical algorithm, is each for augmenting path with BFS can guarantee the augmented way to find the minimum number of arcs, which is also called the Edmonds-Karp algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
main.cpp