Hi all,
I am working on the implementation of maximum flow algorithms and their applications for pgRouting during the GSoC 2016. This is my fourth report.
- What did you get done this week?
This week was spent adding the code for the last implementation for maximum flow (Boykov-Kolmogorov) offered by Boost and refactoring a bit some of the code after some discussions with my mentors. The rest of the time was spent adding documentation.
- What do you plan on doing next week?
Now that all the implementations and the base of the documentation is down, I can actually start writing some applications. I also think it could be useful to have some more different sample data in order to show off the algorithms.
- Are you blocked on anything?
No.
You can check the branch I’m working on here:
https://github.com/Illedran/pgrouting/tree/gsoc-flow
You can check the pull requests and issues here:
https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=author%3AIlledran+
Best regards,
Andrea Nardelli