問題描述
用於二分最大匹配的埃德蒙茲算法 (edmonds algorithm for bipartite maximum matching)
我想使用 edmonds 算法在二分匹配中找到最大匹配。不幸的是，我無法獲得偽代碼。誰能幫幫我？
參考解法
方法 1:
This is a late post for the benefit of future visitors. There is pseudo code available in wikipidia page
Edmonds Algorithm is applicable to general graphs and not just bipartite graphs. The wiki page shows how the general algorithm can be used for bipartite graphs.
(by bulbasaur、Mudabir Kabir)