Dinic is O(V^2E)
https://en.wikipedia.org/wiki/Maximum_flow_problem#Solutions
https://qiita.com/SaitoTsutomu/items/80e70da6717acacefa00 networkx
https://www.hamayanhamayan.com/entry/2017/05/09/120217
https://ikatakos.com/pot/programming_algorithm/graph_theory/maximum_flow Ford-Fulkerson Dinic
This page is auto-translated from /nishio/最大流 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.