<html>
  <head>
    <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    Hi Andrea,<br>
    <br>
    Welcome to this list and thank you for your interest to participate
    in GSoC and pgRouting!<br>
    You probably read our Wiki page on Github:
    <a class="moz-txt-link-freetext" href="https://github.com/pgRouting/pgrouting/wiki/GSoC-Ideas">https://github.com/pgRouting/pgrouting/wiki/GSoC-Ideas</a><br>
    It should answer the basic questions, but if something isn't clear,
    please ask.<br>
    <br>
    I think, that it's a good idea to start with using Boost Graph
    Library first. <br>
    It's also better not to make too ambitious plans, especially if you
    are new to pgRouting.<br>
    Have you used pgRouting already?<br>
    <br>
    Best regards,<br>
    Daniel<br>
    <br>
    <br>
    <div class="moz-cite-prefix">On 16/03/16 00:48, Andrea Nardelli
      wrote:<br>
    </div>
    <blockquote
cite="mid:CAKiFJ3tyXwivz55oynzqkz-=JWzR7ymapb4_0rUxuPEiLQwu4Q@mail.gmail.com"
      type="cite">
      <div dir="ltr">
        <div>
          <div>
            <div>
              <div>Hello,<br>
                <br>
              </div>
              I would like to contribute on pgrouting during the GSoC
              program.<br>
              My project idea is implementing algorithms to solve the
              maximum flow problem, here is what I got so far:<br>
              1) Create new pgrouting functions that utilize the
              implementations already present in the <a
                moz-do-not-send="true"
href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/table_of_contents.html">Boost
                Graph library</a> (22.10).<br>
            </div>
            2) Research/write other possible implementations, such as
            the <a moz-do-not-send="true"
              href="https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm">Ford-Fulkerson</a>
            algorithm, which may yield better results on some particular
            graphs.<br>
          </div>
          3) Extend the problem to include multiple sources and/or
          multiple sinks and implement solutions.<br>
          <br>
        </div>
        <div>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. <br>
          Thank you for your time!<br>
        </div>
        <div><br>
        </div>
        Andrea Nardelli<br>
      </div>
      <br>
      <fieldset class="mimeAttachmentHeader"></fieldset>
      <br>
      <pre wrap="">_______________________________________________
pgrouting-dev mailing list
<a class="moz-txt-link-abbreviated" href="mailto:pgrouting-dev@lists.osgeo.org">pgrouting-dev@lists.osgeo.org</a>
<a class="moz-txt-link-freetext" href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev">http://lists.osgeo.org/mailman/listinfo/pgrouting-dev</a></pre>
    </blockquote>
    <br>
    <pre class="moz-signature" cols="72">-- 
Georepublic UG & Georepublic Japan
eMail: <a class="moz-txt-link-abbreviated" href="mailto:daniel.kastl@georepublic.de">daniel.kastl@georepublic.de</a>
Web: <a class="moz-txt-link-freetext" href="https://georepublic.info">https://georepublic.info</a></pre>
  </body>
</html>