[pgrouting-dev] [SoC] [GSoC 2018] Final Report - Implement Minimum cost flow and ChPP for pgRouting
I am Maoguang Wang, and This is my final report for my GSoC project.
Implement Minimum-cost flow Algorithm by the Boost Graph Library and Chinese Postman Problem for pgRouting
Organization:pgRouting under OSGeo
Minimum-cost flow problem is an extension of maximum flow problem with an added cost (per unit flow) for each edge. The Chinese Postman Problem (ChPP) in a directed graph can be solved by Minimum-cost flow algorithm.
I have added Minimum-cost flow algorithm and directed ChPP algorithms to pgRouting during this GSoC period.
State of the art before the project:pgRouting didn't have above functionalities before my GSoC.
Addition that my project brought to pgRouting:
The deliverables are code, full documentation, documentation tests, pgTap of above functions.