# 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:
# cvvergara, 2013
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-20 14:14+0000\n"
"Last-Translator: Daniel Kastl\n"
"Language-Team: Japanese (http://www.transifex.com/projects/p/pgrouting/language/ja/)\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Language: ja\n"
"Plural-Forms: nplurals=1; plural=0;\n"

# 36e2253743a8455dbfbf75b26155205f
#: ../../../src/kdijkstra/doc/index.rst:13
msgid "pgr_kDijkstra - Mutliple destination Shortest Path Dijkstra"
msgstr ""

# 9f432bf1623d4a299d50ff492edbd66b
#: ../../../src/kdijkstra/doc/index.rst:21
msgid "Name"
msgstr "名前"

# 57c34a235f7a4cea8458d98a50a54e77
#: ../../../src/kdijkstra/doc/index.rst:23
msgid ""
"``pgr_kdijkstraCost`` - Returns the costs for K shortest paths using "
"Dijkstra algorithm."
msgstr ""

# ce7c4be9a502473591591e4d330d46e7
#: ../../../src/kdijkstra/doc/index.rst:24
msgid ""
"``pgr_kdijkstraPath`` - Returns the paths for K shortest paths using "
"Dijkstra algorithm."
msgstr ""

# 130c100b24ac47d4afd3b8ae17ea1335
#: ../../../src/kdijkstra/doc/index.rst:28
msgid "Synopsis"
msgstr "概要"

# 1b2f7dd687d84d76bbc57fc3ad8ed5ec
#: ../../../src/kdijkstra/doc/index.rst:30
msgid ""
"These functions allow you to have a single start node and multiple "
"destination nodes and will compute the routes to all the destinations from "
"the source node. Returns a set of :ref:`pgr_costResult3 <type_cost_result3>`"
" or :ref:`pgr_costResult3 <type_cost_result3>`. ``pgr_kdijkstraCost`` "
"returns one record for each destination node and the cost is the total code "
"of the route to that node. ``pgr_kdijkstraPath`` returns one record for "
"every edge in that path from source to destination and the cost is to "
"traverse that edge."
msgstr ""

# 06379d79c78b4c9bb92226bc66c58c3f
#: ../../../src/kdijkstra/doc/index.rst:42
msgid "Description"
msgstr "説明"

# 84671f541e384cf79360df9e260a5f52
#: ../../../src/kdijkstra/doc/index.rst:44
msgid ""
"a SQL query, which should return a set of rows with the following columns:"
msgstr "SQLのクエリーです。以下に続くカラムからなる行セットを返します:"

# adccb52524354a6c92d9d45edb967dc0
#: ../../../src/kdijkstra/doc/index.rst:51
msgid "``int4`` identifier of the edge"
msgstr "エッジの識別子[``int4``]"

# 5b2a072be67f471a8ab0c6b3daddcc48
#: ../../../src/kdijkstra/doc/index.rst:52
msgid "``int4`` identifier of the source vertex"
msgstr "``int4``型の始点ノードの識別子"

# d00470fb22ae4294a3cf56db3d064839
#: ../../../src/kdijkstra/doc/index.rst:53
msgid "``int4`` identifier of the target vertex"
msgstr "``int4``型の終点ノードの識別子"

# 4bdbc59e5d2d46ba94031caa56975d17
#: ../../../src/kdijkstra/doc/index.rst:54
msgid ""
"``float8`` value, of the edge traversal cost. A negative cost will prevent "
"the edge from being inserted in the graph."
msgstr "``float8``型のエッジにかかる重み。負の重みはエッジがグラフに挿入されることを防ぎます。"

# 569cecbec8e34fa9942c4bcf4ce0c6a4
#: ../../../src/kdijkstra/doc/index.rst:55
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 "(オプション) エッジの反対方向のコスト。この値は``directed``および``has_rcost``パラメータが``true``の場合のみ使用されます。(負のコストについては前述の通りです)"

# b3c8762d18e14a65b4d45ca5b654dabd
#: ../../../src/kdijkstra/doc/index.rst:57
msgid "``int4`` id of the start point"
msgstr "``int4``型の始点ノードのID"

# 552184e10f0940f09327b71d0a2a5293
#: ../../../src/kdijkstra/doc/index.rst:58
msgid "``int4[]`` an array of ids of the end points"
msgstr ""

# 6bee551c7fae494d9429ddf6404f457a
#: ../../../src/kdijkstra/doc/index.rst:59
msgid "``true`` if the graph is directed"
msgstr "有向グラフの場合は``true``を指定"

