pgr_bdAstarCost

pgr_bdAstarCost - Total cost of the shortest path(s) using the bidirectional A* algorithm.

_images/boost-inside.jpeg

Boost Graph Inside

Disponibilidad

  • Versión 3.2.0

  • Versión 3.0.0

    • Función oficial

  • Version 2.4.0

    • New proposed function

Descripción

The pgr_bdAstarCost function sumarizes of the cost of the shortest path(s) using the bidirectional A* algorithm.

The main characteristics are:

  • El tipo predeterminado de grafo es dirigido cuando

    • Falta la el indicador de directed.

    • El indicador de directed se configura a «true».

  • A menos que se especifique lo contrario, la orden es:

    • primero por start_vid (si existe)

    • luego por end_vid

  • Los valores se devuelven cuando hay una ruta

  • Permita que \(v\) y \(u\) sean nodos en el grafo:

    • Si no hay camino de \(v\) a \(u\):

      • no se devuelve ninguna fila correspondiente

      • agg_cost de \(v\) a \(u\) es \(\infty\)

    • No hay camino cuando \(v = u\) por lo tanto

      • no se devuelve ninguna fila correspondiente

      • agg_cost de v a u es \(0\)

  • Los bordes con costes negativos no se incluyen en el grafo.

  • Cuando las coordenadas (x,y) para el mismo identificador de vértice difieren:

    • Se utiliza una selección aleatoria de las coordenadas del vértice (x,y).

  • Tiempo de ejecución: \(O((E + V) * \log V)\)

  • It does not return a path.

  • Returns the sum of the costs of the shortest path of each pair combination of nodes requested.

  • Let be the case the values returned are stored in a table, so the unique index would be the pair: (start_vid, end_vid)

  • For undirected graphs, the results are symmetric.

    • The agg_cost of (u, v) is the same as for (v, u).

  • The returned values are ordered in ascending order:

    • start_vid ascending

    • end_vid ascending

Firmas

Resumen

pgr_bdAstarCost(Edges SQL, start vid, end vid [, directed] [, heuristic] [, factor] [, epsilon])
pgr_bdAstarCost(Edges SQL, start vid, end vids [, directed] [, heuristic] [, factor] [, epsilon])
pgr_bdAstarCost(Edges SQL, start vids, end vid [, directed] [, heuristic] [, factor] [, epsilon])
pgr_bdAstarCost(Edges SQL, start vids, end vids [, directed] [, heuristic] [, factor] [, epsilon])
pgr_bdAstarCost(Edges SQL, Combinations SQL  [, directed] [, heuristic] [, factor] [, epsilon])
RETURNS SET OF (start_vid, end_vid, agg_cost)
OR EMPTY SET

Uno a Uno

pgr_bdAstarCost(Edges SQL, start vid, end vid [, directed] [, heuristic] [, factor] [, epsilon])
RETURNS SET OF (start_vid, end_vid, agg_cost)
OR EMPTY SET
Ejemplo

From vertex \(2\) to vertex \(11\) on a directed graph with heuristic \(2\)

SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  2, 11,
  directed => true, heuristic => 2
);
 start_vid | end_vid | agg_cost
-----------+---------+----------
         2 |      11 |        3
(1 row)

One to Many

pgr_bdAstarCost(Edges SQL, start vid, end vids [, directed] [, heuristic] [, factor] [, epsilon])
RETURNS SET OF (start_vid, end_vid, agg_cost)
OR EMPTY SET
Ejemplo

From vertex \(2\) to vertices \(\{3, 11\}\) on a directed graph with heuristic \(3\) and factor \(3.5\)

SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  2, ARRAY[3, 11],
  heuristic => 3, factor := 3.5
);
 start_vid | end_vid | agg_cost
-----------+---------+----------
         2 |       3 |        5
         2 |      11 |        3
(2 rows)

Muchos a Uno

pgr_bdAstarCost(Edges SQL, start vids, end vid [, directed] [, heuristic] [, factor] [, epsilon])
RETURNS SET OF (start_vid, end_vid, agg_cost)
OR EMPTY SET
Ejemplo

From vertices \(\{2, 10\}\) to vertex \(3\) on an undirected graph with heuristic \(4\)

SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  ARRAY[2, 10], 3,
  false, heuristic => 4
);
 start_vid | end_vid | agg_cost
-----------+---------+----------
         2 |       3 |        1
        10 |       3 |        3
(2 rows)

Muchos a Muchos

pgr_bdAstarCost(Edges SQL, start vids, end vids [, directed] [, heuristic] [, factor] [, epsilon])
RETURNS SET OF (start_vid, end_vid, agg_cost)
OR EMPTY SET
Ejemplo

From vertices \(\{2, 10\}\) to vertices \(\{3, 11\}\) on a directed graph with factor \(0.5\)

SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  ARRAY[2, 10], ARRAY[3, 11],
  factor => 0.5
);
 start_vid | end_vid | agg_cost
-----------+---------+----------
         2 |       3 |        5
         2 |      11 |        3
        10 |       3 |        5
        10 |      11 |        1
(4 rows)

Combinaciones

