[pgrouting-dev] [GSoC] Report - Flow algorithms for pgRouting - Week 6

Hi all,

I am working on the implementation of maximum flow algorithms and their applications for pgRouting during the GSoC 2016. This is my sixth report.

  1. What did you get done this week?
    I created all the possible signatures for one to one, one to many, many to one and many to many versions of the maximum flow algorithms. Additionally, some major internal code revision happened which led to a lot less code duplication, more clarity and higher maintainability. I added an additional function from boost that calculated the maximum cardinality matching in a graph.

  2. What do you plan on doing next week?
    Due to the code changes, some of the documentation will have to change. Additionally, I need to write some more for the new function and also write tests for all of this: I plan to work on this next week.

  3. Are you blocked on anything?

You can check the branch I’m working on here:


Best regards,

Andrea Nardelli