<!DOCTYPE html><html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8" /></head><body><div data-html-editor-font-wrapper="true" style="font-family: arial, sans-serif; font-size: 13px;">Hi All,<br><br>I would just say that the boost library is already well used in the pgrouting and the code required to link the <span style="font-family: 'comic sans ms', sans-serif; font-size: 13px; line-height: 16px; background-color: rgb(255, 255, 255);">algorithms suggested by Vicky could be done by copy the bulk of the current code.<br><br>Dave.</span><br><br>13 April 2016 00:38, "Vicky Vergara" <<a target="_blank" tabindex="-1" href="mailto:%22Vicky%20Vergara%22%20<vicky@georepublic.de>">vicky@georepublic.de</a>> wrote:<blockquote><div><div><div dir="ltr"><div style="font-family: comic sans ms,sans-serif">Hello Rhys:</div><div 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:<ol><li>Maximum Flow and Matching Algorithms<ol><li><a target="_blank" tabindex="-1" rel="external nofollow" 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 target="_blank" tabindex="-1" rel="external nofollow" 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 target="_blank" tabindex="-1" rel="external nofollow" 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 target="_blank" tabindex="-1" rel="external nofollow" 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 target="_blank" tabindex="-1" rel="external nofollow" href="http://www.boost.org/doc/libs/1_60_0/libs/graph/doc/cycle_canceling.html"><tt>cycle_canceling</tt></a></li><li><a target="_blank" tabindex="-1" rel="external nofollow" 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 target="_blank" tabindex="-1" rel="external nofollow" 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.</div><div 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.</div><div style="font-family: comic sans ms,sans-serif"></div></div><div> <div>On Tue, Apr 12, 2016 at 6:25 PM, Rhys A.D. Stewart <span dir="ltr"><<a target="_blank" tabindex="-1" rel="external nofollow" href="mailto:rhys.stewart@gmail.com">rhys.stewart@gmail.com</a>></span> wrote:<br><br> <blockquote style="margin: 0 0 0 .8ex;border-left: 1px #ccc solid;padding-left: 1ex"><div dir="ltr"><div style="font-family: trebuchet ms,sans-serif">Greetings all,</div><div style="font-family: trebuchet ms,sans-serif"></div><div 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 style="font-family: trebuchet ms,sans-serif"></div><div style="font-family: trebuchet ms,sans-serif"></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 target="_blank" tabindex="-1" rel="external nofollow" href="mailto:Pgrouting-users@lists.osgeo.org">Pgrouting-users@lists.osgeo.org</a><br><a rel="external nofollow" target="_blank" tabindex="-1" href="http://lists.osgeo.org/mailman/listinfo/pgrouting-users">http://lists.osgeo.org/mailman/listinfo/pgrouting-users</a></blockquote></div><br><br clear="all"><br>--<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"><div><div dir="ltr"><pre>Georepublic UG (haftungsbeschränkt) Salzmannstraße 44, 81739 München, Germany Vicky Vergara Operations Research eMail: vicky@<a target="_blank" tabindex="-1" rel="external nofollow" href="http://georepublic.de">georepublic.de</a> Web: <a target="_blank" tabindex="-1" rel="external nofollow" href="https://georepublic.info">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 </pre></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></blockquote></div></body></html>