<div dir="ltr"><div><p>Hi all,</p><p>This is my last report for GSoC 2016.<br></p>The goal of my project was adding functionality to solve maximum flow problems to the pgRouting library.  <br>Maximum flow problems involve routing the maximum amount of a commodity from a single source S to a single sink T.<br>Previously, there were no such functions in the library.<br><br>With my work this summer, I added three algorithms that solve this problem and example applications that utilize them:<br><ul><li>Edge disjoint paths</li><li>Maximum cardinality matching</li><li>Multiple sources/sinks flow  </li></ul><br>Additionally, tests and documentation were produced for everything that was coded.<br><br>You can see the branch(gsoc-flow) I worked on here:<br><a href="https://github.com/Illedran/pgrouting/tree/gsoc-flow" target="_blank">https://github.com/Illedran/<wbr>pgrouting/tree/gsoc-flow</a><br></div><div>My pull requests: <br></div><div><a href="https://github.com/pgRouting/pgrouting/pulls?utf8=%E2%9C%93&q=is%3Apr%20author%3AIlledran" target="_blank">https://github.com/pgRouting/<wbr>pgrouting/pulls?utf8=%E2%9C%<wbr>93&q=is%3Apr%20author%<wbr>3AIlledran</a><br>My commits:<br><a href="https://github.com/Illedran/pgrouting/commits/gsoc-flow?author=Illedran" target="_blank">https://github.com/Illedran/<wbr>pgrouting/commits/gsoc-flow?<wbr>author=Illedran</a><br>My work is part of the 2.3.0 release of pgrouting. <br><br>If you want to test my code, you can build the library for yourself following the guidelines here:<br><a href="http://docs.pgrouting.org/dev/en/doc/src/installation/build.html" target="_blank">http://docs.pgrouting.org/dev/<wbr>en/doc/src/installation/build.<wbr>html</a><br><br></div>Link to slide coming as soon as possible.<br><p>Best regards,</p>Andrea Nardelli</div>