Greetings all,
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.
Rhys
Peace & Love|Live Long & Prosper
Hello Rhys:
For the moment we don’t have any flow algorithms, but we want to incorporate into pgRouting the following boost Graph algorithms:
- Maximum Flow and Matching Algorithms
edmonds_karp_max_flow
push_relabel_max_flow
boykov_kolmogorov_max_flow
edmonds_maximum_cardinality_matching
- Minimum Cost Maximum Flow Algorithms
cycle_canceling
successive_shortest_path_nonnegative_weights
find_flow_cost
I don’t know if any of those might serve your purposes.
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.
···
On Tue, Apr 12, 2016 at 6:25 PM, Rhys A.D. Stewart <rhys.stewart@gmail.com> wrote:
Greetings all,
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.
Rhys
Peace & Love|Live Long & Prosper
Pgrouting-users mailing list
Pgrouting-users@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-users
–
Georepublic UG (haftungsbeschränkt)
Salzmannstraße 44,
81739 München, Germany
Vicky Vergara
Operations Research
eMail: vicky@[georepublic.de](http://georepublic.de)
Web: [https://georepublic.info](https://georepublic.info)
Tel: +49 (089) 4161 7698-1
Fax: +49 (089) 4161 7698-9
Commercial register: Amtsgericht München, HRB 181428
CEO: Daniel Kastl
Hi All,
I would just say that the boost library is already well used in the pgrouting and the code required to link the algorithms suggested by Vicky could be done by copy the bulk of the current code.
Dave.
13 April 2016 00:38, “Vicky Vergara” <vicky@georepublic.de> wrote:
Hello Rhys:
For the moment we don’t have any flow algorithms, but we want to incorporate into pgRouting the following boost Graph algorithms:
- Maximum Flow and Matching Algorithms
edmonds_karp_max_flow
push_relabel_max_flow
boykov_kolmogorov_max_flow
edmonds_maximum_cardinality_matching
- Minimum Cost Maximum Flow Algorithms
cycle_canceling
successive_shortest_path_nonnegative_weights
find_flow_cost
I don’t know if any of those might serve your purposes.
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.
On Tue, Apr 12, 2016 at 6:25 PM, Rhys A.D. Stewart <rhys.stewart@gmail.com> wrote:
Greetings all,
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.
Rhys
Peace & Love|Live Long & Prosper
Pgrouting-users mailing list
Pgrouting-users@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-users
–
Georepublic UG (haftungsbeschränkt) Salzmannstraße 44, 81739 München, Germany Vicky Vergara Operations Research eMail: vicky@[georepublic.de](http://georepublic.de) Web: [https://georepublic.info](https://georepublic.info) Tel: +49 (089) 4161 7698-1 Fax: +49 (089) 4161 7698-9 Commercial register: Amtsgericht München, HRB 181428 CEO: Daniel Kastl
Hi all,
I have been looking into flow algorithms for pgRouting and it is also my application for GSoC.
If you have any ideas or just want to discuss, please let me know.
Andrea
···
On Wed, Apr 13, 2016 at 8:16 AM, <dave.potts@pinan.co.uk> wrote:
Hi All,
I would just say that the boost library is already well used in the pgrouting and the code required to link the algorithms suggested by Vicky could be done by copy the bulk of the current code.
Dave.
13 April 2016 00:38, “Vicky Vergara” <vicky@georepublic.de> wrote:
Hello Rhys:
For the moment we don’t have any flow algorithms, but we want to incorporate into pgRouting the following boost Graph algorithms:
- Maximum Flow and Matching Algorithms
edmonds_karp_max_flow
push_relabel_max_flow
boykov_kolmogorov_max_flow
edmonds_maximum_cardinality_matching
- Minimum Cost Maximum Flow Algorithms
cycle_canceling
successive_shortest_path_nonnegative_weights
find_flow_cost
I don’t know if any of those might serve your purposes.
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.
On Tue, Apr 12, 2016 at 6:25 PM, Rhys A.D. Stewart <rhys.stewart@gmail.com> wrote:
Greetings all,
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.
Rhys
Peace & Love|Live Long & Prosper
Pgrouting-users mailing list
Pgrouting-users@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-users
–
Georepublic UG (haftungsbeschränkt) Salzmannstraße 44, 81739 München, Germany Vicky Vergara Operations Research eMail: vicky@[georepublic.de](http://georepublic.de) Web: [https://georepublic.info](https://georepublic.info) Tel: +49 (089) 4161 7698-1 Fax: +49 (089) 4161 7698-9 Commercial register: Amtsgericht München, HRB 181428 CEO: Daniel Kastl
Pgrouting-users mailing list
Pgrouting-users@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-users