# 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-08-04 04:23+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"

# c9937b945f654be08e4180e57b2723de
#: ../../../src/apsp_johnson/doc/index.rst:13
msgid "pgr_apspJohnson - All Pairs Shortest Path, Johnson's Algorithm"
msgstr ""

# 79936f3a71384a8a9148a3886df7a858
#: ../../../src/apsp_johnson/doc/index.rst:20
msgid "Name"
msgstr "Name"

# 3145d47e956649628986400ffdab56a5
#: ../../../src/apsp_johnson/doc/index.rst:22
msgid ""
"``pgr_apspJohnson`` - Returns all costs for each pair of nodes in the graph."
msgstr ""

# 24009fd27614418c9dee8d1d27eca209
#: ../../../src/apsp_johnson/doc/index.rst:26
msgid "Synopsis"
msgstr "Übersicht"

# 6aa48442c73548e58b708ec465f0993a
#: ../../../src/apsp_johnson/doc/index.rst:28
msgid ""
"Johnson's algorithm is a way to find the shortest paths between all pairs of"
" vertices in a sparse, edge weighted, directed graph. Returns a set of "
":ref:`pgr_costResult <type_cost_result>` (seq, id1, id2, cost) rows for "
"every pair of nodes in the graph."
msgstr ""

# afa92fc38dee48288d509f6006247df1
#: ../../../src/apsp_johnson/doc/index.rst:36
msgid "Description"
msgstr "Beschreibung"

# 1256fc43f6ad440689b650619604651c
#: ../../../src/apsp_johnson/doc/index.rst:38
msgid ""
"a SQL query that should return the edges for the graph that will be "
"analyzed:"
msgstr ""

# 3f908a1bbdd04eaa9bf33225e67da2c7
#: ../../../src/apsp_johnson/doc/index.rst:44
msgid "``int4`` identifier of the source vertex for this edge"
msgstr ""

# 993049755c48440a9bc398ea9a13fe95
#: ../../../src/apsp_johnson/doc/index.rst:45
msgid "``int4`` identifier of the target vertex for this edge"
msgstr ""

# 28aa6b13c7d54bbdb49c76098a8e4d8e
#: ../../../src/apsp_johnson/doc/index.rst:46
msgid "``float8`` a positive value for the cost to traverse this edge"
msgstr ""

# 7514070dfcd1415e8414754509baee32
#: ../../../src/apsp_johnson/doc/index.rst:48
msgid "Returns set of :ref:`type_cost_result`:"
msgstr ""

# 25408ce6cf3d45bebebd52768b102fc0
#: ../../../src/apsp_johnson/doc/index.rst:50
msgid "row sequence"
msgstr ""

# e4b9d28e22be4a78a2edc7edbf4f1af3
#: ../../../src/apsp_johnson/doc/index.rst:51
msgid "source node ID"
msgstr ""

# f4ef2869f447410dbdb75bf3856bfa93
#: ../../../src/apsp_johnson/doc/index.rst:52
msgid "target node ID"
msgstr ""

# 74d7b05838ba4c978e0c33f94ab0868f
#: ../../../src/apsp_johnson/doc/index.rst:53
msgid "cost to traverse from ``id1`` to ``id2``"
msgstr ""

# 1767087139fa47218a9eef54ebf0b0f1
#: ../../../src/apsp_johnson/doc/index.rst:56
msgid "History"
msgstr "Geschichte"

# 5bc1dae5c7f041298849cae876983c32
#: ../../../src/apsp_johnson/doc/index.rst:57
msgid "New in version 2.0.0"
msgstr "Neu in Version 2.0.0"

# b679c9ef11b544a6a6502b461b4e3d96
#: ../../../src/apsp_johnson/doc/index.rst:61
msgid "Examples"
msgstr "Beispiele"

# 5d6ef1673c204a229ed05dae0c96d0f8
#: ../../../src/apsp_johnson/doc/index.rst:78
msgid "The query uses the :ref:`sampledata` network."
msgstr ""

# 8ba7f2721fe74966b8dfd4620ae10b9a
#: ../../../src/apsp_johnson/doc/index.rst:82
msgid "See Also"
msgstr "Siehe auch"

# 475eb50687e74051895523e791434bc1
#: ../../../src/apsp_johnson/doc/index.rst:84
msgid ":ref:`type_cost_result`"
msgstr ""

# 75e0dd6fa0ed4621acf49893e637237c
#: ../../../src/apsp_johnson/doc/index.rst:85
msgid ":ref:`pgr_apsp_warshall`"
msgstr ""

# 0e63d6ba27244302bfd848164331ea09
#: ../../../src/apsp_johnson/doc/index.rst:86
msgid "http://en.wikipedia.org/wiki/Johnson%27s_algorithm"
msgstr ""
