Zen

Source string Source string

30/10000 · 30

The string is read only.

English Actions
All vertices in ``source`` and ``target`` are part of the graph.
In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \rightarrow target_{id}`
For the following data:
Edge :math:`2` (:math:`1 \rightarrow 3`) is not part of the graph.
The data is representing the following graph:
In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \frac{\;\;\;\;\;}{} target_{id}`
In terms of a directed graph is like having two edges: :math:`source_{id} \leftrightarrow target_{id}`
Edge :math:`2` (:math:`1 \frac{\;\;\;\;\;}{} 3`) is not part of the graph.
Graph with ``cost`` and ``reverse_cost``
The weighted directed graph, :math:`G_d(V,E)`, is defined by:
``SELECT id, source, target, cost, reverse_cost FROM edges``
The set of edges :math:`E`:
:math:`E = \begin{split} \begin{align} & {\{(source_{id}, target_{id}, cost_{id}) \text{ when } cost_{id} >=0 \}} \\ & \cup \\ & {\{(target_{id}, source_{id}, reverse\_cost_{id}) \text{ when } reverse\_cost_{id} >=0 \}} \end{align} \end{split}`
Edges :math:`(source \rightarrow target)` where ``cost`` is non negative are part of the graph.
Edges :math:`(target \rightarrow source)` where ``reverse_cost`` is non negative are part of the graph.
The set of vertices :math:`V`:
In a directed graph both edges have directionality
edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \rightarrow target_{id}`
edge :math:`(target_{id}, source_{id}, reverse\_cost_{id})` has directionality: :math:`target_{id} \rightarrow source_{id}`
Edges not part of the graph:
:math:`2` (:math:`1 \rightarrow 3`)
:math:`3` (:math:`3 \rightarrow 2`)
In a directed graph both edges do not have directionality
Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \frac{\;\;\;\;\;}{} target_{id}`
Edge :math:`(target_{id}, source_{id}, reverse\_cost_{id})` is :math:`target_{id} \frac{\;\;\;\;\;}{} source_{id}`
In terms of a directed graph is like having four edges:
:math:`source_i \leftrightarrow target_i`
:math:`target_i \leftrightarrow source_i`
:math:`2` (:math:`1 \frac{\;\;\;\;\;}{} 3`)
:math:`3` (:math:`3 \frac{\;\;\;\;\;}{} 2`)
Graphs without geometries

Loading…

User avatar None

String updated in the repository

  1. pgRouting
  2. pgRouting
  3. English
The set of vertices :math:`V`:
The set of vertices :math:`V`:
6 months ago
Browse all string changes

Things to check

Multiple failing checks

Following checks are failing:
Mismatched colon: Japanese, Japanese

Reset

Glossary

English English
No related strings found in the glossary.

String information

Flags
read-only
String age
6 months ago
Last updated
6 months ago
Source string age
6 months ago
Translation file
locale/pot/pgrouting_doc_strings.pot, string 1675