<div dir="ltr"><div dir="ltr"><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 eleventh report.</p><p>1) What did you get done this week?</p>
<p>As said in the last report, this week I was on holiday and could not work.</p>
<p>2) What do you plan on doing next week?</p>
<p>The release of pgRouting 2.3 is imminent. As such, I will mostly
focus on completing all the user and developer documentation by adding
more examples, tests and improving the sample data.</p>
<p>3) Are you blocked on anything?</p>
<p>No.</p><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/<wbr>pgrouting/tree/gsoc-flow</a></p><p>Best regards,</p>Andrea Nardelli</div></div></div></div></div>