1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
|
-- CopyRight(c) pgRouting developers
-- Creative Commons Attribution-Share Alike 3.0 License : https://creativecommons.org/licenses/by-sa/3.0/
/* -- q1 */
SELECT * FROM pgr_dijkstraNear(
'SELECT id, source, target, cost, reverse_cost FROM edges',
6, ARRAY[10, 11, 1]);
/* -- q2 */
SELECT * FROM pgr_dijkstraNear(
'SELECT id, source, target, cost, reverse_cost FROM edges',
ARRAY[10, 11, 1], 6,
true,
cap => 2);
/* -- q3 */
SELECT * FROM pgr_dijkstraNear(
'SELECT id, source, target, cost, reverse_cost FROM edges',
ARRAY[15, 16], ARRAY[10, 11, 1],
directed => false);
/* -- q4 */
SELECT unnest(ARRAY[10, 11, 1]) as source, target
FROM (SELECT unnest(ARRAY[15, 16]) AS target) a
UNION
SELECT unnest(ARRAY[15, 16]), target
FROM (SELECT unnest(ARRAY[10, 11, 1]) AS target) b ORDER BY source, target;
/* -- q41 */
SELECT * FROM pgr_dijkstraNear(
'SELECT id, source, target, cost, reverse_cost FROM edges',
'SELECT unnest(ARRAY[10, 11, 1]) as source, target
FROM (SELECT unnest(ARRAY[15, 16]) AS target) a
UNION
SELECT unnest(ARRAY[15, 16]), target
FROM (SELECT unnest(ARRAY[10, 11, 1]) AS target) b',
global => false);
/* -- q5 */
|