[SoC] [GSoC] Report - Flow algorithms for pgRouting - Week 12
nrd.nardelli at gmail.com
Wed Aug 17 11:59:12 PDT 2016
Link to same slide on OSGeo wiki (as requested):
On Wed, Aug 17, 2016 at 12:55 AM, Andrea Nardelli <nrd.nardelli at gmail.com>
> Link to slide:
> On Tue, Aug 16, 2016 at 7:20 PM, Andrea Nardelli <nrd.nardelli at gmail.com>
>> Hi all,
>> This is my last report for GSoC 2016.
>> The goal of my project was adding functionality to solve maximum flow
>> problems to the pgRouting library.
>> Maximum flow problems involve routing the maximum amount of a commodity
>> from a single source S to a single sink T.
>> Previously, there were no such functions in the library.
>> With my work this summer, I added three algorithms that solve this
>> problem and example applications that utilize them:
>> - Edge disjoint paths
>> - Maximum cardinality matching
>> - Multiple sources/sinks flow
>> Additionally, tests and documentation were produced for everything that
>> was coded.
>> You can see the branch(gsoc-flow) I worked on here:
>> My pull requests:
>> My commits:
>> My work is part of the 2.3.0 release of pgrouting.
>> If you want to test my code, you can build the library for yourself
>> following the guidelines here:
>> Link to slide coming as soon as possible.
>> Best regards,
>> Andrea Nardelli
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the SoC