# 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:
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-22 06:20+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"

# b270045aa6e74d789897bb176f5c4a37
#: ../../../src/astar/doc/index.rst:13
msgid "pgr_astar - Shortest Path A*"
msgstr ""

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

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

# d3e3e83acd754acb9ac4c583d6dd0649
#: ../../../src/astar/doc/index.rst:26
msgid "Synopsis"
msgstr "Übersicht"

# 87ae068cf08b4ddca7f5bb3722ce57f2
#: ../../../src/astar/doc/index.rst:28
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 ""

# cd2802c13d3d4798934f9f60cc9ebfb9
#: ../../../src/astar/doc/index.rst:37
msgid "Description"
msgstr "Beschreibung"

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

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

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

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

# 4ddccc85290d4aba9b82668e90b2ba31
#: ../../../src/astar/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 ""

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

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

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

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

# 46b33f8b295043059fce210e43698191
#: ../../../src/astar/doc/index.rst:54
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 ""

# bfd63fe9d374441babb8662a0874482b
#: ../../../src/astar/doc/index.rst:56
msgid "``int4`` id of the start point"
msgstr ""

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

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

# 1a783bf8f88146999659f222ef236d1b
#: ../../../src/astar/doc/index.rst:59
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 ""

# c0f6cf1f1daf40bc8d08fa3b85c3af6b
#: ../../../src/astar/doc/index.rst:61
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

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

# 1f3ccd737354442fb4d87684690988a2
#: ../../../src/astar/doc/index.rst:64
msgid "node ID"
msgstr ""

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

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

# 9cc8b235e4214d4c87b729d24031271e
#: ../../../src/astar/doc/index.rst:70
msgid "History"
msgstr "Geschichte"

# 623c2a84d062407d93855875a467dbe1
#: ../../../src/astar/doc/index.rst:71
msgid "Renamed in version 2.0.0"
msgstr "Umbenannt in Version 2.0.0"

# 7f75da722e6e4680a8d9e0a3d69678b9
#: ../../../src/astar/doc/index.rst:75
msgid "Examples"
msgstr "Beispiele"

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

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

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

# 3f0ab007b6c24393bda58a4c8f051a6b
#: ../../../src/astar/doc/index.rst:121
msgid "See Also"
msgstr "Siehe auch"

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

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