pgRouting/pgRouting — Korean @ OSGeo Weblate: Result columns change:

Zen

	English	Korean	Actions
	When the start vertex and the end vertex are different, and there exists a path between them without having a negative cycle. The agg_cost would be some finite value denoting the shortest distance between them.
	When the start vertex and the end vertex are different, and there exists a path between them, but it contains a negative cycle. In such case, agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost can’t be defined for them.
	When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\infty`.
	For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored.
	Running time: :math:`O(\| start\_vids \| * ( V * E))`
	pgr_bellmanFord(`Edges SQL`_, start vid, end vid, [``directed``])
	pgr_bellmanFord(`Edges SQL`_, start vid, end vids, [``directed``])
	pgr_bellmanFord(`Edges SQL`_, start vids, end vid, [``directed``])
	pgr_bellmanFord(`Edges SQL`_, start vids, end vids, [``directed``])
	pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])
	From vertex :math:`6` to vertices :math:`\{ 10, 17\}` on a directed graph
	Using a combinations table on an undirected graph.
	https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
	``pgr_biconnectedComponents``
	``pgr_biconnectedComponents`` — Biconnected components of an undirected graph.
	Result columns change:	결과 컬럼
	``n_seq`` is removed
	``seq`` changed type to ``BIGINT``
	The biconnected components of an undirected graph are the maximal subsets of vertices such that the removal of a vertex from particular component will not disconnect the component. Unlike connected components, vertices may belong to multiple biconnected components. Vertices can be present in multiple biconnected components, but each edge can only be contained in a single biconnected component.
	Components are described by edges.
	``component`` ascending.
	``edge`` ascending.
	pgr_biconnectedComponents(`Edges SQL`_)
	Returns set of \|result-component-E\|
	The biconnected components of the graph
	``component``
	Component identifier.
	Has the value of the minimum edge identifier in the component.
	Identifier of the edge that belongs to the ``component``.
	Boost: `Biconnected components <https://www.boost.org/libs/graph/doc/biconnected_components.html>`__
	``pgr_binaryBreadthFirstSearch`` - Experimental

Loading…

anonymous

Suggestion added

English

Korean 9 characters edited

7 months ago

None

String updated in the repository

English

Korean 5 characters edited Current translation Needs editing

7 months ago

Browse all string changes

Things to check

Suggestions

There is 1 suggestion for this string.

View

Mismatched colon

Source and translation do not both end with a colon

Reset

Glossary

English	Korean
No related strings found in the glossary.

String information

String age

7 months ago

Last updated

7 months ago

Source string age

7 months ago

Translation file

locale/ko/LC_MESSAGES/pgrouting_doc_strings.po, string 2633