pgr_bdAstarCost(Edges SQL, Combinations SQL  [, directed] [, heuristic] [, factor] [, epsilon])
RETURNS SET OF (start_vid, end_vid, agg_cost)
OR EMPTY SET
Ejemplo

Using a combinations table on a directed graph with factor \(0.5\).

The combinations table:

SELECT * FROM combinations_table;
 source | target
--------+--------
      1 |      2
      1 |      3
      2 |      1
      2 |      4
      2 |     17
(5 rows)

The query:

SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  'SELECT * FROM combinations_table',
  factor => 0.5
);
 start_vid | end_vid | agg_cost
-----------+---------+----------
         1 |       2 |        1
         1 |       3 |        6
         2 |       1 |        1
         2 |       4 |        4
(4 rows)

Parámetros

Columna

Tipo

Descripción

Edges SQL

TEXT

Edges SQL as described below

Combinations SQL

TEXT

Combinations SQL as described below

start vid

BIGINT

Identifier of the starting vertex of the path.

start vids

ARRAY[BIGINT]

Array of identifiers of starting vertices.

end vid

BIGINT

Identifier of the ending vertex of the path.

end vids

ARRAY[BIGINT]

Array of identifiers of ending vertices.

Optional parameters

Columna

Tipo

default

Descripción

directed

BOOLEAN

true

  • When true the graph is considered Directed

  • When false the graph is considered as Undirected.

aStar optional Parameters

Parámetro

Tipo

x Defecto

Descripción

heuristic

INTEGER

5

Heuristic number. Current valid values 0~5.

  • 0: h(v) = 0 (utilizar este valor para comparar con pgr_dijkstra)

  • 1: h(v) abs(max(dx, dy))

  • 2: h(v) abs(min(dx, dy))

  • 3: h(v) = dx * dx + dy * dy

  • 4: h(v) = sqrt(dx * dx + dy * dy)

  • 5: h(v) = abs(dx) + abs(dy)

factor

FLOAT

1

Para la manipulación de unidades. math:factor > 0. Ver Factor

epsilon

FLOAT

1

Para resultados menos restringidos. \(epsilon >= 1\).

Consultas internas

Edges SQL

Parámetro

Tipo

x Defecto

Descripción

id

ANY-INTEGER

Identificador de la arista.

source

ANY-INTEGER

Identificador del primer vértice extremo de la arista.

target

ANY-INTEGER

Identificador del segundo vértice extremo de la arista.

cost

ANY-NUMERICAL

Weight of the edge (source, target)

  • When negative: edge (source, target) does not exist, therefore it’s not part of the graph.

reverse_cost

ANY-NUMERICAL

-1

Weight of the edge (target, source),

  • When negative: edge (target, source) does not exist, therefore it’s not part of the graph.

x1

ANY-NUMERICAL

X coordinate of source vertex.

y1

ANY-NUMERICAL

Y coordinate of source vertex.

x2

ANY-NUMERICAL

X coordinate of target vertex.

y2

ANY-NUMERICAL

Y coordinate of target vertex.

Donde:

ANY-INTEGER

SMALLINT, INTEGER, BIGINT

ANY-NUMERICAL

SMALLINT, INTEGER, BIGINT, REAL, FLOAT

Combinations SQL

Parámetro

Tipo

Descripción

source

ANY-INTEGER

Identifier of the departure vertex.

target

ANY-INTEGER

Identifier of the arrival vertex.

Donde:

ANY-INTEGER

SMALLINT, INTEGER, BIGINT

Return Columns

Set of (start_vid, end_vid, agg_cost)

Columna

Tipo

Descripción

start_vid

BIGINT

Identificador del vértice inicial.

end_vid

BIGINT

Identificador del vértice final.

agg_cost

FLOAT

Coste agregado de start_vid a end_vid.

Additional Examples

Example 1

Demonstration of repeated values are ignored, and result is sorted.

 SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  ARRAY[5, 3, 4, 3, 3, 4], ARRAY[3, 5, 3, 4]);
 start_vid | end_vid | agg_cost
-----------+---------+----------
         3 |       4 |        3
         3 |       5 |        2
         4 |       3 |        1
         4 |       5 |        3
         5 |       3 |        4
         5 |       4 |        3
(6 rows)

Example 2

Making start_vids the same as end_vids.

SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  ARRAY[5, 3, 4], ARRAY[5, 3, 4]);
 start_vid | end_vid | agg_cost
-----------+---------+----------
         3 |       4 |        3
         3 |       5 |        2
         4 |       3 |        1
         4 |       5 |        3
         5 |       3 |        4
         5 |       4 |        3
(6 rows)

Example 3

Manually assigned vertex combinations.

SELECT * FROM pgr_bdAstarCost(
  'SELECT id, source, target, cost, reverse_cost, x1, y1, x2, y2
  FROM edge_table',
  'SELECT * FROM (VALUES (2, 3), (2, 5), (11, 3)) AS combinations (source, target)');
 start_vid | end_vid | agg_cost
-----------+---------+----------
         2 |       3 |        5
         2 |       5 |        1
        11 |       3 |        4
(3 rows)

Ver también

Índices y tablas