# SOME DESCRIPTIVE TITLE.
# Copyright (C) pgRouting Contributors - Version 2.0.0 (b19690f doc-merge)
# This file is distributed under the same license as the pgRouting package.
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
#
#, fuzzy
msgid ""
msgstr ""
"Project-Id-Version: pgRouting 2.0.0\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2013-09-24 15:37\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
"Language-Team: LANGUAGE <LL@li.org>\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"

#: ../../../src/dijkstra/doc/index.rst:13
# 50301171ce5d401f85559f0f78ed94c2
msgid "pgr_dijkstra - Shortest Path Dijkstra"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:20
# aac36ba64c474526bf1828597c388126
msgid "Name"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:22
# 8fab07f022884045989636bfdef28f17
msgid "``pgr_dijkstra`` — Returns the shortest path using Dijkstra algorithm."
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:26
# bac7f012950e44e781b8011504302763
msgid "Synopsis"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:28
# 501edbe3463e4ee2894a8a47f64d6069
msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. Returns a set of :ref:`pgr_costResult <type_cost_result>` (seq, id1, id2, cost) rows, that make up a path."
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:37
# bf015d45cc2c47e1a954c58da0c0c2d1
msgid "Description"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:39
# 3c98337205be4a89b11255489fdc5707
msgid "a SQL query, which should return a set of rows with the following columns:"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:46
# eb3d36feb6c0498fb0430392b4e6812c
msgid "``int4`` identifier of the edge"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:47
# 5007749c114a4a4883504de934b52755
msgid "``int4`` identifier of the source vertex"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:48
# 4b5b6dc5d0f34de5adf3377389a638b8
msgid "``int4`` identifier of the target vertex"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:49
# 8997da1dc3194f63bde2a1dd22f22459
msgid "``float8`` value, of the edge traversal cost. A negative cost will prevent the edge from being inserted in the graph."
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:50
# a380f7a73abe40dcb448928e9e8f5d8e
msgid "``float8`` (optional) the cost for the reverse traversal of the edge. This is only used when the ``directed`` and ``has_rcost`` parameters are ``true`` (see the above remark about negative costs)."
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:52
# 6be50d4127614cb8af1c89912d3c470b
msgid "``int4`` id of the start point"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:53
# ac4470290cc0492bbbd774e19c7f3885
msgid "``int4`` id of the end point"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:54
# e8017573874b4b32806334bbf0b5c66a
msgid "``true`` if the graph is directed"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:55
# a77e45a90ab247519a55dd214eb09183
msgid "if ``true``, the ``reverse_cost`` column of the SQL generated set of rows will be used for the cost of the traversal of the edge in the opposite direction."
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:57
# 8fa8d103a2c54e799dfefc851d437351
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:59
# 8a1768b88a6348df950c421a085a39b4
msgid "row sequence"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:60
# 4b694cf4fa72486997d4dc72b4131ae9
msgid "node ID"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:61
# cc7e0ea1d452430b905568dbcecf976b
msgid "edge ID (``-1`` for the last row)"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:62
# 199ffe68ac7e4a2a8584fb600c90369d
msgid "cost to traverse from ``id1`` using ``id2``"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:66
# 49024735230e45e6afe5d7fcf5ff9903
msgid "History"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:67
# f7df24de24614eb591f1d2e5455ddd60
msgid "Renamed in version 2.0.0"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:71
# dda042482061476987a715274a6859b3
msgid "Examples"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:73
# 161506681f4442b386c588480840fa42
msgid "Without ``reverse_cost``"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:92
# ad62d0be8ed14ada88f2af6d93bc47ba
msgid "With ``reverse_cost``"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:110
# ecdd052e4b2f46e6977bac493ef43b81
msgid "The queries use the :ref:`sampledata` network."
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:114
# e563519bf1d34a6fa67db74514cba5a4
msgid "See Also"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:116
# c1af2ee0672a4d8394b784757941806c
msgid ":ref:`type_cost_result`"
msgstr ""

#: ../../../src/dijkstra/doc/index.rst:117
# f67200f21bf1487ba2a3c2d0399fc8e6
msgid "http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
msgstr ""

