<div dir="ltr"><div dir="ltr"><div><p>Hi all,</p><p>I am working on the implementation of maximum flow
algorithms and their applications for pgRouting during the GSoC 2016.
This is my eigth report.</p>1) What did you get done this week?<br><br>This week I started studying the algorithm in the paper I linked last week. It is quite complicated and requires knowledge of a lot of other algorithms (it is made up of different sub-algorithms with better complexities it can fall back to). I started prototyping these in Python. <br>For the rest of the week I implemented a way for the edge_disjoint_paths function to actually return the paths and not just their number.<br><br>2) What do you plan on doing next week?<br><br>Next week I plan to do several things:<br> - Continue studying additional max_flow implementations.<br> - Finish up all the possible signatures for the new edge_disjoint_paths function.<br> - While working this week, I realized that there are a lot of small things I can add and improve through the codebase, in regards to both functionality and efficiency.<br><br>3) Are you blocked on anything?<br><br>No.<br><br><p>You can check the branch I'm working on here:</p><p><a href="https://github.com/Illedran/pgrouting/tree/gsoc-flow" target="_blank">https://github.com/Illedran/pgrouting/tree/gsoc-flow</a></p><p>Best regards,</p>Andrea Nardelli</div></div></div>