<a href="/ja/%E6%9C%80%E5%B0%8F%E8%B2%BB%E7%94%A8%E6%B5%81%E3%81%AB%E5%B8%B0%E7%9D%80">最小費用流に帰着</a>
Primal-Dual / 最短路反復法
<ul>
<li>O(V^2UC) <a href="http://www.prefield.com/algorithm/graph/primal_dual.html">Spaghetti Source - 最小費用流 (Primal-Dual)</a></li>
<li>O(FElogV) <a href="https://tubo28.me/compprog/algorithm/primal-dual/">最小費用流 | libalgo</a></li>
<li>O(FElogV) <a href="https://ei1333.github.io/luzhiled/snippets/graph/primal-dual.html">最小費用流(Primal-Dual) | Luzhiled’s memo</a></li>
</ul>
<a href="https://www.hamayanhamayan.com/entry/2017/05/09/120428">https://www.hamayanhamayan.com/entry/2017/05/09/120428</a>
<ul>
<li><a href="http://www.prefield.com/algorithm/graph/primal_dual.html">Spaghetti Source - 最小費用流 (Primal-Dual)</a>
<ul>
<li>ポテンシャルを使うことで負の辺をなくし、<a href="/ja/%E3%83%80%E3%82%A4%E3%82%AF%E3%82%B9%E3%83%88%E3%83%A9%E6%B3%95">ダイクストラ法</a>に帰着</li>
<li><a href="/ja/Primal%20Dual">Primal Dual</a></li>
</ul>
</li>
<li><a href="https://tubo28.me/compprog/algorithm/primal-dual/">最小費用流 | libalgo</a>
</li>
<li>なぜ主双対か
<ul>
<li><a href="https://kopricky.github.io/code/NetworkFlow/min_cost_flow_memo.html">https://kopricky.github.io/code/NetworkFlow/min_cost_flow_memo.html</a></li>
</ul>
</li>
<li><a href="https://gist.github.com/satos---jp/711c056cb63af7fbccb569f98a086b06">flow_bunkakai_memo.md · GitHub</a>
</li>
<li><a href="http://hos.ac/slides/20150319_flow.pdf">http://hos.ac/slides/20150319_flow.pdf</a>
</li>
<li>発展的話題
<ul>
<li><a href="http://sigma425.hatenablog.com/entry/2014/10/12/122018">http://sigma425.hatenablog.com/entry/2014/10/12/122018</a></li>
</ul>
</li>
</ul>
<a href="http://tokoharuland.hateblo.jp/entry/2019/12/25/000000">http://tokoharuland.hateblo.jp/entry/2019/12/25/000000</a>
蟻本p202
他の人の実装
<ul>
<li><a href="https://ei1333.github.io/luzhiled/snippets/graph/primal-dual.html">https://ei1333.github.io/luzhiled/snippets/graph/primal-dual.html</a></li>
</ul>