# 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/astar/doc/index.rst:13
# 6e1e586d213443b784008328909e5ece
msgid "pgr_astar - Shortest Path A*"
msgstr ""

#: ../../../src/astar/doc/index.rst:20
# 2facf0f31f2146489701757746e8a64a
msgid "Name"
msgstr ""

#: ../../../src/astar/doc/index.rst:22
# 23aacea288c342798e40cf0e9ba814c9
msgid "``pgr_astar`` — Returns the shortest path using A* algorithm."
msgstr ""

#: ../../../src/astar/doc/index.rst:26
# acf9bf94f29e4b06b7484e750b4b90a2
msgid "Synopsis"
msgstr ""

#: ../../../src/astar/doc/index.rst:28
# ef84d81b818b48008d29bc99965a6777
msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph. Returns a set of :ref:`pgr_costResult <type_cost_result>` (seq, id1, id2, cost) rows, that make up a path."
msgstr ""

#: ../../../src/astar/doc/index.rst:37
# 2b4f80c2b5b34af5915bdd1bbda06371
msgid "Description"
msgstr ""

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

#: ../../../src/astar/doc/index.rst:46
# 170c19f4695f4528b1032549f545e7da
msgid "``int4`` identifier of the edge"
msgstr ""

#: ../../../src/astar/doc/index.rst:47
# 2c6b77c66814423fb74406d92b5f94ce
msgid "``int4`` identifier of the source vertex"
msgstr ""

#: ../../../src/astar/doc/index.rst:48
# 15b50cb99b7b437f89a8d677084941bb
msgid "``int4`` identifier of the target vertex"
msgstr ""

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

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

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

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

#: ../../../src/astar/doc/index.rst:53
# 09f3e444d5b84c449c9b4bfed347727c
msgid "``y`` coordinate of the end point of the edge"
msgstr ""

#: ../../../src/astar/doc/index.rst:54
# 23cefa9d8f8d4175a70310ba6cff3491
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/astar/doc/index.rst:56
# a67e6af024634f0b9951a9ee8c9a5b0e
msgid "``int4`` id of the start point"
msgstr ""

#: ../../../src/astar/doc/index.rst:57
# 0d93c19173084e758387fbdf0685e7eb
msgid "``int4`` id of the end point"
msgstr ""

#: ../../../src/astar/doc/index.rst:58
# d775130bce1240e29e45304d0e01b438
msgid "``true`` if the graph is directed"
msgstr ""

#: ../../../src/astar/doc/index.rst:59
# 01a1716de277419bb01c175efa6fc8a6
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/astar/doc/index.rst:61
# 9053bb99674d467c90a070c7475ba028
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

#: ../../../src/astar/doc/index.rst:63
# d4c3a227512549ac9b51a4b4574e82a6
msgid "row sequence"
msgstr ""

#: ../../../src/astar/doc/index.rst:64
# 883026be35e04211b0017c663b155fc3
msgid "node ID"
msgstr ""

#: ../../../src/astar/doc/index.rst:65
# 58d443157e2941c1af29d7fd7f16ce3b
msgid "edge ID (``-1`` for the last row)"
msgstr ""

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

#: ../../../src/astar/doc/index.rst:70
# 5b850b7d5d74412fbfe7c33a0d944ec1
msgid "History"
msgstr ""

#: ../../../src/astar/doc/index.rst:71
# 6dbcad5c304445bb90e3d32a771ee68b
msgid "Renamed in version 2.0.0"
msgstr ""

#: ../../../src/astar/doc/index.rst:75
# cd89b18e41e44a87998eee51aa4484dc
msgid "Examples"
msgstr ""

#: ../../../src/astar/doc/index.rst:77
# e9194064ec3642a3be701e5b6beb5cba
msgid "Without ``reverse_cost``"
msgstr ""

#: ../../../src/astar/doc/index.rst:99
# c7f170f7fc3e4a8ebfd8e0e5808d0640
msgid "With ``reverse_cost``"
msgstr ""

#: ../../../src/astar/doc/index.rst:117
# 540bf79726d843d88a072ba5ac357cc9
msgid "The queries use the :ref:`sampledata` network."
msgstr ""

#: ../../../src/astar/doc/index.rst:121
# 0534beb965ef450e898194e478a8ad99
msgid "See Also"
msgstr ""

#: ../../../src/astar/doc/index.rst:123
# ebdee1902c164749b486df950420287b
msgid ":ref:`type_cost_result`"
msgstr ""

#: ../../../src/astar/doc/index.rst:124
# d54c6506fb0b4d10a75e6d6965a9f8c0
msgid "http://en.wikipedia.org/wiki/A*_search_algorithm"
msgstr ""

