# SOME DESCRIPTIVE TITLE.
# Copyright (C) pgRouting Contributors - Version 2.0.0 (ec59fc1 develop)
# This file is distributed under the same license as the pgRouting package.
# 
# Translators:
msgid ""
msgstr ""
"Project-Id-Version: Documentation\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2013-09-22 13:52\n"
"PO-Revision-Date: 2013-09-22 06:20+0000\n"
"Last-Translator: Daniel Kastl\n"
"Language-Team: German (http://www.transifex.com/projects/p/pgrouting/language/de/)\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Language: de\n"
"Plural-Forms: nplurals=2; plural=(n != 1);\n"

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

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

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

# aad22c43d6da4f658543ad79e2b4789c
#: ../../../src/dijkstra/doc/index.rst:26
msgid "Synopsis"
msgstr "Übersicht"

# d23c857c49554c10a6c99810575627e1
#: ../../../src/dijkstra/doc/index.rst:28
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 ""

# 9b3ef7764a8a4aec8be3fd97d0f78855
#: ../../../src/dijkstra/doc/index.rst:37
msgid "Description"
msgstr "Beschreibung"

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

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

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

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

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

# 13bbd212a94840bbbdd82ba008836790
#: ../../../src/dijkstra/doc/index.rst:50
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 ""

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

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

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

# 03f039cd5de34a3f99a5871456ed269f
#: ../../../src/dijkstra/doc/index.rst:55
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 ""

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

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

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

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

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

# d45859a53252493eaea97bdbe6c8936f
#: ../../../src/dijkstra/doc/index.rst:66
msgid "History"
msgstr "Geschichte"

# 41349c9ad4574d009aa7375219beab0c
#: ../../../src/dijkstra/doc/index.rst:67
msgid "Renamed in version 2.0.0"
msgstr "Umbenannt in Version 2.0.0"

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

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

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

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

# 7097292ec353427d90c60607583c42c2
#: ../../../src/dijkstra/doc/index.rst:114
msgid "See Also"
msgstr "Siehe auch"

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

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