# 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/ksp/doc/index.rst:13
# 8fded0f5c5394081adda4db3a409a1bd
msgid "pgr_ksp - K-Shortest Path"
msgstr ""

#: ../../../src/ksp/doc/index.rst:20
# 285de40d0f134529b7fd366033d21d76
msgid "Name"
msgstr ""

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

#: ../../../src/ksp/doc/index.rst:26
# 4e4ecc509a594b3abb906d4d82974bc5
msgid "Synopsis"
msgstr ""

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

#: ../../../src/ksp/doc/index.rst:37
# 0bdce7ee5be74ba98a0d5221b5a10499
msgid "Description"
msgstr ""

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

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

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

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

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

#: ../../../src/ksp/doc/index.rst:50
# 0600cb9492634d53894e713a4898268b
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 ""

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

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

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

#: ../../../src/ksp/doc/index.rst:55
# b24f1c5af0f846468cc3bb28f4f872f0
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/ksp/doc/index.rst:57
# 5cc117f406fb49f4b932c8b8e7f20e0e
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

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

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

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

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

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

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

#: ../../../src/ksp/doc/index.rst:69
# 80d641fff71848beb29d2be6f68c6526
msgid "History"
msgstr ""

#: ../../../src/ksp/doc/index.rst:70
# 168f0b58648c4c43b2b683d760d75222
msgid "New in version 2.0.0"
msgstr ""

#: ../../../src/ksp/doc/index.rst:74
# c8dfe3e8f3c246f49801d1c26294159e
msgid "Examples"
msgstr ""

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

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

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

#: ../../../src/ksp/doc/index.rst:135
# aca51b91e9384c8a85bbc24dbfde463d
msgid "See Also"
msgstr ""

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

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

