# 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_astar/doc/index.rst:13
# 94d553821b2843da8b53f2b62144b2ac
msgid "pgr_bdAstar - Bi-directional A* Shortest Path"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:20
# d66a892d62ea42f389ac4d633677bc69
msgid "Name"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:22
# af928c8cbb924f2a8e51c2ee5b809a1a
msgid "``pgr_bdAstar`` - Returns the shortest path using Bidirectional A* algorithm."
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:26
# 9c224b471f5744db9fab9bc20e85ea4f
msgid "Synopsis"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:28
# 796b6647ea7343cba5cb08d5b378ab90
msgid "This is a bi-directional A* 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_astar/doc/index.rst:37
# 8725c147c87145b18b91fce7eef413e8
msgid "Description"
msgstr ""

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

#: ../../../src/bd_astar/doc/index.rst:46
# 349f1a1cc4a343b99b10297f9254fa6d
msgid "``int4`` identifier of the edge"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:47
# 4290dfb0558549ab82cfbbd0a7a7791e
msgid "``int4`` identifier of the source vertex"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:48
# 3b6f59d09a2b4506b2fb5d08f8d94fbf
msgid "``int4`` identifier of the target vertex"
msgstr ""

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

#: ../../../src/bd_astar/doc/index.rst:50
# 191d7cb28c2f49bba23dbf0b8848d74e
msgid "``x`` coordinate of the start point of the edge"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:51
# aadcb526a9f54bdf9499ff31a5c988a2
msgid "``y`` coordinate of the start point of the edge"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:52
# a1f9145757ab4193a1bb998f34438c9a
msgid "``x`` coordinate of the end point of the edge"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:53
# 96fc3a62bd38495ba875685af0462eb4
msgid "``y`` coordinate of the end point of the edge"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:54
# d81a0f9f10b74755a00b60e69a26f2a2
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_astar/doc/index.rst:56
# 45182780b36c4bf79c8d40211f1e99ec
msgid "``int4`` id of the start point"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:57
# f3177ef8858649878c1ae22a6a330acd
msgid "``int4`` id of the end point"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:58
# 698fa2d9c6d94092a9e0e7e99ba795b5
msgid "``true`` if the graph is directed"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:59
# ec9151bbea714618b966e3a4e0144fb8
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_astar/doc/index.rst:61
# 35ae9e0fbf7b4bf5b1bd2b8ef5682c64
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:63
# ba88c81469da47dc98ffac1c11199489
msgid "row sequence"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:64
# 0f5c9120b49740f493aa38b9df82dab0
msgid "node ID"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:65
# 985b7d421710447385e7d3d37e311590
msgid "edge ID (``-1`` for the last row)"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:66
# 2aac10119ea244b8b0a064e3277f70d5
msgid "cost to traverse from ``id1`` using ``id2``"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:70
# 16b869e2a9c34357806099659c237e08
msgid "You must reconnect to the database after ``CREATE EXTENSION pgrouting``. Otherwise the function will return ``Error computing path: std::bad_alloc``."
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:74
# 11446825468747189e98ea3e7110fae1
msgid "History"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:75
# d95dd9d2ac904f7a8ee6fe9ab78a7738
msgid "New in version 2.0.0"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:79
# b926578064e14ec9befea2cbcdcb47a0
msgid "Examples"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:81
# 3d07cb2cc3c9492db217a0574dfda373
msgid "Without ``reverse_cost``"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:101
# fa4260eb1fe248cf8572e37c60e387d2
msgid "With ``reverse_cost``"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:120
# c01af650893943b4bc17cde283c41a18
msgid "The queries use the :ref:`sampledata` network."
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:124
# f1d4852c159b455580e97a7956413aee
msgid "See Also"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:126
# 8a47b4b822a149ac9872af9e6198353c
msgid ":ref:`type_cost_result`"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:127
# b4440a71fb6a4e5daf6d46b8e557780f
msgid ":ref:`bd_dijkstra`"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:128
# 2f7b25d2e2644a2bb0b7757c92d0bcef
msgid "http://en.wikipedia.org/wiki/Bidirectional_search"
msgstr ""

#: ../../../src/bd_astar/doc/index.rst:129
# 540474312722476ba70eac8d56ff1887
msgid "http://en.wikipedia.org/wiki/A*_search_algorithm"
msgstr ""

