Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
我需要找到一个线性算法(O(|V| + |E|),它可以在原始最大流量已知但每条边的容量增加 1 的图上找到最大流量。
如果你知道 mincut 是什么,我想你可以为每个切割边缘添加一个到最大流量。