'pgRouting - querying with edge dependencies
I would like to know if it is possible to add dependencies to an edge? (In form of a sql sub-select)
For example:
We have bidirectional (default) edges from node A to B and another "special" edge from B to C. In my case this might be a ship transfer from port B to port C. There are hundreds more streets and a lot less ship edges. But for the sake of simplicity we keep those 3 nodes and 2 edges.
A <--(street)--> B <--(ship)--> C
Those streets reflect a simple and standard topology. Nothing fancy here. But this special edge (B->C) depends on the users presets of using a ship or not.
Now we query a route from A to C:
If the users preference "Use Ships" flag is set to true, the result would be: A -> B -> C.
But if the user has disabled the "Use Ships" flag there is no possible way and the routing function should return an empty result set. The sub-query for our "use_ship" edge would be as simple as SELECT use_ships FROM users WHERE id = $1;
A route for A -> B would always work for any user because they don't hit the special edge from B->C.
Is it possible to add some kind of dependency to an edge like a variable? And which topology function would be able to query something like that?
Thanks in advance! Best, Jan
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|
