# 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:
# Daniel Kastl, 2013
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-20 14:15+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"

# dc72571c7ce5498b92c659e3e482c885
#: ../../../src/ksp/doc/index.rst:13
msgid "pgr_ksp - K-Shortest Path"
msgstr ""

# 57b24beea69846f58a8cb9b1a7a892b5
#: ../../../src/ksp/doc/index.rst:20
msgid "Name"
msgstr "Name"

# b3d0fc92b23443c8b718233c1e16f052
#: ../../../src/ksp/doc/index.rst:22
msgid "``pgr_ksp`` — Returns the \"K\" shortest paths."
msgstr ""

# 0e60ee2dfa944557a1e9c76106489a7f
#: ../../../src/ksp/doc/index.rst:26
msgid "Synopsis"
msgstr "Übersicht"

# bcf915dc485c4e3b90c9a8ea251b55d1
#: ../../../src/ksp/doc/index.rst:28
msgid ""
"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the"
" number of shortest paths desired. Returns a set of :ref:`pgr_costResult3 "
"<type_cost_result3>` (seq, id1, id2, id3, cost) rows, that make up a path."
msgstr ""

# 46b5ce0d54a64718819888b77b007080
#: ../../../src/ksp/doc/index.rst:37
msgid "Description"
msgstr "Beschreibung"

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

# 575d21e3bc994dc3a92a7c6cbb0ed6a2
#: ../../../src/ksp/doc/index.rst:46
msgid "``int4`` identifier of the edge"
msgstr ""

# 589751b9c7d34dac9b4eeb12894fd648
#: ../../../src/ksp/doc/index.rst:47
msgid "``int4`` identifier of the source vertex"
msgstr ""

# 6567c097438040d9b678e88df7521b35
#: ../../../src/ksp/doc/index.rst:48
msgid "``int4`` identifier of the target vertex"
msgstr ""

# a1e24bd423dd445889b72928d964a5ec
#: ../../../src/ksp/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 ""

# ed76ed5e3a504c7aa3a35ea3fa5b4c16
#: ../../../src/ksp/doc/index.rst:50
msgid ""
"(optional) the cost for the reverse traversal of the edge. This is only used"
" when ``has_rcost`` the parameter is ``true`` (see the above remark about "
"negative costs)."
msgstr ""

# 588bdec4303b49869b6d1eedd541c198
#: ../../../src/ksp/doc/index.rst:52
msgid "``int4`` id of the start point"
msgstr ""

# 96b44480fac34f6286b863e6c75d4d8a
#: ../../../src/ksp/doc/index.rst:53
msgid "``int4`` id of the end point"
msgstr ""

# 0ffd51df58754f0b89f1b3ad6f75b632
#: ../../../src/ksp/doc/index.rst:54
msgid "``int4`` number of alternative routes"
msgstr ""

# 0fc58370aa30454ea32a2c8b9f3b14a3
#: ../../../src/ksp/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 ""

# dc8dfcffbd604441a95743930181b042
#: ../../../src/ksp/doc/index.rst:57
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

# 611d6bbb82ca4987ae39fd45bb107c2b
#: ../../../src/ksp/doc/index.rst:59
msgid "sequence for ording the results"
msgstr ""

# b79966a030e04ee3b5e992b5a6858947
#: ../../../src/ksp/doc/index.rst:60
msgid "route ID"
msgstr ""

# a324539cdc2e4202b416aa19693d1c3f
#: ../../../src/ksp/doc/index.rst:61
msgid "node ID"
msgstr ""

# 4d87667a7b744eec999819b399fee50c
#: ../../../src/ksp/doc/index.rst:62
msgid "edge ID (``0`` for the last row)"
msgstr ""

# baaba3dc621142bd8fc6b8ba32eb2b2e
#: ../../../src/ksp/doc/index.rst:63
msgid "cost to traverse from ``id2`` using ``id3``"
msgstr ""

# b585e07096f74b0389f8b7dffc969faa
#: ../../../src/ksp/doc/index.rst:65
msgid ""
"KSP code base taken from http://code.google.com/p/k-shortest-paths/source."
msgstr ""

# 2d033ec25b09426c82d7bc27450b0e13
#: ../../../src/ksp/doc/index.rst:69
msgid "History"
msgstr "Geschichte"

# 2910d7995ec342b995c857c1e8ea0ac3
#: ../../../src/ksp/doc/index.rst:70
msgid "New in version 2.0.0"
msgstr "Neu in Version 2.0.0"

# 0fb494088fa241d6a4aa5482217c2851
#: ../../../src/ksp/doc/index.rst:74
msgid "Examples"
msgstr "Beispiele"

# d3ea07b1c58a42ea9f68558e55eb90a0
#: ../../../src/ksp/doc/index.rst:76
msgid "Without ``reverse_cost``"
msgstr ""

# 7c55b739634c4401b46c4014669d2896
#: ../../../src/ksp/doc/index.rst:104
msgid "With ``reverse_cost``"
msgstr ""

# 2412b0b4ec044973a1c2304488a73b1a
#: ../../../src/ksp/doc/index.rst:131
msgid "The queries use the :ref:`sampledata` network."
msgstr ""

# 14d58e1d3a8f4723bb11ed549594cb26
#: ../../../src/ksp/doc/index.rst:135
msgid "See Also"
msgstr "Siehe auch"

# 73cf1bb94518468996cdd3ff6bf897be
#: ../../../src/ksp/doc/index.rst:137
msgid ":ref:`type_cost_result3`"
msgstr ":ref:`type_cost_result3`"

# 3dde120556744d3f9ce7d6e9b9f0c1ee
#: ../../../src/ksp/doc/index.rst:138
msgid "http://en.wikipedia.org/wiki/K_shortest_path_routing"
msgstr "http://en.wikipedia.org/wiki/K_shortest_path_routing"
