https://deepai.org/publication/min-cost-flow-in-unit-capacity-planar-graphs
Min-Cost Flow in Unit-Capacity Planar Graphs | DeepAI
Jul 4, 2019 - 07/04/19 - In this paper we give an O((nm)^2/3 C) time algorithm for computing min-cost flow (or min-cost circulation) in unit capacity plana...
min cost flowunit capacityplanar graphsdeepai
https://www.boost.org/doc/libs/latest/libs/graph/doc/successive_shortest_path_nonnegative_weights.html
Boost Graph Library: Successive Shortest Path for Min Cost Max Flow
boost graph libraryshortest pathsuccessive