最大网络流问题 一个Edmonds-Karp算法，也就是广搜增广路径，用了16MS,A maximum network flow problem Edmonds-Karp algorithm, which is widely found augmented path, with a 16ms