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.
我知道我们可以使用网络流的福特富尔克森算法在二分图中找到最大匹配。但是是否有任何算法使用网络流概念并为非二分图提供最大（甚至最大）匹配？