# c79e8fecdbb94d6f836a2fb692d24fea
#: ../../../src/kdijkstra/doc/index.rst:60
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 "``true``の場合、SQLで生成される行セットの``reverse_cost``カラムは、エッジの逆方向にかかる重みとして使用されます。"

# fe741d49c0f94473971ebcad7951456b
#: ../../../src/kdijkstra/doc/index.rst:63
msgid "``pgr_kdijkstraCost`` returns set of :ref:`type_cost_result`:"
msgstr ""

# 2325329e3ec24e3cbe4c347369b857a4
# 2ac53854f37a48a89b705310628c4d3e
#: ../../../src/kdijkstra/doc/index.rst:65
#: ../../../src/kdijkstra/doc/index.rst:73
msgid "row sequence"
msgstr "行の連番"

# 73cb6093021a456aace98c1f58641bef
#: ../../../src/kdijkstra/doc/index.rst:66
msgid ""
"path vertex source id (this will always be source start point in the query)."
msgstr ""

# 9afd4e01323945118421ebb27f420068
#: ../../../src/kdijkstra/doc/index.rst:67
msgid "path vertex target id"
msgstr ""

# 8b3c8fe211a147f4b031db8a8d899ddd
#: ../../../src/kdijkstra/doc/index.rst:68
msgid ""
"cost to traverse the path from ``id1`` to ``id2``. Cost will be -1.0 if "
"there is no path to that target vertex id."
msgstr ""

# 703a5ecca86b4ef4ba2c275d9ba8a20f
#: ../../../src/kdijkstra/doc/index.rst:71
msgid "``pgr_kdijkstraPath`` returns set of :ref:`type_cost_result3`:"
msgstr ""

# 7fc792793b7c4e65ba68cea3f25384aa
#: ../../../src/kdijkstra/doc/index.rst:74
msgid "path target id (identifies the target path)."
msgstr ""

# c43bcd54fee6435fbe6afd2ec4bb6d65
#: ../../../src/kdijkstra/doc/index.rst:75
msgid "path edge source node id"
msgstr ""

# a567112ee5584a46ac397cb9783627a8
#: ../../../src/kdijkstra/doc/index.rst:76
msgid "path edge id (``-1`` for the last row)"
msgstr ""

# 47af04f2ce09412f8475df30be9581ae
#: ../../../src/kdijkstra/doc/index.rst:77
msgid "cost to traverse this edge or -1.0 if there is no path to this target"
msgstr ""

# e7349c2020bc491aaa02b3eb1ebca791
#: ../../../src/kdijkstra/doc/index.rst:81
msgid "History"
msgstr "歴史"

# f7b3cf1f2e494a4c8697b712adcbd1fc
#: ../../../src/kdijkstra/doc/index.rst:82
msgid "New in version 2.0.0"
msgstr ""

# adf5de36019d4982b76cd696909168b0
#: ../../../src/kdijkstra/doc/index.rst:86
msgid "Examples"
msgstr "例"

# f332ab5afb39404284be98f0e9a2c8dc
#: ../../../src/kdijkstra/doc/index.rst:88
msgid "Returning a ``cost`` result"
msgstr ""

# cb5abec6a55e41a4a61c22fd3f461110
#: ../../../src/kdijkstra/doc/index.rst:123
msgid "Returning a ``path`` result"
msgstr ""

# d2e7b4076702425a9c6928a0cc4b997e
#: ../../../src/kdijkstra/doc/index.rst:144
msgid ""
"There is no assurance that the result above will be ordered in the direction"
" of flow of the route, ie: it might be reversed. You will need to check if "
"``st_startPoint()`` of the route is the same as the start node location and "
"if it is not then call ``st_reverse()`` to reverse the direction of the "
"route. This behavior is a function of PostGIS functions ``st_linemerge()`` "
"and ``st_union()`` and not pgRouting."
msgstr ""

# d6928031c7d047a5999f03c79c5bcfea
#: ../../../src/kdijkstra/doc/index.rst:153
msgid "See Also"
msgstr "参照"

# cd86a4612fe944acbe5a39daaf52dafd
#: ../../../src/kdijkstra/doc/index.rst:155
msgid ":ref:`type_cost_result`"
msgstr ":ref:`type_cost_result`"

# c2386bf8c6314521abe162d0bf548225
#: ../../../src/kdijkstra/doc/index.rst:156
msgid "http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
msgstr "http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
