<div dir="ltr"><div class="gmail_default" style="font-family:comic sans ms,sans-serif">Hello Rhys:<br></div><div class="gmail_default" style="font-family:comic sans ms,sans-serif">For the moment we don't have any flow algorithms, but we want to incorporate into pgRouting the following boost Graph algorithms:<br><ol><li>Maximum Flow and Matching Algorithms
<ol><li><a href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/edmonds_karp_max_flow.html"><tt>edmonds_karp_max_flow</tt></a>
</li><li><a href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/push_relabel_max_flow.html"><tt>push_relabel_max_flow</tt></a>
</li><li><a href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/boykov_kolmogorov_max_flow.html"><tt>boykov_kolmogorov_max_flow</tt></a></li><li><a href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/maximum_matching.html"><tt>edmonds_maximum_cardinality_matching</tt></a>
</li></ol>
</li><li>Minimum Cost Maximum Flow Algorithms
<ol><li><a href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/cycle_canceling.html"><tt>cycle_canceling</tt></a>
</li><li><a href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/successive_shortest_path_nonnegative_weights.html"><tt>successive_shortest_path_nonnegative_weights</tt></a>
</li><li><a href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/find_flow_cost.html"><tt>find_flow_cost</tt></a></li></ol>
</li></ol>I don't know if any of those might serve your purposes.<br></div><div class="gmail_default" style="font-family:comic sans ms,sans-serif">So, if you start writing code, please let us know, so we can give you a hand on how to use the pgRouting internal library.<br></div><div class="gmail_default" style="font-family:comic sans ms,sans-serif"><br></div></div><div class="gmail_extra"><br><div class="gmail_quote">On Tue, Apr 12, 2016 at 6:25 PM, Rhys A.D. Stewart <span dir="ltr"><<a href="mailto:rhys.stewart@gmail.com" target="_blank">rhys.stewart@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr"><div class="gmail_default" style="font-family:trebuchet ms,sans-serif">Greetings all,</div><div class="gmail_default" style="font-family:trebuchet ms,sans-serif"><br></div><div class="gmail_default" style="font-family:trebuchet ms,sans-serif">This is my first foray into the world of pgrouting. I'm particularly interested in sources and flows. I have a graph which I want to give direction based on one or more nodes being a source, and another set of nodes being blockers (I'm representing an electric network). I only saw one mention of sources/sinks in the pgrouting docs. I'm asking before I start writing code that may not need to be written.</div><div class="gmail_default" style="font-family:trebuchet ms,sans-serif"><br></div><div class="gmail_default" style="font-family:trebuchet ms,sans-serif"><br></div><div><div><div dir="ltr"><div>Rhys</div>Peace & Love|Live Long & Prosper</div></div></div>
</div>
<br>_______________________________________________<br>
Pgrouting-users mailing list<br>
<a href="mailto:Pgrouting-users@lists.osgeo.org">Pgrouting-users@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-users" rel="noreferrer" target="_blank">http://lists.osgeo.org/mailman/listinfo/pgrouting-users</a><br></blockquote></div><br><br clear="all"><br>-- <br><div class="gmail_signature"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><pre>Georepublic UG (haftungsbeschränkt)
Salzmannstraße 44,
81739 München, Germany
Vicky Vergara
Operations Research
eMail: vicky@<a href="http://georepublic.de" target="_blank">georepublic.de</a>
Web: <a href="https://georepublic.info" target="_blank">https://georepublic.info</a>
Tel: +49 (089) 4161 7698-1
Fax: +49 (089) 4161 7698-9
Commercial register: Amtsgericht München, HRB 181428
CEO: Daniel Kastl
<span></span></pre></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div>
</div>