# 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/apsp_johnson/doc/index.rst:13
# 88a2ec1d2eb44607a0dcec23c001f89f
msgid "pgr_apspJohnson - All Pairs Shortest Path, Johnson's Algorithm"
msgstr ""

#: ../../../src/apsp_johnson/doc/index.rst:20
# 2f8388c94505467cbaff2676afaa6256
msgid "Name"
msgstr ""

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

#: ../../../src/apsp_johnson/doc/index.rst:26
# 3618c952a36b4852a671f2f7b9a3ab14
msgid "Synopsis"
msgstr ""

#: ../../../src/apsp_johnson/doc/index.rst:28
# c277608a374e444c8d7e5c5034e03f73
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 ""

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

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

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

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

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

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

#: ../../../src/apsp_johnson/doc/index.rst:50
# 81c0db551a0f496ea7b9db840c8df97b
msgid "row sequence"
msgstr ""

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

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

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

#: ../../../src/apsp_johnson/doc/index.rst:56
# 760bf1e4ab2843dcb5b31cfdc927c722
msgid "History"
msgstr ""

#: ../../../src/apsp_johnson/doc/index.rst:57
# 63a884de17654ec6b1b2d13b172649b6
msgid "New in version 2.0.0"
msgstr ""

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

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

#: ../../../src/apsp_johnson/doc/index.rst:82
# be0394087e64497fb6149bab9d484a84
msgid "See Also"
msgstr ""

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

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

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

