# 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/bd_dijkstra/doc/index.rst:13
# cd087563fa634417a9a96f1447db3eef
msgid "pgr_bdDijkstra - Bi-directional Dijkstra Shortest Path"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:21
# 8792d257978d40b78b63abe4efc5e526
msgid "Name"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:23
# 837b0c3d34e748dd8604ad26d045af3b
msgid "``pgr_bdDijkstra`` - Returns the shortest path using Bidirectional Dijkstra algorithm."
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:27
# b0164687c8474bb58b095e2a16944cb5
msgid "Synopsis"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:29
# 468d5a655f514969b05514fc141936cd
msgid "This is a bi-directional Dijkstra search algorithm. It searchs from the source toward the distination and at the same time from the destination to the source and terminates whe these to searchs meet in the middle. Returns a set of :ref:`pgr_costResult <type_cost_result>` (seq, id1, id2, cost) rows, that make up a path."
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:38
# c1d7beb510774fb1bcfaaabf7de9ffdb
msgid "Description"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:40
# 022ee086b0cf494f920b34c5bf9ab727
msgid "a SQL query, which should return a set of rows with the following columns:"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:47
# d492aaf139ca4f1e862a40b159c05c39
msgid "``int4`` identifier of the edge"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:48
# 62644c61c70f44d3b3dbc5ddb896a59e
msgid "``int4`` identifier of the source vertex"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:49
# 0d8b18de07504cde837a6fce2619d6a8
msgid "``int4`` identifier of the target vertex"
msgstr ""

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

#: ../../../src/bd_dijkstra/doc/index.rst:51
# f947208020fc4835826101f9a5b2a2e6
msgid "(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/bd_dijkstra/doc/index.rst:53
# 8af5c7909ee3491381b628192ea60583
msgid "``int4`` id of the start point"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:54
# b2e95038b1174633b071d88bb5b89f52
msgid "``int4`` id of the end point"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:55
# 2c8bee2885f94ec7b4238ae1ae4acf8d
msgid "``true`` if the graph is directed"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:56
# 256f47e8dcfb4938bc26e27cbdf2f010
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/bd_dijkstra/doc/index.rst:58
# 6d9e7fff08af4a06995fbbbca0210783
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:60
# f9139c237adb4ae5a68dcf9cdf00fa88
msgid "row sequence"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:61
# cf58390319724ff28fcf907d2c10f9ac
msgid "node ID"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:62
# 592c54ff23f34cfbb8aab59112f8bffa
msgid "edge ID (``-1`` for the last row)"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:63
# 0ca96bd644b847c396563b2d230838c3
msgid "cost to traverse from ``id1`` using ``id2``"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:66
# 15894b000d784eb7b3228a22113ad2c1
msgid "History"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:67
# 5749a50aaa3949a2b093e3c474d74bbb
msgid "New in version 2.0.0"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:71
# fe393668e10441ff8d71c2399d47aff8
msgid "Examples"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:73
# f5b17ce493294d2f8a5b47b034f89acb
msgid "Without ``reverse_cost``"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:93
# 7b362f2655c44b2e80a0fcbd72489fb8
msgid "With ``reverse_cost``"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:113
# 0aea658bd347454a915aa248d4e5db72
msgid "The queries use the :ref:`sampledata` network."
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:117
# 89cc685068e345f2a2a0aa44d793a833
msgid "See Also"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:119
# 474fed6e1f654dd7887a1e646ca466a6
msgid ":ref:`type_cost_result`"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:120
# ca73c5f11d8a40e1a6280cad363bd614
msgid ":ref:`bd_astar`"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:121
# fca2300e8ffd4f919376e6bcfb7798ec
msgid "http://en.wikipedia.org/wiki/Bidirectional_search"
msgstr ""

#: ../../../src/bd_dijkstra/doc/index.rst:122
# eaefcfbf6d4c4f05af6ccff090f48be4
msgid "http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
msgstr ""

