This project aims to add functionality in order to solve the maximum flow problem in pgRouting.
A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except the for source which only has outgoing flow, and the destination(sink) which only has incoming flow.
Maximum flow algorithms route one possible maximum flow through the graph and have several other applications in network routing, delivery & transportation, circulation and more.