Hi all,
I am working on the implementation of maximum flow algorithms and their applications for pgRouting during the GSoC 2016. This is my seventh report.
- What did you get done this week?
This week I wrote some documentation and examples for some of the signatures I mentioned last week. I also added another application that calculates the number of edge disjoint paths between two vertices. Currently, this only calculates the number of paths and not all the edges of the paths through the graph. This is a possible addition I am looking into. I also refactored the signature of the maximum cardinality matching function to include a parameter for directed/undirected graphs.
- What do you plan on doing next week?
Now that the majority of the code is written, I want to focus on the documentation, a lot of which is still missing. I am also interested in looking into automating tests using PgTAP.
- Are you blocked on anything?
No.
You can check the branch I’m working on here:
https://github.com/Illedran/pgrouting/tree/gsoc-flow
Best regards,
Andrea Nardelli