[pgrouting-dev] [GSOC Application] Flow Algorithms

[Andrea Nardelli]

Hello,

I would like to contribute on pgrouting during the GSoC program.
My project idea is implementing algorithms to solve the maximum flow
problem, here is what I got so far:
1) Create new pgrouting functions that utilize the implementations already
present in the Boost Graph library
<http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/table_of_contents.html>
(22.10).
2) Research/write other possible implementations, such as the Ford-Fulkerson
<https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm> algorithm,
which may yield better results on some particular graphs.
3) Extend the problem to include multiple sources and/or multiple sinks and
implement solutions.

My application will come soon, but I wanted to get in touch with you to
discuss a bit and see if there are any other possible ideas.
Thank you for your time!

Andrea Nardelli
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-dev/attachments/20160315/2639ff77/attachment.html>