Implement pgr_minCostMaxFlow

[XJTUmg]

Code

pgr_flow_t for output and pgr_costFlow_t for input.

• Create minCostMaxFlow.c & minCostMaxFlow_driver.cpp files.
• Create minCostMaxFlow_driver.h file.
• Create pgr_costFlow_t.h file in c_types.
• Extend pgr_flow_t (cost and reverse_cost).
• Create sql files.
• Modify edges_input.h & edges_input.c
• Create pgr_costFlowGraph.hpp file.
• Create pgr_minCostMaxFlow.hpp file.

Documentation

Tests

• Open an issue in fork, draw by hand both boost sample graphs. It will be the first tests.
  • link to boost sample graph

@pgRouting/admins

[cvvergara]

TODO

• Fix license:
  • name of function's developer
  • file names
  • date

[cvvergara]

I prefer edge_id or vertex_id
otherwise is id of what?

[cvvergara]

Why is it valid to ignore or not ignore the id?