diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index 4654f97870..90098dd560 100644 --- a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po @@ -6,7 +6,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-12-10 19:55+0000\n" +"POT-Creation-Date: 2026-03-04 00:25+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Anonymous \n" "Language-Team: German \n" @@ -3521,9988 +3521,10051 @@ msgstr "" msgid ":doc:`release_notes`" msgstr "" -msgid "pgRouting 4.0" +msgid "pgRouting 4.1.0 Release Notes" msgstr "" -msgid "pgRouting 4.0.0-alpha1 Release Notes" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgid "Code enhancements" msgstr "" -msgid "Build" +msgid "`#3049 `__: Use enumeration on drivers and process." msgstr "" -msgid "C++ standard is std17" +msgid "`#3054 `__: Change error message when edges_sql is empty" msgstr "" -msgid "Using this standard, all supported toolchains across our CI matrix will work." +msgid "`#3055 `__: bdDijkstra: use the shortest_path process and driver" msgstr "" -msgid "The code is not yet modified to use std17:" +msgid "`#3056 `__: edwardMoore: use the shortest_path process and driver" msgstr "" -msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." +msgid "`#3060 `__: dagShortestPath: use the shortest_path process and driver" msgstr "" -msgid "The user's documentation is built by default." +msgid "`#3064 `__: Astar: create and use a process and driver for Astar" msgstr "" -msgid "The doxygen documentation is built by default." +msgid "`#3075 `__: Spanning tree: create and use a process and driver" msgstr "" -msgid "For developers:" +msgid "`#3086 `__: MaxFlow: create and use a process and driver" msgstr "" -msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." +msgid "`#3089 `__: edgeDisjoint and bellmanFord use shortestPath driver and process" msgstr "" -msgid "Tidy checks are done on CI." -msgstr "" - -msgid "Documentation build" +msgid "All releases" msgstr "" -msgid "The doxygen documentation is built by default" +msgid "Kruskal - Family of functions" msgstr "" -msgid "The HTML documentation is built by default" +msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." msgstr "" -msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" +msgid "**The main Characteristics are:**" msgstr "" -msgid "`WITH-DOC` is not used anymore" +msgid "The total weight of all the edges in the tree or forest is minimized." msgstr "" -msgid "User Documentation is not built when" +msgid "Kruskal's running time: :math:`O(E * log E)`" msgstr "" -msgid "Sphinx is not found" +msgid "Metrics - Family of functions" msgstr "" -msgid "When all Sphinx formats are OFF" +msgid "Migration guide" msgstr "" -msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." msgstr "" -msgid "When all languages are OFF" +msgid "Results can be different because of the changes." msgstr "" -msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" +msgid "All deprecated functions will be removed on next major version 4.0.0" msgstr "" -msgid "Documentation output location: ``build/doc/_build/``" +msgid "Migration to standardized columns" msgstr "" -msgid "For example: for HTML output is on `build/doc/_build/html` directory" +msgid "There has been an effort to standardize function output columns names and types." msgstr "" -msgid "Developers' Documentation is not built when" -msgstr "" +msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgid "Doxygen is not found" +msgid "|matrix-result|" msgstr "" -msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" -msgstr "" +msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgid "Summary of changes by function" +msgid "|short-generic-result|" msgstr "" -msgid "pgr_aStar" -msgstr "pgr_aStar" +msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgid "Combinations signature promoted to official." +msgid "|result-spantree|" msgstr "" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" - -msgid "pgr_bandwidth" -msgstr "pgr_bandwidth" - -msgid "New experimental function." +msgid "Function" msgstr "" -msgid "pgr_bdAstar" -msgstr "pgr_bdAstar" - -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" - -msgid "pgr_bdDijkstra" -msgstr "pgr_bdDijkstra" - -msgid "Output columns standardized to |short-generic-result|" +msgid ":doc:`pgr_dijkstra`" msgstr "" -msgid "pgr_bdDijkstraCost" -msgstr "pgr_bdDijkstraCost" - -msgid "pgr_bellmanFord" -msgstr "pgr_bellmanFord" - -msgid "pgr_binaryBreadthFirstSearch" -msgstr "pgr_binaryBreadthFirstSearch" - -msgid "pgr_bipartite" -msgstr "pgr_bipartite" - -msgid "Output columns standardized to |result_node_color|" +msgid "`Migration of single path functions`_" msgstr "" -msgid "pgr_boykovKolmogorov" -msgstr "pgr_boykovKolmogorov" - -msgid "pgr_breadthFirstSearch" -msgstr "pgr_breadthFirstSearch" - -msgid ":" +msgid ":doc:`pgr_aStar`" msgstr "" -msgid "Standardizing output columns to |result-spantree|" +msgid ":doc:`pgr_bdAstar`" msgstr "" -msgid "pgr_contraction" -msgstr "pgr_contraction" - -msgid "Breaking change, signatures no longer available:" +msgid ":doc:`pgr_drivingDistance`" msgstr "" -msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`Migration of spanning tree functions`_" msgstr "" -msgid "pgr_dagShortestPath" -msgstr "pgr_dagShortestPath" - -msgid "pgr_depthFirstSearch" -msgstr "pgr_depthFirstSearch" - -msgid "pgr_dijkstra" -msgstr "pgr_dijkstra" - -msgid "pgr_dijkstraCost" -msgstr "pgr_dijkstraCost" - -msgid "pgr_dijkstraNear" -msgstr "pgr_dijkstraNear" - -msgid "Function promoted to official." +msgid ":doc:`pgr_withPointsDD`" msgstr "" -msgid "pgr_dijkstraNearCost" -msgstr "pgr_dijkstraNearCost" - -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" - -msgid "Output columns standardized to |result_edge_color|" +msgid ":doc:`pgr_bdDijkstra`" msgstr "" -msgid "pgr_edgeDisjointPaths" -msgstr "pgr_edgeDisjointPaths" - -msgid "Output columns standardized to |generic-result|" +msgid ":doc:`pgr_binaryBreadthFirstSearch`" msgstr "" -msgid "pgr_edmondsKarp" -msgstr "pgr_edmondsKarp" - -msgid "pgr_edwardMoore" -msgstr "pgr_edwardMoore" - -msgid "Version 3.2.0" +msgid ":doc:`pgr_bipartite`" msgstr "" -msgid "New experimental signature:" +msgid "`Migration of output column name change`_" msgstr "" -msgid "pgr_edwardMoore(Combinations)" +msgid ":doc:`pgr_breadthFirstSearch`" msgstr "" -msgid "Version 3.0.0" +msgid ":doc:`pgr_depthFirstSearch`" msgstr "" -msgid "pgr_kingOrdering" -msgstr "pgr_kingOrdering" - -msgid "pgr_KSP" -msgstr "pgr_KSP" - -msgid "All signatures promoted to official." +msgid ":doc:`pgr_edgeColoring`" msgstr "" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid "`Migration of multiple paths functions`_" +msgstr "" -msgid "pgr_maxCardinalityMatch(text,boolean)" +msgid ":doc:`pgr_sequentialVertexColoring`" msgstr "" -msgid "pgr_maxFlow" -msgstr "pgr_maxFlow" +msgid ":doc:`pgr_topologicalSort`" +msgstr "" -msgid "pgr_pushRelabel" -msgstr "pgr_pushRelabel" +msgid ":doc:`pgr_withPoints`" +msgstr "" -msgid "pgr_sequentialVertexColoring" -msgstr "pgr_sequentialVertexColoring" +msgid "`Migration of cost functions`_" +msgstr "" -msgid "pgr_sloanOrdering" -msgstr "pgr_sloanOrdering" +msgid "Migration of cost functions" +msgstr "" -msgid "pgr_topologicalSort" -msgstr "pgr_topologicalSort" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgstr "" -msgid "Standardize output to |result_node_order|" +msgid "The following functions need to be migrated when they are being used in an application." msgstr "" -msgid "pgr_transitiveClosure" -msgstr "pgr_transitiveClosure" +msgid "Version" +msgstr "" -msgid "Standardized output to |result-closure|" +msgid "From" msgstr "" -msgid "pgr_trsp" -msgstr "pgr_trsp" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "v < 4.0" msgstr "" -msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "|matrix-pid|" msgstr "" -msgid "pgr_trspVia" -msgstr "pgr_trspVia" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgid "**to** |matrix-result|" msgstr "" -msgid "pgr_trspVia_withPoints" +msgid "Migration of |matrix-pid|" msgstr "" -msgid "**Driving side** parameter is positional unnamed." +msgid "Signatures to be migrated:" msgstr "" -msgid "Valid values depend on kind of graph" +msgid "One to One" msgstr "" -msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "One to Many" msgstr "" -msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "Many to One" msgstr "" -msgid "pgr_trsp_withPoints" +msgid "Many to Many" msgstr "" -msgid "**Driving side** parameter is positional unnamed and compulsory." +msgid "Combinations" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Breaking change" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "New output columns are |matrix-result|" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgid "Examples" msgstr "" -msgid "pgr_TSP" -msgstr "pgr_TSP" - -msgid "Results change depending on input order" +msgid "Examples for One to One for cost functions" msgstr "" -msgid "Only for undirected graphs" +msgid "Using ``pgr_withPointsCost``" msgstr "" -msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_TSPeuclidean" -msgstr "pgr_TSPeuclidean" - -msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgid "from" msgstr "" -msgid "pgr_turnRestrictedPath" -msgstr "pgr_turnRestrictedPath" - -msgid "Output columns standardized to |nksp-result|" +msgid "to" msgstr "" -msgid "pgr_withPoints" -msgstr "pgr_withPoints" - -msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Examples for One to Many for cost functions" msgstr "" -msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Examples for Many to One for cost functions" msgstr "" -msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" +msgid "Examples for Many to Many for cost functions" msgstr "" -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" - -msgid "**Driving side** parameter is unnamed and compulsory." +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "Output columns standardized to |matrix-result|" +msgid "Examples for Combinations for cost functions" msgstr "" -msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgid "Migration of multiple paths functions" msgstr "" -msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "" -msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgstr "" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" -msgid "pgr_withpointscost(text,text,text,boolean,character)" +msgid "v < 3.6" msgstr "" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" +msgid ":ref:`from_ksp_result`" +msgstr ":ref:`from_ksp_result`" -msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgstr "" +msgid "``pgr_edgeDisjointPaths``" +msgstr "``pgr_edgeDisjointPaths``" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" +msgid ":ref:`from_result_disjoint`" +msgstr ":ref:`from_result_disjoint`" -msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Migration of |ksp-result|" msgstr "" -msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "|nksp-result|" msgstr "" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" - -msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "Before updating pgRouting, enumerate the |ksp-result|" msgstr "" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - -msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "Functions promoted to official" +msgid "Using `this `__ example." msgstr "" -msgid "`#2701 `__: pgr_trsp" +msgid "Migration of |result-disjoint|" msgstr "" -msgid "`#2701 `__: pgr_trspVia" +msgid "Before updating pgRouting, enumerate the |result-disjoint|" msgstr "" -msgid "`#2701 `__: pgr_trspVia_withPoints" +msgid "Skip when applicable, ``start_vid``" msgstr "" -msgid "`#2701 `__: pgr_trsp_withPoints" +msgid "Skip when applicable, ``end_vid``" msgstr "" -msgid "`#2700 `__: pgr_withPoints" +msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr "" -msgid "`#2700 `__: pgr_withPointsCost" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgid "Before updating pgRouting enumerate the columns: |ksp-result|" msgstr "" -msgid "`#2700 `__: pgr_withPointsDD" +msgid "Migration of single path functions" msgstr "" -msgid "`#2700 `__: pgr_withPointsKSP" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "" -msgid "`#2700 `__: pgr_withPointsVia" -msgstr "" +msgid "``pgr_dijkstra``" +msgstr "``pgr_dijkstra``" -msgid "`#2983 `__: pgr_dijkstraNear" +msgid "v < 3.5" msgstr "" -msgid "`#2983 `__: pgr_dijkstraNearCost" +msgid "|old-generic-result|" msgstr "" -msgid "`#2983 `__: pgr_dijkstraVia" +msgid "``pgr_aStar``" +msgstr "``pgr_aStar``" + +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" + +msgid "``pgr_bellmanFord``" +msgstr "``pgr_bellmanFord``" + +msgid "``pgr_dagShortestPath``" +msgstr "``pgr_dagShortestPath``" + +msgid "|result-1-1|" msgstr "" -msgid "Signatures promoted to official" +msgid "``pgr_edwardMoore``" +msgstr "``pgr_edwardMoore``" + +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" + +msgid "|old-pid-result|" msgstr "" -msgid "`#2718 `__: pgr_aStar(Combinations)" +msgid "Migration of |old-generic-result|" msgstr "" -msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" -msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgid "Migration of |old-pid-result|" msgstr "" -msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgid "To get the old version column names, depending on the signature:" msgstr "" -msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" +msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" msgstr "" -msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgid "Rename the columns:" msgstr "" -msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgid "``start_vid`` to ``start_pid``" msgstr "" -msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgid "``end_vid`` to ``end_pid``" msgstr "" -msgid "`#2718 `__: pgr_KSP(All signatures)" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" -msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" +msgid "Migration of |result-1-1|" msgstr "" -msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgid "To get the old version column names:" msgstr "" -msgid "`#2718 `__: pgr_maxFlow(Combinations)" +msgid "Filter out the columns: ``start_vid`` and ``end_vid``" msgstr "" -msgid "`#2718 `__: pgr_pushRelabel(Combinations)" +msgid "Examples with One to One with one route result" msgstr "" -msgid "New experimental functions." +msgid "Using ``pgr_aStar``" msgstr "" -msgid "Metrics" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2951 `__: pgr_bandwidth" +msgid "Before updating pgRouting enumerate the columns: |result-1-1|" msgstr "" -msgid "Ordering" +msgid "Using ``pgr_bdDijkstra``" msgstr "" -msgid "`#2954 `__: pgr_kingOrdering" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2955 `__: pgr_sloanOrdering" +msgid "Using ``pgr_DAGshortestPath``" msgstr "" -msgid "SQL signatures and output standardization" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2904 `__: Standardize output columns of functions with different output" +msgid "This applies to all signatures of ``pgr_DAGshortestPath``" msgstr "" -msgid "columns within overloads" +msgid "Examples for One to Many with one route result" msgstr "" -msgid "Standardized to |short-generic-result|" +msgid "Using ``pgr_bdAstar``" msgstr "" -msgid "`#2905 `__: pgr_withPoints" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2906 `__: pgr_bdDijkstra" +msgid "Before updating pgRouting enumerate the columns: |result-1-m|" msgstr "" -msgid "`#2907 `__: pgr_bellmanFord" +msgid "Using ``pgr_withPoints``" msgstr "" -msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2910 `__: pgr_edwardMoore" +msgid "|pid-1-m|" msgstr "" -msgid "`#2913 `__: pgr_dagShortestPath" +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." msgstr "" -msgid "Standardized to |matrix-result|" +msgid "Examples for Many to One with one route result" msgstr "" -msgid "`#2905 `__: pgr_withPointsCost" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgid "Before updating pgRouting enumerate the columns: |result-m-1|" msgstr "" -msgid "Standardized to |generic-result|" +msgid "Using ``pgr_dijkstra``" msgstr "" -msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgid "Migrating `this v3.4 `__ example." msgstr "" -msgid "`#2909 `__: pgr_turnRestrictedPath" +msgid "Examples for Many to Many with one route result" msgstr "" -msgid "Standardized to |result_edge_color|" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2924 `__: pgr_edgeColoring" +msgid "|pid-m-m|" msgstr "" -msgid "Standardized to |result_node_color|" +msgid "Examples for combinations with one route result" msgstr "" -msgid "`#2924 `__: pgr_bipartite" +msgid "Migrating `this v3.8 `this `__ example." msgstr "" -msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgid "Migration of spanning tree functions" msgstr "" -msgid "Standardized to |result-spantree|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" -msgid "`#2931 `__: pgr_breadthFirstSearch" -msgstr "" +msgid "``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" + +msgid ":ref:`from_result_dij_dd`" +msgstr ":ref:`from_result_dij_dd`" -msgid "`#2931 `__: pgr_depthFirstSearch" -msgstr "" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" -msgid "Standardized to |result_node_order|" -msgstr "" +msgid ":ref:`from_result_generic_no_seq`" +msgstr ":ref:`from_result_generic_no_seq`" -msgid "`#2934 `__: pgr_topologicalSort" -msgstr "" +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" -msgid "Standardized to |result-closure|" +msgid "v < 3.7" msgstr "" -msgid "`#2934 `__: pgr_transitiveClosure" -msgstr "" +msgid ":ref:`from_result_bfs`" +msgstr ":ref:`from_result_bfs`" -msgid "Removal of SQL deprecated signatures" -msgstr "" +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" -msgid "`#2798 `__: pgr_contraction" -msgstr "" +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" -msgid "`#2683 `__: pgr_trsp" -msgstr "" +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" -msgid "`#2683 `__: pgr_trspVia" -msgstr "" +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" -msgid "`#2888 `__: pgr_findCloseEdges" -msgstr "" +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" -msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "" +msgid "``pgr_breadthFisrtSearch``" +msgstr "``pgr_breadthFisrtSearch``" -msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "v < 4.0.0" msgstr "" -msgid "`#2890 `__: pgr_withPointsDD" -msgstr "" +msgid "``pgr_depthFisrtSearch``" +msgstr "``pgr_depthFisrtSearch``" -msgid "`#2895 `__: pgr_withPointsKSP" +msgid "to |result-spantree|" msgstr "" -msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgid "Migration from |result-bfs|." msgstr "" -msgid "`#2901 `__: pgr_TSP" +msgid "Single vertex" msgstr "" -msgid "`#2901 `__: pgr_TSPeuclidean" +msgid "Multiple vertices" msgstr "" -msgid "Removal of SQL deprecated functions" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|" msgstr "" -msgid "`#2681 `__: pgr_trspViaedges" +msgid "Single vertex example using ``pgr_kruskalDD``" msgstr "" -msgid "`#2682 `__: pgr_trspViaVertices" +msgid "Migrating `this v3.6 `__ example." msgstr "" -msgid "`#2748 `__: pgr_alphaShape" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|." msgstr "" -msgid "`#2751 `__: pgr_createTopology" +msgid "Multiple vertices example using ``pgr_kruskalDFS``" msgstr "" -msgid "`#2752 `__: pgr_analyzeGraph" +msgid "Migrating `this v3.6 `__ example." msgstr "" -msgid "`#2755 `__: pgr_analyzeOneWay" +msgid "Migration from |result-dij-dd|" msgstr "" -msgid "`#2827 `__: pgr_createVerticesTable" +msgid "Migration depends on the signature." msgstr "" -msgid "`#2886 `__: pgr_nodeNetwork" +msgid "For single vertex:" msgstr "" -msgid "Removal of SQL deprecated internal functions" +msgid "Before updating pgRouting, enumerate |result-1-1| columns" msgstr "" -msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgid "For multiple vertices:" msgstr "" -msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgid "Changes must be done after updating pgRouting." msgstr "" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgid "To get the old version column names |result-dij-dd-m|:" msgstr "" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgid "filter out the column ``pred`` and ``depth`` and" msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "rename ``start_vid`` to ``from_v``." msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "Single vertex example using ``pgr_drivingDistance``" msgstr "" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "Migration of |result-generic-no-seq|" msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "After updating pgRouting:" msgstr "" -msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "Enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "`#2861 `__ _pgr_endPoint(geometry)" +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." msgstr "" -msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgid "Enumerate |result-m-1-no-seq| columns" msgstr "" -msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgid "Default value of **driving side** parameter" msgstr "" -msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "" -msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" msgstr "" -msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgid "Default value = 'r';" msgstr "" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgid "In undirected graph: valid values are [``b``, ``B``]" msgstr "" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "Default value = 'b';" msgstr "" -msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgid "Single vertex example using ``pgr_withPointsDD``" msgstr "" -msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "Multiple vertices example using ``pgr_withPointsDD``" msgstr "" -msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" +msgid "Migration of output column name change" msgstr "" -msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgid "The standardized result columns:" msgstr "" -msgid "`#2861 `__ _pgr_msg(integer,text,text)" +msgid "|result_edge_color|" msgstr "" -msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" +msgid "|result_node_color|" msgstr "" -msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" +msgid "|result_node_order|" msgstr "" -msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" +msgid "Changes on column names must be done after updating pgRouting." msgstr "" -msgid "`#2861 `__ _pgr_quote_ident(text)" -msgstr "" +msgid "``pgr_edgeColoring``" +msgstr "``pgr_edgeColoring``" -msgid "`#2861 `__ _pgr_startPoint(geometry)" -msgstr "" +msgid ":ref:`from_old_edge_color`" +msgstr ":ref:`from_old_edge_color`" -msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "" +msgid "``pgr_bipartite``" +msgstr "``pgr_bipartite``" -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "" +msgid ":ref:`from_old_node_color`" +msgstr ":ref:`from_old_node_color`" -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "" +msgid "``pgr_sequentialVertexColoring``" +msgstr "``pgr_sequentialVertexColoring``" -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "" +msgid "``pgr_topologicalSort``" +msgstr "``pgr_topologicalSort``" -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "" +msgid ":ref:`from_toposort`" +msgstr ":ref:`from_toposort`" -msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgstr "" +msgid "``pgr_transitiveClosure``" +msgstr "``pgr_transitiveClosure``" -msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "" +msgid ":ref:`from_old_closure`" +msgstr ":ref:`from_old_closure`" -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Migration from |result-old-closure|" msgstr "" -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "Migration to: |result-old-closure|" msgstr "" -msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "After update:" msgstr "" -msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Remove column ``seq``" msgstr "" -msgid "`#2861 `__ _pgr_versionLess(text,text)" +msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" msgstr "" -msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Migration from |result-toposort|" msgstr "" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgid "Migration to: |result_node_order|" msgstr "" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "Rename ``sorted_v`` to ``node``" msgstr "" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgid "Migration from |old-edge-color|" msgstr "" -msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "Migration to: |result_edge_color|" msgstr "" -msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." msgstr "" -msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgid "Migration from |old-node-color|" msgstr "" -msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgid "Migration to: |result_node_color|" msgstr "" -msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." msgstr "" -msgid "Summary of functions and signatures no longer on pgrouting" +msgid "Migration of deleted functions" msgstr "" -msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgid "Functions no longer on pgRouting" msgstr "" -msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "Migration of ``pgr_alphaShape``" msgstr "" -msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "Deprecated" msgstr "" -msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`v3.8.0 `__" msgstr "" -msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "Removed" msgstr "" -msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgid "`v4.0.0 `__" msgstr "" -msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "**Before Deprecation:** The following was calculated:" msgstr "" -msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "An alphaShape was calculated" msgstr "" -msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgid "**After Deprecation:**" msgstr "" -msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "PostGIS has two ways of generating alphaShape." msgstr "" -msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "If you have SFCGAL, which you can install using" msgstr "" -msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" -msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" msgstr "" -msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "Other PostGIS options are" msgstr "" -msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "`ST_ConvexHull `__" msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "`ST_ConcaveHull `__" msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Migration of ``pgr_nodeNetwork``" msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "**Migration**" msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" msgstr "" -msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Migration of ``pgr_createTopology``" msgstr "" -msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "A table with `_vertices_pgr` was created." msgstr "" -msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgid "**After Deprecation:** The user is responsible to create the complete topology." msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgid "Build a routing topology" msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." msgstr "" -msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" msgstr "" -msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." msgstr "" -msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Migration of ``pgr_createVerticesTable``" msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Migration of ``pgr_analyzeOneWay``" msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "Number of potential problems in directionality" msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "WHERE" msgstr "" -msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Directionality problems were calculated based on codes." msgstr "" -msgid "Code enhancements" +msgid "Dead ends." msgstr "" -msgid "Removal of unused C/C++ code" +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" msgstr "" -msgid "Refactor the Script to build the update PostgreSQL file." +msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." msgstr "" -msgid "One process & driver for:" +msgid "In this example :doc:`pgr_extractVertices` has already been applied." msgstr "" -msgid "allpairs: johnson and Floyd-Warshall" +msgid "Bridges." msgstr "" -msgid "Shortest path: Dijkstra and withPoints using Dijkstra" +msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." msgstr "" -msgid "Deprecation of internal C/C++ functions" +msgid "To determine if the bridges are or not one way." msgstr "" -msgid "Deprecated functions are substituted by new function." +msgid "Migration of ``pgr_analyzeGraph``" msgstr "" -msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" +msgid "Number of isolated segments." msgstr "" -msgid "_pgr_withPointsDD => _pgr_withPointsddv4" +msgid "Number of dead ends." msgstr "" -msgid "_pgr_kruskal => _pgr_kruskalv4" +msgid "Number of potential gaps found near dead ends." msgstr "" -msgid "_pgr_prim => _pgr_primv4" +msgid "Number of intersections. (between 2 edges)" msgstr "" -msgid "_pgr_dijkstra => _pgr_dijkstra_v4" +msgid "Graph component" msgstr "" -msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" +msgid "A connected subgraph that is not part of any larger connected subgraph." msgstr "" -msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgid "Isolated segment" msgstr "" -msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" +msgid "A graph component with only one segment." msgstr "" -msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" +msgid "Dead ends" msgstr "" -msgid "Internal C/C++ functions in legacy" +msgid "A vertex that participates in only one edge." msgstr "" -msgid "`#2683 `__ _trsp" +msgid "gaps" msgstr "" -msgid "`#2683 `__ _v4trsp" +msgid "Space between two geometries." msgstr "" -msgid "`#2748 `__ _pgr_alphaShape" +msgid "Intersection" msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath" +msgid "Is a topological relationship between two geometries." msgstr "" -msgid "All releases" +msgid "Migration." msgstr "" -msgid "Kruskal - Family of functions" +msgid "Components." msgstr "" -msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgid "Instead of counting only isolated segments, determine all the components of the graph." msgstr "" -msgid "**The main Characteristics are:**" +msgid "Depending of the final application requirements use:" msgstr "" -msgid "The total weight of all the edges in the tree or forest is minimized." +msgid ":doc:`pgr_connectedComponents`" msgstr "" -msgid "Kruskal's running time: :math:`O(E * log E)`" +msgid ":doc:`pgr_strongComponents`" msgstr "" -msgid "Metrics - Family of functions" +msgid ":doc:`pgr_biconnectedComponents`" msgstr "" -msgid "Migration guide" +msgid "For example:" msgstr "" -msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." msgstr "" -msgid "Results can be different because of the changes." +msgid "Potential gaps near dead ends." msgstr "" -msgid "All deprecated functions will be removed on next major version 4.0.0" +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" -msgid "Migration to standardized columns" +msgid "Topological relationships." msgstr "" -msgid "There has been an effort to standardize function output columns names and types." +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "" -msgid "|matrix-result|" +msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgid "Signature:" +msgstr "" -msgid "|short-generic-result|" +msgid "`v3.4.0 `__" msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgid ":doc:`pgr_trsp`" +msgstr "" -msgid "|result-spantree|" +msgid "`Migration of restrictions`_" msgstr "" -msgid "Function" +msgid "Use ``pgr_dijkstra`` when there are no restrictions." msgstr "" -msgid ":doc:`pgr_dijkstra`" +msgid "Use :doc:`pgr_dijkstra` instead." msgstr "" -msgid "`Migration of single path functions`_" +msgid "To get the original column names:" msgstr "" -msgid ":doc:`pgr_aStar`" +msgid "``id1`` is the node" msgstr "" -msgid ":doc:`pgr_bdAstar`" +msgid "``id2`` is the edge" msgstr "" -msgid ":doc:`pgr_drivingDistance`" +msgid "Use ``pgr_trsp`` when there are restrictions." msgstr "" -msgid "`Migration of spanning tree functions`_" +msgid "Use :doc:`pgr_trsp` (One to One) instead." msgstr "" -msgid ":doc:`pgr_withPointsDD`" +msgid "Migration of ``pgr_trsp`` (Edges)" msgstr "" -msgid ":doc:`pgr_bdDijkstra`" +msgid ":doc:`pgr_trsp_withPoints`" msgstr "" -msgid ":doc:`pgr_binaryBreadthFirstSearch`" +msgid "Migration of ``pgr_trspViaVertices``" msgstr "" -msgid ":doc:`pgr_bipartite`" +msgid ":doc:`pgr_dijkstraVia`" msgstr "" -msgid "`Migration of output column name change`_" +msgid ":doc:`pgr_trspVia`" msgstr "" -msgid ":doc:`pgr_breadthFirstSearch`" +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" msgstr "" -msgid ":doc:`pgr_depthFirstSearch`" +msgid "Use :doc:`pgr_dijkstraVia` instead." msgstr "" -msgid ":doc:`pgr_edgeColoring`" +msgid "``id1`` is the path identifier" msgstr "" -msgid "`Migration of multiple paths functions`_" +msgid "``id2`` is the node" msgstr "" -msgid ":doc:`pgr_sequentialVertexColoring`" +msgid "``id3`` is the edge" msgstr "" -msgid ":doc:`pgr_topologicalSort`" +msgid "Use ``pgr_trspVia`` when there are restrictions" msgstr "" -msgid ":doc:`pgr_withPoints`" +msgid "Use :doc:`pgr_trspVia` instead." msgstr "" -msgid "`Migration of cost functions`_" +msgid "Migration of ``pgr_trspViaEdges``" msgstr "" -msgid "Migration of cost functions" +msgid ":doc:`pgr_withPointsVia`" msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgid ":doc:`pgr_trspVia_withPoints`" msgstr "" -msgid "The following functions need to be migrated when they are being used in an application." +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" msgstr "" -msgid "Version" +msgid "Use :doc:`pgr_withPointsVia` instead." msgstr "" -msgid "From" +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" msgstr "" -msgid "``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" +msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgstr "" -msgid "v < 4.0" +msgid "Not yet classified migrations" msgstr "" -msgid "|matrix-pid|" +msgid "Migration of ``pgr_withPointsKSP``" msgstr "" -msgid "``pgr_withPointsCostMatrix``" -msgstr "``pgr_withPointsCostMatrix``" +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "" -msgid "**to** |matrix-result|" +msgid "|ksp-result|" msgstr "" -msgid "Migration of |matrix-pid|" +msgid "|generic-result|" msgstr "" -msgid "Signatures to be migrated:" +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." msgstr "" -msgid "One to One" +msgid "``pgr_withPointsKSP`` (`One to One`)" msgstr "" -msgid "One to Many" +msgid "Before Migration" msgstr "" -msgid "Many to One" +msgid "Output columns were |old-pid-result|" msgstr "" -msgid "Many to Many" +msgid "the columns ``start_vid`` and ``end_vid`` do not exist." msgstr "" -msgid "Combinations" +msgid "Migration" msgstr "" -msgid "Breaking change" +msgid "Be aware of the existence of the additional result Columns." msgstr "" -msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgid "New output columns are |generic-result|" msgstr "" -msgid "New output columns are |matrix-result|" +msgid "Using `this `__ example." msgstr "" -msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgid "``start_vid`` contains the **start vid** parameter value." msgstr "" -msgid "Examples" +msgid "``end_vid`` contains the **end vid** parameter value." msgstr "" -msgid "Examples for One to One for cost functions" +msgid "If needed filter out the additional columns, for example, to return the original columns:" msgstr "" -msgid "Using ``pgr_withPointsCost``" +msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Use :doc:`pgr_withPoints` (One to One) instead." msgstr "" -msgid "from" +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." msgstr "" -msgid "to" +msgid "Use :doc:`pgr_trsp_withPoints` instead." msgstr "" -msgid "Examples for One to Many for cost functions" +msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." msgstr "" -msgid "Examples for Many to One for cost functions" +msgid "Starting from `v3.4.0 `__" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Signature to be migrated:" msgstr "" -msgid "Examples for Many to Many for cost functions" +msgid "Migration is needed, because:" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Use ``cost`` and ``reverse_cost`` on the inner query" msgstr "" -msgid "Examples for Combinations for cost functions" +msgid "Results are ordered" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Works for undirected graphs." msgstr "" -msgid "Migration of multiple paths functions" +msgid "New signature" msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" +msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." msgstr "" -msgid "``pgr_KSP``" -msgstr "``pgr_KSP``" +msgid "The optional flag ``directed`` is removed." +msgstr "" -msgid "v < 3.6" +msgid "Before migration" msgstr "" -msgid ":ref:`from_ksp_result`" -msgstr ":ref:`from_ksp_result`" +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgstr "" -msgid "``pgr_edgeDisjointPaths``" -msgstr "``pgr_edgeDisjointPaths``" +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgstr "" -msgid ":ref:`from_result_disjoint`" -msgstr ":ref:`from_result_disjoint`" +msgid "The flag ``directed`` is ignored." +msgstr "" -msgid "Migration of |ksp-result|" +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." msgstr "" -msgid "|nksp-result|" +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." msgstr "" -msgid "Before updating pgRouting, enumerate the |ksp-result|" +msgid "Do not use the flag ``directed``." msgstr "" -msgid "One to One example using ``pgr_KSP``" +msgid "In the query returns only ``edge`` column." msgstr "" -msgid "Using `this `__ example." +msgid "Migration of restrictions" msgstr "" -msgid "Migration of |result-disjoint|" +msgid "The structure of the restrictions have changed:" msgstr "" -msgid "Before updating pgRouting, enumerate the |result-disjoint|" +msgid "Old restrictions structure" msgstr "" -msgid "Skip when applicable, ``start_vid``" +msgid "On the deprecated signatures:" msgstr "" -msgid "Skip when applicable, ``end_vid``" +msgid "Column ``rid`` is ignored" msgstr "" -msgid "One to One example using ``pgr_edgeDisjointPaths``" +msgid "``via_path``" +msgstr "``via_path``" + +msgid "Must be in reverse order." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Is of type ``TEXT``." msgstr "" -msgid "Before updating pgRouting enumerate the columns: |ksp-result|" +msgid "When more than one via edge must be separated with ``,``." msgstr "" -msgid "Migration of single path functions" +msgid "``target_id``" +msgstr "``target_id``" + +msgid "Is the last edge of the forbidden path." msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" +msgid "Is of type ``INTEGER``." msgstr "" -msgid "``pgr_dijkstra``" -msgstr "``pgr_dijkstra``" +msgid "``to_cost``" +msgstr "``to_cost``" -msgid "v < 3.5" +msgid "Is of type ``FLOAT``." msgstr "" -msgid "|old-generic-result|" +msgid "Creation of the old restrictions table" msgstr "" -msgid "``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "Old restrictions fill up" +msgstr "" -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "Old restrictions contents" +msgstr "" -msgid "``pgr_bellmanFord``" -msgstr "``pgr_bellmanFord``" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgstr "" -msgid "``pgr_dagShortestPath``" -msgstr "``pgr_dagShortestPath``" +msgid ":math:`3\\rightarrow5`" +msgstr "" -msgid "|result-1-1|" +msgid "is on column ``via_path`` in reverse order" msgstr "" -msgid "``pgr_edwardMoore``" -msgstr "``pgr_edwardMoore``" +msgid "is of type ``TEXT``" +msgstr "" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +msgid ":math:`9`" +msgstr "" -msgid "|old-pid-result|" +msgid "is on column ``target_id``" msgstr "" -msgid "Migration of |old-generic-result|" +msgid "is of type ``INTEGER``" msgstr "" -msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" +msgid "New restrictions structure" msgstr "" -msgid "Migration of |old-pid-result|" +msgid "Column ``id`` is ignored" msgstr "" -msgid "To get the old version column names, depending on the signature:" +msgid "Column ``path``" msgstr "" -msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" +msgid "Is of type ``ARRAY[ANY-INTEGER]``." msgstr "" -msgid "Rename the columns:" +msgid "Contains all the edges involved on the restriction." msgstr "" -msgid "``start_vid`` to ``start_pid``" +msgid "The array has the ordered edges of the restriction." msgstr "" -msgid "``end_vid`` to ``end_pid``" +msgid "Column ``cost``" msgstr "" -msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" +msgid "Is of type ``ANY-NUMERICAL``" msgstr "" -msgid "Migration of |result-1-1|" +msgid "The creation of the restrictions table" msgstr "" -msgid "To get the old version column names:" +msgid "Adding the restrictions" msgstr "" -msgid "Filter out the columns: ``start_vid`` and ``end_vid``" +msgid "Restrictions data" msgstr "" -msgid "Examples with One to One with one route result" +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." msgstr "" -msgid "Using ``pgr_aStar``" +msgid "By inspection the path is clear." msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "To transform the old restrictions table to the new restrictions structure," msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-1-1|" +msgid "Create a new table with the new restrictions structure." msgstr "" -msgid "Using ``pgr_bdDijkstra``" +msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." msgstr "" -msgid "Using ``pgr_DAGshortestPath``" +msgid "``_pgr_array_reverse``:" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Was created temporally for this migration" msgstr "" -msgid "This applies to all signatures of ``pgr_DAGshortestPath``" +msgid "Is not documented." msgstr "" -msgid "Examples for One to Many with one route result" +msgid "Will be removed on the next mayor version 4.0.0" msgstr "" -msgid "Using ``pgr_bdAstar``" +msgid "The migrated table contents:" msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid ":doc:`pgRouting-concepts`" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-1-m|" +msgid "Ordering - Family of functions" msgstr "" -msgid "Using ``pgr_withPoints``" +msgid "pgRouting Concepts" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" msgstr "" -msgid "|pid-1-m|" +msgid "Graphs" msgstr "" -msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" msgstr "" -msgid "Examples for Many to One with one route result" +msgid ":math:`V` is a set of vertices, also called nodes." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-m-1|" +msgid "There are different kinds of graphs:" msgstr "" -msgid "Using ``pgr_dijkstra``" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" msgstr "" -msgid "Migrating `this v3.4 `__ example." +msgid "Undirected simple graph" msgstr "" -msgid "Examples for Many to Many with one route result" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" msgstr "" -msgid "|pid-m-m|" +msgid "Directed simple graph" msgstr "" -msgid "Examples for combinations with one route result" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgstr "" -msgid "Migrating `this v3.8 `this `__ example." +msgid "Graphs:" msgstr "" -msgid "Migration of spanning tree functions" +msgid "Do not have geometries." msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." msgstr "" -msgid "``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" +msgid "In pgRouting there are several ways to represent a graph on the database:" +msgstr "" -msgid ":ref:`from_result_dij_dd`" -msgstr ":ref:`from_result_dij_dd`" +msgid "With ``cost``" +msgstr "" -msgid "``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "(``id``, ``source``, ``target``, ``cost``)" +msgstr "" -msgid ":ref:`from_result_generic_no_seq`" -msgstr ":ref:`from_result_generic_no_seq`" +msgid "With ``cost`` and ``reverse_cost``" +msgstr "" -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgstr "" -msgid "v < 3.7" +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." msgstr "" -msgid ":ref:`from_result_bfs`" -msgstr ":ref:`from_result_bfs`" +msgid "Identifier of a vertex." +msgstr "" -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" +msgid "Weight of the edge (``source``, ``target``):" +msgstr "" -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgstr "" -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" +msgid "``cost`` must exist in the query." +msgstr "" -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "" -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgstr "" -msgid "``pgr_breadthFisrtSearch``" -msgstr "``pgr_breadthFisrtSearch``" +msgid "Graph with ``cost``" +msgstr "" -msgid "v < 4.0.0" +msgid "The weighted directed graph, :math:`G_d(V,E)`:" msgstr "" -msgid "``pgr_depthFisrtSearch``" -msgstr "``pgr_depthFisrtSearch``" +msgid "Graph data is obtained with a query" +msgstr "" -msgid "to |result-spantree|" +msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" -msgid "Migration from |result-bfs|." +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgstr "" -msgid "Single vertex" +msgid "Edges where ``cost`` is non negative are part of the graph." msgstr "" -msgid "Multiple vertices" +msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|" +msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" -msgid "Single vertex example using ``pgr_kruskalDD``" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" -msgid "Migrating `this v3.6 `__ example." +msgid "For the following data:" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|." +msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." msgstr "" -msgid "Multiple vertices example using ``pgr_kruskalDFS``" +msgid "The data is representing the following graph:" msgstr "" -msgid "Migrating `this v3.6 `__ example." +msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "Migration from |result-dij-dd|" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" msgstr "" -msgid "Migration depends on the signature." +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." msgstr "" -msgid "For single vertex:" +msgid "Graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "Before updating pgRouting, enumerate |result-1-1| columns" +msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" msgstr "" -msgid "For multiple vertices:" +msgid "The set of edges :math:`E`:" msgstr "" -msgid "Changes must be done after updating pgRouting." +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" msgstr "" -msgid "To get the old version column names |result-dij-dd-m|:" +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." msgstr "" -msgid "filter out the column ``pred`` and ``depth`` and" +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." msgstr "" -msgid "rename ``start_vid`` to ``from_v``." +msgid "The set of vertices :math:`V`:" msgstr "" -msgid "Single vertex example using ``pgr_drivingDistance``" +msgid "In a directed graph both edges have directionality" msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" -msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" msgstr "" -msgid "Multiple vertices example using ``pgr_drivingDistance``" +msgid "Edges not part of the graph:" msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid ":math:`2` (:math:`1 \\rightarrow 3`)" msgstr "" -msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid ":math:`3` (:math:`3 \\rightarrow 2`)" msgstr "" -msgid "Migration of |result-generic-no-seq|" +msgid "In a directed graph both edges do not have directionality" msgstr "" -msgid "After updating pgRouting:" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "Enumerate |result-1-1-no-seq| columns" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" -msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgid "In terms of a directed graph is like having four edges:" msgstr "" -msgid "Enumerate |result-m-1-no-seq| columns" +msgid ":math:`source_i \\leftrightarrow target_i`" msgstr "" -msgid "Default value of **driving side** parameter" +msgid ":math:`target_i \\leftrightarrow source_i`" msgstr "" -msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." +msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" msgstr "" -msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" +msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" msgstr "" -msgid "Default value = 'r';" +msgid "Graphs without geometries" msgstr "" -msgid "In undirected graph: valid values are [``b``, ``B``]" +msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." msgstr "" -msgid "Default value = 'b';" +msgid "Wiki example" msgstr "" -msgid "Single vertex example using ``pgr_withPointsDD``" +msgid "Solve the example problem taken from `wikipedia `__):" msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." msgstr "" -msgid "Multiple vertices example using ``pgr_withPointsDD``" +msgid "Is an undirected graph." msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Although visually looks like to have geometries, the drawing is not to scale." msgstr "" -msgid "Migration of output column name change" +msgid "No geometries associated to the vertices or edges" msgstr "" -msgid "The standardized result columns:" +msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" msgstr "" -msgid "|result_edge_color|" +msgid "Has 9 edges:" msgstr "" -msgid "|result_node_color|" +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" msgstr "" -msgid "|result_node_order|" +msgid "The graph can be represented in many ways for example:" msgstr "" -msgid "Changes on column names must be done after updating pgRouting." +msgid "Prepare the database" msgstr "" -msgid "``pgr_edgeColoring``" -msgstr "``pgr_edgeColoring``" +msgid "Create a database for the example, access the database and install pgRouting: ::" +msgstr "" -msgid ":ref:`from_old_edge_color`" -msgstr ":ref:`from_old_edge_color`" +msgid "Create a table" +msgstr "" -msgid "``pgr_bipartite``" -msgstr "``pgr_bipartite``" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgstr "" -msgid ":ref:`from_old_node_color`" -msgstr ":ref:`from_old_node_color`" +msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgstr "" -msgid "``pgr_sequentialVertexColoring``" -msgstr "``pgr_sequentialVertexColoring``" +msgid "Using this table design for this example:" +msgstr "" -msgid "``pgr_topologicalSort``" -msgstr "``pgr_topologicalSort``" +msgid "Insert the data" +msgstr "" -msgid ":ref:`from_toposort`" -msgstr ":ref:`from_toposort`" +msgid "Find the shortest path" +msgstr "" -msgid "``pgr_transitiveClosure``" -msgstr "``pgr_transitiveClosure``" +msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgstr "" -msgid ":ref:`from_old_closure`" -msgstr ":ref:`from_old_closure`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "" -msgid "Migration from |result-old-closure|" +msgid "Vertex information" msgstr "" -msgid "Migration to: |result-old-closure|" +msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" msgstr "" -msgid "After update:" +msgid "Graphs with geometries" msgstr "" -msgid "Remove column ``seq``" +msgid "Create a routing Database" msgstr "" -msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" +msgid "The first step is to create a database and load pgRouting in the database." msgstr "" -msgid "Migration from |result-toposort|" +msgid "Typically create a database for each project." msgstr "" -msgid "Migration to: |result_node_order|" +msgid "Once having the database to work in, load your data and build the routing application in that database." msgstr "" -msgid "Rename ``sorted_v`` to ``node``" +msgid "Load Data" msgstr "" -msgid "Migration from |old-edge-color|" +msgid "There are several ways to load your data into pgRouting." msgstr "" -msgid "Migration to: |result_edge_color|" +msgid "Manually creating a database." msgstr "" -msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." +msgid "`Graphs without geometries`_" msgstr "" -msgid "Migration from |old-node-color|" +msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr "" -msgid "Migration to: |result_node_color|" +msgid "Using `osm2pgrouting `__" msgstr "" -msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." +msgid "There are various open source tools that can help, like:" msgstr "" -msgid "Migration of deleted functions" +msgid "shp2pgsql" msgstr "" -msgid "Functions no longer on pgRouting" +msgid "postgresql shapefile loader" msgstr "" -msgid "Migration of ``pgr_alphaShape``" +msgid "ogr2ogr" msgstr "" -msgid "Deprecated" +msgid "vector data conversion utility" msgstr "" -msgid "`v3.8.0 `__" +msgid "osm2pgsql" msgstr "" -msgid "Removed" +msgid "load OSM data into postgresql" msgstr "" -msgid "`v4.0.0 `__" +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." msgstr "" -msgid "**Before Deprecation:** The following was calculated:" +msgid "Breakup a segments on each segment-segment intersection" msgstr "" -msgid "An alphaShape was calculated" +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." msgstr "" -msgid "**After Deprecation:**" +msgid "Connect a disconnected graph." msgstr "" -msgid "PostGIS has two ways of generating alphaShape." +msgid "Create the complete graph topology" msgstr "" -msgid "If you have SFCGAL, which you can install using" +msgid "Create one or more graphs based on the application to be developed." msgstr "" -msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgid "Create a contracted graph for the high speed roads" msgstr "" -msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgid "Create graphs per state/country" msgstr "" -msgid "Other PostGIS options are" +msgid "In few words:" msgstr "" -msgid "`ST_ConvexHull `__" +msgid "Prepare the graph" msgstr "" -msgid "`ST_ConcaveHull `__" +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." msgstr "" -msgid "Migration of ``pgr_nodeNetwork``" +msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." msgstr "" -msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." msgstr "" -msgid "**Migration**" +msgid "The use of indexes on the database design in general:" msgstr "" -msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" +msgid "Have the geometries indexed." msgstr "" -msgid "Migration of ``pgr_createTopology``" +msgid "Have the identifiers columns indexed." msgstr "" -msgid "A table with `_vertices_pgr` was created." +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." msgstr "" -msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." msgstr "" -msgid "Build a routing topology" +msgid "Adjust costs" msgstr "" -msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." msgstr "" -msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." +msgid "Update costs to length of geometry" msgstr "" -msgid "When the data comes with geometries and there is no routing topology, then this step is needed." +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" msgstr "" -msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." +msgid ":math:`1` when the edge exists in the graph" msgstr "" -msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgid ":math:`-1` when the edge does not exist in the graph" msgstr "" -msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." +msgid "Using that information updating to the length of the geometries:" msgstr "" -msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgid "Which gives the following results:" msgstr "" -msgid "Migration of ``pgr_createVerticesTable``" +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." msgstr "" -msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgid "Returning to the original data:" msgstr "" -msgid "Migration of ``pgr_analyzeOneWay``" +msgid "Update costs based on codes" msgstr "" -msgid "Number of potential problems in directionality" +msgid "Other datasets, can have a column with values like" msgstr "" -msgid "WHERE" +msgid "``FT`` vehicle flow on the direction of the geometry" msgstr "" -msgid "Directionality problems were calculated based on codes." +msgid "``TF`` vehicle flow opposite of the direction of the geometry" msgstr "" -msgid "Dead ends." +msgid "``B`` vehicle flow on both directions" msgstr "" -msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgid "Preparing a code column for the example:" msgstr "" -msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." +msgid "Adjusting the costs based on the codes:" msgstr "" -msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgid "Check the Routing Topology" msgstr "" -msgid "Bridges." +msgid "There are lots of possible problems in a graph." msgstr "" -msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." +msgid "The data used may not have been designed with routing in mind." msgstr "" -msgid "To determine if the bridges are or not one way." +msgid "A graph has some very specific requirements." msgstr "" -msgid "Migration of ``pgr_analyzeGraph``" +msgid "The graph is disconnected." msgstr "" -msgid "Number of isolated segments." +msgid "There are unwanted intersections." msgstr "" -msgid "Number of dead ends." +msgid "The graph is too large and needs to be contracted." msgstr "" -msgid "Number of potential gaps found near dead ends." +msgid "A sub graph is needed for the application." msgstr "" -msgid "Number of intersections. (between 2 edges)" +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." msgstr "" -msgid "Graph component" +msgid "Crossing edges" msgstr "" -msgid "A connected subgraph that is not part of any larger connected subgraph." +msgid "To get the crossing edges:" msgstr "" -msgid "Isolated segment" +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." msgstr "" -msgid "A graph component with only one segment." +msgid "It might be incorrect, for example:" msgstr "" -msgid "Dead ends" +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "" -msgid "A vertex that participates in only one edge." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." msgstr "" -msgid "gaps" +msgid "When it is incorrect, it needs fixing:" msgstr "" -msgid "Space between two geometries." +msgid "For vehicles and pedestrians" msgstr "" -msgid "Intersection" +msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." msgstr "" -msgid "Is a topological relationship between two geometries." +msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" msgstr "" -msgid "Migration." +msgid "For very specific applications" msgstr "" -msgid "Components." +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." msgstr "" -msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgid "The data needs a local fix for the specific application." msgstr "" -msgid "Depending of the final application requirements use:" +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" -msgid ":doc:`pgr_connectedComponents`" +msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." msgstr "" -msgid ":doc:`pgr_strongComponents`" +msgid "Fixing an intersection" msgstr "" -msgid ":doc:`pgr_biconnectedComponents`" +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "" -msgid "For example:" +msgid "An example use without results" msgstr "" -msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgid "Routing from :math:`1` to :math:`18` gives no solution." msgstr "" -msgid "Potential gaps near dead ends." +msgid "Analyze the network for intersections." msgstr "" -msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "The analysis tell us that the network has an intersection." msgstr "" -msgid "Topological relationships." +msgid "Prepare tables" msgstr "" -msgid "Instead of counting intersections, determine topological relationships between geometries." +msgid "Additional columns to control the origin of the segments." msgstr "" -msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Adding new segments." msgstr "" -msgid "Migration of ``pgr_trsp`` (Vertices)" +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "" -msgid "Signature:" +msgid "Update other values" msgstr "" -msgid "`v3.4.0 `__" +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." msgstr "" -msgid ":doc:`pgr_trsp`" +msgid "Update the topology" msgstr "" -msgid "`Migration of restrictions`_" +msgid "Insert the new vertices if any." msgstr "" -msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgid "Update source and target information on the edges table." msgstr "" -msgid "Use :doc:`pgr_dijkstra` instead." +msgid "The example has results" msgstr "" -msgid "To get the original column names:" +msgid "Routing from :math:`1` to :math:`18` gives a solution." msgstr "" -msgid "``id1`` is the node" +msgid "Touching edges" msgstr "" -msgid "``id2`` is the edge" +msgid "Visually the edges seem to be connected, but internally they are not." msgstr "" -msgid "Use ``pgr_trsp`` when there are restrictions." +msgid "The validity of the information is application dependent." msgstr "" -msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" -msgid "Migration of ``pgr_trsp`` (Edges)" +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" -msgid ":doc:`pgr_trsp_withPoints`" +msgid "Fixing a gap" msgstr "" -msgid "Migration of ``pgr_trspViaVertices``" +msgid "Routing from :math:`1` to :math:`2` gives no solution." msgstr "" -msgid ":doc:`pgr_dijkstraVia`" +msgid "Analyze the network for gaps." msgstr "" -msgid ":doc:`pgr_trspVia`" +msgid "The analysis tell us that the network has a gap." msgstr "" -msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" -msgid "Use :doc:`pgr_dijkstraVia` instead." +msgid "Routing from :math:`1` to :math:`2` gives a solution." msgstr "" -msgid "``id1`` is the path identifier" +msgid "Connecting components" msgstr "" -msgid "``id2`` is the node" +msgid "To get the graph connectivity:" msgstr "" -msgid "``id3`` is the edge" +msgid "There are three basic ways to connect components:" msgstr "" -msgid "Use ``pgr_trspVia`` when there are restrictions" +msgid "From the vertex to the starting point of the edge" msgstr "" -msgid "Use :doc:`pgr_trspVia` instead." +msgid "From the vertex to the ending point of the edge" msgstr "" -msgid "Migration of ``pgr_trspViaEdges``" +msgid "From the vertex to the closest vertex on the edge" msgstr "" -msgid ":doc:`pgr_withPointsVia`" +msgid "This solution requires the edge to be split." msgstr "" -msgid ":doc:`pgr_trspVia_withPoints`" +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." msgstr "" -msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgid "Get the connectivity" msgstr "" -msgid "Use :doc:`pgr_withPointsVia` instead." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "" -msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgid "Insert new edges" msgstr "" -msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." msgstr "" -msgid "Not yet classified migrations" +msgid "Create the vertices table" msgstr "" -msgid "Migration of ``pgr_withPointsKSP``" +msgid "Using :doc:`pgr_extractVertices` create the table." msgstr "" -msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgid "Contraction of a graph" msgstr "" -msgid "|ksp-result|" +msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "" -msgid "|generic-result|" +msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." msgstr "" -msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." msgstr "" -msgid "``pgr_withPointsKSP`` (`One to One`)" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" msgstr "" -msgid "Before Migration" +msgid "To get the dead ends:" msgstr "" -msgid "Output columns were |old-pid-result|" +msgid "A dead end happens when" msgstr "" -msgid "the columns ``start_vid`` and ``end_vid`` do not exist." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" -msgid "Migration" +msgid "The vertex is on the limit of the imported graph." msgstr "" -msgid "Be aware of the existence of the additional result Columns." +msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "" -msgid "New output columns are |generic-result|" +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." msgstr "" -msgid "Using `this `__ example." +msgid "Is node :math:`4` a dead end or not?" msgstr "" -msgid "``start_vid`` contains the **start vid** parameter value." +msgid "The answer to that question will depend on the application." msgstr "" -msgid "``end_vid`` contains the **end vid** parameter value." +msgid "Is there such a small curb:" msgstr "" -msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" -msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" msgstr "" -msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" msgstr "" -msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" msgstr "" -msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgid "Depending on the answer, modification of the data might be needed." msgstr "" -msgid "Migration of ``pgr_maxCardinalityMatch``" +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." msgstr "" -msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgid "Linear edges" msgstr "" -msgid "Starting from `v3.4.0 `__" +msgid "To get the linear edges:" msgstr "" -msgid "Signature to be migrated:" +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." msgstr "" -msgid "Migration is needed, because:" +msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." msgstr "" -msgid "Use ``cost`` and ``reverse_cost`` on the inner query" +msgid "Function's structure" msgstr "" -msgid "Results are ordered" +msgid "Once the graph preparation work has been done above, it is time to use a" msgstr "" -msgid "Works for undirected graphs." +msgid "The general form of a pgRouting function call is:" msgstr "" -msgid "New signature" +msgid "\\ \\" msgstr "" -msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." +msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" msgstr "" -msgid "The optional flag ``directed`` is removed." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." msgstr "" -msgid "Before migration" +msgid "**parameters**: Additional compulsory parameters needed by the function." msgstr "" -msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." msgstr "" -msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." msgstr "" -msgid "The flag ``directed`` is ignored." +msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" -msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgid "`Edges SQL`_:" msgstr "" -msgid "Do not use the flag ``directed``." +msgid "Is the first parameter." msgstr "" -msgid "In the query returns only ``edge`` column." +msgid "It is compulsory." msgstr "" -msgid "Migration of restrictions" +msgid "It is an inner query." msgstr "" -msgid "The structure of the restrictions have changed:" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" msgstr "" -msgid "Old restrictions structure" +msgid "**start vid**:" msgstr "" -msgid "On the deprecated signatures:" +msgid "Is the second parameter." msgstr "" -msgid "Column ``rid`` is ignored" +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." msgstr "" -msgid "``via_path``" -msgstr "``via_path``" +msgid "Is the third parameter." +msgstr "" -msgid "Must be in reverse order." +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" msgstr "" -msgid "Is of type ``TEXT``." +msgid "Is the fourth parameter." msgstr "" -msgid "When more than one via edge must be separated with ``,``." +msgid "It is optional." msgstr "" -msgid "``target_id``" -msgstr "``target_id``" +msgid "It has a name." +msgstr "" -msgid "Is the last edge of the forbidden path." +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." msgstr "" -msgid "Is of type ``INTEGER``." +msgid "Function's overloads" msgstr "" -msgid "``to_cost``" -msgstr "``to_cost``" +msgid "A function might have different overloads. The most common are called:" +msgstr "" -msgid "Is of type ``FLOAT``." +msgid "`One to One`_" msgstr "" -msgid "Creation of the old restrictions table" +msgid "`One to Many`_" msgstr "" -msgid "Old restrictions fill up" +msgid "`Many to One`_" msgstr "" -msgid "Old restrictions contents" +msgid "`Many to Many`_" msgstr "" -msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgid "`Combinations`_" msgstr "" -msgid ":math:`3\\rightarrow5`" +msgid "Depending on the overload the parameters types change." msgstr "" -msgid "is on column ``via_path`` in reverse order" +msgid "**One**: **ANY-INTEGER**" msgstr "" -msgid "is of type ``TEXT``" +msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid ":math:`9`" +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." msgstr "" -msgid "is on column ``target_id``" +msgid "When routing from:" msgstr "" -msgid "is of type ``INTEGER``" +msgid "From **one** starting vertex" msgstr "" -msgid "New restrictions structure" +msgid "to **one** ending vertex" msgstr "" -msgid "Column ``id`` is ignored" +msgid "to **many** ending vertices" msgstr "" -msgid "Column ``path``" +msgid "From **many** starting vertices" msgstr "" -msgid "Is of type ``ARRAY[ANY-INTEGER]``." +msgid "From **many** different starting vertices" msgstr "" -msgid "Contains all the edges involved on the restriction." +msgid "to **many** different ending vertices" msgstr "" -msgid "The array has the ordered edges of the restriction." +msgid "Every tuple specifies a pair of a start vertex and an end vertex" msgstr "" -msgid "Column ``cost``" +msgid "Users can define the combinations as desired." msgstr "" -msgid "Is of type ``ANY-NUMERICAL``" +msgid "Needs a `Combinations SQL`_" msgstr "" -msgid "The creation of the restrictions table" +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." msgstr "" -msgid "Adding the restrictions" +msgid "Edges SQL for" msgstr "" -msgid "Restrictions data" +msgid "Some uncategorised functions" msgstr "" -msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgid "General without ``id``" msgstr "" -msgid "By inspection the path is clear." +msgid "General with (X,Y)" msgstr "" -msgid "To transform the old restrictions table to the new restrictions structure," +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." msgstr "" -msgid "Create a new table with the new restrictions structure." +msgid "Weight of the edge (``target``, ``source``)," msgstr "" -msgid "In this migration guide ``new_restrictions`` is been used." +msgid "``x1``" +msgstr "``x1``" + +msgid "X coordinate of ``source`` vertex." msgstr "" -msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgid "``y1``" +msgstr "``y1``" + +msgid "Y coordinate of ``source`` vertex." msgstr "" -msgid "``_pgr_array_reverse``:" +msgid "``x2``" +msgstr "``x2``" + +msgid "X coordinate of ``target`` vertex." msgstr "" -msgid "Was created temporally for this migration" +msgid "``y2``" +msgstr "``y2``" + +msgid "Y coordinate of ``target`` vertex." msgstr "" -msgid "Is not documented." +msgid "Flow" msgstr "" -msgid "Will be removed on the next mayor version 4.0.0" +msgid "Edges SQL for :doc:`flow-family`" msgstr "" -msgid "The migrated table contents:" +msgid "Edges SQL for the following functions of :doc:`flow-family`" msgstr "" -msgid ":doc:`pgRouting-concepts`" +msgid "Used in combination signatures" msgstr "" -msgid "Ordering - Family of functions" +msgid "Points SQL for" msgstr "" -msgid "pgRouting Concepts" +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." msgstr "" -msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." msgstr "" -msgid "Graphs" +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." msgstr "" -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" +msgid "Parameters for the Via functions" msgstr "" -msgid ":math:`V` is a set of vertices, also called nodes." +msgid "SQL query as described." msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgid "When ``true`` Graph is considered `Directed`" msgstr "" -msgid "There are different kinds of graphs:" +msgid "When ``false`` the graph is considered as Undirected." msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -msgstr "" +msgid "``strict``" +msgstr "``strict``" -msgid "Undirected simple graph" +msgid "``false``" +msgstr "``false``" + +msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgid "When ``false`` ignores missing paths returning all paths found" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgid "``U_turn_on_edge``" +msgstr "``U_turn_on_edge``" + +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." msgstr "" -msgid "Directed simple graph" +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "For the TRSP functions" msgstr "" -msgid "Graphs:" +msgid "Array of identifiers of destination vertices." msgstr "" -msgid "Do not have geometries." +msgid "There are several kinds of columns returned are depending of the function." msgstr "" -msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgid "Result columns for single path functions" msgstr "" -msgid "In pgRouting there are several ways to represent a graph on the database:" +msgid "Used in functions that return one path solution per departure and destination." msgstr "" -msgid "With ``cost``" +msgid ":doc:`pgr_dijkstraNear`" msgstr "" -msgid "(``id``, ``source``, ``target``, ``cost``)" +msgid "Returns |short-generic-result|" msgstr "" -msgid "With ``cost`` and ``reverse_cost``" +msgid "``path_seq``" +msgstr "``path_seq``" + +msgid "Relative position in the path. Has value **1** for the beginning of a path." msgstr "" -msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgid "Identifier of the starting vertex of the current path." msgstr "" -msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgid "Identifier of the ending vertex of the current path." msgstr "" -msgid "Identifier of a vertex." +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "Weight of the edge (``source``, ``target``):" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." msgstr "" -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." msgstr "" -msgid "``cost`` must exist in the query." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." msgstr "" -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "Result columns for multiple paths functions" msgstr "" -msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgid "Used in functions that return many paths solutions per departure and destination." msgstr "" -msgid "Graph with ``cost``" +msgid ":doc:`pgr_KSP`" msgstr "" -msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgid ":doc:`pgr_withPointsKSP`" msgstr "" -msgid "Graph data is obtained with a query" +msgid "Returns set of |generic-result|" msgstr "" -msgid "``SELECT id, source, target, cost FROM edges``" +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Path identifier." msgstr "" -msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "Edges where ``cost`` is non negative are part of the graph." +msgid "Result columns for cost functions" msgstr "" -msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgid "Used by:" msgstr "" -msgid "All vertices in ``source`` and ``target`` are part of the graph." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." msgstr "" -msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "Result columns for flow functions" msgstr "" -msgid "For the following data:" +msgid "Result columns for spanning tree functions" msgstr "" -msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." +msgid "Used in functions that return a tree solution per departure." msgstr "" -msgid "The data is representing the following graph:" +msgid "Result columns for simple spanning tree functions" msgstr "" -msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Returns set of ``(edge, cost)``" msgstr "" -msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" +msgid "Cost to traverse the edge." msgstr "" -msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgid "Performance Tips" msgstr "" -msgid "Graph with ``cost`` and ``reverse_cost``" +msgid "For the Routing functions" msgstr "" -msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgid "To get faster results bound the queries to an area of interest of routing." msgstr "" -msgid "The set of edges :math:`E`:" +msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." msgstr "" -msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid "Given this area:" msgstr "" -msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgid "Calculate a route:" msgstr "" -msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgid "How to contribute" msgstr "" -msgid "The set of vertices :math:`V`:" +msgid "Wiki" msgstr "" -msgid "In a directed graph both edges have directionality" +msgid "Edit an existing `pgRouting Wiki `__ page." msgstr "" -msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "Or create a new Wiki page" msgstr "" -msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgid "Create a page on the `pgRouting Wiki `__" msgstr "" -msgid "Edges not part of the graph:" +msgid "Give the title an appropriate name" msgstr "" -msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgid "`Example `__" msgstr "" -msgid ":math:`3` (:math:`3 \\rightarrow 2`)" +msgid "Adding Functionality to pgRouting" msgstr "" -msgid "In a directed graph both edges do not have directionality" +msgid "Consult the `developer's documentation `__" msgstr "" -msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Installation" msgstr "" -msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" msgstr "" -msgid "In terms of a directed graph is like having four edges:" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" msgstr "" -msgid ":math:`source_i \\leftrightarrow target_i`" +msgid "Short Version" msgstr "" -msgid ":math:`target_i \\leftrightarrow source_i`" +msgid "Extracting the tar ball" msgstr "" -msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgid "To compile assuming you have all the dependencies in your search path:" msgstr "" -msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." msgstr "" -msgid "Graphs without geometries" +msgid "Get the sources" msgstr "" -msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" -msgid "Wiki example" +msgid "To download this release:" msgstr "" -msgid "Solve the example problem taken from `wikipedia `__):" +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." msgstr "" -msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." +msgid "git" msgstr "" -msgid "Is an undirected graph." +msgid "To download the repository" msgstr "" -msgid "Although visually looks like to have geometries, the drawing is not to scale." +msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." msgstr "" -msgid "No geometries associated to the vertices or edges" +msgid "Enabling and upgrading in the database" msgstr "" -msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" +msgid "Enabling the database" msgstr "" -msgid "Has 9 edges:" +msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." msgstr "" -msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgid "Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" -msgid "The graph can be represented in many ways for example:" +msgid "Upgrading the database" msgstr "" -msgid "Prepare the database" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" msgstr "" -msgid "Create a database for the example, access the database and install pgRouting: ::" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" msgstr "" -msgid "Create a table" +msgid "Dependencies" msgstr "" -msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgid "Compilation Dependencies" msgstr "" -msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "" -msgid "Using this table design for this example:" +msgid "C and C++0x compilers" msgstr "" -msgid "Insert the data" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" msgstr "" -msgid "Find the shortest path" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" -msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgid "Postgresql version >= 13" msgstr "" -msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "The Boost Graph Library (BGL) >= 1.56.0" msgstr "" -msgid "Vertex information" +msgid "CMake >= 3.12" msgstr "" -msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" +msgid "For user's documentation" msgstr "" -msgid "Graphs with geometries" +msgid "Sphinx >= 4.0" msgstr "" -msgid "Create a routing Database" +msgid "For developer's documentation" msgstr "" -msgid "The first step is to create a database and load pgRouting in the database." +msgid "Doxygen >= 1.7" msgstr "" -msgid "Typically create a database for each project." +msgid "For testing" msgstr "" -msgid "Once having the database to work in, load your data and build the routing application in that database." +msgid "pgtap" msgstr "" -msgid "Load Data" +msgid "pg_prove" msgstr "" -msgid "There are several ways to load your data into pgRouting." +msgid "For using:" msgstr "" -msgid "Manually creating a database." +msgid "PostGIS version >= 3.0.0" msgstr "" -msgid "`Graphs without geometries`_" +msgid "Example: Installing dependencies on linux" msgstr "" -msgid ":doc:`sampledata`: a small graph used in the documentation examples" +msgid "Installing the compilation dependencies" msgstr "" -msgid "Using `osm2pgrouting `__" +msgid "Build dependencies" msgstr "" -msgid "There are various open source tools that can help, like:" +msgid "Optional dependencies" msgstr "" -msgid "shp2pgsql" +msgid "For documentation" msgstr "" -msgid "postgresql shapefile loader" +msgid "Configuring" msgstr "" -msgid "ogr2ogr" +msgid "pgRouting uses the `cmake` system to do the configuration." msgstr "" -msgid "vector data conversion utility" +msgid "Configurable variables" msgstr "" -msgid "osm2pgsql" +msgid "To see the variables that can be configured" msgstr "" -msgid "load OSM data into postgresql" +msgid "The build directory is different from the source directory" msgstr "" -msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgid "Configuring The Documentation" msgstr "" -msgid "Breakup a segments on each segment-segment intersection" +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" msgstr "" -msgid "Connect a disconnected graph." +msgid "Variable" msgstr "" -msgid "Create the complete graph topology" +msgid "Comment" msgstr "" -msgid "Create one or more graphs based on the application to be developed." +msgid "BUILD_HTML" msgstr "" -msgid "Create a contracted graph for the high speed roads" +msgid "BOOL=ON" msgstr "" -msgid "Create graphs per state/country" +msgid "If ON, turn on/off building HTML for user's documentation" msgstr "" -msgid "In few words:" +msgid "BUILD_DOXY" msgstr "" -msgid "Prepare the graph" +msgid "If ON, turn on/off building HTML for developer's documentation" msgstr "" -msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgid "BUILD_LATEX" msgstr "" -msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." +msgid "BOOL=OFF" msgstr "" -msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgid "If ON, turn on/off building PDF" msgstr "" -msgid "The use of indexes on the database design in general:" +msgid "BUILD_MAN" msgstr "" -msgid "Have the geometries indexed." +msgid "If ON, turn on/off building MAN pages" msgstr "" -msgid "Have the identifiers columns indexed." +msgid "DOC_USE_BOOTSTRAP" msgstr "" -msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" msgstr "" -msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." +msgid "EN" msgstr "" -msgid "Adjust costs" +msgid "if OFF the English documentation will no be built" msgstr "" -msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgid "ES" msgstr "" -msgid "Update costs to length of geometry" +msgid "if OFF the Spanish documentation will no be built" msgstr "" -msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgid "SV" msgstr "" -msgid ":math:`1` when the edge exists in the graph" +msgid "if OFF the Swedish documentation will no be built" msgstr "" -msgid ":math:`-1` when the edge does not exist in the graph" +msgid "ZH_HANS" msgstr "" -msgid "Using that information updating to the length of the geometries:" +msgid "if OFF the Chinese simplified documentation will no be built" msgstr "" -msgid "Which gives the following results:" +msgid "Building" msgstr "" -msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgid "Using ``make`` to build the code and the documentation" msgstr "" -msgid "Returning to the original data:" +msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "" -msgid "Update costs based on codes" +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." msgstr "" -msgid "Other datasets, can have a column with values like" +msgid "Linux" msgstr "" -msgid "``FT`` vehicle flow on the direction of the geometry" +msgid "The following instructions start from ``path/to/pgrouting``" msgstr "" -msgid "``TF`` vehicle flow opposite of the direction of the geometry" +msgid "Testing" msgstr "" -msgid "``B`` vehicle flow on both directions" +msgid "Currently there is no :code:`make test` and testing is done as follows" msgstr "" -msgid "Preparing a code column for the example:" +msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." msgstr "" -msgid "Adjusting the costs based on the codes:" +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" -msgid "Check the Routing Topology" +msgid "Licensing" msgstr "" -msgid "There are lots of possible problems in a graph." +msgid "The following licenses can be found in pgRouting:" msgstr "" -msgid "The data used may not have been designed with routing in mind." +msgid "**License**" msgstr "" -msgid "A graph has some very specific requirements." +msgid "GNU General Public License v2.0 or later" msgstr "" -msgid "The graph is disconnected." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." msgstr "" -msgid "There are unwanted intersections." +msgid "Boost Software License - Version 1.0" msgstr "" -msgid "The graph is too large and needs to be contracted." +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." msgstr "" -msgid "A sub graph is needed for the application." +msgid "MIT-X License" msgstr "" -msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgid "Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" -msgid "Crossing edges" +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." msgstr "" -msgid "To get the crossing edges:" +msgid "In general license information should be included in the header of each source file." msgstr "" -msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgid "Contributors" msgstr "" -msgid "It might be incorrect, for example:" +msgid "This Release Contributors" msgstr "" -msgid "When it is actually an intersection of roads, where vehicles can make turns." +msgid "Individuals in this release |release| (in alphabetical order)" msgstr "" -msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgid "Mohit Rawat, Regina Obe, Vicky Vergara" msgstr "" -msgid "When it is incorrect, it needs fixing:" +msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." msgstr "" -msgid "For vehicles and pedestrians" +msgid "Translators (in alphabetical order)" msgstr "" -msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." +msgid "Chinese:" msgstr "" -msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgid "Dapeng Wang" msgstr "" -msgid "For very specific applications" +msgid "Spanish:" msgstr "" -msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgid "Vicky Vergara" msgstr "" -msgid "The data needs a local fix for the specific application." +msgid "Swedish:" msgstr "" -msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgid "Daniel Nylander" msgstr "" -msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" -msgid "Fixing an intersection" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" msgstr "" -msgid "In this example the original edge table will be used to store the additional geometries." +msgid "`OSGeo `__" msgstr "" -msgid "An example use without results" +msgid "`OSGeo UK `__" msgstr "" -msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgid "`Google Summer of Code `__" msgstr "" -msgid "Analyze the network for intersections." +msgid "`HighGo Software `__" msgstr "" -msgid "The analysis tell us that the network has an intersection." +msgid "`Paragon Corporation `__" msgstr "" -msgid "Prepare tables" +msgid "Contributors Past & Present:" msgstr "" -msgid "Additional columns to control the origin of the segments." +msgid "Individuals (in alphabetical order)" msgstr "" -msgid "Adding new segments." +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgstr "" -msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." +msgid "Corporate Sponsors (in alphabetical order)" msgstr "" -msgid "Update other values" +msgid "Camptocamp" msgstr "" -msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgid "CSIS (University of Tokyo)" msgstr "" -msgid "Update the topology" +msgid "Georepublic" msgstr "" -msgid "Insert the new vertices if any." +msgid "Google Summer of Code" msgstr "" -msgid "Update source and target information on the edges table." +msgid "HighGo Software" msgstr "" -msgid "The example has results" +msgid "iMaptools" msgstr "" -msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgid "Leopark" msgstr "" -msgid "Touching edges" +msgid "Orkney" msgstr "" -msgid "Visually the edges seem to be connected, but internally they are not." +msgid "OSGeo" msgstr "" -msgid "The validity of the information is application dependent." +msgid "OSGeo UK" msgstr "" -msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgid "Paragon Corporation" msgstr "" -msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgid "Versaterm Inc." msgstr "" -msgid "Fixing a gap" +msgid "More Information" msgstr "" -msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." msgstr "" -msgid "Analyze the network for gaps." +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." msgstr "" -msgid "The analysis tell us that the network has a gap." +msgid "PostGIS extension at the PostGIS project web site https://postgis.net." msgstr "" -msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." +msgid "Boost C++ source libraries at https://www.boost.org." msgstr "" -msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgid ":doc:`migration`" msgstr "" -msgid "Connecting components" +msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" -msgid "To get the graph connectivity:" +msgid "Availability" msgstr "" -msgid "There are three basic ways to connect components:" +msgid "Version 4.0.0" msgstr "" -msgid "From the vertex to the starting point of the edge" +msgid "All signatures promoted to official." msgstr "" -msgid "From the vertex to the ending point of the edge" +msgid "Version 3.6.0" msgstr "" -msgid "From the vertex to the closest vertex on the edge" +msgid "Standardizing output columns to |nksp-result|" msgstr "" -msgid "This solution requires the edge to be split." +msgid "pgr_ksp(One to One)" msgstr "" -msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "Get the connectivity" +msgid "New proposed signatures:" msgstr "" -msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." +msgid "pgr_ksp(One to Many)" msgstr "" -msgid "Insert new edges" +msgid "pgr_ksp(Many to One)" msgstr "" -msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgid "pgr_ksp(Many to Many)" msgstr "" -msgid "Create the vertices table" +msgid "pgr_ksp(Combinations)" msgstr "" -msgid "Using :doc:`pgr_extractVertices` create the table." +msgid "Version 2.1.0" msgstr "" -msgid "Contraction of a graph" +msgid "Signature change" msgstr "" -msgid "The graph can be reduced in size using :doc:`contraction-family`" +msgid "Old signature no longer supported" msgstr "" -msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." +msgid "Version 2.0.0" msgstr "" -msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." +msgid "Official function." msgstr "" -msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." msgstr "" -msgid "To get the dead ends:" +msgid "|Boost| Boost Graph Inside" msgstr "" -msgid "A dead end happens when" +msgid "Boost Graph inside" msgstr "" -msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgid "Signatures" msgstr "" -msgid "The vertex is on the limit of the imported graph." +msgid "Summary" msgstr "" -msgid "If a larger graph is imported then the vertex might not be a dead end" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgstr "" -msgid "Is node :math:`4` a dead end or not?" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgstr "" -msgid "The answer to that question will depend on the application." +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgstr "" -msgid "Is there such a small curb:" +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" msgstr "" -msgid "That does not allow a vehicle to use that visual intersection?" +msgid "**options:** ``[directed, heap_paths]``" msgstr "" -msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgid "Returns set of |nksp-result|" msgstr "" -msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgid "OR EMPTY SET" msgstr "" -msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgid "Example" msgstr "" -msgid "Depending on the answer, modification of the data might be needed." +msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "" -msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "Linear edges" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." msgstr "" -msgid "To get the linear edges:" +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgid "Using a combinations table on an directed graph" msgstr "" -msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." +msgid "The combinations table:" msgstr "" -msgid "Function's structure" +msgid "The query:" msgstr "" -msgid "Once the graph preparation work has been done above, it is time to use a" +msgid "Identifier of the destination vertex." msgstr "" -msgid "The general form of a pgRouting function call is:" +msgid "**K**" msgstr "" -msgid "\\ \\" +msgid "Number of required paths." msgstr "" -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgid "KSP Optional parameters" msgstr "" -msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." -msgstr "" +msgid "``heap_paths``" +msgstr "``heap_paths``" -msgid "**parameters**: Additional compulsory parameters needed by the function." +msgid "When ``false`` Returns at most K paths." msgstr "" -msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" -msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" -msgid "For example, for this :doc:`pgr_dijkstra` signature:" +msgid "Additional Examples" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" msgstr "" -msgid "`Edges SQL`_:" +msgid "Also get the paths in the heap." msgstr "" -msgid "Is the first parameter." +msgid "Get 2 paths using combinations table on an undirected graph" msgstr "" -msgid "It is compulsory." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." msgstr "" -msgid "It is an inner query." +msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgstr "" -msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgid "``pgr_TSP``" +msgstr "``pgr_TSP``" + +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." msgstr "" -msgid "**start vid**:" +msgid "Availability:" msgstr "" -msgid "Is the second parameter." +msgid "Results change depending on input order" msgstr "" -msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." +msgid "Only for undirected graphs" msgstr "" -msgid "Is the third parameter." +msgid "Breaking change, signatures no longer available:" msgstr "" -msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Is the fourth parameter." +msgid "Version 3.2.1" msgstr "" -msgid "It is optional." +msgid "Metric Algorithm from `Boost library `__" msgstr "" -msgid "It has a name." +msgid "Simulated Annealing Algorithm no longer supported" msgstr "" -msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" msgstr "" -msgid "Function's overloads" +msgid "Version 2.3.0" msgstr "" -msgid "A function might have different overloads. The most common are called:" +msgid "Results change depending on input order of the `Matrix SQL`_" msgstr "" -msgid "`One to One`_" +msgid "Negative costs are ignored." msgstr "" -msgid "`One to Many`_" +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." msgstr "" -msgid "`Many to One`_" +msgid "With ``directed => false``" msgstr "" -msgid "`Many to Many`_" +msgid "Will generate a graph that:" msgstr "" -msgid "`Combinations`_" +msgid "is undirected" msgstr "" -msgid "Depending on the overload the parameters types change." +msgid "is fully connected (As long as the graph has one component)" msgstr "" -msgid "**One**: **ANY-INTEGER**" +msgid "all traveling costs on edges obey the triangle inequality." msgstr "" -msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" -msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "" -msgid "When routing from:" +msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" -msgid "From **one** starting vertex" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." msgstr "" -msgid "to **one** ending vertex" +msgid "With ``directed => true``" msgstr "" -msgid "to **many** ending vertices" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "" -msgid "From **many** starting vertices" +msgid "is directed" msgstr "" -msgid "From **many** different starting vertices" +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." msgstr "" -msgid "to **many** different ending vertices" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" msgstr "" -msgid "Every tuple specifies a pair of a start vertex and an end vertex" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" msgstr "" -msgid "Users can define the combinations as desired." +msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" msgstr "" -msgid "Needs a `Combinations SQL`_" +msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" msgstr "" -msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." msgstr "" -msgid "Edges SQL for" +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" -msgid "Some uncategorised functions" +msgid "Missing values will be calculated with dijkstra algorithm." msgstr "" -msgid "General without ``id``" +msgid "When the graph has more than one component:" msgstr "" -msgid "General with (X,Y)" +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." msgstr "" -msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "Weight of the edge (``target``, ``source``)," +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." msgstr "" -msgid "``x1``" -msgstr "``x1``" - -msgid "X coordinate of ``source`` vertex." +msgid "One cycle attempt to remove crossing edges is done to the TSP results." msgstr "" -msgid "``y1``" -msgstr "``y1``" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgstr "" -msgid "Y coordinate of ``source`` vertex." +msgid "Returns set of |tsp-result|" msgstr "" -msgid "``x2``" -msgstr "``x2``" +msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgstr "" -msgid "X coordinate of ``target`` vertex." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." msgstr "" -msgid "``y2``" -msgstr "``y2``" +msgid "`Matrix SQL`_ as described below" +msgstr "" -msgid "Y coordinate of ``target`` vertex." +msgid "``ANY-INTEGER``" msgstr "" -msgid "Flow" +msgid "``ANY-NUMERICAL``" msgstr "" -msgid "Edges SQL for :doc:`flow-family`" +msgid "Cost for going from start_vid to end_vid" msgstr "" -msgid "Edges SQL for the following functions of :doc:`flow-family`" +msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" msgstr "" -msgid "Used in combination signatures" +msgid "Row sequence." msgstr "" -msgid "Points SQL for" +msgid "**node**" msgstr "" -msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgid "Identifier of the node/coordinate/point." msgstr "" -msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." msgstr "" -msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgid "``0`` for the last row in the tour sequence." msgstr "" -msgid "Parameters for the Via functions" +msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." msgstr "" -msgid "SQL query as described." +msgid "``0`` for the first row in the tour sequence." msgstr "" -msgid "When ``true`` Graph is considered `Directed`" +msgid "Start from vertex :math:`1`" msgstr "" -msgid "When ``false`` the graph is considered as Undirected." +msgid "**Line 6** ``start_vid => 1``" msgstr "" -msgid "``strict``" -msgstr "``strict``" +msgid "Using points of interest to generate an asymmetric matrix." +msgstr "" -msgid "``false``" -msgstr "``false``" +msgid "To generate an asymmetric matrix:" +msgstr "" -msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" msgstr "" -msgid "When ``false`` ignores missing paths returning all paths found" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" -msgid "``U_turn_on_edge``" -msgstr "``U_turn_on_edge``" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgstr "" -msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" msgstr "" -msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgid "Triangle inequality might not be satisfied." msgstr "" -msgid "For the TRSP functions" +msgid "``start_id != 0 AND end_id != 0``" msgstr "" -msgid "Array of identifiers of destination vertices." +msgid "Connected incomplete data" msgstr "" -msgid "There are several kinds of columns returned are depending of the function." +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." msgstr "" -msgid "Result columns for single path functions" +msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." msgstr "" -msgid "Used in functions that return one path solution per departure and destination." +msgid "``pgr_TSPeuclidean``" +msgstr "``pgr_TSPeuclidean``" + +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "" -msgid ":doc:`pgr_dijkstraNear`" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Returns |short-generic-result|" +msgid "Using `Boost: metric TSP approx `__" msgstr "" -msgid "``path_seq``" -msgstr "``path_seq``" +msgid "Version 3.0.0" +msgstr "" -msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgid "Name change from pgr_eucledianTSP" msgstr "" -msgid "Identifier of the starting vertex of the current path." +msgid "New official function." msgstr "" -msgid "Identifier of the ending vertex of the current path." +msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "" -msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "" -msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" msgstr "" -msgid "Result columns for multiple paths functions" +msgid "With default values" msgstr "" -msgid "Used in functions that return many paths solutions per departure and destination." +msgid "`Coordinates SQL`_" msgstr "" -msgid ":doc:`pgr_KSP`" +msgid "`Coordinates SQL`_ as described below" msgstr "" -msgid ":doc:`pgr_withPointsKSP`" +msgid "Coordinates SQL" msgstr "" -msgid "Returns set of |generic-result|" +msgid "``x``" +msgstr "``x``" + +msgid "X value of the coordinate." msgstr "" -msgid "``path_id``" -msgstr "``path_id``" +msgid "``y``" +msgstr "``y``" -msgid "Path identifier." +msgid "Y value of the coordinate." msgstr "" -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "Test 29 cities of Western Sahara" msgstr "" -msgid "Result columns for cost functions" +msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" msgstr "" -msgid "Used by:" +msgid "Creating a table for the data and storing the data" msgstr "" -msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgid "Adding a geometry (for visual purposes)" msgstr "" -msgid "Result columns for flow functions" +msgid "Total tour cost" msgstr "" -msgid "Result columns for spanning tree functions" +msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" msgstr "" -msgid "Used in functions that return a tree solution per departure." +msgid "Getting a geometry of the tour" msgstr "" -msgid "Result columns for simple spanning tree functions" +msgid "Visual results" msgstr "" -msgid "Returns set of ``(edge, cost)``" +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid "Cost to traverse the edge." +msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" -msgid "Performance Tips" +msgid "Combinations signature promoted to official." msgstr "" -msgid "For the Routing functions" +msgid "Standardizing output columns to |short-generic-result|" msgstr "" -msgid "To get faster results bound the queries to an area of interest of routing." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." msgstr "" -msgid "Given this area:" +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" -msgid "Calculate a route:" +msgid "Version 3.2.0" msgstr "" -msgid "How to contribute" +msgid "New proposed signature:" msgstr "" -msgid "Wiki" +msgid "pgr_aStar(Combinations)" msgstr "" -msgid "Edit an existing `pgRouting Wiki `__ page." +msgid "Function promoted to official." msgstr "" -msgid "Or create a new Wiki page" +msgid "Version 2.4.0" msgstr "" -msgid "Create a page on the `pgRouting Wiki `__" +msgid "pgr_aStar(One to Many)" msgstr "" -msgid "Give the title an appropriate name" +msgid "pgr_aStar(Many to One)" msgstr "" -msgid "`Example `__" +msgid "pgr_aStar(Many to Many)" msgstr "" -msgid "Adding Functionality to pgRouting" +msgid "Signature change on pgr_aStar(One to One)" msgstr "" -msgid "Consult the `developer's documentation `__" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" msgstr "" -msgid "Installation" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Short Version" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "Extracting the tar ball" +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "To compile assuming you have all the dependencies in your search path:" +msgid "**options:** ``[directed, heuristic, factor, epsilon]``" msgstr "" -msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." +msgid "Returns set of |short-generic-result|" +msgstr "" + +msgid "Optional parameters are `named parameters` and have a default value." msgstr "" -msgid "Get the sources" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" msgstr "" -msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" msgstr "" -msgid "To download this release:" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" msgstr "" -msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" msgstr "" -msgid "git" +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "" -msgid "To download the repository" +msgid "Example 1" msgstr "" -msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." +msgid "Demonstration of repeated values are ignored, and result is sorted." msgstr "" -msgid "Enabling and upgrading in the database" +msgid "Example 2" msgstr "" -msgid "Enabling the database" +msgid "Making **start vids** the same as **end vids**." msgstr "" -msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." +msgid "Example 3" msgstr "" -msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgid "Manually assigned vertex combinations." msgstr "" -msgid "Upgrading the database" -msgstr "" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" -msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "" -msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgid "pgr_aStarCost(Combinations)" msgstr "" -msgid "Dependencies" +msgid "New proposed function." msgstr "" -msgid "Compilation Dependencies" +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." msgstr "" -msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" msgstr "" -msgid "C and C++0x compilers" +msgid "For undirected graphs, the results are symmetric." msgstr "" -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgid "The returned values are ordered in ascending order:" msgstr "" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "`start_vid` ascending" msgstr "" -msgid "Postgresql version >= 13" +msgid "`end_vid` ascending" msgstr "" -msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "CMake >= 3.12" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "For user's documentation" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Sphinx >= 4.0" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "For developer's documentation" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Doxygen >= 1.7" +msgid "Returns set of |matrix-result|" msgstr "" -msgid "For testing" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" msgstr "" -msgid "pgtap" +msgid "``pgr_aStarCostMatrix``" +msgstr "``pgr_aStarCostMatrix``" + +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" -msgid "pg_prove" +msgid "Using internally the :doc:`pgr_aStar` algorithm" msgstr "" -msgid "For using:" +msgid "Returns a cost matrix." msgstr "" -msgid "PostGIS version >= 3.0.0" +msgid "No ordering is performed" msgstr "" -msgid "Example: Installing dependencies on linux" +msgid "let `v` and `u` are nodes on the graph:" msgstr "" -msgid "Installing the compilation dependencies" +msgid "when there is no path from `v` to `u`:" msgstr "" -msgid "Build dependencies" +msgid "cost from `v` to `u` is :math:`\\inf`" msgstr "" -msgid "Optional dependencies" +msgid "when :math:`v = u` then" msgstr "" -msgid "For documentation" +msgid "cost from `v` to `u` is :math:`0`" msgstr "" -msgid "Configuring" +msgid "When the graph is **undirected** the cost matrix is symmetric" msgstr "" -msgid "pgRouting uses the `cmake` system to do the configuration." +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "Configurable variables" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" msgstr "" -msgid "To see the variables that can be configured" +msgid "Use with :doc:`pgr_TSP`" msgstr "" -msgid "The build directory is different from the source directory" +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" + +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." msgstr "" -msgid "Configuring The Documentation" +msgid "Result columns change: ``seq`` is removed" msgstr "" -msgid "User and developers documentation are not build if prerequisites are not found." +msgid "Version 2.5.0" msgstr "" -msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgid "New experimental function." msgstr "" -msgid "Variable" +msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." msgstr "" -msgid "Comment" +msgid "Works for **undirected** graphs." msgstr "" -msgid "BUILD_HTML" +msgid "``node`` ascending" msgstr "" -msgid "BOOL=ON" +msgid "Running time: :math:`O(V + E)`" msgstr "" -msgid "If ON, turn on/off building HTML for user's documentation" +msgid "pgr_articulationPoints(`Edges SQL`_)" msgstr "" -msgid "BUILD_DOXY" +msgid "Returns set of |result-node|" msgstr "" -msgid "If ON, turn on/off building HTML for developer's documentation" +msgid "The articulation points of the graph" msgstr "" -msgid "BUILD_LATEX" +msgid "Nodes in red are the articulation points." msgstr "" -msgid "BOOL=OFF" +msgid "Identifier of the vertex." msgstr "" -msgid "If ON, turn on/off building PDF" +msgid "`Boost: Biconnected components & articulation points `__" msgstr "" -msgid "BUILD_MAN" +msgid "wikipedia: `Biconnected component `__" msgstr "" -msgid "If ON, turn on/off building MAN pages" +msgid "``pgr_bandwidth`` - Experimental" msgstr "" -msgid "DOC_USE_BOOTSTRAP" +msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "" -msgid "EN" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "" -msgid "if OFF the English documentation will no be built" +msgid "The bandwidth is the maximum of all these distances" msgstr "" -msgid "ES" +msgid "The implementation is for undirected graphs" msgstr "" -msgid "if OFF the Spanish documentation will no be built" +msgid "Run time is 0.160789 seconds" msgstr "" -msgid "SV" +msgid "pgr_bandwidth(`Edges SQL`_)" msgstr "" -msgid "if OFF the Swedish documentation will no be built" +msgid "Returns ``BIGINT``" msgstr "" -msgid "ZH_HANS" +msgid "For an undirected graph with edges." msgstr "" -msgid "if OFF the Chinese simplified documentation will no be built" +msgid "Returns a bigint ``(pgr_bandwidth)``" msgstr "" -msgid "Building" +msgid "``pgr_bandwidth``" +msgstr "``pgr_bandwidth``" + +msgid "gives the bandwidth of the graph." msgstr "" -msgid "Using ``make`` to build the code and the documentation" +msgid "Undirected graph with edges before optimization." msgstr "" -msgid "The following instructions start from ``path/to/pgrouting/build``" +msgid "Undirected graph with edges after optimization." msgstr "" -msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgid "`Boost: bandwidth `_" msgstr "" -msgid "Linux" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" + +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "The following instructions start from ``path/to/pgrouting``" +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "Testing" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "Currently there is no :code:`make test` and testing is done as follows" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." +msgid "pgr_bdAstar(Combinations)" msgstr "" -msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgid "pgr_bdAstar(One to Many)" msgstr "" -msgid "Licensing" +msgid "pgr_bdAstar(Many to One)" msgstr "" -msgid "The following licenses can be found in pgRouting:" +msgid "pgr_bdAstar(Many to Many)" msgstr "" -msgid "**License**" +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" -msgid "GNU General Public License v2.0 or later" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "" -msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "Boost Software License - Version 1.0" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "MIT-X License" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" + +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" -msgid "In general license information should be included in the header of each source file." +msgid "pgr_bdAstarCost(Combinations)" msgstr "" -msgid "Contributors" +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." msgstr "" -msgid "This Release Contributors" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "Individuals in this release v4.0.0 (in alphabetical order)" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "Translators (in alphabetical order)" +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Chinese:" +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" + +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." msgstr "" -msgid "Dapeng Wang" +msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." msgstr "" -msgid "Spanish:" +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "Vicky Vergara" +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." msgstr "" -msgid "Swedish:" +msgid "Output columns standardized to |short-generic-result|" msgstr "" -msgid "Daniel Nylander" +msgid "pgr_bdDijkstra(Combinations)" msgstr "" -msgid "Corporate Sponsors in this release (in alphabetical order)" +msgid "pgr_bdDijkstra(One to Many)" msgstr "" -msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgid "pgr_bdDijkstra(Many to One)" msgstr "" -msgid "`OSGeo `__" +msgid "pgr_bdDijkstra(Many to Many)" msgstr "" -msgid "`OSGeo UK `__" +msgid "Signature change on pgr_bdDijkstra(One to One)" msgstr "" -msgid "`Google Summer of Code `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "`HighGo Software `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "`Paragon Corporation `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Contributors Past & Present:" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Individuals (in alphabetical order)" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "" -msgid "Corporate Sponsors (in alphabetical order)" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" msgstr "" -msgid "Camptocamp" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" -msgid "CSIS (University of Tokyo)" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" msgstr "" -msgid "Georepublic" +msgid "Using a combinations table on an **undirected** graph" msgstr "" -msgid "Google Summer of Code" +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" -msgid "HighGo Software" +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" + +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" -msgid "iMaptools" +msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "Leopark" +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." msgstr "" -msgid "Orkney" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -msgid "OSGeo" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "OSGeo UK" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "" -msgid "Paragon Corporation" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Versaterm Inc." +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" msgstr "" -msgid "More Information" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgid "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" + +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." msgstr "" -msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" -msgid "PostGIS extension at the PostGIS project web site https://postgis.net." +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "Boost C++ source libraries at https://www.boost.org." +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" msgstr "" -msgid ":doc:`migration`" +msgid "Use with :doc:`pgr_TSP`." msgstr "" -msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "``pgr_bellmanFord`` - Experimental" msgstr "" -msgid "Availability" +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" -msgid "Version 4.0.0" +msgid "New experimental signature:" msgstr "" -msgid "Version 3.6.0" +msgid "pgr_bellmanFord(Combinations)" msgstr "" -msgid "Standardizing output columns to |nksp-result|" +msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "pgr_ksp(One to One)" +msgid "Process is valid for edges with both positive and negative edge weights." msgstr "" -msgid "Added ``start_vid`` and ``end_vid`` result columns." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." msgstr "" -msgid "New proposed signatures:" +msgid "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." msgstr "" -msgid "pgr_ksp(One to Many)" +msgid "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." msgstr "" -msgid "pgr_ksp(Many to One)" +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." msgstr "" -msgid "pgr_ksp(Many to Many)" +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." msgstr "" -msgid "pgr_ksp(Combinations)" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" -msgid "Version 2.1.0" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Signature change" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Old signature no longer supported" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Version 2.0.0" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Official function." +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "" -msgid "|Boost| Boost Graph Inside" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" msgstr "" -msgid "Boost Graph inside" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "" -msgid "Signatures" +msgid "Using a combinations table on an undirected graph" msgstr "" -msgid "Summary" +msgid "`Boost: Bellman Ford `__" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "Version 3.7.0" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." msgstr "" -msgid "**options:** ``[directed, heap_paths]``" +msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." msgstr "" -msgid "Returns set of |nksp-result|" +msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." msgstr "" -msgid "OR EMPTY SET" +msgid "This implementation work for both directed and undirected graphs." msgstr "" -msgid "Example" +msgid "Running time: :math:`\\Theta(VE)`" msgstr "" -msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." +msgid "Running space: :math:`\\Theta(VE)`" msgstr "" -msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgid "Throws when there are no edges in the graph" msgstr "" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" msgstr "" -msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgid "Returns set of ``(vid, centrality)``" msgstr "" -msgid "Using a combinations table on an directed graph" +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "The combinations table:" +msgid "Explanation" msgstr "" -msgid "The query:" +msgid "The betweenness centrality are between parenthesis." msgstr "" -msgid "Identifier of the destination vertex." +msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "" -msgid "**K**" +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." msgstr "" -msgid "Number of required paths." +msgid "Removing vertex :math:`6` will create three graph components." msgstr "" -msgid "KSP Optional parameters" +msgid "Removing vertex :math:`10` will create two graph components." msgstr "" -msgid "``heap_paths``" -msgstr "``heap_paths``" +msgid "``vid``" +msgstr "``vid``" -msgid "When ``false`` Returns at most K paths." -msgstr "" +msgid "``centrality``" +msgstr "``centrality``" -msgid "When ``true`` all the calculated paths while processing are returned." +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgid "`Boost: betweenness centrality `_" msgstr "" -msgid "Additional Examples" +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" + +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." msgstr "" -msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" +msgid "Result columns change:" msgstr "" -msgid "Also get the paths in the heap." +msgid "``n_seq`` is removed" msgstr "" -msgid "Get 2 paths using combinations table on an undirected graph" +msgid "``seq`` changed type to ``BIGINT``" msgstr "" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgid "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." msgstr "" -msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgid "Components are described by edges." msgstr "" -msgid "``pgr_TSP``" -msgstr "``pgr_TSP``" +msgid "``component`` ascending." +msgstr "" -msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgid "``edge`` ascending." msgstr "" -msgid "Availability:" +msgid "pgr_biconnectedComponents(`Edges SQL`_)" msgstr "" -msgid "Version 3.2.1" +msgid "Returns set of |result-component-E|" msgstr "" -msgid "Metric Algorithm from `Boost library `__" +msgid "The biconnected components of the graph" msgstr "" -msgid "Simulated Annealing Algorithm no longer supported" +msgid "``component``" +msgstr "``component``" + +msgid "Component identifier." msgstr "" -msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgid "Has the value of the minimum edge identifier in the component." msgstr "" -msgid "Version 2.3.0" +msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "Results change depending on input order of the `Matrix SQL`_" +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" -msgid "Negative costs are ignored." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "" -msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." msgstr "" -msgid "With ``directed => false``" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" -msgid "Will generate a graph that:" +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." msgstr "" -msgid "is undirected" +msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." msgstr "" -msgid "is fully connected (As long as the graph has one component)" +msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" msgstr "" -msgid "all traveling costs on edges obey the triangle inequality." +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "" -msgid "When ``start_vid = 0 OR end_vid = 0``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "With ``directed => true``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" msgstr "" -msgid "is directed" +msgid "`Boost: Breadth First Search `__" msgstr "" -msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -msgid "As an undirected graph is required, the directed graph is transformed as follows:" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgid "``pgr_bipartite`` - Experimental" msgstr "" -msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "" -msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" +msgid "Output columns standardized to |result_node_color|" msgstr "" -msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." msgstr "" -msgid "When the data does not come from an undirected graph or its not fully connected:" +msgid "The algorithm works in undirected graph only." msgstr "" -msgid "Missing values will be calculated with dijkstra algorithm." +msgid "The returned values are not ordered." msgstr "" -msgid "When the graph has more than one component:" +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." msgstr "" -msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgid "If graph is not bipartite then algorithm returns empty set." msgstr "" -msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." +msgid "pgr_bipartite(`Edges SQL`_)" msgstr "" -msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +msgid "When the graph is bipartite" msgstr "" -msgid "One cycle attempt to remove crossing edges is done to the TSP results." +msgid "Additional Example" msgstr "" -msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgid "The odd length cyclic graph can not be bipartite." msgstr "" -msgid "Returns set of |tsp-result|" +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." msgstr "" -msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgid "`Boost: is_bipartite `__" msgstr "" -msgid "`Matrix SQL`_ as described below" +msgid "`Wikipedia: bipartite graph `__" msgstr "" -msgid "``ANY-INTEGER``" +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" + +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." msgstr "" -msgid "``ANY-NUMERICAL``" +msgid "pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "Cost for going from start_vid to end_vid" +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" +msgid "Function promoted to proposed." msgstr "" -msgid "Row sequence." +msgid "Running time: Polynomial" msgstr "" -msgid "**node**" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "Identifier of the node/coordinate/point." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "``0`` for the last row in the tour sequence." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "``0`` for the first row in the tour sequence." +msgid "Returns set of |result-flow|" msgstr "" -msgid "Start from vertex :math:`1`" +msgid "From vertex :math:`11` to vertex :math:`12`" msgstr "" -msgid "**Line 6** ``start_vid => 1``" +msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "Using points of interest to generate an asymmetric matrix." +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -msgid "To generate an asymmetric matrix:" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" +msgid "`Boost: Boykov Kolmogorov max flow `__" msgstr "" -msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" -msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "" -msgid "Triangle inequality might not be satisfied." +msgid "Version 4.0.0:" msgstr "" -msgid "``start_id != 0 AND end_id != 0``" +msgid "Standardizing output columns to |result-spantree|" msgstr "" -msgid "Connected incomplete data" +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "" -msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgid "The implementation will work on any type of graph." msgstr "" -msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." msgstr "" -msgid "``pgr_TSPeuclidean``" -msgstr "``pgr_TSPeuclidean``" - -msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgid "Running time: :math:`O(E + V)`" msgstr "" -msgid "Using `Boost: metric TSP approx `__" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" msgstr "" -msgid "Name change from pgr_eucledianTSP" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgstr "" -msgid "New official function." +msgid "**options:** ``[max_depth, directed]``" msgstr "" -msgid "Results change depending on input order of the `Coordinates SQL`_" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" msgstr "" -msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" -msgid "The coordinates are quite similar for the same identifier, for example ::" +msgid "DFS optional parameters" msgstr "" -msgid "The coordinates are quite different for the same identifier, for example ::" +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." msgstr "" -msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." msgstr "" -msgid "With default values" +msgid "The resulting traversal is different." msgstr "" -msgid "`Coordinates SQL`_" +msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." msgstr "" -msgid "`Coordinates SQL`_ as described below" +msgid "|ascending| |descending|" msgstr "" -msgid "Coordinates SQL" +msgid "ascending" msgstr "" -msgid "``x``" -msgstr "``x``" +msgid "descending" +msgstr "" -msgid "X value of the coordinate." +msgid "`Wikipedia: Breadth First Search algorithm `__" msgstr "" -msgid "``y``" -msgstr "``y``" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "Y value of the coordinate." +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." msgstr "" -msgid "Test 29 cities of Western Sahara" +msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." msgstr "" -msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgid "``edge`` ascending" msgstr "" -msgid "Creating a table for the data and storing the data" +msgid "Running time: :math:`O(E * (V + E))`" msgstr "" -msgid "Adding a geometry (for visual purposes)" +msgid "pgr_bridges(`Edges SQL`_)" msgstr "" -msgid "Total tour cost" +msgid "Returns set of |result-edge|" msgstr "" -msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" +msgid "The bridges of the graph" msgstr "" -msgid "Getting a geometry of the tour" +msgid "Identifier of the edge that is a bridge." msgstr "" -msgid "Visual results" +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgid "`Boost: Connected components `__" msgstr "" -msgid "``pgr_aStar`` — Shortest path using the A* algorithm." +msgid "``pgr_chinesePostman`` - Experimental" msgstr "" -msgid "Standardizing output columns to |short-generic-result|" +msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." msgstr "" -msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "Returns ``EMPTY SET`` on a disconnected graph" msgstr "" -msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgid "pgr_chinesePostman(`Edges SQL`_)" msgstr "" -msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgid "Returns set of |result-1-1-no-seq|" msgstr "" -msgid "New proposed signature:" +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "" -msgid "pgr_aStar(Combinations)" +msgid "Sequential value starting from ``1``" msgstr "" -msgid "Version 2.4.0" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." msgstr "" -msgid "pgr_aStar(One to Many)" +msgid "Aggregate cost from ``start_v`` to ``node``." msgstr "" -msgid "pgr_aStar(Many to One)" +msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" -msgid "pgr_aStar(Many to Many)" +msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." msgstr "" -msgid "Signature change on pgr_aStar(One to One)" +msgid "Return value when the graph if disconnected" msgstr "" -msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "RETURNS ``FLOAT``" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" + +msgid "Minimum costs of a circuit path." msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" + +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." msgstr "" -msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Components are described by vertices" msgstr "" -msgid "**options:** ``[directed, heuristic, factor, epsilon]``" +msgid "``component`` ascending" msgstr "" -msgid "Returns set of |short-generic-result|" +msgid "pgr_connectedComponents(`Edges SQL`_)" msgstr "" -msgid "Optional parameters are `named parameters` and have a default value." +msgid "Returns set of |result-component-V|" msgstr "" -msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" +msgid "The connected components of the graph" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgid "Has the value of the minimum node identifier in the component." msgstr "" -msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgid "Identifier of the vertex that belongs to the ``component``." msgstr "" -msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgid "Connecting disconnected components" msgstr "" -msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgid "wikipedia: `Connected component `__" msgstr "" -msgid "Example 1" +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" + +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "Demonstration of repeated values are ignored, and result is sorted." +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "Example 2" +msgid "Version 3.8.0" msgstr "" -msgid "Making **start vids** the same as **end vids**." +msgid "New signature:" msgstr "" -msgid "Example 3" +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." msgstr "" -msgid "Manually assigned vertex combinations." +msgid "New name and order of optional parameters." msgstr "" -msgid "``pgr_aStarCost``" -msgstr "``pgr_aStarCost``" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "" -msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgid "Name change from ``pgr_contractGraph``" msgstr "" -msgid "pgr_aStarCost(Combinations)" +msgid "Bug fixes" msgstr "" -msgid "New proposed function." +msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." msgstr "" -msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." +msgid "Does not return the full contracted graph." msgstr "" -msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" +msgid "Only changes on the graph are returned." msgstr "" -msgid "For undirected graphs, the results are symmetric." +msgid "The returned values include:" msgstr "" -msgid "The returned values are ordered in ascending order:" +msgid "The new edges generated by linear contraction." msgstr "" -msgid "`start_vid` ascending" +msgid "The modified vertices generated by dead end contraction." msgstr "" -msgid "`end_vid` ascending" +msgid "The returned values are ordered as follows:" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "column ``id`` ascending when its a modified vertex." msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "Currently there are two types of contraction methods included in this function:" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." msgstr "" -msgid "Returns set of |matrix-result|" +msgid "pgr_contraction(`Edges SQL`_, [**options**])" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgid "**options:** ``[directed, methods, cycles, forbidden]``" msgstr "" -msgid "``pgr_aStarCostMatrix``" -msgstr "``pgr_aStarCostMatrix``" +msgid "Returns set of |result-contract|" +msgstr "" -msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgid "Dead end and linear contraction in that order on an undirected graph." msgstr "" -msgid "Using internally the :doc:`pgr_aStar` algorithm" +msgid "Contraction optional parameters" msgstr "" -msgid "Returns a cost matrix." +msgid "``methods``" +msgstr "``methods``" + +msgid "``INTEGER[]``" msgstr "" -msgid "No ordering is performed" +msgid "``ARRAY[1,2]``" msgstr "" -msgid "let `v` and `u` are nodes on the graph:" +msgid "Ordered contraction operations." msgstr "" -msgid "when there is no path from `v` to `u`:" +msgid "1 = Dead end contraction" msgstr "" -msgid "cost from `v` to `u` is :math:`\\inf`" +msgid "2 = Linear contraction" msgstr "" -msgid "when :math:`v = u` then" +msgid "``cycles``" +msgstr "``cycles``" + +msgid ":math:`1`" msgstr "" -msgid "cost from `v` to `u` is :math:`0`" +msgid "Number of times the contraction methods will be performed." msgstr "" -msgid "When the graph is **undirected** the cost matrix is symmetric" +msgid "``forbidden``" +msgstr "``forbidden``" + +msgid "``BIGINT[]``" msgstr "" -msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "``ARRAY[]::BIGINT[]``" msgstr "" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgid "Identifiers of vertices forbidden for contraction." msgstr "" -msgid "Use with :doc:`pgr_TSP`" +msgid "The function returns a single row. The columns of the row are:" msgstr "" -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "``type``" +msgstr "``type``" -msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgid "Type of the row." msgstr "" -msgid "Result columns change: ``seq`` is removed" +msgid "``v`` when the row is a vertex." msgstr "" -msgid "Version 2.5.0" +msgid "Column ``id`` has a positive value." msgstr "" -msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." +msgid "``e`` when the row is an edge." msgstr "" -msgid "Works for **undirected** graphs." +msgid "Column ``id`` has a negative value." msgstr "" -msgid "``node`` ascending" +msgid "All numbers on this column are ``DISTINCT``" msgstr "" -msgid "Running time: :math:`O(V + E)`" +msgid "When ``type`` = **'v'**." msgstr "" -msgid "pgr_articulationPoints(`Edges SQL`_)" +msgid "Identifier of the modified vertex." msgstr "" -msgid "Returns set of |result-node|" +msgid "When ``type`` = **'e'**." msgstr "" -msgid "The articulation points of the graph" +msgid "Decreasing sequence starting from **-1**." msgstr "" -msgid "Nodes in red are the articulation points." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." msgstr "" -msgid "Identifier of the vertex." +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" + +msgid "Array of contracted vertex identifiers." msgstr "" -msgid "`Boost: Biconnected components & articulation points `__" +msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" -msgid "wikipedia: `Biconnected component `__" +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "``pgr_bandwidth`` - Experimental" +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" -msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Only dead end contraction" msgstr "" -msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" +msgid "Only linear contraction" msgstr "" -msgid "The bandwidth is the maximum of all these distances" +msgid "The cycle" msgstr "" -msgid "The implementation is for undirected graphs" +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." msgstr "" -msgid "Run time is 0.160789 seconds" +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." msgstr "" -msgid "pgr_bandwidth(`Edges SQL`_)" +msgid "Contracting sample data" msgstr "" -msgid "Returns ``BIGINT``" +msgid "In this section, building and using a contracted graph will be shown by example." msgstr "" -msgid "For an undirected graph with edges." +msgid "The :doc:`sampledata` for an undirected graph is used" msgstr "" -msgid "Returns a bigint ``(pgr_bandwidth)``" +msgid "a dead end operation first followed by a linear operation." msgstr "" -msgid "``pgr_bandwidth``" -msgstr "``pgr_bandwidth``" - -msgid "gives the bandwidth of the graph." +msgid "Construction of the graph in the database" msgstr "" -msgid "Undirected graph with edges before optimization." +msgid "The original graph:" msgstr "" -msgid "Undirected graph with edges after optimization." +msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." msgstr "" -msgid "`Boost: bandwidth `_" +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." msgstr "" -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" - -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgid "After doing the dead end contraction operation:" msgstr "" -msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "After doing the linear contraction operation to the graph above:" msgstr "" -msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgid "The process to create the contraction graph on the database:" msgstr "" -msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgid "Add additional columns" msgstr "" -msgid "pgr_bdAstar(Combinations)" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "" -msgid "pgr_bdAstar(One to Many)" +msgid "Column." msgstr "" -msgid "pgr_bdAstar(Many to One)" +msgid "The vertices set belonging to the vertex/edge" msgstr "" -msgid "pgr_bdAstar(Many to Many)" -msgstr "" +msgid "``is_contracted``" +msgstr "``is_contracted``" -msgid "Signature change on pgr_bdAstar(One to One)" +msgid "On the vertex table" msgstr "" -msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" +msgid "``is_new``" +msgstr "``is_new``" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "On the edge table" msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." msgstr "" -msgid "``pgr_bdAstarCost``" -msgstr "``pgr_bdAstarCost``" +msgid "Store contraction information" +msgstr "" -msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgid "Store the contraction results in a table." msgstr "" -msgid "pgr_bdAstarCost(Combinations)" +msgid "Update the edges and vertices tables" msgstr "" -msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Insert the new edges generated by pgr_contraction." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "The contracted graph" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Vertices that belong to the contracted graph." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Edges that belong to the contracted graph." msgstr "" -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +msgid "Visually:" +msgstr "" -msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." +msgid "Using the contracted graph" msgstr "" -msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" msgstr "" -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" msgstr "" -msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgid "Case 1: Both source and target belong to the contracted graph." msgstr "" -msgid "pgr_bdDijkstra(Combinations)" +msgid "Case 2: Source and/or target belong to an edge subgraph." msgstr "" -msgid "pgr_bdDijkstra(One to Many)" +msgid "Case 3: Source and/or target belong to a vertex." msgstr "" -msgid "pgr_bdDijkstra(Many to One)" +msgid "The final application should consider all of those cases." msgstr "" -msgid "pgr_bdDijkstra(Many to Many)" +msgid "Create a view (or table) of the contracted graph:" msgstr "" -msgid "Signature change on pgr_bdDijkstra(One to One)" +msgid "Create the function that will use the contracted graph." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "A node is considered a dead end node when:" msgstr "" -msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgid "On undirected graphs:" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgid "The number of adjacent vertices is 1." msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgid "On directed graphs:" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgid "When there is only one adjacent vertex or" msgstr "" -msgid "Using a combinations table on an **undirected** graph" +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "" -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" msgstr "" -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +msgid "**options:** ``[directed, forbidden]``" +msgstr "" -msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgid "Dead end contraction on an undirected graph." msgstr "" -msgid "pgr_bdDijkstraCost(Combinations)" +msgid "The green nodes are dead end nodes." msgstr "" -msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "**Empty**" msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgid "Value = ``e`` indicating the row is an edge." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "A pseudo `id` of the edge." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgid "Identifier of the source vertex of the current edge." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Identifier of the target vertex of the current edge." msgstr "" -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "Weight of the current edge." +msgstr "" -msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgid "Dead end vertex on undirected graph" msgstr "" -msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgid "They have only one adjacent node." msgstr "" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "Dead end vertex on directed graph" msgstr "" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgid "The green nodes are dead end nodes" msgstr "" -msgid "Use with :doc:`pgr_TSP`." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" -msgid "``pgr_bellmanFord`` - Experimental" +msgid "Node" msgstr "" -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgid "Adjacent nodes" msgstr "" -msgid "pgr_bellmanFord(Combinations)" +msgid "Dead end" msgstr "" -msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." +msgid "Reason" msgstr "" -msgid "Process is valid for edges with both positive and negative edge weights." +msgid ":math:`6`" msgstr "" -msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgid ":math:`\\{1\\}`" msgstr "" -msgid "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." +msgid "Yes" msgstr "" -msgid "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." +msgid "Has only one adjacent node." msgstr "" -msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgid ":math:`7`" msgstr "" -msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgid ":math:`\\{2\\}`" msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +msgid ":math:`8`" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid ":math:`\\{2, 3\\}`" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Has more than one adjacent node and all edges are incoming." msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid ":math:`\\{4\\}`" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid ":math:`10`" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid ":math:`\\{4, 5\\}`" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "No" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "Has more than one adjacent node and all edges are outgoing." msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" +msgid ":math:`1,2,3,4,5`" msgstr "" -msgid "Using a combinations table on an undirected graph" +msgid "Many adjacent nodes." msgstr "" -msgid "`Boost: Bellman Ford `__" +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." msgstr "" -msgid "``pgr_betweennessCentrality`` - Experimental" +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "" -msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgid "Step by step dead end contraction" msgstr "" -msgid "Version 3.7.0" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" msgstr "" -msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." msgstr "" -msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." +msgid "Creating the contracted graph" msgstr "" -msgid "This implementation work for both directed and undirected graphs." +msgid "Steps for the creation of the contracted graph" msgstr "" -msgid "Running time: :math:`\\Theta(VE)`" +msgid "Add additional columns." msgstr "" -msgid "Running space: :math:`\\Theta(VE)`" +msgid "Save results into a table." msgstr "" -msgid "Throws when there are no edges in the graph" +msgid "The contracted vertices are not part of the contracted graph." msgstr "" -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgid "Using when departure and destination are in the contracted graph" msgstr "" -msgid "Returns set of ``(vid, centrality)``" +msgid "Using when departure/destination is not in the contracted graph" msgstr "" -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgid "Using when departure and destination are not in the contracted graph" msgstr "" -msgid "Explanation" +msgid "``pgr_contractionHierarchies`` - Experimental" msgstr "" -msgid "The betweenness centrality are between parenthesis." +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." msgstr "" -msgid "The leaf vertices have betweenness centrality :math:`0`." +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." msgstr "" -msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." msgstr "" -msgid "Removing vertex :math:`6` will create three graph components." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." msgstr "" -msgid "Removing vertex :math:`10` will create two graph components." +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." msgstr "" -msgid "``vid``" -msgstr "``vid``" +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgstr "" -msgid "``centrality``" -msgstr "``centrality``" +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgstr "" -msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgid "The process is done on graphs having only edges with positive costs." msgstr "" -msgid "`Boost: betweenness centrality `_" +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." msgstr "" -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgstr "" -msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +msgid "added shortcut edges, with negative identifiers;" msgstr "" -msgid "Result columns change:" +msgid "contracted nodes with an order." msgstr "" -msgid "``n_seq`` is removed" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "" -msgid "``seq`` changed type to ``BIGINT``" +msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" msgstr "" -msgid "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." +msgid "Returns set of |result-contraction-hierarchies|" msgstr "" -msgid "Components are described by edges." +msgid "Contraction hierarchies optional parameters" msgstr "" -msgid "``component`` ascending." +msgid "True if the graph is directed, False otherwise." msgstr "" -msgid "``edge`` ascending." +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "" -msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgid "Type of the ``id``." msgstr "" -msgid "Returns set of |result-component-E|" +msgid "Column ``id`` has a positive value" msgstr "" -msgid "The biconnected components of the graph" +msgid "Column ``id`` has a negative value" msgstr "" -msgid "``component``" -msgstr "``component``" +msgid "``metric``" +msgstr "``metric``" -msgid "Component identifier." +msgid "``vertex_order``" +msgstr "``vertex_order``" + +msgid "On an undirected graph" msgstr "" -msgid "Has the value of the minimum edge identifier in the component." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "" -msgid "Identifier of the edge that belongs to the ``component``." +msgid "building contraction hierarchies on the whole graph" msgstr "" -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." msgstr "" -msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "" -msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgid "We obtain the contracted graph above:" msgstr "" -msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." msgstr "" -msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." +msgid "On an undirected graph with forbidden vertices" msgstr "" -msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" +msgid "building contraction with a set of forbidden vertices" msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" +msgid "Contraction process steps details" msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Shortcut building process" msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Initialize the queue with a first vertices order" msgstr "" -msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" msgstr "" -msgid "`Boost: Breadth First Search `__" +msgid ":math:`v`" msgstr "" -msgid "https://cp-algorithms.com/graph/01_bfs.html" +msgid ":math:`\\{p, r, u\\}`" msgstr "" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid ":math:`p`" msgstr "" -msgid "``pgr_bipartite`` - Experimental" +msgid ":math:`\\{u, v\\}`" msgstr "" -msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +msgid ":math:`u`" msgstr "" -msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgid ":math:`\\{p, v, w\\}`" msgstr "" -msgid "The algorithm works in undirected graph only." +msgid ":math:`r`" msgstr "" -msgid "The returned values are not ordered." +msgid ":math:`\\{v, w\\}`" msgstr "" -msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgid ":math:`w`" msgstr "" -msgid "If graph is not bipartite then algorithm returns empty set." +msgid ":math:`\\{r, u\\}`" msgstr "" -msgid "pgr_bipartite(`Edges SQL`_)" +msgid "Adjacent edges are removed." msgstr "" -msgid "When the graph is bipartite" +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." msgstr "" -msgid "Additional Example" +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." msgstr "" -msgid "The odd length cyclic graph can not be bipartite." +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." msgstr "" -msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "" -msgid "Edges in blue represent odd length cycle subgraph." +msgid "Build the final vertex order" msgstr "" -msgid "`Boost: is_bipartite `__" +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." msgstr "" -msgid "`Wikipedia: bipartite graph `__" +msgid "Add shortcuts to the initial graph" msgstr "" -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgstr "" -msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgid "Use the contraction" msgstr "" -msgid "pgr_boykovKolmogorov(Combinations)" +msgid "Build the contraction" msgstr "" -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgid "Add shortcuts and hierarchy in the existing tables" msgstr "" -msgid "Function promoted to proposed." +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "" -msgid "Running time: Polynomial" +msgid "Update and insert the results in the two tables." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Use a Dijkstra shortest path algorithm on it" msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgid "``pgr_contractionLinear`` - Proposed" msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" msgstr "" -msgid "Returns set of |result-flow|" +msgid "Linear contraction on an undirected graph." msgstr "" -msgid "From vertex :math:`11` to vertex :math:`12`" +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "" -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" +msgid "All edges adjacent will not be part of the contracted graph." msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" +msgid "The red lines will be new edges of the contracted graph." msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "**contraction Order**" msgstr "" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." msgstr "" -msgid "`Boost: Boykov Kolmogorov max flow `__" +msgid "A node connects two (or more) `linear` edges when" msgstr "" -msgid "``pgr_breadthFirstSearch`` - Experimental" +msgid "The number of adjacent vertices is 2." msgstr "" -msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgid "In case of a directed graph, a node is considered a `linear` node when" msgstr "" -msgid "Version 4.0.0:" +msgid "Linearity is symmetrical." msgstr "" -msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgid "Linearity is not symmetrical" msgstr "" -msgid "The implementation will work on any type of graph." +msgid "Graph where linearity is not symmetrical." msgstr "" -msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "" -msgid "Running time: :math:`O(E + V)`" +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "The three edges can be replaced by one undirected edge" msgstr "" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "Edge :math:`1 - 3`." msgstr "" -msgid "**options:** ``[max_depth, directed]``" +msgid "With cost: :math:`4`." msgstr "" -msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." msgstr "" -msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgid "Linearity is symmetrical" msgstr "" -msgid "DFS optional parameters" +msgid "Graph where linearity is symmetrical." msgstr "" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." +msgid "The four edges can be replaced by two directed edges." msgstr "" -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgid "Edge :math:`3 - 1`." msgstr "" -msgid "The resulting traversal is different." +msgid "With cost: :math:`6`." msgstr "" -msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." +msgid "The four edges can be replaced by one undirected edge." msgstr "" -msgid "|ascending| |descending|" +msgid "Step by step linear contraction" msgstr "" -msgid "ascending" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" msgstr "" -msgid "descending" +msgid "Contracting vertex :math:`3`," msgstr "" -msgid "`Wikipedia: Breadth First Search algorithm `__" +msgid "The vertex :math:`3` is removed from the graph" msgstr "" -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "" -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" -msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." +msgid "Contracting vertex :math:`2`:" msgstr "" -msgid "``edge`` ascending" +msgid "The vertex :math:`2` is removed from the graph" msgstr "" -msgid "Running time: :math:`O(E * (V + E))`" +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." msgstr "" -msgid "pgr_bridges(`Edges SQL`_)" +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "" -msgid "Returns set of |result-edge|" +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." msgstr "" -msgid "The bridges of the graph" +msgid "Create the contracted graph." msgstr "" -msgid "Identifier of the edge that is a bridge." +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" -msgid "`Boost: Connected components `__" +msgid "Version 3.4.0" msgstr "" -msgid "``pgr_chinesePostman`` - Experimental" +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." msgstr "" -msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." msgstr "" -msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "pgr_chinesePostman(`Edges SQL`_)" +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" -msgid "Returns set of |result-1-1-no-seq|" +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" msgstr "" -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgid "where :math:`|V|` is the number of vertices," msgstr "" -msgid "Sequential value starting from ``1``" +msgid ":math:`m` is the maximum degree of the vertices in the graph." msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" msgstr "" -msgid "Aggregate cost from ``start_v`` to ``node``." +msgid "Returns set of |result_node_order|" msgstr "" -msgid "``pgr_chinesePostmanCost`` - Experimental" +msgid "Graph ordering of pgRouting :doc:`sampledata`" msgstr "" -msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgid "Returns set of ``(seq, node)``" msgstr "" -msgid "Return value when the graph if disconnected" +msgid "Sequence of the order starting from 1." msgstr "" -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgid "New ordering in reverse order." msgstr "" -msgid "RETURNS ``FLOAT``" +msgid "`Boost: Cuthill-McKee Ordering `__" msgstr "" -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "" -msgid "Minimum costs of a circuit path." +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "" + +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." msgstr "" -msgid "``pgr_connectedComponents``" -msgstr "``pgr_connectedComponents``" - -msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgid "pgr_dagShortestPath(Combinations)" msgstr "" -msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." msgstr "" -msgid "Components are described by vertices" +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." msgstr "" -msgid "``component`` ascending" +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." msgstr "" -msgid "pgr_connectedComponents(`Edges SQL`_)" +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "Returns set of |result-component-V|" +msgid "The `agg_cost` the non included values `(v, v)` is `0`" msgstr "" -msgid "The connected components of the graph" +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "Has the value of the minimum node identifier in the component." +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" msgstr "" -msgid "Identifier of the vertex that belongs to the ``component``." +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "Connecting disconnected components" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "wikipedia: `Connected component `__" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "" -msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "Version 3.8.0" +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" msgstr "" -msgid "New signature:" +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" msgstr "" -msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "" -msgid "New name and order of optional parameters." +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "" -msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "Return columns" msgstr "" -msgid "Name change from ``pgr_contractGraph``" +msgid "Making **start_vids** the same as **end_vids**" msgstr "" -msgid "Bug fixes" +msgid "`Boost: DAG shortest paths `__" msgstr "" -msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." +msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" -msgid "Does not return the full contracted graph." +msgid "``pgr_degree``" +msgstr "``pgr_degree``" + +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." msgstr "" -msgid "Only changes on the graph are returned." +msgid "Error messages adjustment." msgstr "" -msgid "The returned values include:" +msgid "New signature with only Edges SQL." msgstr "" -msgid "The new edges generated by linear contraction." +msgid "Calculates the degree of the vertices of an undirected graph" msgstr "" -msgid "The modified vertices generated by dead end contraction." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." msgstr "" -msgid "The returned values are ordered as follows:" +msgid "A loop contributes 2 to a vertex's degree." msgstr "" -msgid "column ``id`` ascending when its a modified vertex." +msgid "A vertex with degree 0 is called an isolated vertex." msgstr "" -msgid "column ``id`` with negative numbers descending when its a new edge." +msgid "Isolated vertex is not part of the result" msgstr "" -msgid "Currently there are two types of contraction methods included in this function:" +msgid "Vertex not participating on the subgraph is considered and isolated vertex." msgstr "" -msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." msgstr "" -msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgid "The code can be used as base code for the particular application requirements." msgstr "" -msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgid "No ordering is performed." msgstr "" -msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" msgstr "" -msgid "Returns set of |result-contract|" +msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" msgstr "" -msgid "Dead end and linear contraction in that order on an undirected graph." +msgid "RETURNS SETOF |result-degree|" msgstr "" -msgid "Contraction optional parameters" +msgid "Edges" msgstr "" -msgid "``methods``" -msgstr "``methods``" +msgid "example" +msgstr "" -msgid "``INTEGER[]``" +msgid "Get the degree of the vertices defined on the edges table" msgstr "" -msgid "``ARRAY[1,2]``" +msgid "Edges and Vertices" msgstr "" -msgid "Ordered contraction operations." +msgid "Extracting the vertex information" msgstr "" -msgid "1 = Dead end contraction" +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "" -msgid "2 = Linear contraction" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" -msgid "``cycles``" -msgstr "``cycles``" +msgid "Calculate the degree of the nodes:" +msgstr "" -msgid ":math:`1`" +msgid "`Vertex SQL`_" msgstr "" -msgid "Number of times the contraction methods will be performed." +msgid "`Vertex SQL`_ as described below" msgstr "" -msgid "``forbidden``" -msgstr "``forbidden``" +msgid "``dryrun``" +msgstr "``dryrun``" -msgid "``BIGINT[]``" +msgid "When true do not process and get in a NOTICE the resulting query." msgstr "" -msgid "``ARRAY[]::BIGINT[]``" +msgid "For the `Edges and Vertices`_ signature:" msgstr "" -msgid "Identifiers of vertices forbidden for contraction." +msgid "For the `Edges`_ signature:" msgstr "" -msgid "The function returns a single row. The columns of the row are:" +msgid "Vertex SQL" msgstr "" -msgid "``type``" -msgstr "``type``" +msgid "``in_edges``" +msgstr "``in_edges``" -msgid "Type of the row." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." msgstr "" -msgid "``v`` when the row is a vertex." +msgid "When missing, ``out_edges`` must exist." msgstr "" -msgid "Column ``id`` has a positive value." +msgid "``out_edges``" +msgstr "``out_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." msgstr "" -msgid "``e`` when the row is an edge." +msgid "When missing, ``in_edges`` must exist." msgstr "" -msgid "Column ``id`` has a negative value." +msgid "Vertex identifier" msgstr "" -msgid "All numbers on this column are ``DISTINCT``" +msgid "``degree``" +msgstr "``degree``" + +msgid "Number of edges that are incident to the vertex ``id``" msgstr "" -msgid "When ``type`` = **'v'**." +msgid "Degree of a loop" msgstr "" -msgid "Identifier of the modified vertex." +msgid "Using the `Edges`_ signature." msgstr "" -msgid "When ``type`` = **'e'**." +msgid "Using the `Edges and Vertices`_ signature." msgstr "" -msgid "Decreasing sequence starting from **-1**." +msgid "Degree of a sub graph" msgstr "" -msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgid "For the following is a subgraph of the :doc:`sampledata`:" msgstr "" -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr "" -msgid "Array of contracted vertex identifiers." +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" msgstr "" -msgid "When ``type`` = **'v'**: :math:`-1`" +msgid "The vertices not participating on the edge are considered isolated" msgstr "" -msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgid "their degree is 0 in the subgraph and" msgstr "" -msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgid "their degree is not shown in the output." msgstr "" -msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgid "Using a vertex table" msgstr "" -msgid "Only dead end contraction" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." msgstr "" -msgid "Only linear contraction" +msgid "Extract the vertex information and save into a table:" msgstr "" -msgid "The cycle" +msgid "Dry run execution" msgstr "" -msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." msgstr "" -msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgid "The results can be used as base code to make a refinement based on the backend development needs." msgstr "" -msgid "Contracting sample data" +msgid "Finding dead ends" msgstr "" -msgid "In this section, building and using a contracted graph will be shown by example." +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." msgstr "" -msgid "The :doc:`sampledata` for an undirected graph is used" +msgid "The degree of a dead end is 1." msgstr "" -msgid "a dead end operation first followed by a linear operation." +msgid "Finding linear vertices" msgstr "" -msgid "Construction of the graph in the database" +msgid "The degree of a linear vertex is 2." msgstr "" -msgid "The original graph:" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "" -msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." +msgid ":doc:`pgr_extractVertices`" msgstr "" -msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "" -msgid "After doing the dead end contraction operation:" +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." msgstr "" -msgid "After doing the linear contraction operation to the graph above:" +msgid "Version 3.3.0" msgstr "" -msgid "The process to create the contraction graph on the database:" +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." msgstr "" -msgid "Add additional columns" +msgid "The implementation works for both **directed** and **undirected** graphs." msgstr "" -msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." msgstr "" -msgid "Column." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." msgstr "" -msgid "The vertices set belonging to the vertex/edge" +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." msgstr "" -msgid "``is_contracted``" -msgstr "``is_contracted``" +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "" -msgid "On the vertex table" +msgid "The aggregate cost of traversal is not guaranteed to be minimal." msgstr "" -msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgid "The returned values are ordered in ascending order of `start_vid`." msgstr "" -msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgid "Depth First Search Running time: :math:`O(E + V)`" msgstr "" -msgid "``is_new``" -msgstr "``is_new``" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "" -msgid "On the edge table" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgstr "" -msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgid "**options:** ``[directed, max_depth]``" msgstr "" -msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" -msgid "Store contraction information" +msgid "`Boost: Depth First Search `__" msgstr "" -msgid "Store the contraction results in a table." +msgid "`Boost: Undirected DFS `__" msgstr "" -msgid "Update the edges and vertices tables" +msgid "`Wikipedia: Depth First Search algorithm `__" msgstr "" -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" -msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgid "Version 3.5.0" msgstr "" -msgid "Insert the new edges generated by pgr_contraction." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "The contracted graph" +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." msgstr "" -msgid "Vertices that belong to the contracted graph." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" -msgid "Edges that belong to the contracted graph." +msgid "Version 3.1.0" msgstr "" -msgid "Visually:" +msgid "pgr_dijkstra(Combinations)" msgstr "" -msgid "Using the contracted graph" +msgid "Version 2.2.0" msgstr "" -msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgid "pgr_dijkstra(One to Many)" msgstr "" -msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgid "pgr_dijkstra(Many to One)" msgstr "" -msgid "Case 1: Both source and target belong to the contracted graph." +msgid "pgr_dijkstra(Many to Many)" msgstr "" -msgid "Case 2: Source and/or target belong to an edge subgraph." +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" -msgid "Case 3: Source and/or target belong to a vertex." +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "The final application should consider all of those cases." +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Create a view (or table) of the contracted graph:" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Create the function that will use the contracted graph." +msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" -msgid "``pgr_contractionDeadEnd`` - Proposed" +msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" -msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "Directed graph with cost and reverse cost columns" msgstr "" -msgid "A node is considered a dead end node when:" +msgid "1) Path from :math:`6` to :math:`10`" msgstr "" -msgid "On undirected graphs:" +msgid "2) Path from :math:`6` to :math:`7`" msgstr "" -msgid "The number of adjacent vertices is 1." +msgid "3) Path from :math:`12` to :math:`10`" msgstr "" -msgid "On directed graphs:" +msgid "4) Path from :math:`12` to :math:`7`" msgstr "" -msgid "When there is only one adjacent vertex or" +msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" msgstr "" -msgid "When all edges are incoming regardless of the number of adjacent vertices." +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" msgstr "" -msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" msgstr "" -msgid "**options:** ``[directed, forbidden]``" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" msgstr "" -msgid "Dead end contraction on an undirected graph." +msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" msgstr "" -msgid "The green nodes are dead end nodes." +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgstr "" -msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" -msgid "**Empty**" +msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" -msgid "Value = ``e`` indicating the row is an edge." +msgid "Undirected graph with cost and reverse cost columns" msgstr "" -msgid "A pseudo `id` of the edge." +msgid "9) Path from :math:`6` to :math:`10`" msgstr "" -msgid "Identifier of the source vertex of the current edge." +msgid "10) Path from :math:`6` to :math:`7`" msgstr "" -msgid "Identifier of the target vertex of the current edge." +msgid "11) Path from :math:`12` to :math:`10`" msgstr "" -msgid "Weight of the current edge." +msgid "12) Path from :math:`12` to :math:`7`" msgstr "" -msgid "Dead end vertex on undirected graph" +msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" msgstr "" -msgid "They have only one adjacent node." +msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" msgstr "" -msgid "Dead end vertex on directed graph" +msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" msgstr "" -msgid "The green nodes are dead end nodes" +msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" msgstr "" -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "For **directed** graphs only with ``cost`` column" msgstr "" -msgid "Node" +msgid "Directed graph only with cost column" msgstr "" -msgid "Adjacent nodes" +msgid "17) Path from :math:`6` to :math:`10`" msgstr "" -msgid "Dead end" +msgid "18) Path from :math:`6` to :math:`7`" msgstr "" -msgid "Reason" +msgid "19) Path from :math:`12` to :math:`10`" msgstr "" -msgid ":math:`6`" +msgid "20) Path from :math:`12` to :math:`7`" msgstr "" -msgid ":math:`\\{1\\}`" +msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" msgstr "" -msgid "Yes" +msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" msgstr "" -msgid "Has only one adjacent node." +msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" msgstr "" -msgid ":math:`7`" +msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" msgstr "" -msgid ":math:`\\{2\\}`" +msgid "For **undirected** graphs only with ``cost`` column" msgstr "" -msgid ":math:`8`" +msgid "Undirected graph only with cost column" msgstr "" -msgid ":math:`\\{2, 3\\}`" +msgid "25) Path from :math:`6` to :math:`10`" msgstr "" -msgid "Has more than one adjacent node and all edges are incoming." +msgid "26) Path from :math:`6` to :math:`7`" msgstr "" -msgid ":math:`\\{4\\}`" +msgid "27) Path from :math:`12` to :math:`10`" msgstr "" -msgid ":math:`10`" +msgid "28) Path from :math:`12` to :math:`7`" msgstr "" -msgid ":math:`\\{4, 5\\}`" +msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" msgstr "" -msgid "No" +msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" msgstr "" -msgid "Has more than one adjacent node and all edges are outgoing." +msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" msgstr "" -msgid ":math:`1,2,3,4,5`" +msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" msgstr "" -msgid "Many adjacent nodes." +msgid "Equvalences between signatures" msgstr "" -msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" -msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgid "33) Using `One to One`_" msgstr "" -msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." +msgid "34) Using `One to Many`_" msgstr "" -msgid "Step by step dead end contraction" +msgid "35) Using `Many to One`_" msgstr "" -msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgid "36) Using `Many to Many`_" msgstr "" -msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgid "37) Using `Combinations`_" msgstr "" -msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgid "`Boost: Dijkstra shortest paths `__" msgstr "" -msgid "Creating the contracted graph" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" -msgid "Steps for the creation of the contracted graph" -msgstr "" +msgid "``pgr_dijkstraCost``" +msgstr "``pgr_dijkstraCost``" -msgid "Add additional columns." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." msgstr "" -msgid "Save results into a table." +msgid "pgr_dijkstraCost(Combinations)" msgstr "" -msgid "The contracted vertices are not part of the contracted graph." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." msgstr "" -msgid "Using when departure and destination are in the contracted graph" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Using when departure/destination is not in the contracted graph" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Using when departure and destination are not in the contracted graph" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "``pgr_contractionHierarchies`` - Experimental" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgid "``pgr_dijkstraCostMatrix``" +msgstr "``pgr_dijkstraCostMatrix``" + +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." msgstr "" -msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgid "Using Dijkstra algorithm, calculate and return a cost matrix." msgstr "" -msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgid "``pgr_dijkstraNear``" +msgstr "``pgr_dijkstraNear``" + +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." msgstr "" -msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgid "Uses Dijkstra algorithm." msgstr "" -msgid "The process is done on graphs having only edges with positive costs." +msgid "Works for **directed** and **undirected** graphs." msgstr "" -msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgid "When there are more than one path to the same vertex with same cost:" msgstr "" -msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgid "The algorithm will return just one path" msgstr "" -msgid "added shortcut edges, with negative identifiers;" +msgid "Optionally allows to find more than one path." msgstr "" -msgid "contracted nodes with an order." +msgid "When more than one path is to be returned:" msgstr "" -msgid "The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "Results are sorted in increasing order of:" msgstr "" -msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" +msgid "aggregate cost" msgstr "" -msgid "Returns set of |result-contraction-hierarchies|" +msgid "Within the same value of aggregate costs:" msgstr "" -msgid "Contraction hierarchies optional parameters" +msgid "results are sorted by (source, target)" msgstr "" -msgid "True if the graph is directed, False otherwise." +msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" msgstr "" -msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" +msgid "One to Many; :math:`drt`" msgstr "" -msgid "Type of the ``id``." +msgid "Many to One: :math:`drt`" msgstr "" -msgid "Column ``id`` has a positive value" +msgid "Many to Many: :math:`drt * |Starting vids|`" msgstr "" -msgid "Column ``id`` has a negative value" +msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "" -msgid "``metric``" -msgstr "``metric``" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "" -msgid "``vertex_order``" -msgstr "``vertex_order``" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "" -msgid "On an undirected graph" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "The following query shows the original data involved in the contraction operation on an undirected graph." +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "building contraction hierarchies on the whole graph" +msgid "**options A:** ``[directed, cap]``" msgstr "" -msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgid "**options B:** ``[directed, cap, global]``" msgstr "" -msgid "After computing the contraction hierarchies, an order is now given to the vertices," +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgid "**options:** ``[directed, cap]``" msgstr "" -msgid "We obtain the contracted graph above:" +msgid "Departing on car from vertex :math:`6` find the nearest subway station." msgstr "" -msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." +msgid "Using a **directed** graph for car routing." msgstr "" -msgid "On an undirected graph with forbidden vertices" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" -msgid "building contraction with a set of forbidden vertices" +msgid "The defaults used:" msgstr "" -msgid "Contraction process steps details" +msgid "`directed => true`" msgstr "" -msgid "Shortcut building process" +msgid "`cap => 1`" msgstr "" -msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "" -msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" msgstr "" -msgid "Initialize the queue with a first vertices order" +msgid "On line `4`: using the positional parameter: `directed` set to ``true``" msgstr "" -msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" +msgid "In line `5`: using named parameter `cap => 2`" msgstr "" -msgid ":math:`v`" +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." msgstr "" -msgid ":math:`\\{p, r, u\\}`" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid ":math:`p`" +msgid "**options:** ``[directed, cap, global]``" msgstr "" -msgid ":math:`\\{u, v\\}`" +msgid "Find the best pedestrian connection between two lines of buses" msgstr "" -msgid ":math:`u`" +msgid "Using an **undirected** graph for pedestrian routing" msgstr "" -msgid ":math:`\\{p, v, w\\}`" +msgid "The first subway line stations are at :math:`\\{15, 16\\}`" msgstr "" -msgid ":math:`r`" +msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" -msgid ":math:`\\{v, w\\}`" +msgid "On line `4`: using the named parameter: `directed => false`" msgstr "" -msgid ":math:`w`" +msgid "`global => true`" msgstr "" -msgid ":math:`\\{r, u\\}`" +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." msgstr "" -msgid "Adjacent edges are removed." +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "" -msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgid "Find the best car connection between all the stations of two subway lines" msgstr "" -msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" -msgid "A hierarchy will now be constructed by contracting again the vertices in this order." +msgid "The second subway line stations are at :math:`\\{15, 16\\}`" msgstr "" -msgid "Build the final vertex order" +msgid "The combinations contents:" msgstr "" -msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" msgstr "" -msgid "Add shortcuts to the initial graph" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" msgstr "" -msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgid "On line `8`: using the named parameter is `global => false`" msgstr "" -msgid "Use the contraction" +msgid "From the results:" msgstr "" -msgid "Build the contraction" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" msgstr "" -msgid "Add shortcuts and hierarchy in the existing tables" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" -msgid "Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" msgstr "" -msgid "Update and insert the results in the two tables." +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" msgstr "" -msgid "Use a Dijkstra shortest path algorithm on it" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" -msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "" -msgid "``pgr_contractionLinear`` - Proposed" +msgid "Dijkstra optional parameters" msgstr "" -msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "Near optional parameters" msgstr "" -msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgid "``cap``" +msgstr "``cap``" + +msgid "Find at most ``cap`` number of nearest shortest paths" msgstr "" -msgid "Linear contraction on an undirected graph." +msgid "``global``" +msgstr "``global``" + +msgid "When ``true``: only ``cap`` limit results will be returned" msgstr "" -msgid "The green nodes are linear nodes and will not be part of the contracted graph." +msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "All edges adjacent will not be part of the contracted graph." +msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" -msgid "The red lines will be new edges of the contracted graph." +msgid "``pgr_dijkstraNearCost``" +msgstr "``pgr_dijkstraNearCost``" + +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "**contraction Order**" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "A node connects two (or more) `linear` edges when" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "The number of adjacent vertices is 2." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "In case of a directed graph, a node is considered a `linear` node when" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "Linearity is symmetrical." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Linearity is not symmetrical" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" msgstr "" -msgid "Graph where linearity is not symmetrical." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "" -msgid "The three edges can be replaced by one undirected edge" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" -msgid "Edge :math:`1 - 3`." +msgid "``pgr_dijkstraVia``" +msgstr "``pgr_dijkstraVia``" + +msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" -msgid "With cost: :math:`4`." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" -msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgid "Route" msgstr "" -msgid "Linearity is symmetrical" +msgid "is a sequence of paths." msgstr "" -msgid "Graph where linearity is symmetrical." +msgid "Path" msgstr "" -msgid "The four edges can be replaced by two directed edges." +msgid "is a section of the route." msgstr "" -msgid "Edge :math:`3 - 1`." +msgid "One Via" msgstr "" -msgid "With cost: :math:`6`." +msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" msgstr "" -msgid "The four edges can be replaced by one undirected edge." +msgid "**options:** ``[directed, strict, U_turn_on_edge]``" msgstr "" -msgid "Step by step linear contraction" +msgid "Returns set of |via-result|" msgstr "" -msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." msgstr "" -msgid "Contracting vertex :math:`3`," +msgid "Via optional parameters" msgstr "" -msgid "The vertex :math:`3` is removed from the graph" +msgid "When ``true`` departing from a visited vertex will not try to avoid" msgstr "" -msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgid "Identifier of a path. Has value **1** for the first path." msgstr "" -msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." msgstr "" -msgid "Contracting vertex :math:`2`:" +msgid "-1 for the last node of the path." msgstr "" -msgid "The vertex :math:`2` is removed from the graph" +msgid "-2 for the last node of the route." msgstr "" -msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgid "``route_agg_cost``" +msgstr "``route_agg_cost``" + +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." msgstr "" -msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." msgstr "" -msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." +msgid "The main query" msgstr "" -msgid "Create the contracted graph." +msgid "Aggregate cost of the third path." msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgid "Route's aggregate cost of the route at the end of the third path." msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgid "Nodes visited in the route." msgstr "" -msgid "Version 3.4.0" +msgid "The aggregate costs of the route when the visited vertices are reached." msgstr "" -msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgid "Status of \"passes in front\" or \"visits\" of the nodes." msgstr "" -msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgid ":doc:`via-category`." msgstr "" -msgid "The implementation is for **undirected** graphs." +msgid ":doc:`dijkstra-family`." msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgid "pgr_drivingDistance(Single vertex)" msgstr "" -msgid "where :math:`|V|` is the number of vertices," +msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "" -msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgid "pgr_drivingDistance(Multiple vertices)" msgstr "" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgid "Result column name change: ``from_v`` to ``start_vid``." msgstr "" -msgid "Returns set of |result_node_order|" +msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgid "Signature change:" msgstr "" -msgid "Returns set of ``(seq, node)``" +msgid "pgr_drivingDistance(single vertex)" msgstr "" -msgid "Sequence of the order starting from 1." +msgid "New official signature:" msgstr "" -msgid "New ordering in reverse order." +msgid "pgr_drivingDistance(multiple vertices)" msgstr "" -msgid "`Boost: Cuthill-McKee Ordering `__" +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "" -msgid "``pgr_dagShortestPath`` - Experimental" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" -msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgid "**options:** [directed, equicost]" msgstr "" -msgid "pgr_dagShortestPath(Combinations)" +msgid "Single Vertex" msgstr "" -msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgid "From vertex :math:`11` for a distance of :math:`3.0`" msgstr "" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgid "Multiple Vertices" msgstr "" -msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" msgstr "" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgid "Driving distance optional parameters" msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgid "``equicost``" +msgstr "``equicost``" + +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." msgstr "" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgid "end-before" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Output columns standardized to |result_edge_color|" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." msgstr "" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgid "The implementation is for **undirected** and **loop-free** graphs" msgstr "" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgid "loop free" msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgid "no self-loops and no parallel edges." msgstr "" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "" -msgid "Return columns" +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." msgstr "" -msgid "Making **start_vids** the same as **end_vids**" +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." msgstr "" -msgid "`Boost: DAG shortest paths `__" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" msgstr "" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "The algorithm tries to assign the least possible color to every edge." msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +msgid "Does not always produce optimal coloring." +msgstr "" -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgid "The returned rows are ordered in ascending order of the edge identifier." msgstr "" -msgid "Error messages adjustment." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" msgstr "" -msgid "New signature with only Edges SQL." +msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" msgstr "" -msgid "Calculates the degree of the vertices of an undirected graph" +msgid "where :math:`|E|` is the number of edges in the graph," msgstr "" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgid ":math:`|V|` is the number of vertices in the graph." msgstr "" -msgid "A loop contributes 2 to a vertex's degree." +msgid "pgr_edgeColoring(`Edges SQL`_)" msgstr "" -msgid "A vertex with degree 0 is called an isolated vertex." +msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" -msgid "Isolated vertex is not part of the result" +msgid "`Boost: Edge Coloring `__" msgstr "" -msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgid "`Wikipedia: Graph coloring `__" msgstr "" -msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "" -msgid "The code can be used as base code for the particular application requirements." +msgid "Output columns standardized to |generic-result|" msgstr "" -msgid "No ordering is performed." +msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." msgstr "" -msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgid "The main characterics are:" msgstr "" -msgid "RETURNS SETOF |result-degree|" +msgid "Calculates the edge disjoint paths between any two groups of vertices." msgstr "" -msgid "Edges" +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." msgstr "" -msgid "example" +msgid "The graph can be directed or undirected." msgstr "" -msgid "Get the degree of the vertices defined on the edges table" +msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "" -msgid "Edges and Vertices" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Extracting the vertex information" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Calculate the degree of the nodes:" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "`Vertex SQL`_" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." msgstr "" -msgid "`Vertex SQL`_ as described below" +msgid "Manually assigned vertex combinations on an undirected graph." msgstr "" -msgid "``dryrun``" -msgstr "``dryrun``" +msgid "``pgr_edmondsKarp``" +msgstr "``pgr_edmondsKarp``" -msgid "When true do not process and get in a NOTICE the resulting query." +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" -msgid "For the `Edges and Vertices`_ signature:" +msgid "pgr_edmondsKarp(Combinations)" msgstr "" -msgid "For the `Edges`_ signature:" +msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "" -msgid "Vertex SQL" +msgid "Running time: :math:`O( V * E ^ 2)`" msgstr "" -msgid "``in_edges``" -msgstr "``in_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "When missing, ``out_edges`` must exist." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "``out_edges``" -msgstr "``out_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "When missing, ``in_edges`` must exist." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Vertex identifier" +msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "``degree``" -msgstr "``degree``" - -msgid "Number of edges that are incident to the vertex ``id``" +msgid "`Boost: Edmonds Karp max flow `__" msgstr "" -msgid "Degree of a loop" +msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" -msgid "Using the `Edges`_ signature." +msgid "``pgr_edwardMoore`` - Experimental" msgstr "" -msgid "Using the `Edges and Vertices`_ signature." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "Degree of a sub graph" +msgid "pgr_edwardMoore(Combinations)" msgstr "" -msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." msgstr "" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." msgstr "" -msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" msgstr "" -msgid "The vertices not participating on the edge are considered isolated" +msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" -msgid "their degree is 0 in the subgraph and" +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." msgstr "" -msgid "their degree is not shown in the output." +msgid "Running time:" msgstr "" -msgid "Using a vertex table" +msgid "Worst case: :math:`O(| V | * | E |)`" msgstr "" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgid "Average case: :math:`O( | E | )`" msgstr "" -msgid "Extract the vertex information and save into a table:" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Dry run execution" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Finding dead ends" +msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgid "Using a combinations table on an **undirected** graph." msgstr "" -msgid "The degree of a dead end is 1." +msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" -msgid "Finding linear vertices" -msgstr "" +msgid "``pgr_extractVertices``" +msgstr "``pgr_extractVertices``" -msgid "The degree of a linear vertex is 2." +msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" -msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." msgstr "" -msgid ":doc:`pgr_extractVertices`" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" msgstr "" -msgid "``pgr_depthFirstSearch`` - Proposed" +msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" msgstr "" -msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgid "RETURNS SETOF |result-extract|" msgstr "" -msgid "Version 3.3.0" +msgid "When line geometry is known" msgstr "" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgid "(Optional) identifier of the edge." msgstr "" -msgid "The implementation works for both **directed** and **undirected** graphs." -msgstr "" +msgid "``geom``" +msgstr "``geom``" -msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." -msgstr "" +msgid "``LINESTRING``" +msgstr "``LINESTRING``" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgid "Geometry of the edge." msgstr "" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." msgstr "" -msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgid "Ignored columns:" msgstr "" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." -msgstr "" +msgid "``startpoint``" +msgstr "``startpoint``" -msgid "The returned values are ordered in ascending order of `start_vid`." +msgid "``endpoint``" +msgstr "``endpoint``" + +msgid "When vertex geometry is known" msgstr "" -msgid "Depth First Search Running time: :math:`O(E + V)`" +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "``POINT``" +msgstr "``POINT``" + +msgid "POINT geometry of the starting vertex." msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "POINT geometry of the ending vertex." msgstr "" -msgid "**options:** ``[directed, max_depth]``" +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" -msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgid "When identifiers of vertices are known" msgstr "" -msgid "`Boost: Depth First Search `__" +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." msgstr "" -msgid "`Boost: Undirected DFS `__" +msgid "``NULL`` When the ``id`` is not part of the inner query" msgstr "" -msgid "`Wikipedia: Depth First Search algorithm `__" +msgid "X value of the point geometry" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgid "``NULL`` When no geometry is provided" msgstr "" -msgid "Version 3.5.0" +msgid "Geometry of the point" msgstr "" -msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "" -msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgid "Create a routing topology" msgstr "" -msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgid "Make sure the database does not have the ``vertices_table``" msgstr "" -msgid "Version 3.1.0" +msgid "Clean up the columns of the routing topology to be created" msgstr "" -msgid "pgr_dijkstra(Combinations)" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" -msgid "Version 2.2.0" +msgid "For big edge tables that are been prepared," msgstr "" -msgid "pgr_dijkstra(One to Many)" +msgid "Create it as ``UNLOGGED`` and" msgstr "" -msgid "pgr_dijkstra(Many to One)" +msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" msgstr "" -msgid "pgr_dijkstra(Many to Many)" +msgid "Inspect the vertices table" msgstr "" -msgid "Signature change on pgr_dijkstra(One to One)" +msgid "Create the routing topology on the edge table" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Updating the ``source`` information" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Updating the ``target`` information" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Inspect the routing topology" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "**Generated topology**" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "``pgr_findCloseEdges``" +msgstr "``pgr_findCloseEdges``" + +msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network." +msgid "``partial`` option is removed." msgstr "" -msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." msgstr "" -msgid "Directed graph with cost and reverse cost columns" +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "" -msgid "1) Path from :math:`6` to :math:`10`" +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." msgstr "" -msgid "2) Path from :math:`6` to :math:`7`" +msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "" -msgid "3) Path from :math:`12` to :math:`10`" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -msgid "4) Path from :math:`12` to :math:`7`" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "" -msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" +msgid "**options:** ``[cap, dryrun]``" msgstr "" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgid "Returns set of |result-find|" msgstr "" -msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" +msgid "One point" msgstr "" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgid "Get two close edges to points of interest with :math:`pid = 5`" msgstr "" -msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" +msgid "``cap => 2``" msgstr "" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgid "Many points" msgstr "" -msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" +msgid "For each points of interests, find the closest edge." msgstr "" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "**point**" msgstr "" -msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" +msgid "The point geometry" msgstr "" -msgid "Undirected graph with cost and reverse cost columns" +msgid "**points**" msgstr "" -msgid "9) Path from :math:`6` to :math:`10`" +msgid "``POINT[]``" msgstr "" -msgid "10) Path from :math:`6` to :math:`7`" +msgid "An array of point geometries" msgstr "" -msgid "11) Path from :math:`12` to :math:`10`" +msgid "**tolerance**" msgstr "" -msgid "12) Path from :math:`12` to :math:`7`" +msgid "Max distance between geometries" msgstr "" -msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" +msgid "Limit output rows" msgstr "" -msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" +msgid "When ``false`` calculations are performed." msgstr "" -msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." msgstr "" -msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" +msgid "``geometry``" +msgstr "``geometry``" + +msgid "The ``LINESTRING`` geometry of the edge." msgstr "" -msgid "For **directed** graphs only with ``cost`` column" +msgid "When :math:`cap = 1`, it is the closest edge." msgstr "" -msgid "Directed graph only with cost column" +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." msgstr "" -msgid "17) Path from :math:`6` to :math:`10`" +msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "" -msgid "18) Path from :math:`6` to :math:`7`" +msgid "At the right ``r`` of the segment." msgstr "" -msgid "19) Path from :math:`12` to :math:`10`" +msgid "When the point is on the line it is considered to be on the right." msgstr "" -msgid "20) Path from :math:`12` to :math:`7`" +msgid "At the left ``l`` of the segment." msgstr "" -msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" +msgid "``distance``" +msgstr "``distance``" + +msgid "Distance from the point to the edge." msgstr "" -msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" +msgid "Original ``POINT`` geometry." msgstr "" -msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" msgstr "" -msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" +msgid "One point in an edge" msgstr "" -msgid "For **undirected** graphs only with ``cost`` column" +msgid "The green node is the original point." msgstr "" -msgid "Undirected graph only with cost column" +msgid "``geom`` has the value of the original point." msgstr "" -msgid "25) Path from :math:`6` to :math:`10`" +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." msgstr "" -msgid "26) Path from :math:`6` to :math:`7`" +msgid "The point is located at the left of the edge." msgstr "" -msgid "27) Path from :math:`12` to :math:`10`" +msgid "One point dry run execution" msgstr "" -msgid "28) Path from :math:`12` to :math:`7`" +msgid "Using the query from the previous example:" msgstr "" -msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" +msgid "Returns ``EMPTY SET``." msgstr "" -msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" +msgid "``dryrun => true``" msgstr "" -msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "" -msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "" -msgid "Equvalences between signatures" +msgid "Many points in an edge" msgstr "" -msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The green nodes are the **original points**" msgstr "" -msgid "33) Using `One to One`_" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" msgstr "" -msgid "34) Using `One to Many`_" +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." msgstr "" -msgid "35) Using `Many to One`_" +msgid "Many points dry run execution" msgstr "" -msgid "36) Using `Many to Many`_" +msgid "Do not process query" msgstr "" -msgid "37) Using `Combinations`_" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" -msgid "`Boost: Dijkstra shortest paths `__" +msgid "Find at most two routes to a given point" msgstr "" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "Using :doc:`pgr_withPoints`" msgstr "" -msgid "``pgr_dijkstraCost``" -msgstr "``pgr_dijkstraCost``" +msgid "A point of interest table" +msgstr "" -msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgid "Handling points outside the graph." msgstr "" -msgid "pgr_dijkstraCost(Combinations)" +msgid "Points of interest" msgstr "" -msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "A unique identifier." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Identifier of the nearest segment." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Is it on the left, right or both sides of the segment ``edge_id``." msgstr "" -msgid "``pgr_dijkstraCostMatrix``" -msgstr "``pgr_dijkstraCostMatrix``" +msgid "Where in the segment is the point located." +msgstr "" -msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgid "The geometry of the points." msgstr "" -msgid "Using Dijkstra algorithm, calculate and return a cost matrix." +msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "" -msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." msgstr "" -msgid "``pgr_dijkstraNear``" -msgstr "``pgr_dijkstraNear``" +msgid "``newPoint``" +msgstr "``newPoint``" -msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." msgstr "" -msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgid "Points of interest fill up" msgstr "" -msgid "Uses Dijkstra algorithm." +msgid "Inserting the points of interest." msgstr "" -msgid "Works for **directed** and **undirected** graphs." +msgid "Filling the rest of the table." msgstr "" -msgid "When there are more than one path to the same vertex with same cost:" +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "" -msgid "The algorithm will return just one path" +msgid "The points of interest:" msgstr "" -msgid "Optionally allows to find more than one path." -msgstr "" +msgid "``pgr_floydWarshall``" +msgstr "``pgr_floydWarshall``" -msgid "When more than one path is to be returned:" +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" -msgid "Results are sorted in increasing order of:" +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," msgstr "" -msgid "aggregate cost" +msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "" -msgid "Within the same value of aggregate costs:" +msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "results are sorted by (source, target)" +msgid "Boost `Floyd-Warshall `_" msgstr "" -msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" -msgstr "" +msgid "``pgr_full_version``" +msgstr "``pgr_full_version``" -msgid "One to Many; :math:`drt`" +msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "Many to One: :math:`drt`" +msgid "Get complete details of pgRouting version information" msgstr "" -msgid "Many to Many: :math:`drt * |Starting vids|`" +msgid "pgr_full_version()" msgstr "" -msgid "Combinations: :math:`drt * |Starting vids|`" +msgid "RETURNS |result-version|" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "Information about when this documentation was built" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "" +msgid "``version``" +msgstr "``version``" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "pgRouting version" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "" +msgid "``build_type``" +msgstr "``build_type``" -msgid "**options A:** ``[directed, cap]``" +msgid "The Build type" msgstr "" -msgid "**options B:** ``[directed, cap, global]``" -msgstr "" +msgid "``compile_date``" +msgstr "``compile_date``" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Compilation date" msgstr "" -msgid "**options:** ``[directed, cap]``" -msgstr "" +msgid "``library``" +msgstr "``library``" -msgid "Departing on car from vertex :math:`6` find the nearest subway station." +msgid "Library name and version" msgstr "" -msgid "Using a **directed** graph for car routing." -msgstr "" +msgid "``system``" +msgstr "``system``" -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "Operative system" msgstr "" -msgid "The defaults used:" -msgstr "" +msgid "``postgreSQL``" +msgstr "``postgreSQL``" -msgid "`directed => true`" +msgid "pgsql used" msgstr "" -msgid "`cap => 1`" +msgid "``compiler``" +msgstr "``compiler``" + +msgid "Compiler and version" msgstr "" -msgid "The result shows that station at vertex :math:`11` is the nearest." +msgid "``boost``" +msgstr "``boost``" + +msgid "Boost version" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "``hash``" +msgstr "``hash``" + +msgid "Git hash of pgRouting build" msgstr "" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" +msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" -msgid "On line `4`: using the positional parameter: `directed` set to ``true``" +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr "" -msgid "In line `5`: using named parameter `cap => 2`" +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." msgstr "" -msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "The algorithm implementation works only for directed graph" msgstr "" -msgid "**options:** ``[directed, cap, global]``" +msgid "It is a variation of Johnson's algorithm for circuit enumeration." msgstr "" -msgid "Find the best pedestrian connection between two lines of buses" +msgid "The algorithm outputs the distinct circuits present in the graph." msgstr "" -msgid "Using an **undirected** graph for pedestrian routing" +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "" -msgid "The first subway line stations are at :math:`\\{15, 16\\}`" +msgid ":math:`|c|` is the number of circuits in the graph." msgstr "" -msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "" -msgid "On line `4`: using the named parameter: `directed => false`" +msgid "Circuits present in the pgRouting :doc:`sampledata`" msgstr "" -msgid "`global => true`" +msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" -msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgid "Identifier of the starting vertex of the circuit." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Identifier of the ending vertex of the circuit." msgstr "" -msgid "Find the best car connection between all the stations of two subway lines" +msgid "Identifier of the node in the path from a vid to next vid." msgstr "" -msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" -msgid "The second subway line stations are at :math:`\\{15, 16\\}`" +msgid "``pgr_isPlanar`` - Experimental" msgstr "" -msgid "The combinations contents:" +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." msgstr "" -msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." msgstr "" -msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "On line `8`: using the named parameter is `global => false`" +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "" -msgid "From the results:" +msgid "Applicable only for **undirected** graphs." msgstr "" -msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgid "The algorithm does not considers traversal costs in the calculations." msgstr "" -msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "Running time: :math:`O(|V|)`" msgstr "" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgid "pgr_isPlanar(`Edges SQL`)" msgstr "" -msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgid "RETURNS ``BOOLEAN``" msgstr "" -msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "Returns a boolean ``(pgr_isplanar)``" msgstr "" -msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgid "``pgr_isplanar``" +msgstr "``pgr_isplanar``" + +msgid "`true` when the graph is planar." msgstr "" -msgid "Dijkstra optional parameters" +msgid "`false` when the graph is not planar." msgstr "" -msgid "Near optional parameters" +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." msgstr "" -msgid "``cap``" -msgstr "``cap``" +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgstr "" -msgid "Find at most ``cap`` number of nearest shortest paths" +msgid "`Boost: Boyer Myrvold `__" msgstr "" -msgid "``global``" -msgstr "``global``" +msgid "``pgr_johnson``" +msgstr "``pgr_johnson``" -msgid "When ``true``: only ``cap`` limit results will be returned" +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." msgstr "" -msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" -msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" -msgid "``pgr_dijkstraNearCost``" -msgstr "``pgr_dijkstraNearCost``" - -msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +msgid "Boost `Johnson `_" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "``pgr_kingOrdering`` - Experimental" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "The implementation targets undirected graphs." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" +msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "where :math:`|E|` is the number of edges," msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid ":math:`m` is the maximum degree among all vertices." msgstr "" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "" -msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "`Boost: King Ordering `__" msgstr "" -msgid "``pgr_dijkstraVia``" -msgstr "``pgr_dijkstraVia``" +msgid "``pgr_kruskal``" +msgstr "``pgr_kruskal``" -msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." msgstr "" -msgid "Route" +msgid "EMPTY SET is returned when there are no edges in the graph." msgstr "" -msgid "is a sequence of paths." +msgid "pgr_kruskal(`Edges SQL`_)" msgstr "" -msgid "Path" +msgid "Returns set of |result-mst|" msgstr "" -msgid "is a section of the route." +msgid "Minimum spanning forest" msgstr "" -msgid "One Via" +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." msgstr "" -msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgid "Added ``pred`` result columns." msgstr "" -msgid "**options:** ``[directed, strict, U_turn_on_edge]``" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" -msgid "Returns set of |via-result|" +msgid "Returned tree nodes from a root vertex are on Breath First Search order" msgstr "" -msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgid "Breath First Search Running time: :math:`O(E + V)`" msgstr "" -msgid "Via optional parameters" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "When ``true`` departing from a visited vertex will not try to avoid" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "Identifier of a path. Has value **1** for the first path." +msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" msgstr "" -msgid "-1 for the last node of the path." +msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" -msgid "-2 for the last node of the route." +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." msgstr "" -msgid "``route_agg_cost``" -msgstr "``route_agg_cost``" - -msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgid "Returned tree nodes from a root vertex are on Depth First Search order." msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgid "Depth First Search running time: :math:`O(E + V)`" msgstr "" -msgid "The main query" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "" -msgid "Aggregate cost of the third path." +msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "Route's aggregate cost of the route at the end of the third path." +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" msgstr "" -msgid "Nodes visited in the route." +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" msgstr "" -msgid "The aggregate costs of the route when the visited vertices are reached." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" -msgid ":doc:`via-category`." +msgid "Returned tree nodes from a root vertex are on Depth First Search order" msgstr "" -msgid ":doc:`dijkstra-family`." +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "pgr_drivingDistance(Single vertex)" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" -msgid "Added ``depth`` and ``start_vid`` result columns." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "" -msgid "pgr_drivingDistance(Multiple vertices)" +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." msgstr "" -msgid "Result column name change: ``from_v`` to ``start_vid``." +msgid "The algorithm works in directed graph only." msgstr "" -msgid "Added ``depth`` and ``pred`` result columns." +msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "Signature change:" +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "" -msgid "pgr_drivingDistance(single vertex)" +msgid "Running time: :math:`O((V+E)log(V+E))`" msgstr "" -msgid "New official signature:" +msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" msgstr "" -msgid "pgr_drivingDistance(multiple vertices)" +msgid "Returns set of |result-idom|" msgstr "" -msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgid "The dominator tree with root vertex :math:`5`" msgstr "" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "SQL query as described above." msgstr "" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "**root vertex**" msgstr "" -msgid "**options:** [directed, equicost]" +msgid "Returns set of ``(seq, vertex_id, idom)``" msgstr "" -msgid "Single Vertex" -msgstr "" +msgid "``vertex_id``" +msgstr "``vertex_id``" -msgid "From vertex :math:`11` for a distance of :math:`3.0`" +msgid "Identifier of vertex ." msgstr "" -msgid "Multiple Vertices" -msgstr "" +msgid "``idom``" +msgstr "``idom``" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgid "Immediate dominator of vertex." msgstr "" -msgid "Driving distance optional parameters" +msgid "Dominator tree of another component." msgstr "" -msgid "``equicost``" -msgstr "``equicost``" - -msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgid "`Boost: Lengauer-Tarjan dominator `__" msgstr "" -msgid "When ``false`` which resembles several calls using the single vertex signature." +msgid "`Wikipedia: dominator tree `__" msgstr "" -msgid "end-before" +msgid "``pgr_lineGraph`` - Proposed" msgstr "" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "" -msgid "``pgr_edgeColoring`` - Experimental" +msgid "Works for directed and undirected graphs." msgstr "" -msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" -msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "" -msgid "The implementation is for **undirected** and **loop-free** graphs" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" msgstr "" -msgid "loop free" +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." msgstr "" -msgid "no self-loops and no parallel edges." +msgid "When the graph is directed the result is directed." msgstr "" -msgid "Provides the color to be assigned to all the edges present in the graph." +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." msgstr "" -msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +msgid "When the graph is undirected the result is undirected." msgstr "" -msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgid "The ``reverse_cost`` is always :math:`-1`." msgstr "" -msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" msgstr "" -msgid "The algorithm tries to assign the least possible color to every edge." +msgid "Returns set of |result-lineg|" msgstr "" -msgid "Does not always produce optimal coloring." +msgid "For an undirected graph with edges :math:'{2,4,5,8}'" msgstr "" -msgid "The returned rows are ordered in ascending order of the edge identifier." +msgid "Gives a local identifier for the edge" msgstr "" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" +msgid "When `negative`: the source is the reverse edge in the original graph." msgstr "" -msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" +msgid "When `negative`: the target is the reverse edge in the original graph." msgstr "" -msgid "where :math:`|E|` is the number of edges in the graph," +msgid "Weight of the edge (``source``, ``target``)." msgstr "" -msgid ":math:`|V|` is the number of vertices in the graph." +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." msgstr "" -msgid "pgr_edgeColoring(`Edges SQL`_)" +msgid "Weight of the edge (``target``, ``source``)." msgstr "" -msgid "Graph coloring of pgRouting :doc:`sampledata`" +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." msgstr "" -msgid "`Boost: Edge Coloring `__" +msgid "Given the following directed graph" msgstr "" -msgid "`Wikipedia: Graph coloring `__" +msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" msgstr "" -msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgid "Representation as directed with shared edge identifiers" msgstr "" -msgid "pgr_edgeDisjointPaths(Combinations)" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "" -msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgid "hundreds" msgstr "" -msgid "The main characterics are:" +msgid "the source vertex" msgstr "" -msgid "Calculates the edge disjoint paths between any two groups of vertices." +msgid "tens" msgstr "" -msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgid "always 0, acts as a separator" msgstr "" -msgid "The graph can be directed or undirected." +msgid "units" msgstr "" -msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." +msgid "the target vertex" msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "In this image," msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Single or double head arrows represent one edge (row) on the edges table." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." msgstr "" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." msgstr "" -msgid "Manually assigned vertex combinations on an undirected graph." +msgid "The graph can be created as follows:" msgstr "" -msgid "``pgr_edmondsKarp``" -msgstr "``pgr_edmondsKarp``" - -msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgid "Line Graph of a directed graph represented with shared edges" msgstr "" -msgid "pgr_edmondsKarp(Combinations)" +msgid "The result is a directed graph." msgstr "" -msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "" -msgid "Running time: :math:`O( V * E ^ 2)`" +msgid "For all the other values of ``seq`` represent one edge." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgid "When positive: the edge exists." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgid "When negative: the edge does not exist." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Representation as directed with unique edge identifiers" msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgid "Single head arrows represent one edge (row) on the edges table." msgstr "" -msgid "`Boost: Edmonds Karp max flow `__" +msgid "There are no double head arrows" msgstr "" -msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." msgstr "" -msgid "``pgr_edwardMoore`` - Experimental" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." msgstr "" -msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." msgstr "" -msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgid "Line Graph of a directed graph represented with unique edges" msgstr "" -msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "" -msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" +msgid "wikipedia: `Line Graph `__" msgstr "" -msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgid "mathworld: `Line Graph `__" msgstr "" -msgid "Running time:" +msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" -msgid "Worst case: :math:`O(| V | * | E |)`" +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." msgstr "" -msgid "Average case: :math:`O( | E | )`" +msgid "Version 2.6.0" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." msgstr "" -msgid "Using a combinations table on an **undirected** graph." +msgid "This function is for **directed** graphs." msgstr "" -msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgid "Results are undefined when a negative vertex id is used in the input graph." msgstr "" -msgid "``pgr_extractVertices``" -msgstr "``pgr_extractVertices``" +msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgstr "" -msgid "``pgr_extractVertices`` — Extracts the vertices information" +msgid "Running time: TBD" msgstr "" -msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgid "pgr_lineGraphFull(`Edges SQL`_)" msgstr "" -msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgid "Returns set of |result-linegf|" msgstr "" -msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" -msgid "RETURNS SETOF |result-extract|" +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "" -msgid "When line geometry is known" +msgid "The data" msgstr "" -msgid "(Optional) identifier of the edge." +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." msgstr "" -msgid "``geom``" -msgstr "``geom``" - -msgid "``LINESTRING``" -msgstr "``LINESTRING``" +msgid "|first|" +msgstr "" -msgid "Geometry of the edge." +msgid "first" msgstr "" -msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgid "The transformation" msgstr "" -msgid "Ignored columns:" +msgid "|second|" msgstr "" -msgid "``startpoint``" -msgstr "``startpoint``" +msgid "second" +msgstr "" -msgid "``endpoint``" -msgstr "``endpoint``" +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgstr "" -msgid "When vertex geometry is known" +msgid "Creating table that identifies transformed vertices" msgstr "" -msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." msgstr "" -msgid "``POINT``" -msgstr "``POINT``" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgstr "" -msgid "POINT geometry of the starting vertex." +msgid "Store edge results" msgstr "" -msgid "POINT geometry of the ending vertex." +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "" -msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgid "Create the mapping table" msgstr "" -msgid "When identifiers of vertices are known" +msgid "From the original graph's vertex information" msgstr "" -msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgid "Add the new vertices" msgstr "" -msgid "``NULL`` When the ``id`` is not part of the inner query" +msgid "Filling the mapping table" msgstr "" -msgid "X value of the point geometry" +msgid "The positive vertex identifiers are the original identifiers" msgstr "" -msgid "``NULL`` When no geometry is provided" +msgid "Inspecting the vertices map" msgstr "" -msgid "Geometry of the point" +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgid "Updating values from self loops" msgstr "" -msgid "Create a routing topology" +msgid "Inspecting the vertices table" msgstr "" -msgid "Make sure the database does not have the ``vertices_table``" +msgid "Updating from inner self loops" msgstr "" -msgid "Clean up the columns of the routing topology to be created" +msgid "Adding a soft restriction" msgstr "" -msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" -msgid "For big edge tables that are been prepared," +msgid "Identifying the restriction" msgstr "" -msgid "Create it as ``UNLOGGED`` and" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" -msgid "Inspect the vertices table" +msgid "Adding a value to the restriction" msgstr "" -msgid "Create the routing topology on the edge table" +msgid "Updating the cost to the edge:" msgstr "" -msgid "Updating the ``source`` information" +msgid "Routing from :math:`6` to :math:`3`" msgstr "" -msgid "Updating the ``target`` information" +msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." msgstr "" -msgid "Inspect the routing topology" +msgid "Simplifying leaf vertices" msgstr "" -msgid "**Generated topology**" +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "" -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" +msgid "Using the vertex map give the leaf verices their original value." +msgstr "" -msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." +msgid "On the source column" msgstr "" -msgid "``partial`` option is removed." +msgid "On the target column" msgstr "" -msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgid "Removing self loops on leaf nodes" msgstr "" -msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgid "The self loops of the leaf nodes are" msgstr "" -msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgid "Which can be removed" msgstr "" -msgid "``EMPTY SET`` is returned on dryrun executions" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "Complete routing graph" msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "Add edges from the original graph" msgstr "" -msgid "**options:** ``[cap, dryrun]``" +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "" -msgid "Returns set of |result-find|" +msgid "Some administrative tasks to get new identifiers for the edges" msgstr "" -msgid "One point" +msgid "Add the newly calculated edges" msgstr "" -msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgid "Using the routing graph" msgstr "" -msgid "``cap => 2``" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "" -msgid "Many points" +msgid "Routing from :math:`5` to :math:`1`" msgstr "" -msgid "For each points of interests, find the closest edge." +msgid "https://en.wikipedia.org/wiki/Line_graph" msgstr "" -msgid "**point**" +msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "" -msgid "The point geometry" +msgid "``pgr_makeConnected`` - Experimental" msgstr "" -msgid "**points**" +msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" -msgid "``POINT[]``" +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." msgstr "" -msgid "An array of point geometries" +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." msgstr "" -msgid "**tolerance**" +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "" -msgid "Max distance between geometries" +msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "" -msgid "Limit output rows" +msgid "Returns set of |result-component-make|" msgstr "" -msgid "When ``false`` calculations are performed." +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgid "`Boost: make connected `__" msgstr "" -msgid "``geometry``" -msgstr "``geometry``" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" -msgid "The ``LINESTRING`` geometry of the edge." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "" -msgid "When :math:`cap = 1`, it is the closest edge." +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." msgstr "" -msgid "Value in ``[r, l]`` indicating if the point is:" +msgid "Deprecated signature" msgstr "" -msgid "At the right ``r`` of the segment." +msgid "directed => ``false`` when used." msgstr "" -msgid "When the point is on the line it is considered to be on the right." +msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "" -msgid "At the left ``l`` of the segment." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." msgstr "" -msgid "``distance``" -msgstr "``distance``" - -msgid "Distance from the point to the edge." +msgid "A maximum matching is a matching that contains the largest possible number of edges." msgstr "" -msgid "Original ``POINT`` geometry." +msgid "There may be many maximum matchings." msgstr "" -msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgid "Calculates one possible maximum cardinality matching in a graph." msgstr "" -msgid "One point in an edge" +msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" msgstr "" -msgid "The green node is the original point." +msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." msgstr "" -msgid "``geom`` has the value of the original point." +msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" msgstr "" -msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgid "Using all edges." msgstr "" -msgid "The point is located at the left of the edge." +msgid "SQL query, which should return a set of rows with the following columns:" msgstr "" -msgid "One point dry run execution" +msgid "A positive value represents the existence of the edge (``source``, ``target``)." msgstr "" -msgid "Using the query from the previous example:" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" msgstr "" -msgid "Returns ``EMPTY SET``." +msgid "Identifier of the edge in the original query." msgstr "" -msgid "``dryrun => true``" +msgid "`Boost: maximum_matching `__" msgstr "" -msgid "Generates a PostgreSQL ``NOTICE`` with the code used." +msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "" -msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." +msgid "https://en.wikipedia.org/wiki/Ackermann_function" msgstr "" -msgid "Many points in an edge" -msgstr "" +msgid "``pgr_maxFlow``" +msgstr "``pgr_maxFlow``" -msgid "The green nodes are the **original points**" +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" -msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgid "pgr_maxFlow(Combinations)" msgstr "" -msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" -msgid "Many points dry run execution" +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" -msgid "Do not process query" +msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." msgstr "" -msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgid "Running time: :math:`O( V ^ 3)`" msgstr "" -msgid "Find at most two routes to a given point" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "Using :doc:`pgr_withPoints`" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "A point of interest table" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "Handling points outside the graph." +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Points of interest" +msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgid "RETURNS ``BIGINT``" msgstr "" -msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." +msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgid "`Boost: push relabel max flow `__" msgstr "" -msgid "A unique identifier." +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" -msgid "Identifier of the nearest segment." +msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "" -msgid "Is it on the left, right or both sides of the segment ``edge_id``." +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "" -msgid "Where in the segment is the point located." +msgid "pgr_maxFlowMinCost(Combinations)" msgstr "" -msgid "The geometry of the points." +msgid "|Boost| Boost Graph Inside." msgstr "" -msgid "The distance between ``geom`` and the segment ``edge_id``." +msgid "**TODO** check which statement is true:" msgstr "" -msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." +msgid "The cost value of all input edges must be nonnegative." msgstr "" -msgid "``newPoint``" -msgstr "``newPoint``" - -msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgid "Process is done when the cost value of all input edges is nonnegative." msgstr "" -msgid "Points of interest fill up" +msgid "Process is done on edges with nonnegative cost." msgstr "" -msgid "Inserting the points of interest." +msgid "Running time: :math:`O(U * (E + V * logV))`" msgstr "" -msgid "Filling the rest of the table." +msgid "where :math:`U` is the value of the max flow." msgstr "" -msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." msgstr "" -msgid "The points of interest:" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "``pgr_floydWarshall``" -msgstr "``pgr_floydWarshall``" - -msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." +msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "Boost `Floyd-Warshall `_" +msgid "Returns set of |result-flow-mincost|" msgstr "" -msgid "``pgr_full_version``" -msgstr "``pgr_full_version``" - -msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" -msgid "Get complete details of pgRouting version information" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "" -msgid "pgr_full_version()" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" -msgid "RETURNS |result-version|" +msgid "**The cost value of all input edges must be nonnegative.**" msgstr "" -msgid "Information about when this documentation was built" +msgid "When the maximum flow is 0 then there is no flow and **0** is returned." msgstr "" -msgid "``version``" -msgstr "``version``" +msgid "Uses :doc:`pgr_maxFlowMinCost`." +msgstr "" -msgid "pgRouting version" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "``build_type``" -msgstr "``build_type``" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "" -msgid "The Build type" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "``compile_date``" -msgstr "``compile_date``" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "" -msgid "Compilation date" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "``library``" -msgstr "``library``" +msgid "RETURNS FLOAT" +msgstr "" -msgid "Library name and version" +msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "``system``" -msgstr "``system``" +msgid "``pgr_pickDeliver`` - Experimental" +msgstr "" -msgid "Operative system" +msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "``postgreSQL``" -msgstr "``postgreSQL``" +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgstr "" -msgid "pgsql used" +msgid "Optimization problem is NP-hard." msgstr "" -msgid "``compiler``" -msgstr "``compiler``" +msgid "pickup and Delivery with time windows." +msgstr "" -msgid "Compiler and version" +msgid "All vehicles are equal." msgstr "" -msgid "``boost``" -msgstr "``boost``" +msgid "Same Starting location." +msgstr "" -msgid "Boost version" +msgid "Same Ending location which is the same as Starting location." msgstr "" -msgid "``hash``" -msgstr "``hash``" +msgid "All vehicles travel at the same speed." +msgstr "" -msgid "Git hash of pgRouting build" +msgid "A customer is for doing a pickup or doing a deliver." msgstr "" -msgid "``pgr_hawickCircuits`` - Experimental" +msgid "has an open time." msgstr "" -msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgid "has a closing time." msgstr "" -msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgid "has a service time." msgstr "" -msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgid "has an (x, y) location." msgstr "" -msgid "The algorithm implementation works only for directed graph" +msgid "There is a customer where to deliver a pickup." msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgid "travel time between customers is distance / speed" msgstr "" -msgid "The algorithm outputs the distinct circuits present in the graph." +msgid "pickup and delivery pair is done with the same vehicle." msgstr "" -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgid "All trucks depart at time 0." msgstr "" -msgid ":math:`|c|` is the number of circuits in the graph." +msgid "the algorithm will raise an exception when" msgstr "" -msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgid "If there is a pickup-deliver pair than violates time window" msgstr "" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "" -msgid "Id of the circuit starting from ``1``" +msgid "Six different initial will be optimized - the best solution found will be result" msgstr "" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgid "Signature" msgstr "" -msgid "Identifier of the starting vertex of the circuit." +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" -msgid "Identifier of the ending vertex of the circuit." +msgid "**options:** ``[factor, max_cycles, initial_sol]``" msgstr "" -msgid "Identifier of the node in the path from a vid to next vid." +msgid "Returns set of |result-pickdrop|" msgstr "" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "Solve the following problem" msgstr "" -msgid "``pgr_isPlanar`` - Experimental" +msgid "Given the vehicles:" msgstr "" -msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgid "and the orders:" msgstr "" -msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgid "The parameters are:" msgstr "" -msgid "This implementation use the Boyer-Myrvold Planarity Testing." +msgid "A `SELECT` statement that returns the following columns:" msgstr "" -msgid "It will return a boolean value depending upon the planarity of the graph." +msgid "id, demand" msgstr "" -msgid "Applicable only for **undirected** graphs." +msgid "p_node_id, p_open, p_close, [p_service,]" msgstr "" -msgid "The algorithm does not considers traversal costs in the calculations." +msgid "d_node_id, d_open, d_close, [d_service,]" msgstr "" -msgid "Running time: :math:`O(|V|)`" +msgid "id, capacity" msgstr "" -msgid "pgr_isPlanar(`Edges SQL`)" +msgid "start_node_id, start_open, start_close [, start_service,]" msgstr "" -msgid "RETURNS ``BOOLEAN``" +msgid "[end_node_id, end_open, end_close, end_service]" msgstr "" -msgid "Returns a boolean ``(pgr_isplanar)``" +msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "``pgr_isplanar``" -msgstr "``pgr_isplanar``" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgstr "" -msgid "`true` when the graph is planar." +msgid "Replaces ``pgr_gsoc_vrppdtw``" msgstr "" -msgid "`false` when the graph is not planar." +msgid "Pickup and Delivery:" msgstr "" -msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgid "capacitated" msgstr "" -msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgid "with time windows." msgstr "" -msgid "`Boost: Boyer Myrvold `__" +msgid "have (x, y) start and ending locations." msgstr "" -msgid "``pgr_johnson``" -msgstr "``pgr_johnson``" +msgid "have a start and ending service times." +msgstr "" -msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgid "An order is for doing a pickup and a a deliver." msgstr "" -msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgid "has (x, y) pickup and delivery locations." msgstr "" -msgid "pgr johnson(`Edges SQL`_, [``directed``])" +msgid "has opening and closing times for the pickup and delivery locations." msgstr "" -msgid "Boost `Johnson `_" +msgid "has a pickup and deliver service times." msgstr "" -msgid "``pgr_kingOrdering`` - Experimental" +msgid "Six different optional different initial solutions" msgstr "" -msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgid "the best solution found will be result" msgstr "" -msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." +msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" msgstr "" -msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." +msgid "p_x, p_y, p_open, p_close, [p_service,]" msgstr "" -msgid "The implementation targets undirected graphs." +msgid "d_x, d_y, d_open, d_close, [d_service]" msgstr "" -msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." +msgid "start_x, start_y, start_open, start_close [, start_service, ]" msgstr "" -msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" +msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" -msgid "where :math:`|E|` is the number of edges," +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgstr "" -msgid ":math:`m` is the maximum degree among all vertices." +msgid "There are 25 vehicles in the problem all with the same characteristics." msgstr "" -msgid "pgr_kingOrdering(`Edges SQL`_)" +msgid "The original orders" msgstr "" -msgid "`Boost: King Ordering `__" +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "" -msgid "``pgr_kruskal``" -msgstr "``pgr_kruskal``" +msgid "The original data needs to be converted to an appropriate table:" +msgstr "" -msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgid "The query" msgstr "" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgstr "" -msgid "EMPTY SET is returned when there are no edges in the graph." +msgid "The best solution found for **lc101** is a travel time: 828.94" msgstr "" -msgid "pgr_kruskal(`Edges SQL`_)" +msgid "This implementation's travel time: 854.54" msgstr "" -msgid "Returns set of |result-mst|" +msgid "``pgr_prim``" +msgstr "``pgr_prim``" + +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" -msgid "Minimum spanning forest" +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." msgstr "" -msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgid "Prim's running time: :math:`O(E * log V)`" msgstr "" -msgid "Added ``pred`` result columns." +msgid "pgr_prim(`Edges SQL`_)" msgstr "" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Minimum spanning forest of a subgraph" msgstr "" -msgid "Returned tree nodes from a root vertex are on Breath First Search order" +msgid "`Boost: Prim's algorithm documentation `__" msgstr "" -msgid "Breath First Search Running time: :math:`O(E + V)`" +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "The Minimum Spanning Tree having as root vertex :math:`6`" +msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" -msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." msgstr "" -msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "" -msgid "Returned tree nodes from a root vertex are on Depth First Search order." +msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "Depth First Search running time: :math:`O(E + V)`" +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgid "``pgr_pushRelabel``" +msgstr "``pgr_pushRelabel``" + +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" -msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "pgr_pushRelabel(Combinations)" msgstr "" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "" -msgid "Returned tree nodes from a root vertex are on Depth First Search order" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgid "``pgr_separateCrossing``" +msgstr "``pgr_separateCrossing``" + +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "" -msgid "The algorithm works in directed graph only." +msgid "Proposed function." msgstr "" -msgid "The algorithm returns *idom* of each vertex." +msgid "This is an auxiliary function for separating crossing edges." msgstr "" -msgid "If the *root vertex* not present in the graph then it returns empty set." +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" msgstr "" -msgid "Running time: :math:`O((V+E)log(V+E))`" +msgid "RETURNS |result-separate|" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" +msgid "Get the segments of the crossing geometries" msgstr "" -msgid "Returns set of |result-idom|" -msgstr "" +msgid "``tolerance``" +msgstr "``tolerance``" -msgid "The dominator tree with root vertex :math:`5`" +msgid "0.01" msgstr "" -msgid "SQL query as described above." +msgid "Used in ST_Snap before ST_Split" msgstr "" -msgid "**root vertex**" +msgid "Get the code for further refinement." msgstr "" -msgid "Returns set of ``(seq, vertex_id, idom)``" +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" -msgid "``vertex_id``" -msgstr "``vertex_id``" +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" -msgid "Identifier of vertex ." +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" msgstr "" -msgid "``idom``" -msgstr "``idom``" - -msgid "Immediate dominator of vertex." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." msgstr "" -msgid "Dominator tree of another component." +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" msgstr "" -msgid "`Boost: Lengauer-Tarjan dominator `__" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" -msgid "`Wikipedia: dominator tree `__" +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "" -msgid "``pgr_lineGraph`` - Proposed" +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." msgstr "" -msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgid "The implementation is applicable only for **undirected** graphs." msgstr "" -msgid "Works for directed and undirected graphs." +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "" -msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgid "Color identifiers values are in the Range :math:`[1, |V|]`" msgstr "" -msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." +msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "" -msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." msgstr "" -msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgid "The returned rows are ordered in ascending order of the vertex value." msgstr "" -msgid "When the graph is directed the result is directed." +msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" msgstr "" -msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." +msgid ":math:`d` is the maximum degree of the vertices in the graph," msgstr "" -msgid "When the graph is undirected the result is undirected." +msgid ":math:`k` is the number of colors used." msgstr "" -msgid "The ``reverse_cost`` is always :math:`-1`." +msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" +msgid "`Boost: Sequential Vertex Coloring `__" msgstr "" -msgid "Returns set of |result-lineg|" +msgid "``pgr_sloanOrdering`` - Experimental" msgstr "" -msgid "For an undirected graph with edges :math:'{2,4,5,8}'" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" msgstr "" -msgid "Gives a local identifier for the edge" +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" -msgid "When `negative`: the source is the reverse edge in the original graph." +msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "When `negative`: the target is the reverse edge in the original graph." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "Weight of the edge (``source``, ``target``)." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "Weight of the edge (``target``, ``source``)." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" -msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgid "pgr_sloanOrdering(`Edges SQL`_)" msgstr "" -msgid "Given the following directed graph" +msgid ":Example : Sloan ordering without specifying start vertex" msgstr "" -msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgid "New sloan ordering order." msgstr "" -msgid "Representation as directed with shared edge identifiers" +msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" -msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" +msgid "`Boost: Sloan Ordering `__" msgstr "" -msgid "hundreds" +msgid "``pgr_stoerWagner`` - Experimental" msgstr "" -msgid "the source vertex" +msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "" -msgid "tens" +msgid "Version 3.0" msgstr "" -msgid "always 0, acts as a separator" +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." msgstr "" -msgid "units" +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." msgstr "" -msgid "the target vertex" +msgid "Sum of the weights of all edges between the two sets is mincut." msgstr "" -msgid "In this image," +msgid "A **mincut** is a cut having the least weight." msgstr "" -msgid "Single or double head arrows represent one edge (row) on the edges table." +msgid "Values are returned when graph is connected." msgstr "" -msgid "The numbers in the yellow shadow are the edge identifiers." +msgid "When there is no edge in graph then EMPTY SET is return." msgstr "" -msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." msgstr "" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgid "Running time: :math:`O(V*E + V^2*log V)`." msgstr "" -msgid "The graph can be created as follows:" +msgid "pgr_stoerWagner(`Edges SQL`_)" msgstr "" -msgid "Line Graph of a directed graph represented with shared edges" +msgid "Returns set of |result-mincut|" msgstr "" -msgid "The result is a directed graph." +msgid "min cut of the main subgraph" msgstr "" -msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgid "Returns set of ``(seq, edge, cost, mincut)``" msgstr "" -msgid "For all the other values of ``seq`` represent one edge." +msgid "Edges which divides the set of vertices into two." msgstr "" -msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "Cost to traverse of edge." msgstr "" -msgid "When positive: the edge exists." +msgid "**mincut**" msgstr "" -msgid "When negative: the edge does not exist." +msgid "Min-cut weight of a undirected graph." msgstr "" -msgid "Representation as directed with unique edge identifiers" +msgid "Additional Example:" msgstr "" -msgid "Single head arrows represent one edge (row) on the edges table." +msgid "min cut of an edge" msgstr "" -msgid "There are no double head arrows" +msgid "Using :doc:`pgr_connectedComponents`" msgstr "" -msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgid "`Boost: Stoer Wagner min cut `__" msgstr "" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgid "``pgr_strongComponents``" +msgstr "``pgr_strongComponents``" + +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." msgstr "" -msgid "Line Graph of a directed graph represented with unique edges" +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." msgstr "" -msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgid "Works for **directed** graphs." msgstr "" -msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgid "Components are described by vertices identifiers." msgstr "" -msgid "wikipedia: `Line Graph `__" +msgid "pgr_strongComponents(`Edges SQL`_)" msgstr "" -msgid "mathworld: `Line Graph `__" +msgid "The strong components of the graph" msgstr "" -msgid "``pgr_lineGraphFull`` - Experimental" +msgid "`Boost: Strong components `__" msgstr "" -msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgid "wikipedia: `Strongly connected component `__" msgstr "" -msgid "Version 2.6.0" +msgid "``pgr_topologicalSort`` - Experimental" msgstr "" -msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." msgstr "" -msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgid "Standardize output to |result_node_order|" msgstr "" -msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." msgstr "" -msgid "Forbid the routing between two edges by removing the connecting edge" +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "" -msgid "This function is for **directed** graphs." +msgid "will return one of them." msgstr "" -msgid "Results are undefined when a negative vertex id is used in the input graph." +msgid "The returned values are ordered in topological order:" msgstr "" -msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgid "pgr_topologicalSort(`Edges SQL`_)" msgstr "" -msgid "Running time: TBD" +msgid "Topologically sorting the graph" msgstr "" -msgid "pgr_lineGraphFull(`Edges SQL`_)" +msgid "Sequential value starting from :math:`1`" msgstr "" -msgid "Returns set of |result-linegf|" +msgid "Linear topological ordering of the vertices" msgstr "" -msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" +msgid "Additional examples" msgstr "" -msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgid "Topologically sorting the one way segments" msgstr "" -msgid "The data" +msgid "Graph is not a DAG" msgstr "" -msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgid "`Boost: topological sort `__" msgstr "" -msgid "|first|" +msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" -msgid "first" +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "The transformation" +msgid "Standardized output to |result-closure|" msgstr "" -msgid "|second|" +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "" -msgid "second" +msgid "Process is valid for directed graphs." msgstr "" -msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "Creating table that identifies transformed vertices" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" -msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgid "The returned values are not ordered" msgstr "" -msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgid "The returned graph is compressed" msgstr "" -msgid "Store edge results" +msgid "Running time: :math:`O(|V||E|)`" msgstr "" -msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" +msgid "The pgr_transitiveClosure function has the following signature:" msgstr "" -msgid "Create the mapping table" +msgid "pgr_transitiveClosure(`Edges SQL`_)" msgstr "" -msgid "From the original graph's vertex information" +msgid "Returns set of |result-closure|" msgstr "" -msgid "Add the new vertices" +msgid "Rechability of a subgraph" msgstr "" -msgid "Filling the mapping table" +msgid "Identifier of the source of the edges" msgstr "" -msgid "The positive vertex identifiers are the original identifiers" +msgid "``target_array``" +msgstr "``target_array``" + +msgid "Identifiers of the targets of the edges" msgstr "" -msgid "Inspecting the vertices map" +msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgid "`Boost: transitive closure `__" msgstr "" -msgid "Updating values from self loops" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "Inspecting the vertices table" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" + +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "Updating from inner self loops" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "Adding a soft restriction" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." +msgid "pgr_trsp(One to One)" msgstr "" -msgid "Identifying the restriction" +msgid "pgr_trsp(One to Many)" msgstr "" -msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgid "pgr_trsp(Many to One)" msgstr "" -msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgid "pgr_trsp(Many to Many)" msgstr "" -msgid "Adding a value to the restriction" +msgid "pgr_trsp(Combinations)" msgstr "" -msgid "Updating the cost to the edge:" +msgid "Deprecated signatures" msgstr "" -msgid "Routing from :math:`6` to :math:`3`" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "Simplifying leaf vertices" +msgid "New prototypes" msgstr "" -msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" + +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" + +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." msgstr "" -msgid "Using the vertex map give the leaf verices their original value." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "" -msgid "On the source column" +msgid "The general algorithm is as follows:" msgstr "" -msgid "On the target column" +msgid "Execute a Dijkstra." msgstr "" -msgid "Removing self loops on leaf nodes" +msgid "If the solution passes thru a restriction then." msgstr "" -msgid "The self loops of the leaf nodes are" +msgid "Execute the **TRSP** algorithm with restrictions." msgstr "" -msgid "Which can be removed" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Complete routing graph" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Add edges from the original graph" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Add all the edges that are not involved in the line graph process to the new table" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Some administrative tasks to get new identifiers for the edges" +msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" -msgid "Add the newly calculated edges" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -msgid "Using the routing graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "When using this method for routing with soft restrictions there will be uturns" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "" -msgid "Routing from :math:`5` to :math:`1`" +msgid "Using a combinations table on an undirected graph." msgstr "" -msgid "https://en.wikipedia.org/wiki/Line_graph" +msgid "`Deprecated documentation `_" msgstr "" -msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" + +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "``pgr_makeConnected`` - Experimental" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" -msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgid "The paths represents the sections of the route." msgstr "" -msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" -msgid "The algorithm does not considers geometric topology in the calculations." +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "" -msgid "pgr_makeConnected(`Edges SQL`_)" +msgid "Execute the **TRSP** algorithm with restrictions for the paths." msgstr "" -msgid "Returns set of |result-component-make|" +msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "" -msgid "List of edges that are needed to connect the graph." +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" msgstr "" -msgid "`Boost: make connected `__" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" -msgid "``pgr_maxCardinalityMatch``" -msgstr "``pgr_maxCardinalityMatch``" +msgid "Simulation of how algorithm works." +msgstr "" -msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" -msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." msgstr "" -msgid "Deprecated signature" +msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" -msgid "directed => ``false`` when used." +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" -msgid "Renamed from ``pgr_maximumCardinalityMatching``" +msgid "Getting the same result as ``pgr_trspVia``:" msgstr "" -msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgid "Example 8" msgstr "" -msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" -msgid "There may be many maximum matchings." +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "Calculates one possible maximum cardinality matching in a graph." +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "" -msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." +msgid ":doc:`via-category`" msgstr "" -msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" + +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "Using all edges." +msgid "**Driving side** parameter is positional unnamed." msgstr "" -msgid "SQL query, which should return a set of rows with the following columns:" +msgid "Valid values depend on kind of graph" msgstr "" -msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" -msgid "Identifier of the edge in the original query." +msgid "is a sequence of paths" msgstr "" -msgid "`Boost: maximum_matching `__" +msgid "Build the Graph with the new points." msgstr "" -msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgid "The points identifiers will be converted to negative values." msgstr "" -msgid "https://en.wikipedia.org/wiki/Ackermann_function" +msgid "The vertices identifiers will remain positive." msgstr "" -msgid "``pgr_maxFlow``" -msgstr "``pgr_maxFlow``" +msgid "Execute a :doc:`pgr_withPointsVia`." +msgstr "" -msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "" -msgid "pgr_maxFlow(Combinations)" +msgid "Execute the **TRSP** algorithm with restrictions for the path." msgstr "" -msgid "Calculates the maximum flow from the sources to the targets." +msgid "Do not use negative values on identifiers of the inner queries." msgstr "" -msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" msgstr "" -msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." +msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "" -msgid "Running time: :math:`O( V ^ 3)`" +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +msgid "When positive it is considered a vertex identifier" msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgid "When negative it is considered a point identifier" msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +msgid "[**driving side**]" msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgid "For directed graph:" msgstr "" -msgid "RETURNS ``BIGINT``" +msgid "[``r``, ``R``] for right driving side" msgstr "" -msgid "Maximum flow possible from the source(s) to the target(s)" +msgid "[``l``, ``L``] for left driving side" msgstr "" -msgid "`Boost: push relabel max flow `__" +msgid "For undirected graph:" msgstr "" -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "[``b``, ``B``] for both driving sides" msgstr "" -msgid "``pgr_maxFlowMinCost`` - Experimental" +msgid "Default values when parameter is missing:" msgstr "" -msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgid "[``r``, ``R``] for directed graph" msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" +msgid "[``l``, ``L``] for undirected graph" msgstr "" -msgid "|Boost| Boost Graph Inside." +msgid "With points optional parameters" msgstr "" -msgid "**TODO** check which statement is true:" +msgid "``details``" +msgstr "``details``" + +msgid "For showing points stops." msgstr "" -msgid "The cost value of all input edges must be nonnegative." +msgid "When ``true`` the results will include the points that are in the path." msgstr "" -msgid "Process is done when the cost value of all input edges is nonnegative." +msgid "When ``false`` the results will not include the points that are in the path." msgstr "" -msgid "Process is done on edges with nonnegative cost." +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." msgstr "" -msgid "Running time: :math:`O(U * (E + V * logV))`" +msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "" -msgid "where :math:`U` is the value of the max flow." +msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "" -msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Usage variations" msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" -msgid "Returns set of |result-flow-mincost|" +msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" +msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" -msgid "**The cost value of all input edges must be nonnegative.**" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" -msgid "When the maximum flow is 0 then there is no flow and **0** is returned." +msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "Uses :doc:`pgr_maxFlowMinCost`." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" + +msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "RETURNS FLOAT" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "``pgr_pickDeliver`` - Experimental" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" +msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "Optimization problem is NP-hard." +msgid "Vertices of the graph are:" msgstr "" -msgid "pickup and Delivery with time windows." +msgid "**positive** when it belongs to the `Edges SQL`_" msgstr "" -msgid "All vehicles are equal." +msgid "**negative** when it belongs to the `Points SQL`_" msgstr "" -msgid "Same Starting location." +msgid "The `agg_cost` in the non included values `(v, v)` is `0`" msgstr "" -msgid "Same Ending location which is the same as Starting location." +msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "All vehicles travel at the same speed." +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." msgstr "" -msgid "A customer is for doing a pickup or doing a deliver." +msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "" -msgid "has an open time." +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "has a closing time." +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "has a service time." +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "has an (x, y) location." +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "There is a customer where to deliver a pickup." +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" msgstr "" -msgid "travel time between customers is distance / speed" +msgid "**options:** ``[directed, details]``" msgstr "" -msgid "pickup and delivery pair is done with the same vehicle." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" msgstr "" -msgid "All trucks depart at time 0." +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "the algorithm will raise an exception when" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" msgstr "" -msgid "If there is a pickup-deliver pair than violates time window" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." msgstr "" -msgid "The speed, max_cycles, ma_capacity have illegal values" +msgid "Two combinations" msgstr "" -msgid "Six different initial will be optimized - the best solution found will be result" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" msgstr "" -msgid "Signature" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" -msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "**options:** ``[factor, max_cycles, initial_sol]``" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" msgstr "" -msgid "Returns set of |result-pickdrop|" +msgid "Passes in front or visits with right side driving." msgstr "" -msgid "Solve the following problem" +msgid "For point :math:`6` and vertex :math:`11`." msgstr "" -msgid "Given the vehicles:" +msgid "Passes in front or visits with left side driving." msgstr "" -msgid "and the orders:" +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" -msgid "The parameters are:" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" msgstr "" -msgid "A `SELECT` statement that returns the following columns:" +msgid "Output columns standardized to |nksp-result|" msgstr "" -msgid "id, demand" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" -msgid "p_node_id, p_open, p_close, [p_service,]" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "d_node_id, d_open, d_close, [d_service,]" +msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" msgstr "" -msgid "id, capacity" +msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" msgstr "" -msgid "start_node_id, start_open, start_close [, start_service,]" +msgid "Special optional parameters" msgstr "" -msgid "[end_node_id, end_open, end_close, end_service]" -msgstr "" +msgid "``stop_on_first``" +msgstr "``stop_on_first``" -msgid "``pgr_pickDeliverEuclidean`` - Experimental" +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "When ``false`` returns at most K paths" msgstr "" -msgid "Replaces ``pgr_gsoc_vrppdtw``" +msgid "When ``true`` returns only paths that do not violate restrictions" msgstr "" -msgid "Pickup and Delivery:" +msgid "When ``false`` returns the paths found" msgstr "" -msgid "capacitated" +msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." msgstr "" -msgid "with time windows." +msgid "No results because the only path available follows a restriction." msgstr "" -msgid "have (x, y) start and ending locations." +msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" msgstr "" -msgid "have a start and ending service times." +msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" msgstr "" -msgid "An order is for doing a pickup and a a deliver." +msgid "``pgr_version``" +msgstr "``pgr_version``" + +msgid "``pgr_version`` — Query for pgRouting version information." msgstr "" -msgid "has (x, y) pickup and delivery locations." +msgid "Breaking change on result columns" msgstr "" -msgid "has opening and closing times for the pickup and delivery locations." +msgid "Support for old signature ends" msgstr "" -msgid "has a pickup and deliver service times." +msgid "Returns pgRouting version information." msgstr "" -msgid "Six different optional different initial solutions" +msgid "pgr_version()" msgstr "" -msgid "the best solution found will be result" +msgid "RETURNS ``TEXT``" msgstr "" -msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgid "pgRouting Version for this documentation" msgstr "" -msgid "p_x, p_y, p_open, p_close, [p_service,]" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" -msgid "d_x, d_y, d_open, d_close, [d_service]" +msgid "**No documentation available**" msgstr "" -msgid "start_x, start_y, start_open, start_close [, start_service, ]" +msgid "**TBD**" msgstr "" -msgid "[ end_x, end_y, end_open, end_close, end_service ]" +msgid "TBD" msgstr "" -msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." msgstr "" -msgid "There are 25 vehicles in the problem all with the same characteristics." +msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "The original orders" +msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "The data comes in different rows for the pickup and the delivery of the same order." +msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "The original data needs to be converted to an appropriate table:" +msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "The query" +msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgid "pgr_withPoints(Combinations)" msgstr "" -msgid "The best solution found for **lc101** is a travel time: 828.94" +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "This implementation's travel time: 854.54" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "``pgr_prim``" -msgstr "``pgr_prim``" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "Prim's running time: :math:`O(E * log V)`" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" -msgid "pgr_prim(`Edges SQL`_)" +msgid "**options:** ``[directed, details])``" msgstr "" -msgid "Minimum spanning forest of a subgraph" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" msgstr "" -msgid "`Boost: Prim's algorithm documentation `__" +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." msgstr "" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." msgstr "" -msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." msgstr "" -msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgid "**Driving side** parameter is unnamed and compulsory." msgstr "" -msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +msgid "Output columns standardized to |matrix-result|" msgstr "" -msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "pgr_withpointscost(text,text,text,boolean,character)" msgstr "" -msgid "``pgr_pushRelabel``" -msgstr "``pgr_pushRelabel``" +msgid "pgr_withPointsCost(Combinations)" +msgstr "" -msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." msgstr "" -msgid "pgr_pushRelabel(Combinations)" +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." msgstr "" -msgid "Renamed from ``pgr_maxFlowPushRelabel``" +msgid "The returned values are in the form of a set of |matrix-result|." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +msgid "**positive** when it belongs to the edges_sql" msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +msgid "**negative** when it belongs to the points_sql" msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +msgid "For **undirected** graphs, the results are **symmetric**." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "``pgr_separateCrossing``" -msgstr "``pgr_separateCrossing``" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "" -msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "Proposed function." +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "This is an auxiliary function for separating crossing edges." +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" -msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgid "**options:** ``[directed]``" msgstr "" -msgid "RETURNS |result-separate|" +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." msgstr "" -msgid "Get the segments of the crossing geometries" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." msgstr "" -msgid "``tolerance``" -msgstr "``tolerance``" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgstr "" -msgid "0.01" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." msgstr "" -msgid "Used in ST_Snap before ST_Split" +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Get the code for further refinement." +msgid "Being close to the graph does not mean have a shorter route." msgstr "" -msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgid "Right side driving topology" msgstr "" -msgid "``pgr_separateTouching``" -msgstr "``pgr_separateTouching``" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "" -msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" +msgid "Left side driving topology" msgstr "" -msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." +msgid "Does not matter driving side driving topology" msgstr "" -msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." msgstr "" -msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" msgstr "" -msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" msgstr "" -msgid "The implementation is applicable only for **undirected** graphs." +msgid "Returning a **symmetrical** cost matrix" msgstr "" -msgid "Provides the color to be assigned to all the vertices present in the graph." +msgid "Using the default ``side`` value on the **points_sql** query" msgstr "" -msgid "Color identifiers values are in the Range :math:`[1, |V|]`" +msgid "Using the default ``driving side`` value" msgstr "" -msgid "The algorithm tries to assign the least possible color to every vertex." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "" -msgid "The returned rows are ordered in ascending order of the vertex value." +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid ":math:`d` is the maximum degree of the vertices in the graph," +msgid "Output columns standardized to |result-spantree|" msgstr "" -msgid ":math:`k` is the number of colors used." +msgid "When ``details`` is ``false``:" msgstr "" -msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgid "Points reached within the distance are not included." msgstr "" -msgid "`Boost: Sequential Vertex Coloring `__" +msgid "Deprecated signatures:" msgstr "" -msgid "``pgr_sloanOrdering`` - Experimental" +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." msgstr "" -msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" msgstr "" -msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" msgstr "" -msgid "Finds a pseudoperipheral vertex pair to determine good starting points" +msgid "**options A:** ``[directed, details]``" msgstr "" -msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." +msgid "**options B:** ``[directed, details, equicost]``" msgstr "" -msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" msgstr "" -msgid "Typically produces better orderings than simple breadth-first approaches." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." msgstr "" -msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" msgstr "" -msgid "pgr_sloanOrdering(`Edges SQL`_)" +msgid "**options:** ``[directed, details, equicost]``" msgstr "" -msgid ":Example : Sloan ordering without specifying start vertex" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" msgstr "" -msgid "New sloan ordering order." +msgid "Negative values represent a point" msgstr "" -msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "`Boost: Sloan Ordering `__" +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "``pgr_stoerWagner`` - Experimental" +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." +msgid "Driving side does not matter" msgstr "" -msgid "Version 3.0" +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." msgstr "" -msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" + +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" -msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "Sum of the weights of all edges between the two sets is mincut." +msgid "pgr_withPointsKSP(One to Many)" msgstr "" -msgid "A **mincut** is a cut having the least weight." +msgid "pgr_withPointsKSP(Many to One)" msgstr "" -msgid "Values are returned when graph is connected." +msgid "pgr_withPointsKSP(Many to Many)" msgstr "" -msgid "When there is no edge in graph then EMPTY SET is return." +msgid "pgr_withPointsKSP(Combinations)" msgstr "" -msgid "When the graph is unconnected then EMPTY SET is return." +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" -msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "Running time: :math:`O(V*E + V^2*log V)`." +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "pgr_stoerWagner(`Edges SQL`_)" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "Returns set of |result-mincut|" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "min cut of the main subgraph" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" msgstr "" -msgid "Returns set of ``(seq, edge, cost, mincut)``" +msgid "**options:** ``[directed, heap_paths, details]``" msgstr "" -msgid "Edges which divides the set of vertices into two." +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." msgstr "" -msgid "Cost to traverse of edge." +msgid "For a directed graph." msgstr "" -msgid "**mincut**" +msgid "No details are given about distance of other points of the query." msgstr "" -msgid "Min-cut weight of a undirected graph." +msgid "No heap paths are returned." msgstr "" -msgid "Additional Example:" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "min cut of an edge" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" msgstr "" -msgid "Using :doc:`pgr_connectedComponents`" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" msgstr "" -msgid "`Boost: Stoer Wagner min cut `__" +msgid "Using a combinations table on an **directed** graph" msgstr "" -msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgid "Number of required paths" msgstr "" -msgid "``pgr_strongComponents``" -msgstr "``pgr_strongComponents``" - -msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgid "withPointsKSP optional parameters" msgstr "" -msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Works for **directed** graphs." +msgid "Left driving side" msgstr "" -msgid "Components are described by vertices identifiers." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." msgstr "" -msgid "pgr_strongComponents(`Edges SQL`_)" +msgid "Right driving side" msgstr "" -msgid "The strong components of the graph" +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." msgstr "" -msgid "`Boost: Strong components `__" +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" + +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." msgstr "" -msgid "wikipedia: `Strongly connected component `__" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "``pgr_topologicalSort`` - Experimental" +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" -msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" msgstr "" -msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." msgstr "" -msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "For optimization purposes, if there are more than one answer, the function" +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" -msgid "will return one of them." +msgid "Prim - Family of functions" msgstr "" -msgid "The returned values are ordered in topological order:" +msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." msgstr "" -msgid "pgr_topologicalSort(`Edges SQL`_)" +msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." msgstr "" -msgid "Topologically sorting the graph" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" msgstr "" -msgid "Sequential value starting from :math:`1`" +msgid "Boost: `Prim's algorithm `__" msgstr "" -msgid "Linear topological ordering of the vertices" +msgid "Wikipedia: `Prim's algorithm `__" msgstr "" -msgid "Additional examples" +msgid "Proposed Functions" msgstr "" -msgid "Topologically sorting the one way segments" +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" -msgid "Graph is not a DAG" +msgid "Reference" msgstr "" -msgid "`Boost: topological sort `__" +msgid "Release Notes" msgstr "" -msgid "``pgr_transitiveClosure`` - Experimental" +msgid "To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "Mayors" msgstr "" -msgid "Transforms the input directed graph into the transitive closure of the graph." +msgid "pgRouting 4" msgstr "" -msgid "Process is valid for directed graphs." +msgid "Minors 4.x" msgstr "" -msgid "The transitive closure of an undirected graph produces a cluster graph" +msgid "pgRouting 4.1" msgstr "" -msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgid "pgRouting 4.0" msgstr "" -msgid "The returned values are not ordered" +msgid "pgRouting 4.0.1 Release Notes" msgstr "" -msgid "The returned graph is compressed" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" msgstr "" -msgid "Running time: :math:`O(|V||E|)`" +msgid "Bug Fixes" msgstr "" -msgid "The pgr_transitiveClosure function has the following signature:" +msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "" -msgid "pgr_transitiveClosure(`Edges SQL`_)" +msgid "`#3034 `__: metrics driver should not be using new" msgstr "" -msgid "Returns set of |result-closure|" +msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" msgstr "" -msgid "Rechability of a subgraph" +msgid "`#3040 `__: Check and fix cppcoreguidelines-virtual-class-destructor" msgstr "" -msgid "Identifier of the source of the edges" +msgid "`#3039 `__: Check and fix cppcoreguidelines-special-member-functions" msgstr "" -msgid "``target_array``" -msgstr "``target_array``" +msgid "`#3038 `__: Check and fix cppcoreguidelines-prefer-member-initializer" +msgstr "" -msgid "Identifiers of the targets of the edges" +msgid "`#3037 `__: Check and fix cppcoreguidelines-init-variables" msgstr "" -msgid "Identifiers of the vertices that are reachable from vertex v." +msgid "`#3035 `__: Pass by reference on existing drivers" msgstr "" -msgid "`Boost: transitive closure `__" +msgid "Administration" msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "`#3031 `__: pgtap license to Creative commons and License texts standardization" msgstr "" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +msgid "pgRouting 4.0.0 Release Notes" +msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" -msgid "pgr_trsp(One to One)" +msgid "Build" msgstr "" -msgid "pgr_trsp(One to Many)" +msgid "C++ standard is std17" msgstr "" -msgid "pgr_trsp(Many to One)" +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" -msgid "pgr_trsp(Many to Many)" +msgid "The code is not yet modified to use std17:" msgstr "" -msgid "pgr_trsp(Combinations)" +msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." msgstr "" -msgid "Deprecated signatures" +msgid "The user's documentation is built by default." msgstr "" -msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "The doxygen documentation is built by default." msgstr "" -msgid "New prototypes" +msgid "For developers:" msgstr "" -msgid "pgr_trspViaVertices" -msgstr "pgr_trspViaVertices" +msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." +msgstr "" -msgid "pgr_trspViaEdges" -msgstr "pgr_trspViaEdges" +msgid "Tidy checks are done on CI." +msgstr "" -msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgid "Documentation build" msgstr "" -msgid "It does no guarantee the shortest path as it might contain restriction paths." +msgid "The doxygen documentation is built by default" msgstr "" -msgid "The general algorithm is as follows:" +msgid "The HTML documentation is built by default" msgstr "" -msgid "Execute a Dijkstra." +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "" -msgid "If the solution passes thru a restriction then." +msgid "`WITH-DOC` is not used anymore" msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions." +msgid "User Documentation is not built when" msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Sphinx is not found" msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "When all Sphinx formats are OFF" msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "When all languages are OFF" msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" msgstr "" -msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." +msgid "Documentation output location: ``build/doc/_build/``" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "For example: for HTML output is on `build/doc/_build/html` directory" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "Developers' Documentation is not built when" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgid "Doxygen is not found" msgstr "" -msgid "Using a combinations table on an undirected graph." +msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" -msgid "`Deprecated documentation `_" +msgid "Summary of changes by function" msgstr "" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" +msgid "pgr_aStar" +msgstr "pgr_aStar" -msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." -msgstr "" +msgid "pgr_aStarCost" +msgstr "pgr_aStarCost" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" +msgid "pgr_bandwidth" +msgstr "pgr_bandwidth" -msgid "The paths represents the sections of the route." -msgstr "" +msgid "pgr_bdAstar" +msgstr "pgr_bdAstar" -msgid "Execute a :doc:`pgr_dijkstraVia`." -msgstr "" +msgid "pgr_bdAstarCost" +msgstr "pgr_bdAstarCost" -msgid "For the set of sub paths of the solution that pass through a restriction then" -msgstr "" +msgid "pgr_bdDijkstra" +msgstr "pgr_bdDijkstra" -msgid "Execute the **TRSP** algorithm with restrictions for the paths." -msgstr "" +msgid "pgr_bdDijkstraCost" +msgstr "pgr_bdDijkstraCost" -msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." -msgstr "" +msgid "pgr_bellmanFord" +msgstr "pgr_bellmanFord" -msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgstr "" +msgid "pgr_binaryBreadthFirstSearch" +msgstr "pgr_binaryBreadthFirstSearch" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." -msgstr "" +msgid "pgr_bipartite" +msgstr "pgr_bipartite" -msgid "Simulation of how algorithm works." -msgstr "" +msgid "pgr_boykovKolmogorov" +msgstr "pgr_boykovKolmogorov" -msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" -msgstr "" +msgid "pgr_breadthFirstSearch" +msgstr "pgr_breadthFirstSearch" -msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +msgid ":" msgstr "" -msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." -msgstr "" +msgid "pgr_contraction" +msgstr "pgr_contraction" -msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" +msgid "pgr_dagShortestPath" +msgstr "pgr_dagShortestPath" -msgid "Getting the same result as ``pgr_trspVia``:" -msgstr "" +msgid "pgr_depthFirstSearch" +msgstr "pgr_depthFirstSearch" -msgid "Example 8" -msgstr "" +msgid "pgr_dijkstra" +msgstr "pgr_dijkstra" -msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." -msgstr "" +msgid "pgr_dijkstraCost" +msgstr "pgr_dijkstraCost" -msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." -msgstr "" +msgid "pgr_dijkstraNear" +msgstr "pgr_dijkstraNear" -msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "" +msgid "pgr_dijkstraNearCost" +msgstr "pgr_dijkstraNearCost" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." -msgstr "" +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" -msgid ":doc:`via-category`" -msgstr "" +msgid "pgr_edgeDisjointPaths" +msgstr "pgr_edgeDisjointPaths" -msgid "``pgr_trspVia_withPoints``" -msgstr "``pgr_trspVia_withPoints``" +msgid "pgr_edmondsKarp" +msgstr "pgr_edmondsKarp" -msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." -msgstr "" +msgid "pgr_edwardMoore" +msgstr "pgr_edwardMoore" -msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" +msgid "pgr_kingOrdering" +msgstr "pgr_kingOrdering" -msgid "is a sequence of paths" -msgstr "" +msgid "pgr_KSP" +msgstr "pgr_KSP" -msgid "Build the Graph with the new points." -msgstr "" +msgid "pgr_maxCardinalityMatch" +msgstr "pgr_maxCardinalityMatch" -msgid "The points identifiers will be converted to negative values." -msgstr "" +msgid "pgr_maxFlow" +msgstr "pgr_maxFlow" -msgid "The vertices identifiers will remain positive." -msgstr "" +msgid "pgr_pushRelabel" +msgstr "pgr_pushRelabel" -msgid "Execute a :doc:`pgr_withPointsVia`." -msgstr "" +msgid "pgr_sequentialVertexColoring" +msgstr "pgr_sequentialVertexColoring" -msgid "For the set of paths of the solution that pass through a restriction then" -msgstr "" +msgid "pgr_sloanOrdering" +msgstr "pgr_sloanOrdering" -msgid "Execute the **TRSP** algorithm with restrictions for the path." -msgstr "" +msgid "pgr_topologicalSort" +msgstr "pgr_topologicalSort" -msgid "Do not use negative values on identifiers of the inner queries." -msgstr "" +msgid "pgr_transitiveClosure" +msgstr "pgr_transitiveClosure" -msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" -msgstr "" +msgid "pgr_trsp" +msgstr "pgr_trsp" -msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgstr "" +msgid "pgr_trspVia" +msgstr "pgr_trspVia" -msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." +msgid "pgr_trspVia_withPoints" msgstr "" -msgid "When positive it is considered a vertex identifier" +msgid "pgr_trsp_withPoints" msgstr "" -msgid "When negative it is considered a point identifier" -msgstr "" +msgid "pgr_TSP" +msgstr "pgr_TSP" -msgid "[**driving side**]" -msgstr "" +msgid "pgr_TSPeuclidean" +msgstr "pgr_TSPeuclidean" -msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" -msgstr "" +msgid "pgr_turnRestrictedPath" +msgstr "pgr_turnRestrictedPath" -msgid "For directed graph:" -msgstr "" +msgid "pgr_withPoints" +msgstr "pgr_withPoints" -msgid "[``r``, ``R``] for right driving side" -msgstr "" +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" -msgid "[``l``, ``L``] for left driving side" -msgstr "" +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" -msgid "For undirected graph:" -msgstr "" +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" -msgid "[``b``, ``B``] for both driving sides" -msgstr "" +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" -msgid "Default values when parameter is missing:" -msgstr "" +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" -msgid "[``r``, ``R``] for directed graph" +msgid "Functions promoted to official" msgstr "" -msgid "[``l``, ``L``] for undirected graph" +msgid "`#2701 `__: pgr_trsp" msgstr "" -msgid "With points optional parameters" +msgid "`#2701 `__: pgr_trspVia" msgstr "" -msgid "``details``" -msgstr "``details``" - -msgid "For showing points stops." +msgid "`#2701 `__: pgr_trspVia_withPoints" msgstr "" -msgid "When ``true`` the results will include the points that are in the path." +msgid "`#2701 `__: pgr_trsp_withPoints" msgstr "" -msgid "When ``false`` the results will not include the points that are in the path." +msgid "`#2700 `__: pgr_withPoints" msgstr "" -msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgid "`#2700 `__: pgr_withPointsCost" msgstr "" -msgid "Use ``pgr_findCloseEdges`` for points on the fly" +msgid "`#2700 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "Using :doc:`pgr_findCloseEdges`:" +msgid "`#2700 `__: pgr_withPointsDD" msgstr "" -msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." +msgid "`#2700 `__: pgr_withPointsKSP" msgstr "" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "`#2700 `__: pgr_withPointsVia" msgstr "" -msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "" -msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "" -msgid "Usage variations" +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +msgid "Signatures promoted to official" msgstr "" -msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." +msgid "`#2718 `__: pgr_aStar(Combinations)" msgstr "" -msgid "The algorithm performs a :doc:`pgr_withPointsVia`" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" msgstr "" -msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgid "`#2718 `__: pgr_bdAstar(Combinations)" msgstr "" -msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" msgstr "" -msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" msgstr "" -msgid "Getting the same result as ``pgr_trspVia_withPoints``:" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgid "`#2718 `__: pgr_dijkstra(Combinations)" msgstr "" -msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" msgstr "" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgid "`#2718 `__: pgr_KSP(All signatures)" msgstr "" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" - -msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" msgstr "" -msgid "Vertices of the graph are:" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" msgstr "" -msgid "**positive** when it belongs to the `Edges SQL`_" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" msgstr "" -msgid "**negative** when it belongs to the `Points SQL`_" +msgid "New experimental functions." msgstr "" -msgid "The `agg_cost` in the non included values `(v, v)` is `0`" +msgid "Metrics" msgstr "" -msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" +msgid "`#2951 `__: pgr_bandwidth" msgstr "" -msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgid "Ordering" msgstr "" -msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgid "`#2954 `__: pgr_kingOrdering" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgid "`#2955 `__: pgr_sloanOrdering" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgid "SQL signatures and output standardization" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgid "`#2904 `__: Standardize output columns of functions with different output" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgid "columns within overloads" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgid "Standardized to |short-generic-result|" msgstr "" -msgid "**options:** ``[directed, details]``" +msgid "`#2905 `__: pgr_withPoints" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgid "`#2906 `__: pgr_bdDijkstra" msgstr "" -msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgid "`#2907 `__: pgr_bellmanFord" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgid "`#2910 `__: pgr_edwardMoore" msgstr "" -msgid "Two combinations" +msgid "`#2913 `__: pgr_dagShortestPath" msgstr "" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgid "Standardized to |matrix-result|" msgstr "" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." +msgid "`#2905 `__: pgr_withPointsCost" msgstr "" -msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2905 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgid "Standardized to |generic-result|" msgstr "" -msgid "Passes in front or visits with right side driving." +msgid "`#2909 `__: pgr_edgeDisjointPaths" msgstr "" -msgid "For point :math:`6` and vertex :math:`11`." +msgid "`#2909 `__: pgr_turnRestrictedPath" msgstr "" -msgid "Passes in front or visits with left side driving." +msgid "Standardized to |result_edge_color|" msgstr "" -msgid "``pgr_turnRestrictedPath`` - Experimental" +msgid "`#2924 `__: pgr_edgeColoring" msgstr "" -msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgid "Standardized to |result_node_color|" msgstr "" -msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" +msgid "`#2924 `__: pgr_bipartite" msgstr "" -msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "`#2927 `__: pgr_sequentialVertexColoring" msgstr "" -msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +msgid "Standardized to |result-spantree|" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" +msgid "`#2931 `__: pgr_breadthFirstSearch" msgstr "" -msgid "Special optional parameters" +msgid "`#2931 `__: pgr_depthFirstSearch" msgstr "" -msgid "``stop_on_first``" -msgstr "``stop_on_first``" - -msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgid "Standardized to |result_node_order|" msgstr "" -msgid "When ``false`` returns at most K paths" +msgid "`#2934 `__: pgr_topologicalSort" msgstr "" -msgid "When ``true`` returns only paths that do not violate restrictions" +msgid "Standardized to |result-closure|" msgstr "" -msgid "When ``false`` returns the paths found" +msgid "`#2934 `__: pgr_transitiveClosure" msgstr "" -msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." +msgid "Removal of SQL deprecated signatures" msgstr "" -msgid "No results because the only path available follows a restriction." +msgid "`#2798 `__: pgr_contraction" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" +msgid "`#2683 `__: pgr_trsp" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" +msgid "`#2683 `__: pgr_trspVia" msgstr "" -msgid "``pgr_version``" -msgstr "``pgr_version``" - -msgid "``pgr_version`` — Query for pgRouting version information." +msgid "`#2888 `__: pgr_findCloseEdges" msgstr "" -msgid "Breaking change on result columns" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "Support for old signature ends" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "Returns pgRouting version information." +msgid "`#2890 `__: pgr_withPointsDD" msgstr "" -msgid "pgr_version()" +msgid "`#2895 `__: pgr_withPointsKSP" msgstr "" -msgid "RETURNS ``TEXT``" +msgid "`#2899 `__: pgr_maxCardinalityMatch" msgstr "" -msgid "pgRouting Version for this documentation" +msgid "`#2901 `__: pgr_TSP" msgstr "" -msgid "``pgr_vrpOneDepot`` - Experimental" +msgid "`#2901 `__: pgr_TSPeuclidean" msgstr "" -msgid "**No documentation available**" +msgid "Removal of SQL deprecated functions" msgstr "" -msgid "**TBD**" +msgid "`#2681 `__: pgr_trspViaedges" msgstr "" -msgid "TBD" +msgid "`#2682 `__: pgr_trspViaVertices" msgstr "" -msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgid "`#2748 `__: pgr_alphaShape" msgstr "" -msgid "pgr_withPoints(Combinations)" +msgid "`#2751 `__: pgr_createTopology" msgstr "" -msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgid "`#2752 `__: pgr_analyzeGraph" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgid "`#2755 `__: pgr_analyzeOneWay" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgid "`#2827 `__: pgr_createVerticesTable" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgid "`#2886 `__: pgr_nodeNetwork" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgid "Removal of SQL deprecated internal functions" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" msgstr "" -msgid "**options:** ``[directed, details])``" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" msgstr "" -msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" msgstr "" -msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" msgstr "" -msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" msgstr "" -msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" msgstr "" -msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" msgstr "" -msgid "pgr_withPointsCost(Combinations)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "" -msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" msgstr "" -msgid "The returned values are in the form of a set of |matrix-result|." +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" msgstr "" -msgid "**positive** when it belongs to the edges_sql" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "" -msgid "**negative** when it belongs to the points_sql" +msgid "`#2861 `__ _pgr_endPoint(geometry)" msgstr "" -msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" msgstr "" -msgid "For **undirected** graphs, the results are **symmetric**." +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" msgstr "" -msgid "**options:** ``[directed]``" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" msgstr "" -msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" msgstr "" -msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "Being close to the graph does not mean have a shorter route." +msgid "`#2861 `__ _pgr_msg(integer,text,text)" msgstr "" -msgid "Right side driving topology" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" msgstr "" -msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" msgstr "" -msgid "Left side driving topology" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "Does not matter driving side driving topology" +msgid "`#2861 `__ _pgr_quote_ident(text)" msgstr "" -msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgid "`#2861 `__ _pgr_startPoint(geometry)" msgstr "" -msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "Returning a **symmetrical** cost matrix" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" msgstr "" -msgid "Using the default ``side`` value on the **points_sql** query" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" msgstr "" -msgid "Using the default ``driving side`` value" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" msgstr "" -msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" msgstr "" -msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "Output columns standardized to |result-spantree|" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "When ``details`` is ``false``:" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "Points reached within the distance are not included." +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Deprecated signatures:" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgid "`#2861 `__ _pgr_versionLess(text,text)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" msgstr "" -msgid "**options A:** ``[directed, details]``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "**options B:** ``[directed, details, equicost]``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" msgstr "" -msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "**options:** ``[directed, details, equicost]``" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" msgstr "" -msgid "Negative values represent a point" +msgid "Summary of functions and signatures no longer on pgrouting" msgstr "" -msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" msgstr "" -msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" msgstr "" -msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" msgstr "" -msgid "Driving side does not matter" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" msgstr "" -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgstr "" -msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "pgr_withPointsKSP(One to Many)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "pgr_withPointsKSP(Many to One)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "pgr_withPointsKSP(Many to Many)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" msgstr "" -msgid "pgr_withPointsKSP(Combinations)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "**options:** ``[directed, heap_paths, details]``" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "For a directed graph." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "No details are given about distance of other points of the query." +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "No heap paths are returned." +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "Using a combinations table on an **directed** graph" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" msgstr "" -msgid "Number of required paths" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" msgstr "" -msgid "withPointsKSP optional parameters" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" msgstr "" -msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "Left driving side" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "Right driving side" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "" -msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgid "Removal of unused C/C++ code" msgstr "" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" +msgid "Refactor the Script to build the update PostgreSQL file." msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "One process & driver for:" msgstr "" -msgid "Prim - Family of functions" +msgid "allpairs: johnson and Floyd-Warshall" msgstr "" -msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." +msgid "Shortest path: Dijkstra and withPoints using Dijkstra" msgstr "" -msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." +msgid "Deprecation of internal C/C++ functions" msgstr "" -msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgid "Deprecated functions are substituted by new function." msgstr "" -msgid "Boost: `Prim's algorithm `__" +msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" msgstr "" -msgid "Wikipedia: `Prim's algorithm `__" +msgid "_pgr_withPointsDD => _pgr_withPointsddv4" msgstr "" -msgid "Proposed Functions" +msgid "_pgr_kruskal => _pgr_kruskalv4" msgstr "" -msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid "_pgr_prim => _pgr_primv4" msgstr "" -msgid "Reference" +msgid "_pgr_dijkstra => _pgr_dijkstra_v4" msgstr "" -msgid "Release Notes" +msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" msgstr "" -msgid "To see the full list of changes check the list of `Git commits `_ on Github." +msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" msgstr "" -msgid "Mayors" +msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" msgstr "" -msgid "pgRouting 4" +msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" msgstr "" -msgid "Minors 4.x" +msgid "Internal C/C++ functions in legacy" msgstr "" -msgid "pgRouting 4.1" +msgid "`#2683 `__ _trsp" msgstr "" -msgid "pgRouting 4.1.0 Release Notes" +msgid "`#2683 `__ _v4trsp" msgstr "" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgid "`#2748 `__ _pgr_alphaShape" msgstr "" -msgid "No changes yet" +msgid "`#2913 `__ _pgr_dagShortestPath" msgstr "" msgid "pgRouting 3" @@ -14579,9 +14642,6 @@ msgstr "" msgid "Removed unnecessary column seq" msgstr "" -msgid "Bug Fixes" -msgstr "" - msgid "pgr_maxFlowMinCost" msgstr "pgr_maxFlowMinCost" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 30eba92afe..86a4189d54 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,20 @@ # Celia Virginia Vergara Castillo , 2023, 2024, 2025. # DeepL , 2024, 2025. msgid "" -msgstr "Project-Id-Version: pgRouting v4.1\nReport-Msgid-Bugs-To: \nPOT-Creation-Date: 2025-12-10 19:55+0000\nPO-Revision-Date: 2025-12-10 20:25+0000\nLast-Translator: DeepL \nLanguage-Team: Spanish \nLanguage: es\nMIME-Version: 1.0\nContent-Type: text/plain; charset=UTF-8\nContent-Transfer-Encoding: 8bit\nPlural-Forms: nplurals=2; plural=n != 1;\nX-Generator: Weblate 5.4.3\nGenerated-By: Babel 2.10.3\n" +msgstr "" +"Project-Id-Version: pgRouting v4.1\n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2026-03-04 00:25+0000\n" +"PO-Revision-Date: 2025-12-10 20:25+0000\n" +"Last-Translator: DeepL \n" +"Language-Team: Spanish \n" +"Language: es\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=UTF-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Plural-Forms: nplurals=2; plural=n != 1;\n" +"X-Generator: Weblate 5.4.3\n" +"Generated-By: Babel 2.10.3\n" msgid "BFS - Category" msgstr "BFS - Categoría" @@ -3513,10112 +3526,10179 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" -msgid "pgRouting 4.0" -msgstr "pgRouting 4.0" - -msgid "pgRouting 4.0.0-alpha1 Release Notes" -msgstr "Notas de la versión de pgRouting 4.0.0-alpha1" +#, fuzzy +msgid "pgRouting 4.1.0 Release Notes" +msgstr "Notas de la Versión pgRouting 3.1.0" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 `__" -msgid "Build" -msgstr "Construir" +msgid "Code enhancements" +msgstr "Mejoras del código" -msgid "C++ standard is std17" -msgstr "" +#, fuzzy +msgid "`#3049 `__: Use enumeration on drivers and process." +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid "Using this standard, all supported toolchains across our CI matrix will work." -msgstr "" +#, fuzzy +msgid "`#3054 `__: Change error message when edges_sql is empty" +msgstr "`#1640 `__: pgr_withPoints falla cuando points_sql está vacía" -msgid "The code is not yet modified to use std17:" -msgstr "" +#, fuzzy +msgid "`#3055 `__: bdDijkstra: use the shortest_path process and driver" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." -msgstr "" +#, fuzzy +msgid "`#3056 `__: edwardMoore: use the shortest_path process and driver" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "The user's documentation is built by default." -msgstr "La documentación del usuario se construye por defecto." +#, fuzzy +msgid "`#3060 `__: dagShortestPath: use the shortest_path process and driver" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "The doxygen documentation is built by default." -msgstr "La documentación doxygen se construye por defecto." +#, fuzzy +msgid "`#3064 `__: Astar: create and use a process and driver for Astar" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "For developers:" -msgstr "Para desarrolladores:" +#, fuzzy +msgid "`#3075 `__: Spanning tree: create and use a process and driver" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." -msgstr "" +#, fuzzy +msgid "`#3086 `__: MaxFlow: create and use a process and driver" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "Tidy checks are done on CI." -msgstr "" +#, fuzzy +msgid "`#3089 `__: edgeDisjoint and bellmanFord use shortestPath driver and process" +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid "Documentation build" -msgstr "Construcción de la documentación" +msgid "All releases" +msgstr "Todas las versiones" -msgid "The doxygen documentation is built by default" -msgstr "La documentación doxygen se construye por defecto" +msgid "Kruskal - Family of functions" +msgstr "Kruskal - Familia de funciones" -msgid "The HTML documentation is built by default" -msgstr "La documentación HTML se crea por defecto" +msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgstr "Kruskal es un ambicioso algoritmo para generar un árbol de expansión mínimo que en cada ciclo encuentra y agrega la arista del menor peso posible que conecta dos árboles en el bosque." -msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" -msgstr "Los idiomas traducidos (en, es, sv, zh_Hans) para documentación HTML se construyen por defecto" +msgid "**The main Characteristics are:**" +msgstr "**Las características principales son:**" -msgid "`WITH-DOC` is not used anymore" -msgstr "" +msgid "The total weight of all the edges in the tree or forest is minimized." +msgstr "Se minimiza el peso total de todos los bordes del árbol o bosque." -msgid "User Documentation is not built when" -msgstr "La documentación de usuario no se crea cuando" +msgid "Kruskal's running time: :math:`O(E * log E)`" +msgstr "Tiempo de ejecución de Kruskal: :math:`O(E * log E)`" -msgid "Sphinx is not found" -msgstr "" +msgid "Metrics - Family of functions" +msgstr "Métricas - Familia de funciones" -msgid "When all Sphinx formats are OFF" -msgstr "" +msgid "Migration guide" +msgstr "Guía de migración" -msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" -msgstr "" +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." +msgstr "Varias funciones están teniendo cambios en las firmas, y/o han sido remplazadas por nuevas funciones." -msgid "When all languages are OFF" -msgstr "" +msgid "Results can be different because of the changes." +msgstr "Resultados pueden ser diferentes dado los cambios." -msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" -msgstr "" +msgid "All deprecated functions will be removed on next major version 4.0.0" +msgstr "Todas las funciones obsoletas serán removidas en las siguiente versión mayor 4.0.0" -msgid "Documentation output location: ``build/doc/_build/``" -msgstr "" +msgid "Migration to standardized columns" +msgstr "Migración a columnas estandarizadas" -msgid "For example: for HTML output is on `build/doc/_build/html` directory" +msgid "There has been an effort to standardize function output columns names and types." msgstr "" -msgid "Developers' Documentation is not built when" -msgstr "La documentación de los desarrolladores no se construye cuando" +msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgid "Doxygen is not found" -msgstr "" +msgid "|matrix-result|" +msgstr "|matrix-result|" -msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" -msgstr "" +msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgid "Summary of changes by function" -msgstr "" +msgid "|short-generic-result|" +msgstr "|short-generic-result|" -msgid "pgr_aStar" -msgstr "pgr_aStar" +msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgid "Combinations signature promoted to official." -msgstr "Firmas de combinaciones promovidas a oficial." +msgid "|result-spantree|" +msgstr "|result-spantree|" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +msgid "Function" +msgstr "Función" -msgid "pgr_bandwidth" -msgstr "pgr_bandwidth" +msgid ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_dijkstra`" -msgid "New experimental function." -msgstr "Nueva función experimental." +msgid "`Migration of single path functions`_" +msgstr "`Migración de funciones de una sola ruta`_" -msgid "pgr_bdAstar" -msgstr "pgr_bdAstar" +msgid ":doc:`pgr_aStar`" +msgstr ":doc:`pgr_aStar`" -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" +msgid ":doc:`pgr_bdAstar`" +msgstr ":doc:`pgr_bdAstar`" -msgid "pgr_bdDijkstra" -msgstr "pgr_bdDijkstra" +msgid ":doc:`pgr_drivingDistance`" +msgstr ":doc:`pgr_drivingDistance`" -msgid "Output columns standardized to |short-generic-result|" -msgstr "Las columnas de resultados estandarizadas a |short-generic-result|" +msgid "`Migration of spanning tree functions`_" +msgstr "`Migración de las funciones del árbol de expansión`_" -msgid "pgr_bdDijkstraCost" -msgstr "pgr_bdDijkstraCost" +msgid ":doc:`pgr_withPointsDD`" +msgstr ":doc:`pgr_withPointsDD`" -msgid "pgr_bellmanFord" -msgstr "pgr_bellmanFord" +msgid ":doc:`pgr_bdDijkstra`" +msgstr ":doc:`pgr_bdDijkstra`" -msgid "pgr_binaryBreadthFirstSearch" -msgstr "pgr_binaryBreadthFirstSearch" +msgid ":doc:`pgr_binaryBreadthFirstSearch`" +msgstr ":doc:`pgr_binaryBreadthFirstSearch`" -msgid "pgr_bipartite" -msgstr "pgr_bipartite" +msgid ":doc:`pgr_bipartite`" +msgstr ":doc:`pgr_bipartite`" -msgid "Output columns standardized to |result_node_color|" -msgstr "Columnas de resultados estandarizados a |result_node_color|" +msgid "`Migration of output column name change`_" +msgstr "`Migración de cambio de nombre de columna de salida`_" -msgid "pgr_boykovKolmogorov" -msgstr "pgr_boykovKolmogorov" +msgid ":doc:`pgr_breadthFirstSearch`" +msgstr ":doc:`pgr_breadthFirstSearch`" -msgid "pgr_breadthFirstSearch" -msgstr "pgr_breadthFirstSearch" +msgid ":doc:`pgr_depthFirstSearch`" +msgstr ":doc:`pgr_depthFirstSearch`" -msgid ":" -msgstr "" +msgid ":doc:`pgr_edgeColoring`" +msgstr ":doc:`pgr_edgeColoring`" -msgid "Standardizing output columns to |result-spantree|" -msgstr "Columnas de resultados estandarizados a |result-spantree|" +msgid "`Migration of multiple paths functions`_" +msgstr "`Migración de funciones de rutas múltiples`_" -msgid "pgr_contraction" -msgstr "pgr_contraction" +msgid ":doc:`pgr_sequentialVertexColoring`" +msgstr ":doc:`pgr_sequentialVertexColoring`" -msgid "Breaking change, signatures no longer available:" -msgstr "" +msgid ":doc:`pgr_topologicalSort`" +msgstr ":doc:`pgr_topologicalSort`" -msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid ":doc:`pgr_withPoints`" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_dagShortestPath" -msgstr "pgr_dagShortestPath" +msgid "`Migration of cost functions`_" +msgstr "`Migración de las funciones de coste`_" -msgid "pgr_depthFirstSearch" -msgstr "pgr_depthFirstSearch" +msgid "Migration of cost functions" +msgstr "Migración de las funciones de coste" -msgid "pgr_dijkstra" -msgstr "pgr_dijkstra" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgstr "" -msgid "pgr_dijkstraCost" -msgstr "pgr_dijkstraCost" +msgid "The following functions need to be migrated when they are being used in an application." +msgstr "" -msgid "pgr_dijkstraNear" -msgstr "pgr_dijkstraNear" +msgid "Version" +msgstr "Versión" -msgid "Function promoted to official." -msgstr "Función promovida a oficial." +msgid "From" +msgstr "" -msgid "pgr_dijkstraNearCost" -msgstr "pgr_dijkstraNearCost" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" +msgid "v < 4.0" +msgstr "" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +msgid "|matrix-pid|" +msgstr "|matrix-pid|" -msgid "Output columns standardized to |result_edge_color|" -msgstr "Columnas de resultados estandarizados a |result_edge_color|" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" -msgid "pgr_edgeDisjointPaths" -msgstr "pgr_edgeDisjointPaths" +msgid "**to** |matrix-result|" +msgstr "**a** |matrix-result|" -msgid "Output columns standardized to |generic-result|" -msgstr "Columnas de resultados estandarizados a |generic-result|" +msgid "Migration of |matrix-pid|" +msgstr "Migración de |matrix-pid|" -msgid "pgr_edmondsKarp" -msgstr "pgr_edmondsKarp" +msgid "Signatures to be migrated:" +msgstr "Firmas que serán migradas:" -msgid "pgr_edwardMoore" -msgstr "pgr_edwardMoore" +msgid "One to One" +msgstr "Uno a Uno" -msgid "Version 3.2.0" -msgstr "Versión 3.2.0" +msgid "One to Many" +msgstr "Uno a Muchos" -msgid "New experimental signature:" -msgstr "Nueva firma experimental:" +msgid "Many to One" +msgstr "Muchos a Uno" -msgid "pgr_edwardMoore(Combinations)" -msgstr "pgr_edwardMoore(Combinaciones)" +msgid "Many to Many" +msgstr "Muchos a Muchos" -msgid "Version 3.0.0" -msgstr "Versión 3.0.0" +msgid "Combinations" +msgstr "Combinaciones" -msgid "pgr_kingOrdering" -msgstr "pgr_kingOrdering" +msgid "Breaking change" +msgstr "Cambio de ruptura" -msgid "pgr_KSP" -msgstr "pgr_KSP" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgstr "" -msgid "All signatures promoted to official." -msgstr "Todas las firmas promovidas a oficial." +msgid "New output columns are |matrix-result|" +msgstr "Las nuevas columnas de salida son |matrix-result|" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgstr "" -msgid "pgr_maxCardinalityMatch(text,boolean)" -msgstr "pgr_maxCardinalityMatch(text,boolean)" +msgid "Examples" +msgstr "Ejemplos" -msgid "pgr_maxFlow" -msgstr "pgr_maxFlow" +msgid "Examples for One to One for cost functions" +msgstr "Ejemplos de uno a uno para funciones de coste" -msgid "pgr_pushRelabel" -msgstr "pgr_pushRelabel" +msgid "Using ``pgr_withPointsCost``" +msgstr "Usando ``pgr_withPointsCost``" -msgid "pgr_sequentialVertexColoring" -msgstr "pgr_sequentialVertexColoring" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "pgr_sloanOrdering" -msgstr "pgr_sloanOrdering" +msgid "from" +msgstr "de" -msgid "pgr_topologicalSort" -msgstr "pgr_topologicalSort" +msgid "to" +msgstr "a" -msgid "Standardize output to |result_node_order|" -msgstr "Columnas de resultados estandarizados a|result_node_order|" +msgid "Examples for One to Many for cost functions" +msgstr "Ejemplos de funciones de coste de Uno a Muchos" -msgid "pgr_transitiveClosure" -msgstr "pgr_transitiveClosure" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "Standardized output to |result-closure|" -msgstr "Estandarización de columnas de resultados a |result-closure|" +msgid "Examples for Many to One for cost functions" +msgstr "Ejemplos de funciones de coste de Muchos a Uno" -msgid "pgr_trsp" -msgstr "pgr_trsp" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "Examples for Many to Many for cost functions" +msgstr "Ejemplos de funciones de coste de Muchos a Muchos" -msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "pgr_trspVia" -msgstr "pgr_trspVia" +msgid "Examples for Combinations for cost functions" +msgstr "Ejemplos de funciones de coste de Combinaciones" -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "pgr_trspVia_withPoints" -msgstr "pgr_trspVia_withPoints" +msgid "Migration of multiple paths functions" +msgstr "Migración de funciones de múltiples rutas" -msgid "**Driving side** parameter is positional unnamed." -msgstr "El parámetro **Lado de Manejo** era opcional ahora es obligatorio posicional sin nombre." +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" +msgstr "Las columnas estandarizadas :ref:`pgRouting-concepts:Result columns for single path functions` son |nksp-result|" -msgid "Valid values depend on kind of graph" -msgstr "Valores válidos dependen del tipo de grafo" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" -msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "v < 3.6" +msgstr "" -msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid ":ref:`from_ksp_result`" +msgstr ":ref:`from_ksp_result`" -msgid "pgr_trsp_withPoints" -msgstr "pgr_trsp_withPoints" +msgid "``pgr_edgeDisjointPaths``" +msgstr "``pgr_edgeDisjointPaths``" -msgid "**Driving side** parameter is positional unnamed and compulsory." -msgstr "El parámetro **driving_side** era opcional ahora es obligatorio sin nombre." +msgid ":ref:`from_result_disjoint`" +msgstr ":ref:`from_result_disjoint`" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Migration of |ksp-result|" +msgstr "Migración de |ksp-result|" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "|nksp-result|" +msgstr "|nksp-result|" -msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Before updating pgRouting, enumerate the |ksp-result|" +msgstr "Antes de actualizar pgRouting, enumerar los |ksp-result|" -msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "One to One example using ``pgr_KSP``" +msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgid "Using `this `__ example." +msgstr "Usando `éste `__ ejemplo." -msgid "pgr_TSP" -msgstr "pgr_TSP" +msgid "Migration of |result-disjoint|" +msgstr "Migración de |result-disjoint|" -msgid "Results change depending on input order" -msgstr "Los resultados cambian dependiendo el orden de entrada" +msgid "Before updating pgRouting, enumerate the |result-disjoint|" +msgstr "Antes de actualizar pgRouting, enumerar los |result-disjoint|" -msgid "Only for undirected graphs" -msgstr "Solo para grafos no dirigidos" +msgid "Skip when applicable, ``start_vid``" +msgstr "" -msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Skip when applicable, ``end_vid``" +msgstr "Omitir cuando proceda, ``end_vid``" -msgid "pgr_TSPeuclidean" -msgstr "pgr_TSPeuclidean" +msgid "One to One example using ``pgr_edgeDisjointPaths``" +msgstr "Ejemplo de Uno a Uno con ``pgr_edgeDisjointPaths``" -msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" -msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.6 `__." -msgid "pgr_turnRestrictedPath" -msgstr "pgr_turnRestrictedPath" +msgid "Before updating pgRouting enumerate the columns: |ksp-result|" +msgstr "Antes de actualizar pgRouting enumerar las columnas: |ksp-result|" -msgid "Output columns standardized to |nksp-result|" -msgstr "Columnas de salida estandarizados a |nksp-result|" +msgid "Migration of single path functions" +msgstr "Migración de funciones de ruta única" -msgid "pgr_withPoints" -msgstr "pgr_withPoints" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" +msgstr "Las columnas estandarizadas :ref:`pgRouting-concepts:Result columns for single path functions` son |short-generic-result|" -msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "``pgr_dijkstra``" +msgstr "``pgr_dijkstra``" -msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "v < 3.5" +msgstr "" -msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "|old-generic-result|" +msgstr "|old-generic-result|" -msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "``pgr_aStar``" +msgstr "``pgr_aStar``" -msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,text,boolean,character,boolean)" +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" +msgid "``pgr_bellmanFord``" +msgstr "``pgr_bellmanFord``" -msgid "**Driving side** parameter is unnamed and compulsory." -msgstr "El parámetro **Driving side** es obligatorio sin nombre." +msgid "``pgr_dagShortestPath``" +msgstr "``pgr_dagShortestPath``" -msgid "Output columns standardized to |matrix-result|" -msgstr "Columnas de resultados estandarizados a |matrix-result|" +msgid "|result-1-1|" +msgstr "|result-1-1|" -msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -msgstr "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +msgid "``pgr_edwardMoore``" +msgstr "``pgr_edwardMoore``" -msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -msgstr "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" -msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -msgstr "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgid "|old-pid-result|" +msgstr "|old-pid-result|" -msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgstr "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgid "Migration of |old-generic-result|" +msgstr "Migración de |old-generic-result|" -msgid "pgr_withpointscost(text,text,text,boolean,character)" -msgstr "pgr_withpointscost(text,text,text,boolean,character)" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" +msgstr "" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" +msgid "Migration of |old-pid-result|" +msgstr "Migración de |old-pid-result|" -msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +msgid "To get the old version column names, depending on the signature:" +msgstr "" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" +msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" +msgstr "Filtrar las columnas ``start_vid`` y /o ``end_vid``" -msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Rename the columns:" +msgstr "Cambio de nombre en las columnas:" -msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "``start_vid`` to ``start_pid``" +msgstr "``start_vid`` a ``end_pid``" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" +msgid "``end_vid`` to ``end_pid``" +msgstr "``end_vid`` a ``end_pid``" -msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" +msgstr "" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" +msgid "Migration of |result-1-1|" +msgstr "Migración de |result-1-1|" -msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "To get the old version column names:" +msgstr "Para obtener los nombres de columna de la versión antigua:" -msgid "Functions promoted to official" -msgstr "Funciones promovidas a oficial" +msgid "Filter out the columns: ``start_vid`` and ``end_vid``" +msgstr "Filtrar las columnas: ``start_vid`` y ``end_vid``" -msgid "`#2701 `__: pgr_trsp" -msgstr "`#2701 `__: pgr_trsp" +msgid "Examples with One to One with one route result" +msgstr "" -msgid "`#2701 `__: pgr_trspVia" -msgstr "`#2701 `__: pgr_trspVia" +msgid "Using ``pgr_aStar``" +msgstr "Usando ``pgr_aStar``" -msgid "`#2701 `__: pgr_trspVia_withPoints" -msgstr "`#2701 `__: pgr_trspVia_withPoints" +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." -msgid "`#2701 `__: pgr_trsp_withPoints" -msgstr "`#2701 `__: pgr_trsp_withPoints" +msgid "Before updating pgRouting enumerate the columns: |result-1-1|" +msgstr "" -msgid "`#2700 `__: pgr_withPoints" -msgstr "`#2700 `__: pgr_withPoints" +msgid "Using ``pgr_bdDijkstra``" +msgstr "Usando ``pgr_bdDijkstra``" -msgid "`#2700 `__: pgr_withPointsCost" -msgstr "`#2700 `__: pgr_withPointsCost" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "`#2700 `__: pgr_withPointsCostMatrix" -msgstr "`#2700 `__: pgr_withPointsCostMatrix" +msgid "Using ``pgr_DAGshortestPath``" +msgstr "Usando ``pgr_DAGshortestPath``" -msgid "`#2700 `__: pgr_withPointsDD" -msgstr "`#2700 `__: pgr_withPointsDD" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "`#2700 `__: pgr_withPointsKSP" -msgstr "`#2700 `__: pgr_withPointsKSP" +msgid "This applies to all signatures of ``pgr_DAGshortestPath``" +msgstr "" -msgid "`#2700 `__: pgr_withPointsVia" -msgstr "`#2700 `__: pgr_withPointsVia" +msgid "Examples for One to Many with one route result" +msgstr "" -msgid "`#2983 `__: pgr_dijkstraNear" -msgstr "`#2983 `__: pgr_dijkstraNear" +msgid "Using ``pgr_bdAstar``" +msgstr "Usando ``pgr_bdAstar``" -msgid "`#2983 `__: pgr_dijkstraNearCost" -msgstr "`#2983 `__: pgr_dijkstraNearCost" +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." -msgid "`#2983 `__: pgr_dijkstraVia" -msgstr "`#2983 `__: pgr_dijkstraVia" +msgid "Before updating pgRouting enumerate the columns: |result-1-m|" +msgstr "" -msgid "Signatures promoted to official" -msgstr "Firmas promovidas a oficial" +msgid "Using ``pgr_withPoints``" +msgstr "Usando ``pgr_withPoints``" -msgid "`#2718 `__: pgr_aStar(Combinations)" -msgstr "`#2718 `__: pgr_aStar(Combinaciones)" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "`#2718 `__: pgr_aStarCost(Combinations)" -msgstr "`#2718 `__: pgr_aStarCost(Combinaciones)" +msgid "|pid-1-m|" +msgstr "" -msgid "`#2718 `__: pgr_bdAstar(Combinations)" -msgstr "`#2718 `__: pgr_bdAstar(Combinaciones)" +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." +msgstr "Para obtener los nombres de columna de la firma antigua: filtrar la columna ``start_vid`` y cambiar el nombre de ``end_vid`` a ``end_pid``." -msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" -msgstr "`#2718 `__: pgr_bdAstarCost(Combinaciones)" +msgid "Examples for Many to One with one route result" +msgstr "" -msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" -msgstr "`#2718 `__: pgr_bdDijkstra(Combinaciones)" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" -msgstr "`#2718 `__: pgr_bdDijkstraCost(Combinaciones)" +msgid "Before updating pgRouting enumerate the columns: |result-m-1|" +msgstr "" -msgid "`#2718 `__: pgr_dijkstra(Combinations)" -msgstr "`#2718 `__: pgr_dijkstra(Combinaciones)" +msgid "Using ``pgr_dijkstra``" +msgstr "Usando ``pgr_dijkstra``" -msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" -msgstr "`#2718 `__: pgr_dijkstraCost(Combinaciones)" +msgid "Migrating `this v3.4 `__ example." +msgstr "Migrando ejemplo `de v3.4 `__." -msgid "`#2718 `__: pgr_KSP(All signatures)" -msgstr "`#2718 `__: pgr_KSP(Todas las firmas)" +msgid "Examples for Many to Many with one route result" +msgstr "" -msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" -msgstr "`#2718 `__: pgr_boykovKolmogorov(Combinaciones)" +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." -msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" -msgstr "`#2718 `__: pgr_edmondsKarp(Combinaciones)" +msgid "|pid-m-m|" +msgstr "" -msgid "`#2718 `__: pgr_maxFlow(Combinations)" -msgstr "`#2718 `__: pgr_maxFlow(Combinaciones)" +msgid "Examples for combinations with one route result" +msgstr "" -msgid "`#2718 `__: pgr_pushRelabel(Combinations)" -msgstr "`#2718 `__: pgr_pushRelabel(Combinaciones)" +msgid "Migrating `this v3.8 `this `__ example." +msgstr "Migrando ejemplo `de v3.8 `this `__." -msgid "New experimental functions." -msgstr "Nuevas funciones experimentales." +msgid "Migration of spanning tree functions" +msgstr "Migración de las funciones de árbol de expansión" -msgid "Metrics" -msgstr "Métricas" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" +msgstr "" -msgid "`#2951 `__: pgr_bandwidth" -msgstr "`#2951 `__: pgr_bandwidth" +msgid "``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" -msgid "Ordering" -msgstr "Ordenamiento" +msgid ":ref:`from_result_dij_dd`" +msgstr ":ref:`from_result_dij_dd`" -msgid "`#2954 `__: pgr_kingOrdering" -msgstr "`#2954 `__: pgr_kingOrdering" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" -msgid "`#2955 `__: pgr_sloanOrdering" -msgstr "`#2955 `__: pgr_sloanOrdering" +msgid ":ref:`from_result_generic_no_seq`" +msgstr ":ref:`from_result_generic_no_seq`" -msgid "SQL signatures and output standardization" -msgstr "" +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" -msgid "`#2904 `__: Standardize output columns of functions with different output" -msgstr "`#2904 `__: Estandarizar columnas de resultados de funciones con diferente salida" +msgid "v < 3.7" +msgstr "" -msgid "columns within overloads" -msgstr "columnas dentro de las sobrecargas" +msgid ":ref:`from_result_bfs`" +msgstr ":ref:`from_result_bfs`" -msgid "Standardized to |short-generic-result|" -msgstr "Estandardizar de las columnas de resultados a |short-generic-result|" +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" -msgid "`#2905 `__: pgr_withPoints" -msgstr "`#2905 `__: pgr_withPoints" +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" -msgid "`#2906 `__: pgr_bdDijkstra" -msgstr "`#2906 `__: pgr_bdDijkstra" +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" -msgid "`#2907 `__: pgr_bellmanFord" -msgstr "`#2907 `__: pgr_bellmanFord" +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" -msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgstr "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" -msgid "`#2910 `__: pgr_edwardMoore" -msgstr "`#2910 `__: pgr_edwardMoore" +msgid "``pgr_breadthFisrtSearch``" +msgstr "``pgr_breadthFisrtSearch``" -msgid "`#2913 `__: pgr_dagShortestPath" -msgstr "`#2913 `__: pgr_dagShortestPath" +msgid "v < 4.0.0" +msgstr "" -msgid "Standardized to |matrix-result|" -msgstr "Estandardizar de las columnas de resultados a |matrix-result|" +msgid "``pgr_depthFisrtSearch``" +msgstr "``pgr_depthFisrtSearch``" -msgid "`#2905 `__: pgr_withPointsCost" -msgstr "`#2905 `__: pgr_withPointsCost" +msgid "to |result-spantree|" +msgstr "a |result-spantree|" -msgid "`#2905 `__: pgr_withPointsCostMatrix" -msgstr "`#2905 `__: pgr_withPointsCostMatrix" +msgid "Migration from |result-bfs|." +msgstr "Migración de |result-bfs|." -msgid "Standardized to |generic-result|" -msgstr "Estandardizar de las columnas de resultados a |generic-result|" +msgid "Single vertex" +msgstr "Vértice único" -msgid "`#2909 `__: pgr_edgeDisjointPaths" -msgstr "`#2909 `__: pgr_edgeDisjointPaths" +msgid "Multiple vertices" +msgstr "Múltiples vértices" -msgid "`#2909 `__: pgr_turnRestrictedPath" -msgstr "`#2909 `__: pgr_turnRestrictedPath" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|" +msgstr "" -msgid "Standardized to |result_edge_color|" -msgstr "Estandardizar de las columnas de resultados a |result_edge_color|" +msgid "Single vertex example using ``pgr_kruskalDD``" +msgstr "Ejemplo de vértice único con ``pgr_kruskalDD``" -msgid "`#2924 `__: pgr_edgeColoring" -msgstr "`#2924 `__: pgr_edgeColoring" +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrando ejemplo `de v3.6 `__." -msgid "Standardized to |result_node_color|" -msgstr "Estandardizar de las columnas de resultados a |result_node_color|" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|." +msgstr "" -msgid "`#2924 `__: pgr_bipartite" -msgstr "`#2924 `__: pgr_bipartite" +msgid "Multiple vertices example using ``pgr_kruskalDFS``" +msgstr "Ejemplo de vértices múltiples con ``pgr_kruskalDFS``" -msgid "`#2927 `__: pgr_sequentialVertexColoring" -msgstr "`#2927 `__: pgr_sequentialVertexColoring" +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrando ejemplo `de v3.6 `__." -msgid "Standardized to |result-spantree|" -msgstr "Estandardizar de las columnas de resultados a |result-spantree|" +msgid "Migration from |result-dij-dd|" +msgstr "Migración de |result-dij-dd|" -msgid "`#2931 `__: pgr_breadthFirstSearch" -msgstr "`#2931 `__: pgr_breadthFirstSearch" +msgid "Migration depends on the signature." +msgstr "" -msgid "`#2931 `__: pgr_depthFirstSearch" -msgstr "`#2931 `__: pgr_depthFirstSearch" +msgid "For single vertex:" +msgstr "Para vértice único:" -msgid "Standardized to |result_node_order|" -msgstr "Estandardizar de las columnas de resultados a |result_node_order|" +msgid "Before updating pgRouting, enumerate |result-1-1| columns" +msgstr "Antes de actualizar pgRouting, enumerar las columnas |result-1-1|" -msgid "`#2934 `__: pgr_topologicalSort" -msgstr "`#2934 `__: pgr_topologicalSort" +msgid "For multiple vertices:" +msgstr "Para múltiples vértices:" -msgid "Standardized to |result-closure|" -msgstr "Estandardizar de las columnas de resultados a |result-closure|" +msgid "Changes must be done after updating pgRouting." +msgstr "" -msgid "`#2934 `__: pgr_transitiveClosure" -msgstr "`#2934 `__: pgr_transitiveClosure" +msgid "To get the old version column names |result-dij-dd-m|:" +msgstr "Para obtener los nombres de columna de la versión antigua |result-dij-dd-m|:" -msgid "Removal of SQL deprecated signatures" -msgstr "Eliminación de funciones SQL obsoletas" +msgid "filter out the column ``pred`` and ``depth`` and" +msgstr "filtrar las columnas ``pred`` y ``depth`` y" -msgid "`#2798 `__: pgr_contraction" -msgstr "`#2798 `__: pgr_contraction" +msgid "rename ``start_vid`` to ``from_v``." +msgstr "renombrar ``start_vid`` a ``from_v``." -msgid "`#2683 `__: pgr_trsp" -msgstr "`#2683 `__: pgr_trsp" +msgid "Single vertex example using ``pgr_drivingDistance``" +msgstr "Ejemplo de vértice único con ``pgr_drivingDistance``" -msgid "`#2683 `__: pgr_trspVia" -msgstr "`#2683 `__: pgr_trspVia" +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." -msgid "`#2888 `__: pgr_findCloseEdges" -msgstr "`#2888 `__: pgr_findCloseEdges" +msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" +msgstr "Antes de actualizar pgRouting, enumerar las columnas |result-1-1-no-seq|" -msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "Multiple vertices example using ``pgr_drivingDistance``" +msgstr "Ejemplo de vértices múltiples con ``pgr_drivingDistance``" -msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." -msgid "`#2890 `__: pgr_withPointsDD" -msgstr "`#2890 `__: pgr_withPointsDD" +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgstr "" -msgid "`#2895 `__: pgr_withPointsKSP" -msgstr "`#2895 `__: pgr_withPointsKSP" +msgid "Migration of |result-generic-no-seq|" +msgstr "Migración de |result-generic-no-seq|" -msgid "`#2899 `__: pgr_maxCardinalityMatch" -msgstr "`#2899 `__: pgr_maxCardinalityMatch" +msgid "After updating pgRouting:" +msgstr "" -msgid "`#2901 `__: pgr_TSP" -msgstr "`#2901 `__: pgr_TSP" +msgid "Enumerate |result-1-1-no-seq| columns" +msgstr "Enumerar las columnas |result-1-1-no-seq|" -msgid "`#2901 `__: pgr_TSPeuclidean" -msgstr "`#2901 `__: pgr_TSPeuclidean" +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgstr "Usar un valor válido sin nombre para **lado de manejo** después del parámetro **distancia**." -msgid "Removal of SQL deprecated functions" -msgstr "Eliminación de funciones obsoletas" +msgid "Enumerate |result-m-1-no-seq| columns" +msgstr "Enumerar las columnas |result-m-1-no-seq|" -msgid "`#2681 `__: pgr_trspViaedges" -msgstr "`#2681 `__: pgr_trspViaedges" +msgid "Default value of **driving side** parameter" +msgstr "Valor por defecto del parámetro **lado conductor**" -msgid "`#2682 `__: pgr_trspViaVertices" -msgstr "`#2682 `__: pgr_trspViaVertices" +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." +msgstr "El parámetro **lado conductor** no tiene nombre, y los valores válidos difieren para grafos dirigidos y no dirigidos." -msgid "`#2748 `__: pgr_alphaShape" -msgstr "`#2748 `__: pgr_alphaShape" +msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" +msgstr "En grafos dirigidos: Los valores válidos son [``r``, ``R``, ``l``, ``L``]" -msgid "`#2751 `__: pgr_createTopology" -msgstr "`#2751 `__: pgr_createTopology" +msgid "Default value = 'r';" +msgstr "Valor por defecto = 'r';" -msgid "`#2752 `__: pgr_analyzeGraph" -msgstr "`#2752 `__: pgr_analyzeGraph" +msgid "In undirected graph: valid values are [``b``, ``B``]" +msgstr "En grafos no dirigidos: Los valores válidos son [``b``, ``B``]" -msgid "`#2755 `__: pgr_analyzeOneWay" -msgstr "`#2755 `__: pgr_analyzeOneWay" +msgid "Default value = 'b';" +msgstr "Valor por defecto = 'b';" -msgid "`#2827 `__: pgr_createVerticesTable" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "Single vertex example using ``pgr_withPointsDD``" +msgstr "Ejemplo de vértice único con ``pgr_withPointsDD``" -msgid "`#2886 `__: pgr_nodeNetwork" -msgstr "`#2886 `__: pgr_nodeNetwork" +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." -msgid "Removal of SQL deprecated internal functions" -msgstr "Eliminación de funciones internas SQL obsoletas" +msgid "Multiple vertices example using ``pgr_withPointsDD``" +msgstr "Ejemplo de vértices múltiples con ``pgr_withPointsDD``" -msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" -msgstr "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." -msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" -msgstr "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgid "Migration of output column name change" +msgstr "Migración del cambio de nombre de la columna de salida" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" -msgstr "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgid "The standardized result columns:" +msgstr "Columnas de resultados estandarizados:" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" -msgstr "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgid "|result_edge_color|" +msgstr "|result_edge_color|" -msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" -msgstr "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "|result_node_color|" +msgstr "|result_node_color|" -msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgstr "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "|result_node_order|" +msgstr "|result_node_order|" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "Changes on column names must be done after updating pgRouting." +msgstr "" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "``pgr_edgeColoring``" +msgstr "``pgr_edgeColoring``" -msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgid ":ref:`from_old_edge_color`" +msgstr ":ref:`from_old_edge_color`" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "``pgr_bipartite``" +msgstr "``pgr_bipartite``" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid ":ref:`from_old_node_color`" +msgstr ":ref:`from_old_node_color`" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "``pgr_sequentialVertexColoring``" +msgstr "``pgr_sequentialVertexColoring``" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "``pgr_topologicalSort``" +msgstr "``pgr_topologicalSort``" -msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" -msgstr "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid ":ref:`from_toposort`" +msgstr ":ref:`from_toposort`" -msgid "`#2861 `__ _pgr_endPoint(geometry)" -msgstr "`#2861 `__ _pgr_endPoint(geometry)" +msgid "``pgr_transitiveClosure``" +msgstr "``pgr_transitiveClosure``" -msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" -msgstr "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgid ":ref:`from_old_closure`" +msgstr ":ref:`from_old_closure`" -msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" -msgstr "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgid "Migration from |result-old-closure|" +msgstr "Migración de |result-old-closure|" -msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" -msgstr "`#2861 `__ _pgr_getcolumntype(text,text,integer,text)" +msgid "Migration to: |result-old-closure|" +msgstr "Migración a: |result-old-closure|" -msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" -msgstr "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgid "After update:" +msgstr "" -msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" -msgstr "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgid "Remove column ``seq``" +msgstr "Eliminar la columna ``seq``" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" -msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" +msgstr "" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" -msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "Migration from |result-toposort|" +msgstr "Migración de |result-toposort|" -msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgstr "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgid "Migration to: |result_node_order|" +msgstr "Migración a: |result_node_order|" -msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgstr "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "Rename ``sorted_v`` to ``node``" +msgstr "Cambiar el nombre de ``sorted_v`` a ``node``" -msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -msgstr "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "Migration from |old-edge-color|" +msgstr "Migración de |old-edge-color|" -msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" -msgstr "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgid "Migration to: |result_edge_color|" +msgstr "Migración a: |result_edge_color|" -msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" -msgstr "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" +msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." +msgstr "" -msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgstr "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgid "Migration from |old-node-color|" +msgstr "Migración de |old-node-color|" -msgid "`#2861 `__ _pgr_msg(integer,text,text)" -msgstr "`#2861 `__ _pgr_msg(integer,text,text)" +msgid "Migration to: |result_node_color|" +msgstr "Migración a: |result_node_color|" -msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" -msgstr "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" +msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." +msgstr "" -msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" -msgstr "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" +msgid "Migration of deleted functions" +msgstr "Migración de funciones eliminadas" -msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" -msgstr "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" +msgid "Functions no longer on pgRouting" +msgstr "Funciones que ya no están en pgRouting" -msgid "`#2861 `__ _pgr_quote_ident(text)" -msgstr "`#2861 `__ _pgr_quote_ident(text)" +msgid "Migration of ``pgr_alphaShape``" +msgstr "Migración de ``pgr_alphaShape``" -msgid "`#2861 `__ _pgr_startPoint(geometry)" -msgstr "`#2861 `__ _pgr_startPoint(geometry)" +msgid "Deprecated" +msgstr "Obsoleto" -msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "`v3.8.0 `__" +msgstr "`v3.8.0 `__" -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgid "Removed" +msgstr "Eliminado" -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" +msgid "`v4.0.0 `__" +msgstr "`v4.0.0 `__" -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "**Before Deprecation:** The following was calculated:" +msgstr "**Antes de la Depreciación:** Se calculó lo siguiente:" -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" +msgid "An alphaShape was calculated" +msgstr "Se ha calculado un alphaShape" -msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgstr "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgid "**After Deprecation:**" +msgstr "**Después de la eliminación:**" -msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "PostGIS has two ways of generating alphaShape." +msgstr "" -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "If you have SFCGAL, which you can install using" +msgstr "" -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgstr "" -msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgstr "" -msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Other PostGIS options are" +msgstr "" -msgid "`#2861 `__ _pgr_versionLess(text,text)" -msgstr "`#2861 `__ _pgr_versionLess(text,text)" +msgid "`ST_ConvexHull `__" +msgstr "" -msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "`ST_ConcaveHull `__" +msgstr "" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" -msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgid "Migration of ``pgr_nodeNetwork``" +msgstr "Migración de ``pgr_nodeNetwork``" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." +msgstr "" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgid "**Migration**" +msgstr "**Migración**" -msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgstr "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" +msgstr "" -msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Migration of ``pgr_createTopology``" +msgstr "Migración de ``pgr_createTopology``" -msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgid "A table with `_vertices_pgr` was created." +msgstr "Se ha creado una tabla con `_vertices_pgr`." -msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgstr "**Después de la depreciación** El usuario es responsable de crear la topología completa." -msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" -msgstr "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgid "Build a routing topology" +msgstr "Construir una topología de ruteo" -msgid "Summary of functions and signatures no longer on pgrouting" -msgstr "Resumen de funciones y firmas que ya no están en pgrouting" +msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." +msgstr "La información básica para usar la mayoría de las funciones de pgRouting ``id, source, target, cost, [reverse_cost]`` es lo que en pgRouting se llama topología de ruteo." -msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" -msgstr "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." +msgstr "``reverse_cost`` es opcional pero se recomienda encarecidamente tenerlo para reducir el tamaño de la base de datos debido al tamaño de las columnas de geometría. Dicho esto, en esta documentación se utiliza ``reverse_cost``." -msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgstr "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." +msgstr "Cuando los datos vienen con geometrías y no hay topología de ruteo, entonces este paso es necesario." -msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" -msgstr "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." +msgstr "Todos los vértices iniciales y finales de las geometrías necesitan un identificador que se almacenará en las columnas ``source`` y ``target`` de la tabla de los datos. Del mismo modo, ``cost`` y ``reverse_cost`` necesitan tener el valor de atravesar la arista en ambas direcciones." -msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgstr "Si las columnas no existen, hay que añadirlas a la tabla en cuestión. (véase `ALTER TABLE `__)" -msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" -msgstr "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." +msgstr "La función :doc:`pgr_extractVertices` se utiliza para crear una tabla de vértices basada en el identificador de arista y la geometría de la arista del grafo." -msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" -msgstr "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgstr "Finalmente, utilizando los datos almacenados en las tablas de vértices, se rellenan los campos ``source`` y ``target``." -msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "Migration of ``pgr_createVerticesTable``" +msgstr "Migracion de ``pgr_createVerticesTable``" -msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgstr "**Después de la depreciación:** El usuario es responsable de crear la tabla de vértices, índices, etc. Para ello puede utilizar :doc:`pgr_extractVertices`." -msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgstr "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgid "Migration of ``pgr_analyzeOneWay``" +msgstr "Migración de ``pgr_analyzeOneWay``" -msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgstr "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "Number of potential problems in directionality" +msgstr "Número de problemas potenciales en la dirección" -msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "WHERE" +msgstr "Donde" -msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "Directionality problems were calculated based on codes." +msgstr "Los problemas de dirección se calcularon a partir de códigos." -msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "Dead ends." +msgstr "Callejones sin salida." -msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgstr "Un problema de ruteo puede surgir cuando desde un vértice sólo hay una salida o una entrada, pero no ambas:" -msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." +msgstr "Guardando o usando directamente :doc:`pgr_extractVertices` se obtiene la información de los callejones sin salida y se determina si la arista adyacente es unidireccional o no." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgstr "En este ejemplo :doc:`pgr_extractVertices` ya se ha aplicado." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Bridges." +msgstr "Puentes." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." +msgstr "Otro problema para ruteo puede surgir cuando en un grafo no dirigido hay una arista cuya eliminación aumenta el numero de componentes conectados, y el puente es solo de un sentido." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "To determine if the bridges are or not one way." +msgstr "Para determinar si los puentes son o no unidireccionales." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgid "Migration of ``pgr_analyzeGraph``" +msgstr "Migración de ``pgr_analyzeGraph``" -msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Number of isolated segments." +msgstr "Número de segmentos aislados." -msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Number of dead ends." +msgstr "Cantidad de callejones sin salida." -msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgid "Number of potential gaps found near dead ends." +msgstr "Número de huecos potenciales encontrados cerca de callejones sin salida." -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgid "Number of intersections. (between 2 edges)" +msgstr "Número de intersecciones. (entre 2 aristas)" -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "Graph component" +msgstr "Componente de grafo" -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "A connected subgraph that is not part of any larger connected subgraph." +msgstr "Un sub-grafo conectando no es parte de un grafo conectado mas grande." -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "Isolated segment" +msgstr "Segmento aislado" -msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgid "A graph component with only one segment." +msgstr "Un componente de grafo con un solo segmento." -msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Dead ends" +msgstr "Callejones sin salida" -msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "A vertex that participates in only one edge." +msgstr "Un vértice que participa en una sola arista." -msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "gaps" +msgstr "Espacios" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Space between two geometries." +msgstr "Espacio entre dos geometrías." -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Intersection" +msgstr "Intersección" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Is a topological relationship between two geometries." +msgstr "Es una relación topológica entre dos geometrías." -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "Migration." +msgstr "Migración." -msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "Components." +msgstr "Componentes." -msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgstr "En lugar de contar sólo segmentos aislados, determinar todos los componentes del grafo." -msgid "Code enhancements" -msgstr "Mejoras del código" +msgid "Depending of the final application requirements use:" +msgstr "Dependiendo de los requisitos de la aplicación final utilizar:" -msgid "Removal of unused C/C++ code" -msgstr "Eliminación de código C/C++ no utilizado" +msgid ":doc:`pgr_connectedComponents`" +msgstr ":doc:`pgr_connectedComponents`" -msgid "Refactor the Script to build the update PostgreSQL file." -msgstr "" +msgid ":doc:`pgr_strongComponents`" +msgstr ":doc:`pgr_strongComponents`" -msgid "One process & driver for:" -msgstr "" +msgid ":doc:`pgr_biconnectedComponents`" +msgstr ":doc:`pgr_biconnectedComponents`" -msgid "allpairs: johnson and Floyd-Warshall" -msgstr "" +msgid "For example:" +msgstr "Por ejemplo:" -msgid "Shortest path: Dijkstra and withPoints using Dijkstra" -msgstr "" +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgstr "En lugar de contar los callejones sin salida, determine todos los callejones sin salida del grafo utilizando :doc:`pgr_degree`." -msgid "Deprecation of internal C/C++ functions" -msgstr "Obsolescencia de funciones internas C/C++" +msgid "Potential gaps near dead ends." +msgstr "Huecos potenciales cerca de callejones sin salida." -msgid "Deprecated functions are substituted by new function." +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" -msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" -msgstr "_pgr_drivingDistance => _pgr_drivingDistancev4" - -msgid "_pgr_withPointsDD => _pgr_withPointsddv4" -msgstr "_pgr_withPointsDD => _pgr_withPointsddv4" +msgid "Topological relationships." +msgstr "Relaciones topológicas." -msgid "_pgr_kruskal => _pgr_kruskalv4" +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -msgid "_pgr_prim => _pgr_primv4" -msgstr "" +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "Se pueden utilizar varias funciones de PostGIS: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgid "_pgr_dijkstra => _pgr_dijkstra_v4" -msgstr "_pgr_dijkstra => _pgr_dijkstra_v4" +msgid "Migration of ``pgr_trsp`` (Vertices)" +msgstr "Migración de `pgr_trsp`` (Vértices)" -msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" -msgstr "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" +msgid "Signature:" +msgstr "Firma:" -msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" -msgstr "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgid "`v3.4.0 `__" +msgstr "`v3.4.0 `__" -msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" -msgstr "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" +msgid ":doc:`pgr_trsp`" +msgstr ":doc:`pgr_trsp`" -msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" -msgstr "_pgr_withPointsVia => _pgr_withPointsvia_v4" +msgid "`Migration of restrictions`_" +msgstr "`Migración de restricciones`_" -msgid "Internal C/C++ functions in legacy" -msgstr "Funciones C/C++ internas en legado" +msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgstr "Usar ``pgr_dijkstra`` cuando no hay restricciones." -msgid "`#2683 `__ _trsp" -msgstr "`#2683 `__ _trsp" +msgid "Use :doc:`pgr_dijkstra` instead." +msgstr "Usa en vez :doc:`pgr_dijkstra`." -msgid "`#2683 `__ _v4trsp" -msgstr "`#2683 `__ _v4trsp" +msgid "To get the original column names:" +msgstr "Para obtener los nombres originales de las columnas:" -msgid "`#2748 `__ _pgr_alphaShape" -msgstr "`#2748 `__ _pgr_alphaShape" +msgid "``id1`` is the node" +msgstr "``id1`` es el nodo" -msgid "`#2913 `__ _pgr_dagShortestPath" -msgstr "`#2913 `__ _pgr_dagShortestPath" +msgid "``id2`` is the edge" +msgstr "``id2`` es la arista" -msgid "All releases" -msgstr "Todas las versiones" +msgid "Use ``pgr_trsp`` when there are restrictions." +msgstr "Usar ``pgr_trspVia`` cuando hay restricciones." -msgid "Kruskal - Family of functions" -msgstr "Kruskal - Familia de funciones" +msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgstr "Utilice en su lugar :doc:`pgr_trsp` (Uno a Uno)." -msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." -msgstr "Kruskal es un ambicioso algoritmo para generar un árbol de expansión mínimo que en cada ciclo encuentra y agrega la arista del menor peso posible que conecta dos árboles en el bosque." +msgid "Migration of ``pgr_trsp`` (Edges)" +msgstr "Migración de ``pgr_trsp`` (Aristas)" -msgid "**The main Characteristics are:**" -msgstr "**Las características principales son:**" +msgid ":doc:`pgr_trsp_withPoints`" +msgstr ":doc:`pgr_trsp_withPoints`" -msgid "The total weight of all the edges in the tree or forest is minimized." -msgstr "Se minimiza el peso total de todos los bordes del árbol o bosque." +msgid "Migration of ``pgr_trspViaVertices``" +msgstr "Migraciones de ``pgr_trspViaVertices``" -msgid "Kruskal's running time: :math:`O(E * log E)`" -msgstr "Tiempo de ejecución de Kruskal: :math:`O(E * log E)`" +msgid ":doc:`pgr_dijkstraVia`" +msgstr ":doc:`pgr_dijkstraVia`" -msgid "Metrics - Family of functions" -msgstr "Métricas - Familia de funciones" +msgid ":doc:`pgr_trspVia`" +msgstr ":doc:`pgr_trspVia`" -msgid "Migration guide" -msgstr "Guía de migración" +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgstr "Usar ``pgr_dijkstraVia`` cuando no hay restricciones" -msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." -msgstr "Varias funciones están teniendo cambios en las firmas, y/o han sido remplazadas por nuevas funciones." +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "Usar :doc:`pgr_dijkstraVia` en su lugar." -msgid "Results can be different because of the changes." -msgstr "Resultados pueden ser diferentes dado los cambios." +msgid "``id1`` is the path identifier" +msgstr "``id1`` es el identificador de camino" -msgid "All deprecated functions will be removed on next major version 4.0.0" -msgstr "Todas las funciones obsoletas serán removidas en las siguiente versión mayor 4.0.0" +msgid "``id2`` is the node" +msgstr "``id2`` es el nodo" -msgid "Migration to standardized columns" -msgstr "Migración a columnas estandarizadas" +msgid "``id3`` is the edge" +msgstr "``id3`` es la arista" -msgid "There has been an effort to standardize function output columns names and types." -msgstr "" +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr "Usar ``pgr_trspVia`` cuando hay restricciones" -msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgid "Use :doc:`pgr_trspVia` instead." +msgstr "Usar :doc:`pgr_trspVia` en su lugar." -msgid "|matrix-result|" -msgstr "|matrix-result|" +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "Migración de ``pgr_trspViaEdges``" -msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgid ":doc:`pgr_withPointsVia`" +msgstr ":doc:`pgr_withPointsVia`" -msgid "|short-generic-result|" -msgstr "|short-generic-result|" +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr ":doc:`pgr_trspVia_withPoints`" -msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgstr "Usar ``pgr_withPointsVia`` cuando no hay restricciones" -msgid "|result-spantree|" -msgstr "|result-spantree|" +msgid "Use :doc:`pgr_withPointsVia` instead." +msgstr "Usar :doc:`pgr_withPointsVia` en su lugar." -msgid "Function" -msgstr "Función" +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr "Usar ``pgr_trspVia_withPoints`` cuando hay restricciones" -msgid ":doc:`pgr_dijkstra`" -msgstr ":doc:`pgr_dijkstra`" +msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgstr "Usar :doc:`pgr_trspVia_withPoints` en su lugar." -msgid "`Migration of single path functions`_" -msgstr "`Migración de funciones de una sola ruta`_" +msgid "Not yet classified migrations" +msgstr "" -msgid ":doc:`pgr_aStar`" -msgstr ":doc:`pgr_aStar`" +msgid "Migration of ``pgr_withPointsKSP``" +msgstr "Migración de ``pgr_withPointsKSP``" -msgid ":doc:`pgr_bdAstar`" -msgstr ":doc:`pgr_bdAstar`" +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "A partir de `v3.6.0 `__ en :doc:`pgr_withPointsKSP` las columnas de resultados están siendo estandarizadas." -msgid ":doc:`pgr_drivingDistance`" -msgstr ":doc:`pgr_drivingDistance`" +msgid "|ksp-result|" +msgstr "|ksp-result|" -msgid "`Migration of spanning tree functions`_" -msgstr "`Migración de las funciones del árbol de expansión`_" +msgid "|generic-result|" +msgstr "|generic-result|" -msgid ":doc:`pgr_withPointsDD`" -msgstr ":doc:`pgr_withPointsDD`" +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgstr "Y el parámetro ``driving side`` ha cambiado de opcional con nombre a **lado conductor** sin nombre y su validez difiere para grafos dirigidos y no dirigidos." -msgid ":doc:`pgr_bdDijkstra`" -msgstr ":doc:`pgr_bdDijkstra`" +msgid "``pgr_withPointsKSP`` (`One to One`)" +msgstr "``pgr_withPointsKSP`` (`Uno a Uno`)" -msgid ":doc:`pgr_binaryBreadthFirstSearch`" -msgstr ":doc:`pgr_binaryBreadthFirstSearch`" +msgid "Before Migration" +msgstr "Antes de la migración" -msgid ":doc:`pgr_bipartite`" -msgstr ":doc:`pgr_bipartite`" +msgid "Output columns were |old-pid-result|" +msgstr "Regresa conjunto de |old-generic-result|" -msgid "`Migration of output column name change`_" -msgstr "`Migración de cambio de nombre de columna de salida`_" +msgid "the columns ``start_vid`` and ``end_vid`` do not exist." +msgstr "las columnas ``start_vid`` y ``end_vid`` no existen." -msgid ":doc:`pgr_breadthFirstSearch`" -msgstr ":doc:`pgr_breadthFirstSearch`" +msgid "Migration" +msgstr "Migración" -msgid ":doc:`pgr_depthFirstSearch`" -msgstr ":doc:`pgr_depthFirstSearch`" +msgid "Be aware of the existence of the additional result Columns." +msgstr "Tener en cuenta la existencia de las columnas adicionales de resultados." -msgid ":doc:`pgr_edgeColoring`" -msgstr ":doc:`pgr_edgeColoring`" +msgid "New output columns are |generic-result|" +msgstr "Las nuevas columnas de salida son |generic-result|" -msgid "`Migration of multiple paths functions`_" -msgstr "`Migración de funciones de rutas múltiples`_" +msgid "Using `this `__ example." +msgstr "Usando `este `__ ejemplo." -msgid ":doc:`pgr_sequentialVertexColoring`" -msgstr ":doc:`pgr_sequentialVertexColoring`" +msgid "``start_vid`` contains the **start vid** parameter value." +msgstr "``start_vid`` contiene el valor del parámetro **start vid**." -msgid ":doc:`pgr_topologicalSort`" -msgstr ":doc:`pgr_topologicalSort`" +msgid "``end_vid`` contains the **end vid** parameter value." +msgstr "``end_vid`` contiene el valor del parámetro **end vid**." -msgid ":doc:`pgr_withPoints`" -msgstr ":doc:`pgr_withPoints`" +msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgstr "Si es necesario, filtrar las columnas adicionales, por ejemplo, para devolver las columnas originales:" -msgid "`Migration of cost functions`_" -msgstr "`Migración de las funciones de coste`_" +msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgstr "Usar ``pgr_withPoints`` cuando no hay restricciones." -msgid "Migration of cost functions" -msgstr "Migración de las funciones de coste" +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr "Utilizar en su lugar :doc:`pgr_withPoints` (Uno a Uno)." -msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" -msgstr "" +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgstr "Usar ``pgr_trsp_withPoints`` cuando hay restricciones." -msgid "The following functions need to be migrated when they are being used in an application." -msgstr "" +msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgstr "Utilizar en su lugar :doc:`pgr_trsp_withPoints`." -msgid "Version" -msgstr "Versión" +msgid "Migration of ``pgr_maxCardinalityMatch``" +msgstr "Migración de ``pgr_maxCardinalityMatch``" -msgid "From" -msgstr "" +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgstr ":doc:`pgr_maxCardinalityMatch` funciona solamente para grafos no dirigidos, entonces la bandera ``directed`` ha sido removida." -msgid "``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" +msgid "Starting from `v3.4.0 `__" +msgstr "A partir de v3.4.0 `__" -msgid "v < 4.0" -msgstr "" +msgid "Signature to be migrated:" +msgstr "Firma que serán migrada:" -msgid "|matrix-pid|" -msgstr "|matrix-pid|" +msgid "Migration is needed, because:" +msgstr "Migración es necesaria, porque:" -msgid "``pgr_withPointsCostMatrix``" -msgstr "``pgr_withPointsCostMatrix``" +msgid "Use ``cost`` and ``reverse_cost`` on the inner query" +msgstr "Usa ``cost`` y ``reverse_cost`` en la consulta interna" -msgid "**to** |matrix-result|" -msgstr "**a** |matrix-result|" +msgid "Results are ordered" +msgstr "Los resultados son ordenados" -msgid "Migration of |matrix-pid|" -msgstr "Migración de |matrix-pid|" +msgid "Works for undirected graphs." +msgstr "Funciona para grafos no dirigidos." -msgid "Signatures to be migrated:" -msgstr "Firmas que serán migradas:" +msgid "New signature" +msgstr "Nueva firma" -msgid "One to One" -msgstr "Uno a Uno" +msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." +msgstr "``pgr_maxCardinalityMatch(text)`` regresa solamente la columna ``edge``." -msgid "One to Many" -msgstr "Uno a Muchos" +msgid "The optional flag ``directed`` is removed." +msgstr "La bandera opcional ``directed`` es removida." -msgid "Many to One" -msgstr "Muchos a Uno" +msgid "Before migration" +msgstr "Antes de migración" -msgid "Many to Many" -msgstr "Muchos a Muchos" +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgstr "Las columnas usadas son ``going`` y ``coming`` para representar la existencia de la arista." -msgid "Combinations" -msgstr "Combinaciones" +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgstr "La flag ``directed`` es usada para indicar si fue para un grafo **dirigido** or **no dirigido**." -msgid "Breaking change" -msgstr "Cambio de ruptura" +msgid "The flag ``directed`` is ignored." +msgstr "La bandera ``directed`` es ignorada." -msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" -msgstr "" +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgstr "Independiente de su valor, da el resultado considerando el grafo como **no dirigido**." -msgid "New output columns are |matrix-result|" -msgstr "Las nuevas columnas de salida son |matrix-result|" +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgstr "Usa las columnas ``cost`` y ``reverse_cost`` para representar la existenica de una arista." -msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." -msgstr "" +msgid "Do not use the flag ``directed``." +msgstr "No use la bandera ``directed``." -msgid "Examples" -msgstr "Ejemplos" +msgid "In the query returns only ``edge`` column." +msgstr "En la consulta solo devuelve la columna ``edge``." -msgid "Examples for One to One for cost functions" -msgstr "Ejemplos de uno a uno para funciones de coste" +msgid "Migration of restrictions" +msgstr "Migración de restricciones" -msgid "Using ``pgr_withPointsCost``" -msgstr "Usando ``pgr_withPointsCost``" +msgid "The structure of the restrictions have changed:" +msgstr "La estructura de las restricciones ha cambiado:" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "Old restrictions structure" +msgstr "Estructura de restricciones vieja" -msgid "from" -msgstr "de" +msgid "On the deprecated signatures:" +msgstr "Sobre las firmas obsoletas:" -msgid "to" -msgstr "a" +msgid "Column ``rid`` is ignored" +msgstr "La columna ``rid`` es ignorada" -msgid "Examples for One to Many for cost functions" -msgstr "Ejemplos de funciones de coste de Uno a Muchos" +msgid "``via_path``" +msgstr "``via_path``" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "Must be in reverse order." +msgstr "Debe de estar en orden reverso." -msgid "Examples for Many to One for cost functions" -msgstr "Ejemplos de funciones de coste de Muchos a Uno" +msgid "Is of type ``TEXT``." +msgstr "Es de tipo ``TEXT``." -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "When more than one via edge must be separated with ``,``." +msgstr "Cuando hay más de una arista debe de ser separada con ``,``." -msgid "Examples for Many to Many for cost functions" -msgstr "Ejemplos de funciones de coste de Muchos a Muchos" +msgid "``target_id``" +msgstr "``target_id``" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "Is the last edge of the forbidden path." +msgstr "Es la última arista del camino prohibido." -msgid "Examples for Combinations for cost functions" -msgstr "Ejemplos de funciones de coste de Combinaciones" +msgid "Is of type ``INTEGER``." +msgstr "Es de tipo de ``INTEGER``." -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "``to_cost``" +msgstr "``to_cost``" -msgid "Migration of multiple paths functions" -msgstr "Migración de funciones de múltiples rutas" +msgid "Is of type ``FLOAT``." +msgstr "Es de tipo ``FLOAT``." -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" -msgstr "Las columnas estandarizadas :ref:`pgRouting-concepts:Result columns for single path functions` son |nksp-result|" +msgid "Creation of the old restrictions table" +msgstr "Creación de la vieja table de restricciones" -msgid "``pgr_KSP``" -msgstr "``pgr_KSP``" +msgid "Old restrictions fill up" +msgstr "Las viejas restricciones se llenan" -msgid "v < 3.6" -msgstr "" +msgid "Old restrictions contents" +msgstr "Contenido de viejas restricciones" -msgid ":ref:`from_ksp_result`" -msgstr ":ref:`from_ksp_result`" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgstr "La restricción con ``rid = 2`` representa :math:`3 \\rightarrow 5 \\rightarrow9`" -msgid "``pgr_edgeDisjointPaths``" -msgstr "``pgr_edgeDisjointPaths``" +msgid ":math:`3\\rightarrow5`" +msgstr ":math:`3\\rightarrow5`" -msgid ":ref:`from_result_disjoint`" -msgstr ":ref:`from_result_disjoint`" +msgid "is on column ``via_path`` in reverse order" +msgstr "esta en la columna ``via_path`` en orden reverso" -msgid "Migration of |ksp-result|" -msgstr "Migración de |ksp-result|" +msgid "is of type ``TEXT``" +msgstr "es de tipo ``TEXT``" -msgid "|nksp-result|" -msgstr "|nksp-result|" +msgid ":math:`9`" +msgstr ":math:`9`" -msgid "Before updating pgRouting, enumerate the |ksp-result|" -msgstr "Antes de actualizar pgRouting, enumerar los |ksp-result|" +msgid "is on column ``target_id``" +msgstr "está en la columna ``target_id``" -msgid "One to One example using ``pgr_KSP``" -msgstr "" +msgid "is of type ``INTEGER``" +msgstr "es de tipo ``INTEGER``" -msgid "Using `this `__ example." -msgstr "Usando `éste `__ ejemplo." +msgid "New restrictions structure" +msgstr "Estructura de nuevas restricciones" -msgid "Migration of |result-disjoint|" -msgstr "Migración de |result-disjoint|" +msgid "Column ``id`` is ignored" +msgstr "La columna ``id`` es ignorada" -msgid "Before updating pgRouting, enumerate the |result-disjoint|" -msgstr "Antes de actualizar pgRouting, enumerar los |result-disjoint|" +msgid "Column ``path``" +msgstr "Columna ``path``" -msgid "Skip when applicable, ``start_vid``" -msgstr "" +msgid "Is of type ``ARRAY[ANY-INTEGER]``." +msgstr "Es de tipo ``ARRAY[ANY-INTEGER]``." -msgid "Skip when applicable, ``end_vid``" -msgstr "Omitir cuando proceda, ``end_vid``" +msgid "Contains all the edges involved on the restriction." +msgstr "Contiene todas las aristas involucradas con la restricción" -msgid "One to One example using ``pgr_edgeDisjointPaths``" -msgstr "Ejemplo de Uno a Uno con ``pgr_edgeDisjointPaths``" +msgid "The array has the ordered edges of the restriction." +msgstr "El conjunto tiene las aristas ordenadas de la restricción." -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.6 `__." +msgid "Column ``cost``" +msgstr "Columna ``cost``" -msgid "Before updating pgRouting enumerate the columns: |ksp-result|" -msgstr "Antes de actualizar pgRouting enumerar las columnas: |ksp-result|" +msgid "Is of type ``ANY-NUMERICAL``" +msgstr "Es de tipo``ANY-NUMERICAL``" -msgid "Migration of single path functions" -msgstr "Migración de funciones de ruta única" +msgid "The creation of the restrictions table" +msgstr "La creación de la tabla de restricciones" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" -msgstr "Las columnas estandarizadas :ref:`pgRouting-concepts:Result columns for single path functions` son |short-generic-result|" +msgid "Adding the restrictions" +msgstr "Agregando las restricciones" -msgid "``pgr_dijkstra``" -msgstr "``pgr_dijkstra``" +msgid "Restrictions data" +msgstr "Datos de restricciones" -msgid "v < 3.5" -msgstr "" +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgstr "La restricción con``rid = 2`` representa el camino :math:`3 \\rightarrow5 \\rightarrow9`." -msgid "|old-generic-result|" -msgstr "|old-generic-result|" +msgid "By inspection the path is clear." +msgstr "El camino es claro por inspección." -msgid "``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "To transform the old restrictions table to the new restrictions structure," +msgstr "Para transformar la antigua tabla de restricciones a la nueva estructura de restricciones," -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "Create a new table with the new restrictions structure." +msgstr "Crea una nueva tabla con la nueva estructura de restricciones." -msgid "``pgr_bellmanFord``" -msgstr "``pgr_bellmanFord``" +msgid "In this migration guide ``new_restrictions`` is been used." +msgstr "En esta guía de migración ``new_restrictions`` está siendo usada." -msgid "``pgr_dagShortestPath``" -msgstr "``pgr_dagShortestPath``" +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgstr "Para esta migración pgRouting proporciona una función auxiliar para la inversión de un conjunto ``_pgr_array_reverse`` necesaria para la migración." -msgid "|result-1-1|" -msgstr "|result-1-1|" +msgid "``_pgr_array_reverse``:" +msgstr "``_pgr_array_reverse``:" -msgid "``pgr_edwardMoore``" -msgstr "``pgr_edwardMoore``" +msgid "Was created temporally for this migration" +msgstr "Se creo temporalmente para esta migración" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +msgid "Is not documented." +msgstr "No está documentado." -msgid "|old-pid-result|" -msgstr "|old-pid-result|" +msgid "Will be removed on the next mayor version 4.0.0" +msgstr "Se eliminara en la próxima versión mayor 4.0.0" -msgid "Migration of |old-generic-result|" -msgstr "Migración de |old-generic-result|" +msgid "The migrated table contents:" +msgstr "El contenido de la tabla de migración:" -msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" -msgstr "" +msgid ":doc:`pgRouting-concepts`" +msgstr ":doc:`pgRouting-concepts`" -msgid "Migration of |old-pid-result|" -msgstr "Migración de |old-pid-result|" +msgid "Ordering - Family of functions" +msgstr "Ordenamiento - Familia de funciones" -msgid "To get the old version column names, depending on the signature:" -msgstr "" +msgid "pgRouting Concepts" +msgstr "Conceptos de pgRouting" -msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" -msgstr "Filtrar las columnas ``start_vid`` y /o ``end_vid``" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgstr "Esta es una guía simple que va a través de los pasos básicos para empezar trabajar con pgRouting. Esta guía cubre:" -msgid "Rename the columns:" -msgstr "Cambio de nombre en las columnas:" +msgid "Graphs" +msgstr "Grafos" -msgid "``start_vid`` to ``start_pid``" -msgstr "``start_vid`` a ``end_pid``" +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" +msgstr "Un grafo es un par ordenado :math:`G = (V ,E)` donde:" -msgid "``end_vid`` to ``end_pid``" -msgstr "``end_vid`` a ``end_pid``" +msgid ":math:`V` is a set of vertices, also called nodes." +msgstr ":math:`V` es un conjunto de vértices, también llamados nodos." -msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" -msgstr "" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgid "Migration of |result-1-1|" -msgstr "Migración de |result-1-1|" +msgid "There are different kinds of graphs:" +msgstr "Hay diferentes tipos de grafos:" -msgid "To get the old version column names:" -msgstr "Para obtener los nombres de columna de la versión antigua:" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -msgid "Filter out the columns: ``start_vid`` and ``end_vid``" -msgstr "Filtrar las columnas: ``start_vid`` y ``end_vid``" +msgid "Undirected simple graph" +msgstr "Grafo no dirigido simple" -msgid "Examples with One to One with one route result" -msgstr "" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" -msgid "Using ``pgr_aStar``" -msgstr "Usando ``pgr_aStar``" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrando ejemplo `de v3.5 `__." +msgid "Directed simple graph" +msgstr "Grafo dirigido simple" -msgid "Before updating pgRouting enumerate the columns: |result-1-1|" -msgstr "" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgid "Using ``pgr_bdDijkstra``" -msgstr "Usando ``pgr_bdDijkstra``" +msgid "Graphs:" +msgstr "Grafos:" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "Do not have geometries." +msgstr "No tienen geometrías." -msgid "Using ``pgr_DAGshortestPath``" -msgstr "Usando ``pgr_DAGshortestPath``" +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgstr "Algunos problemas de teoría de grafos requieren tener pesos, llamados **cost** en pgRouting." -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "In pgRouting there are several ways to represent a graph on the database:" +msgstr "En pgRouting hay varias maneras de representar in grafo en la base de datos:" -msgid "This applies to all signatures of ``pgr_DAGshortestPath``" -msgstr "" +msgid "With ``cost``" +msgstr "Con ``cost``" -msgid "Examples for One to Many with one route result" -msgstr "" +msgid "(``id``, ``source``, ``target``, ``cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``)" -msgid "Using ``pgr_bdAstar``" -msgstr "Usando ``pgr_bdAstar``" +msgid "With ``cost`` and ``reverse_cost``" +msgstr "Con ``cost`` y ``reverse_cost``" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrando ejemplo `de v3.5 `__." +msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgid "Before updating pgRouting enumerate the columns: |result-1-m|" -msgstr "" +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgstr "Identificador de la asirsta. Requerimiento para mantener consistente la base de datos." -msgid "Using ``pgr_withPoints``" -msgstr "Usando ``pgr_withPoints``" +msgid "Identifier of a vertex." +msgstr "Identificador de un vértice." -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "Weight of the edge (``source``, ``target``):" +msgstr "Peso de la arista (``source``, ``target``):" -msgid "|pid-1-m|" -msgstr "" +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgstr "Cuando negativo: la arista (``source``, ``target``) no existe en el grafo." -msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." -msgstr "Para obtener los nombres de columna de la firma antigua: filtrar la columna ``start_vid`` y cambiar el nombre de ``end_vid`` a ``end_pid``." +msgid "``cost`` must exist in the query." +msgstr "``cost`` debe existir en la consulta." -msgid "Examples for Many to One with one route result" -msgstr "" +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "Cuando negativo: la arista (``target``, ``source``) no existe en el grafo." -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgstr "La decisión del grafo de ser **directed** o **undirected** es resultado al ejecutar el algoritmo de pgRouting." -msgid "Before updating pgRouting enumerate the columns: |result-m-1|" -msgstr "" +msgid "Graph with ``cost``" +msgstr "Grafo con ``cost``" -msgid "Using ``pgr_dijkstra``" -msgstr "Usando ``pgr_dijkstra``" +msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgstr "El grafo ponderado dirigido, :math:`G_d(V,E)`:" -msgid "Migrating `this v3.4 `__ example." -msgstr "Migrando ejemplo `de v3.4 `__." +msgid "Graph data is obtained with a query" +msgstr "Datos de l grafo se obtienen mediante una consulta" -msgid "Examples for Many to Many with one route result" -msgstr "" +msgid "``SELECT id, source, target, cost FROM edges``" +msgstr "``SELECT id, source, target, cost FROM edges``" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrando ejemplo `de v3.8 `__." +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ cuando } cost_{id} \\ge 0 \\}`" -msgid "|pid-m-m|" -msgstr "" +msgid "Edges where ``cost`` is non negative are part of the graph." +msgstr "Aristas donde ``cost`` es no negativo son parte del grafo." -msgid "Examples for combinations with one route result" -msgstr "" +msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgid "Migrating `this v3.8 `this `__ example." -msgstr "Migrando ejemplo `de v3.8 `this `__." +msgid "All vertices in ``source`` and ``target`` are part of the graph." +msgstr "Todos los vértices``source`` y ``target`` son parte del grafo." -msgid "Migration of spanning tree functions" -msgstr "Migración de las funciones de árbol de expansión" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "En un grafo dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" -msgstr "" +msgid "For the following data:" +msgstr "Para los siguientes datos:" -msgid "``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" +msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." +msgstr "La arista :math:`2` (:math:`1 \\rightarrow 3`) no es parte del grafo." -msgid ":ref:`from_result_dij_dd`" -msgstr ":ref:`from_result_dij_dd`" +msgid "The data is representing the following graph:" +msgstr "Los datos se representan en el siguiente grafo:" -msgid "``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "En un grafo no dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` no tiene direccionalidad: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgid ":ref:`from_result_generic_no_seq`" -msgstr ":ref:`from_result_generic_no_seq`" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" +msgstr "En términos de un grafo dirigido es como tener dos aristas: :math:`source_{id} \\leftrightarrow target_{id}`" -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgstr "Arista :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) no es parte del grafo." -msgid "v < 3.7" -msgstr "" +msgid "Graph with ``cost`` and ``reverse_cost``" +msgstr "Grafo con ``cost`` y ``reverse_cost``" -msgid ":ref:`from_result_bfs`" -msgstr ":ref:`from_result_bfs`" +msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" +msgid "The set of edges :math:`E`:" +msgstr "El conjunto de aristas :math:`E`:" -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgstr "Aristas :math:`(source \\rightarrow target)` done ``cost`` es no negativo son parte del grafo." -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "Aristas :math:`(target \\rightarrow source)` donde ``reverse_cost`` es no negativo son parte del grafo." -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" +msgid "The set of vertices :math:`V`:" +msgstr "El conjunto de vértices :math:`V`:" -msgid "``pgr_breadthFisrtSearch``" -msgstr "``pgr_breadthFisrtSearch``" +msgid "In a directed graph both edges have directionality" +msgstr "En un grafo dirigido ambas aristas tiene direccionalidad" -msgid "v < 4.0.0" -msgstr "" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`" -msgid "``pgr_depthFisrtSearch``" -msgstr "``pgr_depthFisrtSearch``" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgstr "arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` tiene direccionalidad: :math:`target_{id} \\rightarrow source_{id}`" -msgid "to |result-spantree|" -msgstr "a |result-spantree|" +msgid "Edges not part of the graph:" +msgstr "Aristas no son parte del grafo:" -msgid "Migration from |result-bfs|." -msgstr "Migración de |result-bfs|." +msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgstr ":math:`2` (:math:`1 \\rightarrow 3`)" -msgid "Single vertex" -msgstr "Vértice único" +msgid ":math:`3` (:math:`3 \\rightarrow 2`)" +msgstr ":math:`3` (:math:`3 \\rightarrow 2`)" -msgid "Multiple vertices" -msgstr "Múltiples vértices" +msgid "In a directed graph both edges do not have directionality" +msgstr "En un grafo dirigido ambas aristas no tiene direccionalidad" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|" -msgstr "" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "Arista :math:`(source_{id}, target_{id}, cost_{id})` es :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgid "Single vertex example using ``pgr_kruskalDD``" -msgstr "Ejemplo de vértice único con ``pgr_kruskalDD``" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgstr "Arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` es :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgid "Migrating `this v3.6 `__ example." -msgstr "Migrando ejemplo `de v3.6 `__." +msgid "In terms of a directed graph is like having four edges:" +msgstr "En términos de un grafo dirigido es como tener cuatro aristas:" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|." -msgstr "" +msgid ":math:`source_i \\leftrightarrow target_i`" +msgstr ":math:`source_i \\leftrightarrow target_i`" -msgid "Multiple vertices example using ``pgr_kruskalDFS``" -msgstr "Ejemplo de vértices múltiples con ``pgr_kruskalDFS``" +msgid ":math:`target_i \\leftrightarrow source_i`" +msgstr ":math:`target_i \\leftrightarrow source_i`" -msgid "Migrating `this v3.6 `__ example." -msgstr "Migrando ejemplo `de v3.6 `__." +msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" -msgid "Migration from |result-dij-dd|" -msgstr "Migración de |result-dij-dd|" +msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" -msgid "Migration depends on the signature." -msgstr "" +msgid "Graphs without geometries" +msgstr "Grafos sin geometrías" -msgid "For single vertex:" -msgstr "Para vértice único:" +msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgstr "Relaciones personales, genealogía, problemas de dependencia de archivos puede ser resueltos usando pgRouting. Esos problemas, normalmente, no vienen con las geometrías asociadas con el grafo." -msgid "Before updating pgRouting, enumerate |result-1-1| columns" -msgstr "Antes de actualizar pgRouting, enumerar las columnas |result-1-1|" +msgid "Wiki example" +msgstr "Ejemplo de Wiki" -msgid "For multiple vertices:" -msgstr "Para múltiples vértices:" +msgid "Solve the example problem taken from `wikipedia `__):" +msgstr "Resuelva el problema de ejemplo tomado de `wikipedia `__):" -msgid "Changes must be done after updating pgRouting." -msgstr "" +msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." +msgstr "Problema es encontrar el camino mas corto desde :math:`1` a :math:`5`." -msgid "To get the old version column names |result-dij-dd-m|:" -msgstr "Para obtener los nombres de columna de la versión antigua |result-dij-dd-m|:" +msgid "Is an undirected graph." +msgstr "Es un grafo dirigido." -msgid "filter out the column ``pred`` and ``depth`` and" -msgstr "filtrar las columnas ``pred`` y ``depth`` y" +msgid "Although visually looks like to have geometries, the drawing is not to scale." +msgstr "Aunque visualmente se vea con geometrías, el dibujo no es a escala." -msgid "rename ``start_vid`` to ``from_v``." -msgstr "renombrar ``start_vid`` a ``from_v``." +msgid "No geometries associated to the vertices or edges" +msgstr "Las geometrías no esta asociadas con los vértices o aristas" -msgid "Single vertex example using ``pgr_drivingDistance``" -msgstr "Ejemplo de vértice único con ``pgr_drivingDistance``" +msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" +msgstr "Tiene 6 vértices :math:`\\{1,2,3,4,5,6\\}`" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrando ejemplo `de v3.5 `__." +msgid "Has 9 edges:" +msgstr "Tiene 9 aristas:" -msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" -msgstr "Antes de actualizar pgRouting, enumerar las columnas |result-1-1-no-seq|" +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" -msgid "Multiple vertices example using ``pgr_drivingDistance``" -msgstr "Ejemplo de vértices múltiples con ``pgr_drivingDistance``" +msgid "The graph can be represented in many ways for example:" +msgstr "El grafo puede ser representados de varias maneras por ejemplo:" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrando ejemplo `de v3.5 `__." +msgid "Prepare the database" +msgstr "Prepara la base de datos" -msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." -msgstr "" +msgid "Create a database for the example, access the database and install pgRouting: ::" +msgstr "Crea una base de datos para el ejemplo, acceda a la base de datos e instala pgRouting: ::" -msgid "Migration of |result-generic-no-seq|" -msgstr "Migración de |result-generic-no-seq|" +msgid "Create a table" +msgstr "Crear una tabla" -msgid "After updating pgRouting:" -msgstr "" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgstr "Los elementos básicos necesarios para realizar routing básico en un grafo no dirigido son:" -msgid "Enumerate |result-1-1-no-seq| columns" -msgstr "Enumerar las columnas |result-1-1-no-seq|" +msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." -msgstr "Usar un valor válido sin nombre para **lado de manejo** después del parámetro **distancia**." +msgid "Using this table design for this example:" +msgstr "Usando este diseño de tabla para este ejemplo:" -msgid "Enumerate |result-m-1-no-seq| columns" -msgstr "Enumerar las columnas |result-m-1-no-seq|" +msgid "Insert the data" +msgstr "Introduzca los datos" -msgid "Default value of **driving side** parameter" -msgstr "Valor por defecto del parámetro **lado conductor**" +msgid "Find the shortest path" +msgstr "En cuentre el camino más corto" -msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." -msgstr "El parámetro **lado conductor** no tiene nombre, y los valores válidos difieren para grafos dirigidos y no dirigidos." +msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgstr "Para resolver el ejemplo se usa :doc:`pgr_dijkstra`:" -msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" -msgstr "En grafos dirigidos: Los valores válidos son [``r``, ``R``, ``l``, ``L``]" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "Para ir de :math:`1` a :math:`5` el camino que atraviesa los siguientes vértices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" -msgid "Default value = 'r';" -msgstr "Valor por defecto = 'r';" +msgid "Vertex information" +msgstr "Información de vertices" -msgid "In undirected graph: valid values are [``b``, ``B``]" -msgstr "En grafos no dirigidos: Los valores válidos son [``b``, ``B``]" +msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" +msgstr "Para obtener la información de los vértices, use :doc:`pgr_extractVertices`" -msgid "Default value = 'b';" -msgstr "Valor por defecto = 'b';" +msgid "Graphs with geometries" +msgstr "Grafos con geometrías" -msgid "Single vertex example using ``pgr_withPointsDD``" -msgstr "Ejemplo de vértice único con ``pgr_withPointsDD``" +msgid "Create a routing Database" +msgstr "Crear una Base de Datos de Ruteo" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrando ejemplo `de v3.5 `__." +msgid "The first step is to create a database and load pgRouting in the database." +msgstr "El primer paso para crear una base de datos y cargar pgRouting en la base de datos." -msgid "Multiple vertices example using ``pgr_withPointsDD``" -msgstr "Ejemplo de vértices múltiples con ``pgr_withPointsDD``" +msgid "Typically create a database for each project." +msgstr "Típicamente se crea una base de datos para cada proyecto." -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrando ejemplo `de v3.5 `__." +msgid "Once having the database to work in, load your data and build the routing application in that database." +msgstr "Una vez que se tenga una base de datos, cargue sus datos y construya la aplicación de routeo en esa base de datos." -msgid "Migration of output column name change" -msgstr "Migración del cambio de nombre de la columna de salida" +msgid "Load Data" +msgstr "Cargar Datos" -msgid "The standardized result columns:" -msgstr "Columnas de resultados estandarizados:" +msgid "There are several ways to load your data into pgRouting." +msgstr "Hay varias maneras de cargar tus datos en pgRouting." -msgid "|result_edge_color|" -msgstr "|result_edge_color|" +msgid "Manually creating a database." +msgstr "Creando manualmente la base de datos." -msgid "|result_node_color|" -msgstr "|result_node_color|" +msgid "`Graphs without geometries`_" +msgstr "`Grafos sin geometrías`_" -msgid "|result_node_order|" -msgstr "|result_node_order|" +msgid ":doc:`sampledata`: a small graph used in the documentation examples" +msgstr ":doc:`sampledata`: un pequeño grafo utilizado en los ejemplos de la documentación" -msgid "Changes on column names must be done after updating pgRouting." -msgstr "" +msgid "Using `osm2pgrouting `__" +msgstr "Usando `osm2pgrouting `__" -msgid "``pgr_edgeColoring``" -msgstr "``pgr_edgeColoring``" +msgid "There are various open source tools that can help, like:" +msgstr "Existen varias herramientas de codigo abierto que pueden ayudar, como:" -msgid ":ref:`from_old_edge_color`" -msgstr ":ref:`from_old_edge_color`" +msgid "shp2pgsql" +msgstr "shp2pgsql" -msgid "``pgr_bipartite``" -msgstr "``pgr_bipartite``" +msgid "postgresql shapefile loader" +msgstr "cargador a postgresql de archivos shape" -msgid ":ref:`from_old_node_color`" -msgstr ":ref:`from_old_node_color`" +msgid "ogr2ogr" +msgstr "ogr2ogr" -msgid "``pgr_sequentialVertexColoring``" -msgstr "``pgr_sequentialVertexColoring``" +msgid "vector data conversion utility" +msgstr "herramienta de conversión de datos vectoriales" -msgid "``pgr_topologicalSort``" -msgstr "``pgr_topologicalSort``" +msgid "osm2pgsql" +msgstr "osm2pgsql" -msgid ":ref:`from_toposort`" -msgstr ":ref:`from_toposort`" +msgid "load OSM data into postgresql" +msgstr "cargar datos de OSM a postgresql" -msgid "``pgr_transitiveClosure``" -msgstr "``pgr_transitiveClosure``" +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgstr "Tener en cuenta que estas herramientas **no** importan los datos a una estructura compatible con pgRouting y cuando esto sucede, la topología necesita ser ajustada." -msgid ":ref:`from_old_closure`" -msgstr ":ref:`from_old_closure`" +msgid "Breakup a segments on each segment-segment intersection" +msgstr "Rompe en segmentos cada intersección segmento-segmento" -msgid "Migration from |result-old-closure|" -msgstr "Migración de |result-old-closure|" +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgstr "Cuando falte, agregue columnas y asigne valores a ``source``, ``target``, ``cost``, ``reverse_cost``." -msgid "Migration to: |result-old-closure|" -msgstr "Migración a: |result-old-closure|" +msgid "Connect a disconnected graph." +msgstr "Conecte un grafo desconectado." -msgid "After update:" -msgstr "" +msgid "Create the complete graph topology" +msgstr "Crea la topología de un grafo completo" -msgid "Remove column ``seq``" -msgstr "Eliminar la columna ``seq``" +msgid "Create one or more graphs based on the application to be developed." +msgstr "Crea uno o mas grafos según la aplicación que se desarrolla." -msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" -msgstr "" +msgid "Create a contracted graph for the high speed roads" +msgstr "Crea un grafo contraído para calles de alta velocidad" -msgid "Migration from |result-toposort|" -msgstr "Migración de |result-toposort|" +msgid "Create graphs per state/country" +msgstr "Crear grafos por estado/país" -msgid "Migration to: |result_node_order|" -msgstr "Migración a: |result_node_order|" +msgid "In few words:" +msgstr "En pocas palabras:" -msgid "Rename ``sorted_v`` to ``node``" -msgstr "Cambiar el nombre de ``sorted_v`` a ``node``" +msgid "Prepare the graph" +msgstr "Prepara el grafo" -msgid "Migration from |old-edge-color|" -msgstr "Migración de |old-edge-color|" +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgstr "Qué y cómo preparar el grafo, dependerá de la aplicación y/o de la calidad de los datos y/o de lo cerca que esté la información de tener una topología utilizable por pgRouting y/o algunos otros factores no mencionados." -msgid "Migration to: |result_edge_color|" -msgstr "Migración a: |result_edge_color|" +msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." +msgstr "Los pasos para preparar el grafo implican operaciones de geometría utilizando `PostGIS `__ y algunos otros implican operaciones de grafos como :doc:`pgr_contraction` para contraer un grafo." -msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." -msgstr "" +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgstr "El `taller `__ tiene un paso a paso sobre cómo preparar un grafo utilizando datos de Open Street Map, para una pequeña aplicación." -msgid "Migration from |old-node-color|" -msgstr "Migración de |old-node-color|" +msgid "The use of indexes on the database design in general:" +msgstr "El uso de índices en el diseño de bases de datos en general:" -msgid "Migration to: |result_node_color|" -msgstr "Migración a: |result_node_color|" +msgid "Have the geometries indexed." +msgstr "Tener las geometrías indexadas." -msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." -msgstr "" +msgid "Have the identifiers columns indexed." +msgstr "Tener indexadas las columnas de identificadores." -msgid "Migration of deleted functions" -msgstr "Migración de funciones eliminadas" +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgstr "Consultar la documentación de `PostgreSQL `__ y la documentación de `PostGIS `__." -msgid "Functions no longer on pgRouting" -msgstr "Funciones que ya no están en pgRouting" +msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." +msgstr "Los datos procedentes de OSM y utilizando ``osm2pgrouting `__ como herramienta de importación, vienen con la topología de ruteo. Ver un ejemplo de uso de ``osm2pgrouting`` en el `workshop `__." -msgid "Migration of ``pgr_alphaShape``" -msgstr "Migración de ``pgr_alphaShape``" +msgid "Adjust costs" +msgstr "Ajustar los costes" -msgid "Deprecated" -msgstr "Obsoleto" +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgstr "Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el doble de la longitud de la geometría." -msgid "`v3.8.0 `__" -msgstr "`v3.8.0 `__" +msgid "Update costs to length of geometry" +msgstr "Actualizar los costes a la longitud de la geometría" -msgid "Removed" -msgstr "Eliminado" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgstr "Suponer que las columnas ``cost`` y ``reverse_cost`` de los datos de la muestra representan:" -msgid "`v4.0.0 `__" -msgstr "`v4.0.0 `__" +msgid ":math:`1` when the edge exists in the graph" +msgstr ":math:`1` cuando la arista existe en el grafo" -msgid "**Before Deprecation:** The following was calculated:" -msgstr "**Antes de la Depreciación:** Se calculó lo siguiente:" +msgid ":math:`-1` when the edge does not exist in the graph" +msgstr ":math:`-1` cuando la arista no existe en el grafo" -msgid "An alphaShape was calculated" -msgstr "Se ha calculado un alphaShape" +msgid "Using that information updating to the length of the geometries:" +msgstr "Utilizando esa información de actualización a la longitud de las geometrías:" -msgid "**After Deprecation:**" -msgstr "**Después de la eliminación:**" +msgid "Which gives the following results:" +msgstr "Lo que da los siguientes resultados:" -msgid "PostGIS has two ways of generating alphaShape." -msgstr "" +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgstr "Tener en cuenta que para poder seguir los ejemplos de la documentación, todo se basa en el grafo original." -msgid "If you have SFCGAL, which you can install using" -msgstr "" +msgid "Returning to the original data:" +msgstr "Volviendo a los datos originales:" -msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" -msgstr "" +msgid "Update costs based on codes" +msgstr "Actualizar los costes en función de los códigos" -msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" -msgstr "" +msgid "Other datasets, can have a column with values like" +msgstr "Otros conjuntos de datos, pueden tener una columna con valores como" -msgid "Other PostGIS options are" -msgstr "" +msgid "``FT`` vehicle flow on the direction of the geometry" +msgstr "``FT`` flujo de vehículos en la dirección de la geometría" -msgid "`ST_ConvexHull `__" -msgstr "" +msgid "``TF`` vehicle flow opposite of the direction of the geometry" +msgstr "``TF`` flujo del vehículo opuesto a la dirección de la geometría" -msgid "`ST_ConcaveHull `__" -msgstr "" +msgid "``B`` vehicle flow on both directions" +msgstr "``B`` flujo de vehículos en ambas direcciones" -msgid "Migration of ``pgr_nodeNetwork``" -msgstr "Migración de ``pgr_nodeNetwork``" +msgid "Preparing a code column for the example:" +msgstr "Preparar una columna de códigos para el ejemplo:" -msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." -msgstr "" - -msgid "**Migration**" -msgstr "**Migración**" +msgid "Adjusting the costs based on the codes:" +msgstr "Ajuste de los costes en función de los códigos:" -msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" -msgstr "" +msgid "Check the Routing Topology" +msgstr "Compruebe la Topología de Ruteo" -msgid "Migration of ``pgr_createTopology``" -msgstr "Migración de ``pgr_createTopology``" +msgid "There are lots of possible problems in a graph." +msgstr "Hay muchos problemas posibles en un grafo." -msgid "A table with `_vertices_pgr` was created." -msgstr "Se ha creado una tabla con `_vertices_pgr`." +msgid "The data used may not have been designed with routing in mind." +msgstr "Es posible que los datos utilizados no se hayan diseñado teniendo en cuenta el ruteo." -msgid "**After Deprecation:** The user is responsible to create the complete topology." -msgstr "**Después de la depreciación** El usuario es responsable de crear la topología completa." +msgid "A graph has some very specific requirements." +msgstr "Un grafo tiene unos requisitos muy específicos." -msgid "Build a routing topology" -msgstr "Construir una topología de ruteo" +msgid "The graph is disconnected." +msgstr "El grafo está desconectado." -msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." -msgstr "La información básica para usar la mayoría de las funciones de pgRouting ``id, source, target, cost, [reverse_cost]`` es lo que en pgRouting se llama topología de ruteo." +msgid "There are unwanted intersections." +msgstr "Hay intersecciones no deseadas." -msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." -msgstr "``reverse_cost`` es opcional pero se recomienda encarecidamente tenerlo para reducir el tamaño de la base de datos debido al tamaño de las columnas de geometría. Dicho esto, en esta documentación se utiliza ``reverse_cost``." +msgid "The graph is too large and needs to be contracted." +msgstr "El grafo es demasiado grande y hay que contraerlo." -msgid "When the data comes with geometries and there is no routing topology, then this step is needed." -msgstr "Cuando los datos vienen con geometrías y no hay topología de ruteo, entonces este paso es necesario." +msgid "A sub graph is needed for the application." +msgstr "Se necesita un subgrafo para la aplicación." -msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." -msgstr "Todos los vértices iniciales y finales de las geometrías necesitan un identificador que se almacenará en las columnas ``source`` y ``target`` de la tabla de los datos. Del mismo modo, ``cost`` y ``reverse_cost`` necesitan tener el valor de atravesar la arista en ambas direcciones." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgstr "y muchos otros problemas que el usuario de pgRouting, es decir, el desarrollador de aplicaciones, puede encontrar." -msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" -msgstr "Si las columnas no existen, hay que añadirlas a la tabla en cuestión. (véase `ALTER TABLE `__)" +msgid "Crossing edges" +msgstr "Aristas que se cruzan" -msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." -msgstr "La función :doc:`pgr_extractVertices` se utiliza para crear una tabla de vértices basada en el identificador de arista y la geometría de la arista del grafo." +msgid "To get the crossing edges:" +msgstr "Para obtener las aristas que se cruzan:" -msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." -msgstr "Finalmente, utilizando los datos almacenados en las tablas de vértices, se rellenan los campos ``source`` y ``target``." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgstr "Esa información es correcta, por ejemplo, cuando en términos de vehículos, es un túnel o puente cruczando sobre otra carretera." -msgid "Migration of ``pgr_createVerticesTable``" -msgstr "Migracion de ``pgr_createVerticesTable``" +msgid "It might be incorrect, for example:" +msgstr "Puede ser incorrecto, por ejemplo:" -msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." -msgstr "**Después de la depreciación:** El usuario es responsable de crear la tabla de vértices, índices, etc. Para ello puede utilizar :doc:`pgr_extractVertices`." +msgid "When it is actually an intersection of roads, where vehicles can make turns." +msgstr "Cuando en realidad es una intersección de carreteras, donde los vehículos pueden hacer giros." -msgid "Migration of ``pgr_analyzeOneWay``" -msgstr "Migración de ``pgr_analyzeOneWay``" +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgstr "En cuanto a las líneas eléctricas, son capaces de cambiar de carretera incluso en un túnel o puente." -msgid "Number of potential problems in directionality" -msgstr "Número de problemas potenciales en la dirección" +msgid "When it is incorrect, it needs fixing:" +msgstr "Cuando es incorrecta, hay que arreglarla:" -msgid "WHERE" -msgstr "Donde" +msgid "For vehicles and pedestrians" +msgstr "Para vehículos y peatones" -msgid "Directionality problems were calculated based on codes." -msgstr "Los problemas de dirección se calcularon a partir de códigos." +msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." +msgstr "Si los datos provienen de OSM y fueron importados a la base de datos utilizando ``osm2pgrouting``, la corrección debe hacerse en el `OSM portal `__ y los datos ser importados de nuevo." -msgid "Dead ends." -msgstr "Callejones sin salida." +msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgstr "En general, cuando los datos proceden de un proveedor que tiene los datos preparados para el ruteo de vehículos, y hay un problema, los datos deben ser fijados por el proveedor" -msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" -msgstr "Un problema de ruteo puede surgir cuando desde un vértice sólo hay una salida o una entrada, pero no ambas:" +msgid "For very specific applications" +msgstr "Para aplicaciones muy específicas" -msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." -msgstr "Guardando o usando directamente :doc:`pgr_extractVertices` se obtiene la información de los callejones sin salida y se determina si la arista adyacente es unidireccional o no." +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgstr "Los datos son correctos desde el punto de vista de la circulación de vehículos o peatones." -msgid "In this example :doc:`pgr_extractVertices` has already been applied." -msgstr "En este ejemplo :doc:`pgr_extractVertices` ya se ha aplicado." +msgid "The data needs a local fix for the specific application." +msgstr "Los datos necesitan un arreglo local para la aplicación específica." -msgid "Bridges." -msgstr "Puentes." +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "Una vez analizados uno a uno los cruces, para los que necesitan un arreglo local, hay que `dividir las aristas `__." -msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." -msgstr "Otro problema para ruteo puede surgir cuando en un grafo no dirigido hay una arista cuya eliminación aumenta el numero de componentes conectados, y el puente es solo de un sentido." +msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgstr "Hay que añadir las nuevas aristas a la tabla de aristas, actualizar el resto de atributos en las nuevas aristas, eliminar las aristas antiguas y actualizar la topología de encaminamiento." -msgid "To determine if the bridges are or not one way." -msgstr "Para determinar si los puentes son o no unidireccionales." +msgid "Fixing an intersection" +msgstr "Encontrando una intersección" -msgid "Migration of ``pgr_analyzeGraph``" -msgstr "Migración de ``pgr_analyzeGraph``" +msgid "In this example the original edge table will be used to store the additional geometries." +msgstr "" -msgid "Number of isolated segments." -msgstr "Número de segmentos aislados." +msgid "An example use without results" +msgstr "" -msgid "Number of dead ends." -msgstr "Cantidad de callejones sin salida." +msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgstr "La ruta de :math:`1` a :math:`18` no da ninguna solución." -msgid "Number of potential gaps found near dead ends." -msgstr "Número de huecos potenciales encontrados cerca de callejones sin salida." +msgid "Analyze the network for intersections." +msgstr "" -msgid "Number of intersections. (between 2 edges)" -msgstr "Número de intersecciones. (entre 2 aristas)" +msgid "The analysis tell us that the network has an intersection." +msgstr "El análisis nos dice que la red tiene una intersección." -msgid "Graph component" -msgstr "Componente de grafo" +msgid "Prepare tables" +msgstr "Preparar tablas" -msgid "A connected subgraph that is not part of any larger connected subgraph." -msgstr "Un sub-grafo conectando no es parte de un grafo conectado mas grande." +msgid "Additional columns to control the origin of the segments." +msgstr "" -msgid "Isolated segment" -msgstr "Segmento aislado" +msgid "Adding new segments." +msgstr "Añadiendo nuevos segmentos." -msgid "A graph component with only one segment." -msgstr "Un componente de grafo con un solo segmento." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." +msgstr "" -msgid "Dead ends" -msgstr "Callejones sin salida" +msgid "Update other values" +msgstr "Actualizar otros valores" -msgid "A vertex that participates in only one edge." -msgstr "Un vértice que participa en una sola arista." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgstr "En este ejemplo sólo se actualizan ``cost`` y ``reverse_cost``, donde se basan en la longitud de la geometría y se mantiene la direccionalidad mediante la función ``sign``." -msgid "gaps" -msgstr "Espacios" +msgid "Update the topology" +msgstr "Actualizar la topología" -msgid "Space between two geometries." -msgstr "Espacio entre dos geometrías." +msgid "Insert the new vertices if any." +msgstr "Insertar nuevos vértices si existen." -msgid "Intersection" -msgstr "Intersección" +msgid "Update source and target information on the edges table." +msgstr "Actualizar la salida y el destino en la tabla de aristas." -msgid "Is a topological relationship between two geometries." -msgstr "Es una relación topológica entre dos geometrías." +msgid "The example has results" +msgstr "" -msgid "Migration." -msgstr "Migración." +msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgstr "La ruta de :math:`1` a :math:`18` da una solución." -msgid "Components." -msgstr "Componentes." +msgid "Touching edges" +msgstr "Bordes que se tocan" -msgid "Instead of counting only isolated segments, determine all the components of the graph." -msgstr "En lugar de contar sólo segmentos aislados, determinar todos los componentes del grafo." +msgid "Visually the edges seem to be connected, but internally they are not." +msgstr "" -msgid "Depending of the final application requirements use:" -msgstr "Dependiendo de los requisitos de la aplicación final utilizar:" +msgid "The validity of the information is application dependent." +msgstr "" -msgid ":doc:`pgr_connectedComponents`" -msgstr ":doc:`pgr_connectedComponents`" +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgstr "" -msgid ":doc:`pgr_strongComponents`" -msgstr ":doc:`pgr_strongComponents`" +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "Una vez analizados uno a uno los toques, para los que necesiten un arreglo local, hay que separar las aristas con `split `__." -msgid ":doc:`pgr_biconnectedComponents`" -msgstr ":doc:`pgr_biconnectedComponents`" +msgid "Fixing a gap" +msgstr "" -msgid "For example:" -msgstr "Por ejemplo:" +msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgstr "La ruta de :math:`1` a :math:`2` no da ninguna solución." -msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." -msgstr "En lugar de contar los callejones sin salida, determine todos los callejones sin salida del grafo utilizando :doc:`pgr_degree`." +msgid "Analyze the network for gaps." +msgstr "Analizar la red por espacios." -msgid "Potential gaps near dead ends." -msgstr "Huecos potenciales cerca de callejones sin salida." +msgid "The analysis tell us that the network has a gap." +msgstr "El análisis nos dice que la red tiene una brecha." -msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" -msgid "Topological relationships." -msgstr "Relaciones topológicas." +msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgstr "La ruta de :math:`1` a :math:`2` da una solución." -msgid "Instead of counting intersections, determine topological relationships between geometries." -msgstr "" +msgid "Connecting components" +msgstr "Conectando componentes" -msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgstr "Se pueden utilizar varias funciones de PostGIS: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "To get the graph connectivity:" +msgstr "Para obtener la conectividad del grafo:" -msgid "Migration of ``pgr_trsp`` (Vertices)" -msgstr "Migración de `pgr_trsp`` (Vértices)" +msgid "There are three basic ways to connect components:" +msgstr "Existen tres formas básicas de conectar los componentes:" -msgid "Signature:" -msgstr "Firma:" +msgid "From the vertex to the starting point of the edge" +msgstr "Del vértice al punto inicial de la arista" -msgid "`v3.4.0 `__" -msgstr "`v3.4.0 `__" +msgid "From the vertex to the ending point of the edge" +msgstr "Desde el vértice hasta el punto final de la arista" -msgid ":doc:`pgr_trsp`" -msgstr ":doc:`pgr_trsp`" +msgid "From the vertex to the closest vertex on the edge" +msgstr "Del vértice al vértice más cercano de la arista" -msgid "`Migration of restrictions`_" -msgstr "`Migración de restricciones`_" +msgid "This solution requires the edge to be split." +msgstr "Esta solución requiere dividir el borde." -msgid "Use ``pgr_dijkstra`` when there are no restrictions." -msgstr "Usar ``pgr_dijkstra`` cuando no hay restricciones." +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgstr "" -msgid "Use :doc:`pgr_dijkstra` instead." -msgstr "Usa en vez :doc:`pgr_dijkstra`." +msgid "Get the connectivity" +msgstr "Obtener la conectividad" -msgid "To get the original column names:" -msgstr "Para obtener los nombres originales de las columnas:" +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." +msgstr "" -msgid "``id1`` is the node" -msgstr "``id1`` es el nodo" +msgid "Insert new edges" +msgstr "Insertar nuevas aristas" -msgid "``id2`` is the edge" -msgstr "``id2`` es la arista" +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgstr "" -msgid "Use ``pgr_trsp`` when there are restrictions." -msgstr "Usar ``pgr_trspVia`` cuando hay restricciones." +msgid "Create the vertices table" +msgstr "Crear la tabla de vértices" -msgid "Use :doc:`pgr_trsp` (One to One) instead." -msgstr "Utilice en su lugar :doc:`pgr_trsp` (Uno a Uno)." +msgid "Using :doc:`pgr_extractVertices` create the table." +msgstr "Usar :doc:`pgr_extractVertices` para crear la tabla." -msgid "Migration of ``pgr_trsp`` (Edges)" -msgstr "Migración de ``pgr_trsp`` (Aristas)" +msgid "Contraction of a graph" +msgstr "Contracción de un grafo" -msgid ":doc:`pgr_trsp_withPoints`" -msgstr ":doc:`pgr_trsp_withPoints`" +msgid "The graph can be reduced in size using :doc:`contraction-family`" +msgstr "El grafo puede reducirse de tamaño utilizando :doc:`contraction-family`" -msgid "Migration of ``pgr_trspViaVertices``" -msgstr "Migraciones de ``pgr_trspViaVertices``" +msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." +msgstr "El cuando contraer dependerá del tamaño del gráfico, de los tiempos de procesamiento, de la corrección de los datos, de la aplicación final o de cualquier otro factor no mencionado." -msgid ":doc:`pgr_dijkstraVia`" -msgstr ":doc:`pgr_dijkstraVia`" +msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." +msgstr "Un método bastante bueno para saber si la contracción puede ser útil es por el número de callejones sin salida y/o el número de aristas lineales." -msgid ":doc:`pgr_trspVia`" -msgstr ":doc:`pgr_trspVia`" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgstr "En :doc:`contraction-family` se describe un método completo sobre cómo contraer y cómo utilizar el grafo contraído" -msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" -msgstr "Usar ``pgr_dijkstraVia`` cuando no hay restricciones" +msgid "To get the dead ends:" +msgstr "Para obtener los callejones sin salida:" -msgid "Use :doc:`pgr_dijkstraVia` instead." -msgstr "Usar :doc:`pgr_dijkstraVia` en su lugar." +msgid "A dead end happens when" +msgstr "Un callejón sin salida se produce cuando" -msgid "``id1`` is the path identifier" -msgstr "``id1`` es el identificador de camino" +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgstr "El vértice es el límite de un callejón sin salida, una vía de no paso o una vía de no salida." -msgid "``id2`` is the node" -msgstr "``id2`` es el nodo" +msgid "The vertex is on the limit of the imported graph." +msgstr "El vértice esta en el limite del grafo importado." -msgid "``id3`` is the edge" -msgstr "``id3`` es la arista" +msgid "If a larger graph is imported then the vertex might not be a dead end" +msgstr "Si se importa un grafo más grande, puede que el vértice no sea un callejón sin salida" -msgid "Use ``pgr_trspVia`` when there are restrictions" -msgstr "Usar ``pgr_trspVia`` cuando hay restricciones" +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgstr "El nodo :math:`4`, es un callejón sin salida en la consulta, aunque visualmente parezca un punto final de 3 aristas." -msgid "Use :doc:`pgr_trspVia` instead." -msgstr "Usar :doc:`pgr_trspVia` en su lugar." +msgid "Is node :math:`4` a dead end or not?" +msgstr "¿Es el nodo :math:`4` un callejón sin salida o no?" -msgid "Migration of ``pgr_trspViaEdges``" -msgstr "Migración de ``pgr_trspViaEdges``" +msgid "The answer to that question will depend on the application." +msgstr "La respuesta a esta pregunta dependerá de la aplicación." -msgid ":doc:`pgr_withPointsVia`" -msgstr ":doc:`pgr_withPointsVia`" +msgid "Is there such a small curb:" +msgstr "Hay un bordillo tan pequeño:" -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid "That does not allow a vehicle to use that visual intersection?" +msgstr "¿Eso no permite a un vehículo utilizar esa intersección visual?" -msgid "Use ``pgr_withPointsVia`` when there are no restrictions" -msgstr "Usar ``pgr_withPointsVia`` cuando no hay restricciones" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgstr "¿Es la aplicación para peatones y por lo tanto el peatón puede caminar fácilmente en una acera pequeña?" -msgid "Use :doc:`pgr_withPointsVia` instead." -msgstr "Usar :doc:`pgr_withPointsVia` en su lugar." +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgstr "¿Es la aplicación para la electricidad y las líneas eléctricas que se puede extender fácilmente en la parte superior de la acera pequeña?" -msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" -msgstr "Usar ``pgr_trspVia_withPoints`` cuando hay restricciones" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgstr "¿Hay un gran acantilado y desde la vista de las águilas parece que el callejón sin salida está cerca del segmento?" -msgid "Use :doc:`pgr_trspVia_withPoints` instead." -msgstr "Usar :doc:`pgr_trspVia_withPoints` en su lugar." +msgid "Depending on the answer, modification of the data might be needed." +msgstr "Dependiendo de la respuesta, será necesario la modificación de datos." -msgid "Not yet classified migrations" -msgstr "" +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." +msgstr "Cuando hay muchos callejones sin salida, para acelerar el procesamiento, se pueden utilizar las funciones de :doc:`contraction-family` para contraer el grafo." -msgid "Migration of ``pgr_withPointsKSP``" -msgstr "Migración de ``pgr_withPointsKSP``" +msgid "Linear edges" +msgstr "Bordes lineales" -msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." -msgstr "A partir de `v3.6.0 `__ en :doc:`pgr_withPointsKSP` las columnas de resultados están siendo estandarizadas." +msgid "To get the linear edges:" +msgstr "Para obtener las aristas lineales:" -msgid "|ksp-result|" -msgstr "|ksp-result|" +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgstr "Estos vértices lineales son correctos, por ejemplo, cuando esos vértices son badenes, señales de alto y la aplicación los tiene en cuenta." -msgid "|generic-result|" -msgstr "|generic-result|" +msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." +msgstr "Cuando hay muchas aristas lineales, que no necesitan tomarse en cuenta, para acelerar el procesamiento se pueden utilizar las funciones :doc:`contraction-family` para contraer el grafo." -msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." -msgstr "Y el parámetro ``driving side`` ha cambiado de opcional con nombre a **lado conductor** sin nombre y su validez difiere para grafos dirigidos y no dirigidos." +msgid "Function's structure" +msgstr "Estructura de la función" -msgid "``pgr_withPointsKSP`` (`One to One`)" -msgstr "``pgr_withPointsKSP`` (`Uno a Uno`)" +msgid "Once the graph preparation work has been done above, it is time to use a" +msgstr "Una vez realizado el trabajo de preparación del grafo anterior, es el momento de utilizar un" -msgid "Before Migration" -msgstr "Antes de la migración" +msgid "The general form of a pgRouting function call is:" +msgstr "La forma general de una llamada a una función de pgRouting es:" -msgid "Output columns were |old-pid-result|" -msgstr "Regresa conjunto de |old-generic-result|" +msgid "\\ \\" +msgstr "\\ \\" -msgid "the columns ``start_vid`` and ``end_vid`` do not exist." -msgstr "las columnas ``start_vid`` y ``end_vid`` no existen." +msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgstr "pgr_(`Consultas internas`_, **parámetros**, [ ``Parámetros opcionales``)" -msgid "Migration" -msgstr "Migración" +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." +msgstr "`Consultas internas`_: Son parámetros obligatorios que son ``TEXT`` que contienen consultas SQL." -msgid "Be aware of the existence of the additional result Columns." -msgstr "Tener en cuenta la existencia de las columnas adicionales de resultados." +msgid "**parameters**: Additional compulsory parameters needed by the function." +msgstr "**Parámetros**: Parámetros obligatorios adicionales que necesita la función." -msgid "New output columns are |generic-result|" -msgstr "Las nuevas columnas de salida son |generic-result|" +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgstr "``Parámetros opcionales``: Son parámetros **nombrados** no obligatorios que tienen un valor por defecto cuando se omiten." -msgid "Using `this `__ example." -msgstr "Usando `este `__ ejemplo." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgstr "Los parámetros obligatorios son parámetros de posición, los parámetros opcionales son parámetros nombrados." -msgid "``start_vid`` contains the **start vid** parameter value." -msgstr "``start_vid`` contiene el valor del parámetro **start vid**." +msgid "For example, for this :doc:`pgr_dijkstra` signature:" +msgstr "Por ejemplo, para esta firma :doc:`pgr_dijkstra`:" -msgid "``end_vid`` contains the **end vid** parameter value." -msgstr "``end_vid`` contiene el valor del parámetro **end vid**." +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "If needed filter out the additional columns, for example, to return the original columns:" -msgstr "Si es necesario, filtrar las columnas adicionales, por ejemplo, para devolver las columnas originales:" +msgid "`Edges SQL`_:" +msgstr "`SQL de aristas`_:" -msgid "Use ``pgr_withPoints`` when there are no restrictions." -msgstr "Usar ``pgr_withPoints`` cuando no hay restricciones." +msgid "Is the first parameter." +msgstr "Es el primer parámetro." -msgid "Use :doc:`pgr_withPoints` (One to One) instead." -msgstr "Utilizar en su lugar :doc:`pgr_withPoints` (Uno a Uno)." +msgid "It is compulsory." +msgstr "Es obligatorio." -msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." -msgstr "Usar ``pgr_trsp_withPoints`` cuando hay restricciones." +msgid "It is an inner query." +msgstr "Es una consulta interna." -msgid "Use :doc:`pgr_trsp_withPoints` instead." -msgstr "Utilizar en su lugar :doc:`pgr_trsp_withPoints`." +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgstr "No tiene nombre, por lo que **SQL de aristas** da una idea del tipo de consulta interna que hay que utilizar" -msgid "Migration of ``pgr_maxCardinalityMatch``" -msgstr "Migración de ``pgr_maxCardinalityMatch``" +msgid "**start vid**:" +msgstr "**vid inical**:" -msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." -msgstr ":doc:`pgr_maxCardinalityMatch` funciona solamente para grafos no dirigidos, entonces la bandera ``directed`` ha sido removida." +msgid "Is the second parameter." +msgstr "Es el segundo parámetro." -msgid "Starting from `v3.4.0 `__" -msgstr "A partir de v3.4.0 `__" +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." +msgstr "No tiene nombre, por lo que **salida** da una idea de lo que debe contener el valor del segundo parámetro." -msgid "Signature to be migrated:" -msgstr "Firma que serán migrada:" +msgid "Is the third parameter." +msgstr "Es el tercer parámetro." -msgid "Migration is needed, because:" -msgstr "Migración es necesaria, porque:" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgstr "No tiene nombre, por lo que **destino** da una idea de lo que debe contener el valor del tercer parámetro" -msgid "Use ``cost`` and ``reverse_cost`` on the inner query" -msgstr "Usa ``cost`` y ``reverse_cost`` en la consulta interna" +msgid "Is the fourth parameter." +msgstr "Es el cuarto parámetro." -msgid "Results are ordered" -msgstr "Los resultados son ordenados" +msgid "It is optional." +msgstr "Es opcional." -msgid "Works for undirected graphs." -msgstr "Funciona para grafos no dirigidos." +msgid "It has a name." +msgstr "Tiene un nombre." -msgid "New signature" -msgstr "Nueva firma" +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgstr "La descripción completa de los parámetros se encuentra en la sección `Parámetros`_ de cada función." -msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." -msgstr "``pgr_maxCardinalityMatch(text)`` regresa solamente la columna ``edge``." +msgid "Function's overloads" +msgstr "Sobrecargas de funciones" -msgid "The optional flag ``directed`` is removed." -msgstr "La bandera opcional ``directed`` es removida." +msgid "A function might have different overloads. The most common are called:" +msgstr "Una función puede tener diferentes sobrecargas. Las más comunes se llaman:" -msgid "Before migration" -msgstr "Antes de migración" +msgid "`One to One`_" +msgstr "`Uno a Uno`_" -msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." -msgstr "Las columnas usadas son ``going`` y ``coming`` para representar la existencia de la arista." +msgid "`One to Many`_" +msgstr "`Uno a Muchos`_" -msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." -msgstr "La flag ``directed`` es usada para indicar si fue para un grafo **dirigido** or **no dirigido**." +msgid "`Many to One`_" +msgstr "`Muchos a Uno`_" -msgid "The flag ``directed`` is ignored." -msgstr "La bandera ``directed`` es ignorada." +msgid "`Many to Many`_" +msgstr "`Muchos a Muchos`_" -msgid "Regardless of it's value it gives the result considering the graph as **undirected**." -msgstr "Independiente de su valor, da el resultado considerando el grafo como **no dirigido**." +msgid "`Combinations`_" +msgstr "`Combinaciones`_" -msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." -msgstr "Usa las columnas ``cost`` y ``reverse_cost`` para representar la existenica de una arista." +msgid "Depending on the overload the parameters types change." +msgstr "Dependiendo de la sobrecarga, los tipos de los parámetros cambian." -msgid "Do not use the flag ``directed``." -msgstr "No use la bandera ``directed``." +msgid "**One**: **ANY-INTEGER**" +msgstr "**Uno**: **CUALQUIER-ENTERO**" -msgid "In the query returns only ``edge`` column." -msgstr "En la consulta solo devuelve la columna ``edge``." +msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgstr "**Muchos**: ``ARRAY`` [**CUALQUIER-ENTERO**]" -msgid "Migration of restrictions" -msgstr "Migración de restricciones" +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgstr "Dependiendo de la función, las sobrecargas pueden variar. Pero el concepto de cambio de tipo de parámetro sigue siendo el mismo." -msgid "The structure of the restrictions have changed:" -msgstr "La estructura de las restricciones ha cambiado:" +msgid "When routing from:" +msgstr "Cuando se rutea desde:" -msgid "Old restrictions structure" -msgstr "Estructura de restricciones vieja" +msgid "From **one** starting vertex" +msgstr "Desde **un** vértice inicial" -msgid "On the deprecated signatures:" -msgstr "Sobre las firmas obsoletas:" +msgid "to **one** ending vertex" +msgstr "al **un** vértice final" -msgid "Column ``rid`` is ignored" -msgstr "La columna ``rid`` es ignorada" +msgid "to **many** ending vertices" +msgstr "a los vértices finales **many**" -msgid "``via_path``" -msgstr "``via_path``" +msgid "From **many** starting vertices" +msgstr "Desde **muchos** vértices iniciales" -msgid "Must be in reverse order." -msgstr "Debe de estar en orden reverso." +msgid "From **many** different starting vertices" +msgstr "A partir de **muchos** diferentes vértices de inicio" -msgid "Is of type ``TEXT``." -msgstr "Es de tipo ``TEXT``." +msgid "to **many** different ending vertices" +msgstr "a **muchos** diferentes vértices finales" -msgid "When more than one via edge must be separated with ``,``." -msgstr "Cuando hay más de una arista debe de ser separada con ``,``." +msgid "Every tuple specifies a pair of a start vertex and an end vertex" +msgstr "Cada tupla especifica un par de vértices iniciales y un vértice final" -msgid "``target_id``" -msgstr "``target_id``" +msgid "Users can define the combinations as desired." +msgstr "Los usuarios pueden definir las combinaciones como deseen." -msgid "Is the last edge of the forbidden path." -msgstr "Es la última arista del camino prohibido." +msgid "Needs a `Combinations SQL`_" +msgstr "Necesita una `SQL de combinaciones`_" -msgid "Is of type ``INTEGER``." -msgstr "Es de tipo de ``INTEGER``." +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." +msgstr "Existen varios tipos de consultas internas válidas y también las columnas devueltas dependen de la función. El tipo de consulta interna dependerá de los requisitos de la función. Para simplificar la variedad de tipos, se utiliza **ANY-INTEGER** y **ANY-NUMERICAL**." -msgid "``to_cost``" -msgstr "``to_cost``" +msgid "Edges SQL for" +msgstr "SQL de aristas para" -msgid "Is of type ``FLOAT``." -msgstr "Es de tipo ``FLOAT``." +msgid "Some uncategorised functions" +msgstr "Algunas funciones no categorizadas" -msgid "Creation of the old restrictions table" -msgstr "Creación de la vieja table de restricciones" +msgid "General without ``id``" +msgstr "General sin ``id``" -msgid "Old restrictions fill up" -msgstr "Las viejas restricciones se llenan" +msgid "General with (X,Y)" +msgstr "General con (X,Y)" -msgid "Old restrictions contents" -msgstr "Contenido de viejas restricciones" +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgstr "Cuando es negativo: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo." -msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" -msgstr "La restricción con ``rid = 2`` representa :math:`3 \\rightarrow 5 \\rightarrow9`" +msgid "Weight of the edge (``target``, ``source``)," +msgstr "Peso de la arista (``target``, ``source``)," -msgid ":math:`3\\rightarrow5`" -msgstr ":math:`3\\rightarrow5`" +msgid "``x1``" +msgstr "``x1``" -msgid "is on column ``via_path`` in reverse order" -msgstr "esta en la columna ``via_path`` en orden reverso" +msgid "X coordinate of ``source`` vertex." +msgstr "Coordenada X del vértice ``source``." -msgid "is of type ``TEXT``" -msgstr "es de tipo ``TEXT``" +msgid "``y1``" +msgstr "``y1``" -msgid ":math:`9`" -msgstr ":math:`9`" +msgid "Y coordinate of ``source`` vertex." +msgstr "Coordenada Y del vértice ``source``." -msgid "is on column ``target_id``" -msgstr "está en la columna ``target_id``" +msgid "``x2``" +msgstr "``x2``" -msgid "is of type ``INTEGER``" -msgstr "es de tipo ``INTEGER``" +msgid "X coordinate of ``target`` vertex." +msgstr "Coordenada X del vértice ``target``." -msgid "New restrictions structure" -msgstr "Estructura de nuevas restricciones" +msgid "``y2``" +msgstr "``y2``" -msgid "Column ``id`` is ignored" -msgstr "La columna ``id`` es ignorada" +msgid "Y coordinate of ``target`` vertex." +msgstr "Coordenada Y del vértice ``target``." -msgid "Column ``path``" -msgstr "Columna ``path``" +msgid "Flow" +msgstr "Flujo" -msgid "Is of type ``ARRAY[ANY-INTEGER]``." -msgstr "Es de tipo ``ARRAY[ANY-INTEGER]``." +msgid "Edges SQL for :doc:`flow-family`" +msgstr "SQL de aristas para :doc:`flow-family`" -msgid "Contains all the edges involved on the restriction." -msgstr "Contiene todas las aristas involucradas con la restricción" +msgid "Edges SQL for the following functions of :doc:`flow-family`" +msgstr "SQL de aristas para las siguientes funciones de :doc:`flow-family`" -msgid "The array has the ordered edges of the restriction." -msgstr "El conjunto tiene las aristas ordenadas de la restricción." +msgid "Used in combination signatures" +msgstr "Utilizado en combinación firmas" -msgid "Column ``cost``" -msgstr "Columna ``cost``" +msgid "Points SQL for" +msgstr "SQL de puntos para" -msgid "Is of type ``ANY-NUMERICAL``" -msgstr "Es de tipo``ANY-NUMERICAL``" +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgstr "El parámetro principal de la mayoría de las funciones pgRouting es una consulta que selecciona las aristas del grafo." -msgid "The creation of the restrictions table" -msgstr "La creación de la tabla de restricciones" +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgstr "Dependiendo de la familia o categoría de una función tendrá parámetros adicionales, algunos de ellos son obligatorios y otros opcionales." -msgid "Adding the restrictions" -msgstr "Agregando las restricciones" +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgstr "Los parámetros obligatorios no tienen nombre y deben indicarse en el orden requerido. Los parámetros opcionales son parámetros con nombre y tendrán un valor por defecto." -msgid "Restrictions data" -msgstr "Datos de restricciones" +msgid "Parameters for the Via functions" +msgstr "Párametros para las funciones Via" -msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." -msgstr "La restricción con``rid = 2`` representa el camino :math:`3 \\rightarrow5 \\rightarrow9`." +msgid "SQL query as described." +msgstr "Consulta SQL como se describe." -msgid "By inspection the path is clear." -msgstr "El camino es claro por inspección." +msgid "When ``true`` Graph is considered `Directed`" +msgstr "Cuando ``true`` el gráfo se considera `Dirigido`" -msgid "To transform the old restrictions table to the new restrictions structure," -msgstr "Para transformar la antigua tabla de restricciones a la nueva estructura de restricciones," +msgid "When ``false`` the graph is considered as Undirected." +msgstr "Cuando ``false`` el gráfico se considera como No Dirigido." -msgid "Create a new table with the new restrictions structure." -msgstr "Crea una nueva tabla con la nueva estructura de restricciones." +msgid "``strict``" +msgstr "``strict``" -msgid "In this migration guide ``new_restrictions`` is been used." -msgstr "En esta guía de migración ``new_restrictions`` está siendo usada." +msgid "``false``" +msgstr "``false``" -msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." -msgstr "Para esta migración pgRouting proporciona una función auxiliar para la inversión de un conjunto ``_pgr_array_reverse`` necesaria para la migración." +msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" +msgstr "Cuando ``true`` si un camino le faltan paradas y regresa **EMPTY SET**" -msgid "``_pgr_array_reverse``:" -msgstr "``_pgr_array_reverse``:" +msgid "When ``false`` ignores missing paths returning all paths found" +msgstr "Cuando ``false``, ignora las rutas faltantes y devuelve todas las rutas encontradas" -msgid "Was created temporally for this migration" -msgstr "Se creo temporalmente para esta migración" +msgid "``U_turn_on_edge``" +msgstr "``U_turn_on_edge``" -msgid "Is not documented." -msgstr "No está documentado." +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgstr "Cuando ``true`` saliendo de un vértice visitado no intentará evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se permite la vuelta en U usando la arista con el mismo identificador." -msgid "Will be removed on the next mayor version 4.0.0" -msgstr "Se eliminara en la próxima versión mayor 4.0.0" +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgstr "Cuando ``false`` al salir de un vértice visitado intenta evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se utiliza la vuelta en U utilizando la arista con el mismo identificador cuando no se encuentra ninguna otra ruta." -msgid "The migrated table contents:" -msgstr "El contenido de la tabla de migración:" +msgid "For the TRSP functions" +msgstr "Para las funciones de TRSP" -msgid ":doc:`pgRouting-concepts`" -msgstr ":doc:`pgRouting-concepts`" +msgid "Array of identifiers of destination vertices." +msgstr "Arreglo de identificadores de vértices destino." -msgid "Ordering - Family of functions" -msgstr "Ordenamiento - Familia de funciones" +msgid "There are several kinds of columns returned are depending of the function." +msgstr "Hay varios tipos de columnas devueltas que dependen de la función." -msgid "pgRouting Concepts" -msgstr "Conceptos de pgRouting" +msgid "Result columns for single path functions" +msgstr "Columnas de resultados para funciones de ruta única" -msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" -msgstr "Esta es una guía simple que va a través de los pasos básicos para empezar trabajar con pgRouting. Esta guía cubre:" +msgid "Used in functions that return one path solution per departure and destination." +msgstr "Se utiliza en funciones que devuelven solo una solución de ruta por salida y destino." -msgid "Graphs" -msgstr "Grafos" +msgid ":doc:`pgr_dijkstraNear`" +msgstr ":doc:`pgr_dijkstraNear`" -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" -msgstr "Un grafo es un par ordenado :math:`G = (V ,E)` donde:" +msgid "Returns |short-generic-result|" +msgstr "Devuelve |short-generic-result|" -msgid ":math:`V` is a set of vertices, also called nodes." -msgstr ":math:`V` es un conjunto de vértices, también llamados nodos." +msgid "``path_seq``" +msgstr "``path_seq``" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgstr "Posición relativa en la ruta. Tiene el valor **1** para el inicio de una ruta." -msgid "There are different kinds of graphs:" -msgstr "Hay diferentes tipos de grafos:" +msgid "Identifier of the starting vertex of the current path." +msgstr "Identificador del vértice inicial de la ruta actual." -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgid "Identifier of the ending vertex of the current path." +msgstr "Identificador del vértice final de la ruta actual." -msgid "Undirected simple graph" -msgstr "Grafo no dirigido simple" +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." +msgstr "Identificador del nodo en la ruta de ``start_vid`` a ``end_vid``." -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgstr "Identificador de la arista utilizado para ir del ``node`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta." -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgstr "Costo para atravesar desde ``node`` usando ``edge`` hasta el siguiente nodo en la secuencia de la ruta." -msgid "Directed simple graph" -msgstr "Grafo dirigido simple" +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgstr "Cuando las columnas ``start_vid`` o ``end_vid`` tienen valores negativos, el identificador corresponde a un Punto." -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "Result columns for multiple paths functions" +msgstr "Columnas de resultados para funciones de rutas múltiples" -msgid "Graphs:" -msgstr "Grafos:" +msgid "Used in functions that return many paths solutions per departure and destination." +msgstr "Se utiliza en funciones que devuelven muchas soluciones de rutas por salida y destino." -msgid "Do not have geometries." -msgstr "No tienen geometrías." +msgid ":doc:`pgr_KSP`" +msgstr ":doc:`pgr_KSP`" -msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." -msgstr "Algunos problemas de teoría de grafos requieren tener pesos, llamados **cost** en pgRouting." +msgid ":doc:`pgr_withPointsKSP`" +msgstr ":doc:`pgr_withPointsKSP`" -msgid "In pgRouting there are several ways to represent a graph on the database:" -msgstr "En pgRouting hay varias maneras de representar in grafo en la base de datos:" +msgid "Returns set of |generic-result|" +msgstr "Regresa el conjunto de |generic-result|" -msgid "With ``cost``" -msgstr "Con ``cost``" +msgid "``path_id``" +msgstr "``path_id``" -msgid "(``id``, ``source``, ``target``, ``cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``)" +msgid "Path identifier." +msgstr "Identificador del camino." -msgid "With ``cost`` and ``reverse_cost``" -msgstr "Con ``cost`` y ``reverse_cost``" +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgstr "Tiene valor **1** para el primero de la ruta de ``start_vid`` a ``end_vid``." -msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgid "Result columns for cost functions" +msgstr "Columnas de resultados de las funciones de costes" -msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." -msgstr "Identificador de la asirsta. Requerimiento para mantener consistente la base de datos." +msgid "Used by:" +msgstr "Utilizado por:" -msgid "Identifier of a vertex." -msgstr "Identificador de un vértice." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgstr "Cuando las columnas del vértice inicial o del destino continen valores negativos, el identificador es para un Punto." -msgid "Weight of the edge (``source``, ``target``):" -msgstr "Peso de la arista (``source``, ``target``):" +msgid "Result columns for flow functions" +msgstr "Columnas de resultados para funciones de flujo" -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." -msgstr "Cuando negativo: la arista (``source``, ``target``) no existe en el grafo." +msgid "Result columns for spanning tree functions" +msgstr "Columnas de resultados para funciones de árbol de expansión" -msgid "``cost`` must exist in the query." -msgstr "``cost`` debe existir en la consulta." +msgid "Used in functions that return a tree solution per departure." +msgstr "Se utiliza en funciones que devuelven una solución de árbol por salida." -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." -msgstr "Cuando negativo: la arista (``target``, ``source``) no existe en el grafo." +msgid "Result columns for simple spanning tree functions" +msgstr "Columnas de resultados para funciones de árbol de expansión simple" -msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." -msgstr "La decisión del grafo de ser **directed** o **undirected** es resultado al ejecutar el algoritmo de pgRouting." +msgid "Returns set of ``(edge, cost)``" +msgstr "Regresa el conjunto de ``(edge, cost)``" -msgid "Graph with ``cost``" -msgstr "Grafo con ``cost``" +msgid "Cost to traverse the edge." +msgstr "Coste para atravezar el borde." -msgid "The weighted directed graph, :math:`G_d(V,E)`:" -msgstr "El grafo ponderado dirigido, :math:`G_d(V,E)`:" +msgid "Performance Tips" +msgstr "Consejos de Rendimiento" -msgid "Graph data is obtained with a query" -msgstr "Datos de l grafo se obtienen mediante una consulta" +msgid "For the Routing functions" +msgstr "Para las funciones de Ruteo" -msgid "``SELECT id, source, target, cost FROM edges``" -msgstr "``SELECT id, source, target, cost FROM edges``" +msgid "To get faster results bound the queries to an area of interest of routing." +msgstr "Para obtener resultados más rápidos, delimitar las consultas a un área de interés para el ruteo." -msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" -msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ cuando } cost_{id} \\ge 0 \\}`" +msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." +msgstr "En este ejemplo, usar una consulta SQL interna que no incluya algunas aristas en la función de ruteo y dentro del área de los resultados." -msgid "Edges where ``cost`` is non negative are part of the graph." -msgstr "Aristas donde ``cost`` es no negativo son parte del grafo." +msgid "Given this area:" +msgstr "Dada esta área:" -msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgid "Calculate a route:" +msgstr "Calcular una ruta:" -msgid "All vertices in ``source`` and ``target`` are part of the graph." -msgstr "Todos los vértices``source`` y ``target`` son parte del grafo." +msgid "How to contribute" +msgstr "Cómo contribuir" -msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "En un grafo dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`" +msgid "Wiki" +msgstr "Wiki" -msgid "For the following data:" -msgstr "Para los siguientes datos:" +msgid "Edit an existing `pgRouting Wiki `__ page." +msgstr "Edita una página existente `Wiki de pgRouting `_." -msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." -msgstr "La arista :math:`2` (:math:`1 \\rightarrow 3`) no es parte del grafo." +msgid "Or create a new Wiki page" +msgstr "O crea una nueva página Wiki" -msgid "The data is representing the following graph:" -msgstr "Los datos se representan en el siguiente grafo:" +msgid "Create a page on the `pgRouting Wiki `__" +msgstr "Crear una página en el `Wiki de pgRouting `_" -msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "En un grafo no dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` no tiene direccionalidad: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Give the title an appropriate name" +msgstr "Asigne al título un nombre apropiado" -msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" -msgstr "En términos de un grafo dirigido es como tener dos aristas: :math:`source_{id} \\leftrightarrow target_{id}`" +msgid "`Example `__" +msgstr "`Ejemplo `__" -msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." -msgstr "Arista :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) no es parte del grafo." +msgid "Adding Functionality to pgRouting" +msgstr "Agregando Funcionalidad a pgRouting" -msgid "Graph with ``cost`` and ``reverse_cost``" -msgstr "Grafo con ``cost`` y ``reverse_cost``" +msgid "Consult the `developer's documentation `__" +msgstr "Consultar la `documentation de desarrolladores `__" -msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" -msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgid "Installation" +msgstr "Instalación" -msgid "The set of edges :math:`E`:" -msgstr "El conjunto de aristas :math:`E`:" +msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" +msgstr "Las instrucciones para descargar e instalar los binarios para diferentes sistemas operativos, notas adicionales y correcciones no incluidas en esta documentación se pueden encontrar en `Installation wiki `__" -msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgstr "Para utilizar pgRouting, PostGIS necesita ser instalado, por favor lea la información sobre la instalación en esta `Guía de Instalación `__" -msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." -msgstr "Aristas :math:`(source \\rightarrow target)` done ``cost`` es no negativo son parte del grafo." +msgid "Short Version" +msgstr "Versión corta" -msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." -msgstr "Aristas :math:`(target \\rightarrow source)` donde ``reverse_cost`` es no negativo son parte del grafo." +msgid "Extracting the tar ball" +msgstr "Extraer la bola de alquitrán" -msgid "The set of vertices :math:`V`:" -msgstr "El conjunto de vértices :math:`V`:" +msgid "To compile assuming you have all the dependencies in your search path:" +msgstr "Para compilar suponiendo que tiene todas las dependencias en su ruta de búsqueda:" -msgid "In a directed graph both edges have directionality" -msgstr "En un grafo dirigido ambas aristas tiene direccionalidad" +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." +msgstr "Una vez que pgRouting está instalado, debe habilitarse en cada base de datos individual en la que desee utilizarlo." -msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`" +msgid "Get the sources" +msgstr "Obtener las fuentes" -msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" -msgstr "arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` tiene direccionalidad: :math:`target_{id} \\rightarrow source_{id}`" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgstr "La última versión de pgRouting se puede encontrar en https://github.com/pgRouting/pgrouting/releases/latest" -msgid "Edges not part of the graph:" -msgstr "Aristas no son parte del grafo:" +msgid "To download this release:" +msgstr "Para descargar esta versión:" -msgid ":math:`2` (:math:`1 \\rightarrow 3`)" -msgstr ":math:`2` (:math:`1 \\rightarrow 3`)" +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgstr "Ir a :ref:`install-short` para más instrucciones sobre la extraccion de la bola tar y la compilación de pgRouting." -msgid ":math:`3` (:math:`3 \\rightarrow 2`)" -msgstr ":math:`3` (:math:`3 \\rightarrow 2`)" +msgid "git" +msgstr "git" -msgid "In a directed graph both edges do not have directionality" -msgstr "En un grafo dirigido ambas aristas no tiene direccionalidad" +msgid "To download the repository" +msgstr "Para descargar el repositorio" -msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "Arista :math:`(source_{id}, target_{id}, cost_{id})` es :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." +msgstr "Ir a :ref:`install-short` para más instrucciones sobre la compilación de pgRouting (no hay bola tar involucrada al descargar el repositorio pgRouting desde GitHub)." -msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgstr "Arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` es :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Enabling and upgrading in the database" +msgstr "Habilitación y actualización en la base de datos" -msgid "In terms of a directed graph is like having four edges:" -msgstr "En términos de un grafo dirigido es como tener cuatro aristas:" +msgid "Enabling the database" +msgstr "Habilitación de la base de datos" -msgid ":math:`source_i \\leftrightarrow target_i`" -msgstr ":math:`source_i \\leftrightarrow target_i`" +msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." +msgstr "pgRouting es una extensión de PostgreSQL y depende de PostGIS para proporcionar funcionalidades al usuario final. A continuación se muestra el código demuestra que permite PostGIS y pgRouting en la base de datos." -msgid ":math:`target_i \\leftrightarrow source_i`" -msgstr ":math:`target_i \\leftrightarrow source_i`" +msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgstr "Comprobación de la versión de PostGIS y pgRouting después de habilitarlos en la base de datos." -msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" -msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgid "Upgrading the database" +msgstr "Actualización de la base de datos" -msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" -msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgstr "Para actualizar pgRouting en la base de datos a la versión 4.1.0 utilice el siguiente comando:" -msgid "Graphs without geometries" -msgstr "Grafos sin geometrías" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgstr "Puede hallar más información en https://www.postgresql.org/docs/current/sql-createextension.html" -msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." -msgstr "Relaciones personales, genealogía, problemas de dependencia de archivos puede ser resueltos usando pgRouting. Esos problemas, normalmente, no vienen con las geometrías asociadas con el grafo." +msgid "Dependencies" +msgstr "Dependencias" -msgid "Wiki example" -msgstr "Ejemplo de Wiki" +msgid "Compilation Dependencies" +msgstr "Dependencias de Compilación" -msgid "Solve the example problem taken from `wikipedia `__):" -msgstr "Resuelva el problema de ejemplo tomado de `wikipedia `__):" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgstr "Para poder compilar pgRouting, asegúrese de que se cumplen las siguientes dependencias:" -msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." -msgstr "Problema es encontrar el camino mas corto desde :math:`1` a :math:`5`." +msgid "C and C++0x compilers" +msgstr "Compiladores C y C++0x" -msgid "Is an undirected graph." -msgstr "Es un grafo dirigido." +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgstr "Compilar con Boost 1.56 hasta Boost 1.74 requiere un compilador C++ con soporte estandard para C++03 o C++11" -msgid "Although visually looks like to have geometries, the drawing is not to scale." -msgstr "Aunque visualmente se vea con geometrías, el dibujo no es a escala." +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgstr "La compilación con Boost 1.75 requiere un compilador de C++ compatible con el estándar C++14" -msgid "No geometries associated to the vertices or edges" -msgstr "Las geometrías no esta asociadas con los vértices o aristas" +msgid "Postgresql version >= 13" +msgstr "Postgresql version >= 13" -msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" -msgstr "Tiene 6 vértices :math:`\\{1,2,3,4,5,6\\}`" +msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgstr "La Librería de Grafos Boost (BGL) >= 1.56.0" -msgid "Has 9 edges:" -msgstr "Tiene 9 aristas:" +msgid "CMake >= 3.12" +msgstr "CMake >= 3.12" -msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" -msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgid "For user's documentation" +msgstr "Para la documentación del usuario" -msgid "The graph can be represented in many ways for example:" -msgstr "El grafo puede ser representados de varias maneras por ejemplo:" +msgid "Sphinx >= 4.0" +msgstr "Sphinx >= 4.0" -msgid "Prepare the database" -msgstr "Prepara la base de datos" +msgid "For developer's documentation" +msgstr "Para la documentación del desarrollador" -msgid "Create a database for the example, access the database and install pgRouting: ::" -msgstr "Crea una base de datos para el ejemplo, acceda a la base de datos e instala pgRouting: ::" +msgid "Doxygen >= 1.7" +msgstr "Doxygen >= 1.7" -msgid "Create a table" -msgstr "Crear una tabla" +msgid "For testing" +msgstr "Para pruebas" -msgid "The basic elements needed to perform basic routing on an undirected graph are:" -msgstr "Los elementos básicos necesarios para realizar routing básico en un grafo no dirigido son:" +msgid "pgtap" +msgstr "pgtap" -msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgid "pg_prove" +msgstr "pg_prove" -msgid "Using this table design for this example:" -msgstr "Usando este diseño de tabla para este ejemplo:" +msgid "For using:" +msgstr "Para uso:" -msgid "Insert the data" -msgstr "Introduzca los datos" +msgid "PostGIS version >= 3.0.0" +msgstr "PostGIS versión >= 3.0.0" -msgid "Find the shortest path" -msgstr "En cuentre el camino más corto" +msgid "Example: Installing dependencies on linux" +msgstr "Ejemplo: Instalación de dependencias en linux" -msgid "To solve this example :doc:`pgr_dijkstra` is used:" -msgstr "Para resolver el ejemplo se usa :doc:`pgr_dijkstra`:" +msgid "Installing the compilation dependencies" +msgstr "Instalación de las dependencias de compilación" -msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" -msgstr "Para ir de :math:`1` a :math:`5` el camino que atraviesa los siguientes vértices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "Build dependencies" +msgstr "Construir dependencias" -msgid "Vertex information" -msgstr "Información de vertices" +msgid "Optional dependencies" +msgstr "Dependencias opcionales" -msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" -msgstr "Para obtener la información de los vértices, use :doc:`pgr_extractVertices`" +msgid "For documentation" +msgstr "Para la documentación" -msgid "Graphs with geometries" -msgstr "Grafos con geometrías" +msgid "Configuring" +msgstr "Configuración" -msgid "Create a routing Database" -msgstr "Crear una Base de Datos de Ruteo" +msgid "pgRouting uses the `cmake` system to do the configuration." +msgstr "pgRouting utiliza el sistema 'cmake' para realizar la configuración." -msgid "The first step is to create a database and load pgRouting in the database." -msgstr "El primer paso para crear una base de datos y cargar pgRouting en la base de datos." +msgid "Configurable variables" +msgstr "Variables configurables" -msgid "Typically create a database for each project." -msgstr "Típicamente se crea una base de datos para cada proyecto." +msgid "To see the variables that can be configured" +msgstr "Para ver las variables que se pueden configurar" -msgid "Once having the database to work in, load your data and build the routing application in that database." -msgstr "Una vez que se tenga una base de datos, cargue sus datos y construya la aplicación de routeo en esa base de datos." +msgid "The build directory is different from the source directory" +msgstr "El directorio de compilación es diferente del directorio de origen" -msgid "Load Data" -msgstr "Cargar Datos" +msgid "Configuring The Documentation" +msgstr "Configurar la documentación" -msgid "There are several ways to load your data into pgRouting." -msgstr "Hay varias maneras de cargar tus datos en pgRouting." +msgid "User and developers documentation are not build if prerequisites are not found." +msgstr "" -msgid "Manually creating a database." -msgstr "Creando manualmente la base de datos." +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgstr "La mayor parte del esfuerzo de la documentación ha estado en los archivos HTML. Algunas variables para construir la documentación:" -msgid "`Graphs without geometries`_" -msgstr "`Grafos sin geometrías`_" +msgid "Variable" +msgstr "Variable" -msgid ":doc:`sampledata`: a small graph used in the documentation examples" -msgstr ":doc:`sampledata`: un pequeño grafo utilizado en los ejemplos de la documentación" +msgid "Comment" +msgstr "Comentario" -msgid "Using `osm2pgrouting `__" -msgstr "Usando `osm2pgrouting `__" +msgid "BUILD_HTML" +msgstr "BUILD_HTML" -msgid "There are various open source tools that can help, like:" -msgstr "Existen varias herramientas de codigo abierto que pueden ayudar, como:" +msgid "BOOL=ON" +msgstr "BOOL=ON" -msgid "shp2pgsql" -msgstr "shp2pgsql" +msgid "If ON, turn on/off building HTML for user's documentation" +msgstr "Si está activado, active/desactive la creación de HTML para la documentación del usuario" -msgid "postgresql shapefile loader" -msgstr "cargador a postgresql de archivos shape" +msgid "BUILD_DOXY" +msgstr "BUILD_DOXY" -msgid "ogr2ogr" -msgstr "ogr2ogr" +msgid "If ON, turn on/off building HTML for developer's documentation" +msgstr "Si está activado, active o desactive la creación de HTML para la documentación del desarrollador" -msgid "vector data conversion utility" -msgstr "herramienta de conversión de datos vectoriales" +msgid "BUILD_LATEX" +msgstr "BUILD_LATEX" -msgid "osm2pgsql" -msgstr "osm2pgsql" +msgid "BOOL=OFF" +msgstr "BOOL=OFF" -msgid "load OSM data into postgresql" -msgstr "cargar datos de OSM a postgresql" +msgid "If ON, turn on/off building PDF" +msgstr "Si está activado, active/desactive la creación de PDF" -msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." -msgstr "Tener en cuenta que estas herramientas **no** importan los datos a una estructura compatible con pgRouting y cuando esto sucede, la topología necesita ser ajustada." +msgid "BUILD_MAN" +msgstr "BUILD_MAN" -msgid "Breakup a segments on each segment-segment intersection" -msgstr "Rompe en segmentos cada intersección segmento-segmento" +msgid "If ON, turn on/off building MAN pages" +msgstr "Si está activado, active/desactive las páginas MAN de construcción" -msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." -msgstr "Cuando falte, agregue columnas y asigne valores a ``source``, ``target``, ``cost``, ``reverse_cost``." +msgid "DOC_USE_BOOTSTRAP" +msgstr "DOC_USE_BOOTSTRAP" -msgid "Connect a disconnected graph." -msgstr "Conecte un grafo desconectado." +msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" +msgstr "Si está activado, utilice sphinx-bootstrap para las páginas HTML de la documentación de los usuarios" -msgid "Create the complete graph topology" -msgstr "Crea la topología de un grafo completo" +msgid "EN" +msgstr "" -msgid "Create one or more graphs based on the application to be developed." -msgstr "Crea uno o mas grafos según la aplicación que se desarrolla." +msgid "if OFF the English documentation will no be built" +msgstr "si está en OFF no se creará la documentación en inglés" -msgid "Create a contracted graph for the high speed roads" -msgstr "Crea un grafo contraído para calles de alta velocidad" +msgid "ES" +msgstr "" -msgid "Create graphs per state/country" -msgstr "Crear grafos por estado/país" +msgid "if OFF the Spanish documentation will no be built" +msgstr "si OFF la documentación en español no se construirá" -msgid "In few words:" -msgstr "En pocas palabras:" +msgid "SV" +msgstr "" -msgid "Prepare the graph" -msgstr "Prepara el grafo" +msgid "if OFF the Swedish documentation will no be built" +msgstr "si OFF la documentación en sueco no se construirá" -msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." -msgstr "Qué y cómo preparar el grafo, dependerá de la aplicación y/o de la calidad de los datos y/o de lo cerca que esté la información de tener una topología utilizable por pgRouting y/o algunos otros factores no mencionados." +msgid "ZH_HANS" +msgstr "" -msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." -msgstr "Los pasos para preparar el grafo implican operaciones de geometría utilizando `PostGIS `__ y algunos otros implican operaciones de grafos como :doc:`pgr_contraction` para contraer un grafo." +msgid "if OFF the Chinese simplified documentation will no be built" +msgstr "" -msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." -msgstr "El `taller `__ tiene un paso a paso sobre cómo preparar un grafo utilizando datos de Open Street Map, para una pequeña aplicación." +msgid "Building" +msgstr "Compilando" -msgid "The use of indexes on the database design in general:" -msgstr "El uso de índices en el diseño de bases de datos en general:" +msgid "Using ``make`` to build the code and the documentation" +msgstr "Uso de ``make`` para compilar el código y la documentación" -msgid "Have the geometries indexed." -msgstr "Tener las geometrías indexadas." +msgid "The following instructions start from ``path/to/pgrouting/build``" +msgstr "Las siguientes instrucciones parten de ``path/to/pgrouting/build``" -msgid "Have the identifiers columns indexed." -msgstr "Tener indexadas las columnas de identificadores." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgstr "Hemos probado en varias plataformas, Para instalar o reinstalar todos los pasos son necesarios." -msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." -msgstr "Consultar la documentación de `PostgreSQL `__ y la documentación de `PostGIS `__." +msgid "Linux" +msgstr "Linux" -msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." -msgstr "Los datos procedentes de OSM y utilizando ``osm2pgrouting `__ como herramienta de importación, vienen con la topología de ruteo. Ver un ejemplo de uso de ``osm2pgrouting`` en el `workshop `__." +msgid "The following instructions start from ``path/to/pgrouting``" +msgstr "Las siguientes instrucciones parten de ``path/to/pgrouting``" -msgid "Adjust costs" -msgstr "Ajustar los costes" +msgid "Testing" +msgstr "Pruebas" -msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." -msgstr "Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el doble de la longitud de la geometría." +msgid "Currently there is no :code:`make test` and testing is done as follows" +msgstr "Actualmente no hay :code:`make test` y las pruebas se realizan de la siguiente manera" -msgid "Update costs to length of geometry" -msgstr "Actualizar los costes a la longitud de la geometría" +msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." +msgstr "pgRouting es una extensión de la base de datos geoespacial `PostGIS `__ y `PostgreSQL `__ y agrega ruteo y otras funciones de análisis de redes. Un predecesor de pgRouting – pgDijkstra, escrito por Sylvain Pasche de `Camptocamp `__, fue más tarde extendido por Orkney y renombrado a pgRouting. El proyecto ahora es apoyado y mantenido por Georepublic `__, `Paragon Corporation `__ y una amplia comunidad de usuarios." -msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" -msgstr "Suponer que las columnas ``cost`` y ``reverse_cost`` de los datos de la muestra representan:" +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgstr "pgRouting es parte de la `Comunidad de Proyectos de OSGeo ` __ de la `Fundación OSGeo ` __ y se incluye en`OSGeoLive `__." -msgid ":math:`1` when the edge exists in the graph" -msgstr ":math:`1` cuando la arista existe en el grafo" +msgid "Licensing" +msgstr "Licencias" -msgid ":math:`-1` when the edge does not exist in the graph" -msgstr ":math:`-1` cuando la arista no existe en el grafo" +msgid "The following licenses can be found in pgRouting:" +msgstr "Las siguientes licencias pueden ser encontradas en pgRouting:" -msgid "Using that information updating to the length of the geometries:" -msgstr "Utilizando esa información de actualización a la longitud de las geometrías:" +msgid "**License**" +msgstr "**Licencia**" -msgid "Which gives the following results:" -msgstr "Lo que da los siguientes resultados:" +msgid "GNU General Public License v2.0 or later" +msgstr "Licencia Pública General GNU v2.0 o posterior" -msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." -msgstr "Tener en cuenta que para poder seguir los ejemplos de la documentación, todo se basa en el grafo original." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgstr "La mayoría de las características de pgRouting están disponibles en `Licencia Pública General v2.0 o posterior `_." -msgid "Returning to the original data:" -msgstr "Volviendo a los datos originales:" +msgid "Boost Software License - Version 1.0" +msgstr "Licencia de Software Boost - Version 1.0" -msgid "Update costs based on codes" -msgstr "Actualizar los costes en función de los códigos" +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgstr "Algunas extensiones de Boost están disponibles bajo `Boost Software License - Version 1.0 `_." -msgid "Other datasets, can have a column with values like" -msgstr "Otros conjuntos de datos, pueden tener una columna con valores como" +msgid "MIT-X License" +msgstr "Licencia MIT-X" -msgid "``FT`` vehicle flow on the direction of the geometry" -msgstr "``FT`` flujo de vehículos en la dirección de la geometría" +msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgstr "Parte del código es contribución de iMaptools.com y está disponibe bajo la licencia MIT-X." -msgid "``TF`` vehicle flow opposite of the direction of the geometry" -msgstr "``TF`` flujo del vehículo opuesto a la dirección de la geometría" +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgstr "El Manual de pgRouting está disponible bajo una licencia `Creative Commons Attribution-Share Alike 3.0 License `_." -msgid "``B`` vehicle flow on both directions" -msgstr "``B`` flujo de vehículos en ambas direcciones" +msgid "In general license information should be included in the header of each source file." +msgstr "En general, la información de las licencias debe estar incluida en la cabecera de cada archivo de origen." -msgid "Preparing a code column for the example:" -msgstr "Preparar una columna de códigos para el ejemplo:" +msgid "Contributors" +msgstr "Colaboradores" -msgid "Adjusting the costs based on the codes:" -msgstr "Ajuste de los costes en función de los códigos:" +msgid "This Release Contributors" +msgstr "Colaboradores de esta Versión" -msgid "Check the Routing Topology" -msgstr "Compruebe la Topología de Ruteo" +#, fuzzy +msgid "Individuals in this release |release| (in alphabetical order)" +msgstr "Personas en esta versión v4.0.0 (por orden alfabético)" -msgid "There are lots of possible problems in a graph." -msgstr "Hay muchos problemas posibles en un grafo." +#, fuzzy +msgid "Mohit Rawat, Regina Obe, Vicky Vergara" +msgstr "Regina Obe, Vicky Vergara" -msgid "The data used may not have been designed with routing in mind." -msgstr "Es posible que los datos utilizados no se hayan diseñado teniendo en cuenta el ruteo." +msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgstr "Y a toda la gente que nos regala un poco de su tiempo haciendo comentarios, encontrando problemas, haciendo pull requests etc. en cualquiera de nuestros productos: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgid "A graph has some very specific requirements." -msgstr "Un grafo tiene unos requisitos muy específicos." +msgid "Translators (in alphabetical order)" +msgstr "Traductores (en orden alfabético)" -msgid "The graph is disconnected." -msgstr "El grafo está desconectado." +msgid "Chinese:" +msgstr "" -msgid "There are unwanted intersections." -msgstr "Hay intersecciones no deseadas." - -msgid "The graph is too large and needs to be contracted." -msgstr "El grafo es demasiado grande y hay que contraerlo." +msgid "Dapeng Wang" +msgstr "" -msgid "A sub graph is needed for the application." -msgstr "Se necesita un subgrafo para la aplicación." +msgid "Spanish:" +msgstr "" -msgid "and many other problems that the pgRouting user, that is the application developer might encounter." -msgstr "y muchos otros problemas que el usuario de pgRouting, es decir, el desarrollador de aplicaciones, puede encontrar." +msgid "Vicky Vergara" +msgstr "Vicky Vergara" -msgid "Crossing edges" -msgstr "Aristas que se cruzan" +msgid "Swedish:" +msgstr "" -msgid "To get the crossing edges:" -msgstr "Para obtener las aristas que se cruzan:" +msgid "Daniel Nylander" +msgstr "" -msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." -msgstr "Esa información es correcta, por ejemplo, cuando en términos de vehículos, es un túnel o puente cruczando sobre otra carretera." +msgid "Corporate Sponsors in this release (in alphabetical order)" +msgstr "Patrocinadores corporativos de este lanzamiento (en orden alfabético)" -msgid "It might be incorrect, for example:" -msgstr "Puede ser incorrecto, por ejemplo:" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "Estas son las entidades corporativas que han contribuido con tiempo de desarrollo, alojamiento, o financiamiento monetario directo al proyecto de pgRouting:" -msgid "When it is actually an intersection of roads, where vehicles can make turns." -msgstr "Cuando en realidad es una intersección de carreteras, donde los vehículos pueden hacer giros." +msgid "`OSGeo `__" +msgstr "`OSGeo `__" -msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." -msgstr "En cuanto a las líneas eléctricas, son capaces de cambiar de carretera incluso en un túnel o puente." +msgid "`OSGeo UK `__" +msgstr "`OSGeo UK `__" -msgid "When it is incorrect, it needs fixing:" -msgstr "Cuando es incorrecta, hay que arreglarla:" +msgid "`Google Summer of Code `__" +msgstr "`Google Summer of Code `__" -msgid "For vehicles and pedestrians" -msgstr "Para vehículos y peatones" +msgid "`HighGo Software `__" +msgstr "`HighGo Software `__" -msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." -msgstr "Si los datos provienen de OSM y fueron importados a la base de datos utilizando ``osm2pgrouting``, la corrección debe hacerse en el `OSM portal `__ y los datos ser importados de nuevo." +msgid "`Paragon Corporation `__" +msgstr "`Paragon Corporation `__" -msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" -msgstr "En general, cuando los datos proceden de un proveedor que tiene los datos preparados para el ruteo de vehículos, y hay un problema, los datos deben ser fijados por el proveedor" +msgid "Contributors Past & Present:" +msgstr "Colaboradores, Pasado y Presente:" -msgid "For very specific applications" -msgstr "Para aplicaciones muy específicas" +msgid "Individuals (in alphabetical order)" +msgstr "Personas (en orden alfabético)" -msgid "The data is correct when from the point of view of routing vehicles or pedestrians." -msgstr "Los datos son correctos desde el punto de vista de la circulación de vehículos o peatones." +#, fuzzy +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgid "The data needs a local fix for the specific application." -msgstr "Los datos necesitan un arreglo local para la aplicación específica." +msgid "Corporate Sponsors (in alphabetical order)" +msgstr "Patrocinadores corporativos (en orden alfabético)" -msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." -msgstr "Una vez analizados uno a uno los cruces, para los que necesitan un arreglo local, hay que `dividir las aristas `__." +msgid "Camptocamp" +msgstr "Camptocamp" -msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." -msgstr "Hay que añadir las nuevas aristas a la tabla de aristas, actualizar el resto de atributos en las nuevas aristas, eliminar las aristas antiguas y actualizar la topología de encaminamiento." +msgid "CSIS (University of Tokyo)" +msgstr "CSIS (University of Tokyo)" -msgid "Fixing an intersection" -msgstr "Encontrando una intersección" +msgid "Georepublic" +msgstr "Georepublic" -msgid "In this example the original edge table will be used to store the additional geometries." -msgstr "" +msgid "Google Summer of Code" +msgstr "Google Summer of Code" -msgid "An example use without results" +msgid "HighGo Software" msgstr "" -msgid "Routing from :math:`1` to :math:`18` gives no solution." -msgstr "La ruta de :math:`1` a :math:`18` no da ninguna solución." +msgid "iMaptools" +msgstr "iMaptools" -msgid "Analyze the network for intersections." -msgstr "" +msgid "Leopark" +msgstr "Leopark" -msgid "The analysis tell us that the network has an intersection." -msgstr "El análisis nos dice que la red tiene una intersección." +msgid "Orkney" +msgstr "Orkney" -msgid "Prepare tables" -msgstr "Preparar tablas" +msgid "OSGeo" +msgstr "OSGeo" -msgid "Additional columns to control the origin of the segments." -msgstr "" +msgid "OSGeo UK" +msgstr "OSGeo UK" -msgid "Adding new segments." -msgstr "Añadiendo nuevos segmentos." +msgid "Paragon Corporation" +msgstr "Paragon Corporation" -msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." -msgstr "" +msgid "Versaterm Inc." +msgstr "Versaterm Inc." -msgid "Update other values" -msgstr "Actualizar otros valores" +msgid "More Information" +msgstr "Más Información" -msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." -msgstr "En este ejemplo sólo se actualizan ``cost`` y ``reverse_cost``, donde se basan en la longitud de la geometría y se mantiene la direccionalidad mediante la función ``sign``." +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "Lo último en software, documentación y noticias, se encuentra disponible en el sitio web de pgRouting https://pgrouting.org." -msgid "Update the topology" -msgstr "Actualizar la topología" +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgstr "Servidor de base de datos PostgreSQL en el sitio principal de PostgreSQL https://www.postgresql.org." -msgid "Insert the new vertices if any." -msgstr "Insertar nuevos vértices si existen." +msgid "PostGIS extension at the PostGIS project web site https://postgis.net." +msgstr "PostGIS extension en el sitio web del projecto PostGIS https://postgis.net." -msgid "Update source and target information on the edges table." -msgstr "Actualizar la salida y el destino en la tabla de aristas." +msgid "Boost C++ source libraries at https://www.boost.org." +msgstr "Bibliotecas de código Boost C++ en https://www.boost.org." -msgid "The example has results" -msgstr "" +msgid ":doc:`migration`" +msgstr ":doc:`migration`" -msgid "Routing from :math:`1` to :math:`18` gives a solution." -msgstr "La ruta de :math:`1` a :math:`18` da una solución." +msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_KSP`` — Devuelve las K rutas más cortas usando Dijkstra ." -msgid "Touching edges" -msgstr "Bordes que se tocan" +msgid "Availability" +msgstr "Disponibilidad" -msgid "Visually the edges seem to be connected, but internally they are not." -msgstr "" +msgid "Version 4.0.0" +msgstr "Versión 4.0.0" -msgid "The validity of the information is application dependent." -msgstr "" +msgid "All signatures promoted to official." +msgstr "Todas las firmas promovidas a oficial." -msgid "Maybe there is a small barrier for vehicles but not for pedestrians." -msgstr "" +msgid "Version 3.6.0" +msgstr "Versión 3.6.0" -msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." -msgstr "Una vez analizados uno a uno los toques, para los que necesiten un arreglo local, hay que separar las aristas con `split `__." +msgid "Standardizing output columns to |nksp-result|" +msgstr "Estandarización de columnas de resultados a |nksp-result|" -msgid "Fixing a gap" -msgstr "" +msgid "pgr_ksp(One to One)" +msgstr "pgr_ksp(Uno a Uno)" -msgid "Routing from :math:`1` to :math:`2` gives no solution." -msgstr "La ruta de :math:`1` a :math:`2` no da ninguna solución." +msgid "Added ``start_vid`` and ``end_vid`` result columns." +msgstr "Añadidas las columnas de resultados ``start_vid`` y ``end_vid``." -msgid "Analyze the network for gaps." -msgstr "Analizar la red por espacios." +msgid "New proposed signatures:" +msgstr "Nuevas firmas propuestas:" -msgid "The analysis tell us that the network has a gap." -msgstr "El análisis nos dice que la red tiene una brecha." +msgid "pgr_ksp(One to Many)" +msgstr "pgr_ksp(Uno a muchos)" -msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." -msgstr "" +msgid "pgr_ksp(Many to One)" +msgstr "pgr_ksp(Muchos a uno)" -msgid "Routing from :math:`1` to :math:`2` gives a solution." -msgstr "La ruta de :math:`1` a :math:`2` da una solución." +msgid "pgr_ksp(Many to Many)" +msgstr "pgr_ksp(Muchos a muchos)" -msgid "Connecting components" -msgstr "Conectando componentes" +msgid "pgr_ksp(Combinations)" +msgstr "pgr_ksp(Combinaciones)" -msgid "To get the graph connectivity:" -msgstr "Para obtener la conectividad del grafo:" +msgid "Version 2.1.0" +msgstr "Versión 2.1.0" -msgid "There are three basic ways to connect components:" -msgstr "Existen tres formas básicas de conectar los componentes:" +msgid "Signature change" +msgstr "Cambio de firma" -msgid "From the vertex to the starting point of the edge" -msgstr "Del vértice al punto inicial de la arista" +msgid "Old signature no longer supported" +msgstr "Firma antigua ya no soportada" -msgid "From the vertex to the ending point of the edge" -msgstr "Desde el vértice hasta el punto final de la arista" +msgid "Version 2.0.0" +msgstr "Versión 2.0.0" -msgid "From the vertex to the closest vertex on the edge" -msgstr "Del vértice al vértice más cercano de la arista" +msgid "Official function." +msgstr "Función oficial." -msgid "This solution requires the edge to be split." -msgstr "Esta solución requiere dividir el borde." +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgstr "El algoritmo de ruteo para obtener la ruta más corta K basado en el algoritmo de Yen . \"K\" es el número de rutas más cortas deseadas." -msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." -msgstr "" +msgid "|Boost| Boost Graph Inside" +msgstr "|Boost| Adentro: Boost Graph" -msgid "Get the connectivity" -msgstr "Obtener la conectividad" +msgid "Boost Graph inside" +msgstr "Adentro: Boost Graph" -msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." -msgstr "" +msgid "Signatures" +msgstr "Firmas" -msgid "Insert new edges" -msgstr "Insertar nuevas aristas" +msgid "Summary" +msgstr "Resumen" -msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." -msgstr "" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" -msgid "Create the vertices table" -msgstr "Crear la tabla de vértices" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" -msgid "Using :doc:`pgr_extractVertices` create the table." -msgstr "Usar :doc:`pgr_extractVertices` para crear la tabla." +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" -msgid "Contraction of a graph" -msgstr "Contracción de un grafo" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])" -msgid "The graph can be reduced in size using :doc:`contraction-family`" -msgstr "El grafo puede reducirse de tamaño utilizando :doc:`contraction-family`" +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, `SQL de combinaciones`_, **K**, [**opciones**])" -msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." -msgstr "El cuando contraer dependerá del tamaño del gráfico, de los tiempos de procesamiento, de la corrección de los datos, de la aplicación final o de cualquier otro factor no mencionado." +msgid "**options:** ``[directed, heap_paths]``" +msgstr "**opcionales:** ``[directed, heap_paths]``" -msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." -msgstr "Un método bastante bueno para saber si la contracción puede ser útil es por el número de callejones sin salida y/o el número de aristas lineales." +msgid "Returns set of |nksp-result|" +msgstr "Regresa conjunto de |nksp-result|" -msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" -msgstr "En :doc:`contraction-family` se describe un método completo sobre cómo contraer y cómo utilizar el grafo contraído" +msgid "OR EMPTY SET" +msgstr "O CONJUNTO VACÍO" -msgid "To get the dead ends:" -msgstr "Para obtener los callejones sin salida:" +msgid "Example" +msgstr "Ejemplo" -msgid "A dead end happens when" -msgstr "Un callejón sin salida se produce cuando" +msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." +msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo dirigido." -msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." -msgstr "El vértice es el límite de un callejón sin salida, una vía de no paso o una vía de no salida." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Obtener 2 rutas del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido." -msgid "The vertex is on the limit of the imported graph." -msgstr "El vértice esta en el limite del grafo importado." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo dirigido." -msgid "If a larger graph is imported then the vertex might not be a dead end" -msgstr "Si se importa un grafo más grande, puede que el vértice no sea un callejón sin salida" +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Obtener 2 rutas los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido." -msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." -msgstr "El nodo :math:`4`, es un callejón sin salida en la consulta, aunque visualmente parezca un punto final de 3 aristas." +msgid "Using a combinations table on an directed graph" +msgstr "Usando una tabla de combinaciones en un grafo dirigido" -msgid "Is node :math:`4` a dead end or not?" -msgstr "¿Es el nodo :math:`4` un callejón sin salida o no?" +msgid "The combinations table:" +msgstr "La tabla de combinaciones:" -msgid "The answer to that question will depend on the application." -msgstr "La respuesta a esta pregunta dependerá de la aplicación." +msgid "The query:" +msgstr "La consulta:" -msgid "Is there such a small curb:" -msgstr "Hay un bordillo tan pequeño:" +msgid "Identifier of the destination vertex." +msgstr "Identificador del vértice destino." -msgid "That does not allow a vehicle to use that visual intersection?" -msgstr "¿Eso no permite a un vehículo utilizar esa intersección visual?" +msgid "**K**" +msgstr "**K**" -msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" -msgstr "¿Es la aplicación para peatones y por lo tanto el peatón puede caminar fácilmente en una acera pequeña?" +msgid "Number of required paths." +msgstr "Cantidad de rutas requeridas." -msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" -msgstr "¿Es la aplicación para la electricidad y las líneas eléctricas que se puede extender fácilmente en la parte superior de la acera pequeña?" +msgid "KSP Optional parameters" +msgstr "Parámetros opcionales de KSP" -msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" -msgstr "¿Hay un gran acantilado y desde la vista de las águilas parece que el callejón sin salida está cerca del segmento?" +msgid "``heap_paths``" +msgstr "``heap_paths``" -msgid "Depending on the answer, modification of the data might be needed." -msgstr "Dependiendo de la respuesta, será necesario la modificación de datos." +msgid "When ``false`` Returns at most K paths." +msgstr "Cuando ``false`` Regresa a lo más K caminos." -msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." -msgstr "Cuando hay muchos callejones sin salida, para acelerar el procesamiento, se pueden utilizar las funciones de :doc:`contraction-family` para contraer el grafo." +msgid "When ``true`` all the calculated paths while processing are returned." +msgstr "Cuando ``true`` se regresan todos los caminos calulados mientras se procesa." -msgid "Linear edges" -msgstr "Bordes lineales" +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgstr "Aproximadamente, si la ruta más corta tiene ``N`` aristas, las procesadas contendrán aproximadamente ``N * K`` rutas para valores pequeños de ``K`` y ``K > 5``." -msgid "To get the linear edges:" -msgstr "Para obtener las aristas lineales:" +msgid "Additional Examples" +msgstr "Ejemplos Adicionales" -msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." -msgstr "Estos vértices lineales son correctos, por ejemplo, cuando esos vértices son badenes, señales de alto y la aplicación los tiene en cuenta." +msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" +msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo no dirigido" -msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." -msgstr "Cuando hay muchas aristas lineales, que no necesitan tomarse en cuenta, para acelerar el procesamiento se pueden utilizar las funciones :doc:`contraction-family` para contraer el grafo." +msgid "Also get the paths in the heap." +msgstr "También obtener los caminos procesados." -msgid "Function's structure" -msgstr "Estructura de la función" +msgid "Get 2 paths using combinations table on an undirected graph" +msgstr "Obtener dos rutas usando una tabla de combinaciones en un grafo no dirigido" -msgid "Once the graph preparation work has been done above, it is time to use a" -msgstr "Una vez realizado el trabajo de preparación del grafo anterior, es el momento de utilizar un" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo no dirigido." -msgid "The general form of a pgRouting function call is:" -msgstr "La forma general de una llamada a una función de pgRouting es:" +msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgid "\\ \\" -msgstr "\\ \\" +msgid "``pgr_TSP``" +msgstr "``pgr_TSP``" -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgstr "pgr_(`Consultas internas`_, **parámetros**, [ ``Parámetros opcionales``)" +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSP`` - Aproximación usando el algoritmo *métrico*." -msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." -msgstr "`Consultas internas`_: Son parámetros obligatorios que son ``TEXT`` que contienen consultas SQL." +msgid "Availability:" +msgstr "Disponibilidad:" -msgid "**parameters**: Additional compulsory parameters needed by the function." -msgstr "**Parámetros**: Parámetros obligatorios adicionales que necesita la función." +msgid "Results change depending on input order" +msgstr "Los resultados cambian dependiendo el orden de entrada" -msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." -msgstr "``Parámetros opcionales``: Son parámetros **nombrados** no obligatorios que tienen un valor por defecto cuando se omiten." +msgid "Only for undirected graphs" +msgstr "Solo para grafos no dirigidos" -msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." -msgstr "Los parámetros obligatorios son parámetros de posición, los parámetros opcionales son parámetros nombrados." +msgid "Breaking change, signatures no longer available:" +msgstr "" -msgid "For example, for this :doc:`pgr_dijkstra` signature:" -msgstr "Por ejemplo, para esta firma :doc:`pgr_dijkstra`:" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "Version 3.2.1" +msgstr "Versión 3.2.1" -msgid "`Edges SQL`_:" -msgstr "`SQL de aristas`_:" +msgid "Metric Algorithm from `Boost library `__" +msgstr "Algoritmo Metrico de la `Librería Boost `__" -msgid "Is the first parameter." -msgstr "Es el primer parámetro." +msgid "Simulated Annealing Algorithm no longer supported" +msgstr "El algoritmo de recocido simulado ya no es utilizado" -msgid "It is compulsory." -msgstr "Es obligatorio." +msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgstr "Se ignoran los parámetros relacionados con el algoritmo de recocido simulado: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgid "It is an inner query." -msgstr "Es una consulta interna." +msgid "Version 2.3.0" +msgstr "Versión 2.3.0" -msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" -msgstr "No tiene nombre, por lo que **SQL de aristas** da una idea del tipo de consulta interna que hay que utilizar" +msgid "Results change depending on input order of the `Matrix SQL`_" +msgstr "" -msgid "**start vid**:" -msgstr "**vid inical**:" +msgid "Negative costs are ignored." +msgstr "Costos negativos son ignorados." -msgid "Is the second parameter." -msgstr "Es el segundo parámetro." +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgstr "Se puede utilizar con funciones :doc:`costMatrix-category` preferiblemente con `directed => false`." -msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." -msgstr "No tiene nombre, por lo que **salida** da una idea de lo que debe contener el valor del segundo parámetro." +msgid "With ``directed => false``" +msgstr "Con ``directed => false``" -msgid "Is the third parameter." -msgstr "Es el tercer parámetro." +msgid "Will generate a graph that:" +msgstr "Generará un grafo que:" -msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" -msgstr "No tiene nombre, por lo que **destino** da una idea de lo que debe contener el valor del tercer parámetro" +msgid "is undirected" +msgstr "es no dirigido" -msgid "Is the fourth parameter." -msgstr "Es el cuarto parámetro." +msgid "is fully connected (As long as the graph has one component)" +msgstr "está completamente conectado (siempre que el grafo tenga un componente)" -msgid "It is optional." -msgstr "Es opcional." +msgid "all traveling costs on edges obey the triangle inequality." +msgstr "todos los costos de viaje en los segmentos vumplen con la desigualdad del triángulo." -msgid "It has a name." -msgstr "Tiene un nombre." +msgid "When ``start_vid = 0 OR end_vid = 0``" +msgstr "Cuando ``start_vid = 0 Ó end_vid = 0``" -msgid "The full description of the parameters are found on the `Parameters`_ section of each function." -msgstr "La descripción completa de los parámetros se encuentra en la sección `Parámetros`_ de cada función." +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +msgstr "Se garantiza que las soluciones generadas sean *en el peor de los casos el doble de largas que el recorrido óptimo*" -msgid "Function's overloads" -msgstr "Sobrecargas de funciones" +msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgstr "Cuando ``start_vid != 0 Y end_vid != 0 Y start_vid != end_vid``" -msgid "A function might have different overloads. The most common are called:" -msgstr "Una función puede tener diferentes sobrecargas. Las más comunes se llaman:" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgstr "No está **garantizado** que la solución sea, en el peor de los casos, el doble de larga que el recorrido óptimo, debido a que `end_vid` está forzado a estar en una posición fija." -msgid "`One to One`_" -msgstr "`Uno a Uno`_" +msgid "With ``directed => true``" +msgstr "Con ``directed => true``" -msgid "`One to Many`_" -msgstr "`Uno a Muchos`_" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +msgstr "No está **garantizado** que la solución sea, en el peor de los casos, dos veces más larga que el recorrido óptimo" -msgid "`Many to One`_" -msgstr "`Muchos a Uno`_" +msgid "is directed" +msgstr "es dirigido" -msgid "`Many to Many`_" -msgstr "`Muchos a Muchos`_" +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgstr "algunos (o todos) los costos de viaje en los segmentos podrían no obedecer a la desigualdad del triángulo." -msgid "`Combinations`_" -msgstr "`Combinaciones`_" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" +msgstr "Como se requiere un grafo no dirigido, el grafo dirigido se transforma de la siguiente manera:" -msgid "Depending on the overload the parameters types change." -msgstr "Dependiendo de la sobrecarga, los tipos de los parámetros cambian." +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgstr "los segmentos `(u, v)` y `(v, u)` se consideran el mismo segmentos (denotado `(u, v)`" -msgid "**One**: **ANY-INTEGER**" -msgstr "**Uno**: **CUALQUIER-ENTERO**" +msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" +msgstr "Si '``agg_cost`` difiere entre una o más instancias del segmento `(u, v)`" -msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" -msgstr "**Muchos**: ``ARRAY`` [**CUALQUIER-ENTERO**]" +msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" +msgstr "El valor mínimo de ``agg_cost`` en todas las instancias de la arista `(u, v)` se considera como el ``agg_cost`` de la arista `(u, v)`" -msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." -msgstr "Dependiendo de la función, las sobrecargas pueden variar. Pero el concepto de cambio de tipo de parámetro sigue siendo el mismo." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgstr "Algunos (o todos) los costos de viaje en los segmentos aún podrían no obedecer a la desigualdad del triángulo." -msgid "When routing from:" -msgstr "Cuando se rutea desde:" +msgid "When the data does not come from an undirected graph or its not fully connected:" +msgstr "" -msgid "From **one** starting vertex" -msgstr "Desde **un** vértice inicial" +msgid "Missing values will be calculated with dijkstra algorithm." +msgstr "Los valores perdidos se calcularán con el algoritmo de Dijkstra." -msgid "to **one** ending vertex" -msgstr "al **un** vértice final" +msgid "When the graph has more than one component:" +msgstr "Cuando el grafo tiene más de un componente:" -msgid "to **many** ending vertices" -msgstr "a los vértices finales **many**" +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgstr "" -msgid "From **many** starting vertices" -msgstr "Desde **muchos** vértices iniciales" +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." +msgstr "" -msgid "From **many** different starting vertices" -msgstr "A partir de **muchos** diferentes vértices de inicio" +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +msgstr "" -msgid "to **many** different ending vertices" -msgstr "a **muchos** diferentes vértices finales" +msgid "One cycle attempt to remove crossing edges is done to the TSP results." +msgstr "" -msgid "Every tuple specifies a pair of a start vertex and an end vertex" -msgstr "Cada tupla especifica un par de vértices iniciales y un vértice final" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSP(`SQL de martiz`_, ``[start_id, end_id]``)" -msgid "Users can define the combinations as desired." -msgstr "Los usuarios pueden definir las combinaciones como deseen." +msgid "Returns set of |tsp-result|" +msgstr "Regresa el conjunto de |nksp-result|" -msgid "Needs a `Combinations SQL`_" -msgstr "Necesita una `SQL de combinaciones`_" +msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgstr "Usando :doc:`pgr_dijkstraCostMatrix` para generar la información de la matriz" -msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." -msgstr "Existen varios tipos de consultas internas válidas y también las columnas devueltas dependen de la función. El tipo de consulta interna dependerá de los requisitos de la función. Para simplificar la variedad de tipos, se utiliza **ANY-INTEGER** y **ANY-NUMERICAL**." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgstr "**Línea 5** Los vértices :math:`\\{2, 4, 13, 14\\}` no están incluidos porque no están conectados." -msgid "Edges SQL for" -msgstr "SQL de aristas para" +msgid "`Matrix SQL`_ as described below" +msgstr "`SQL de matriz`_ como se describe más adelante" -msgid "Some uncategorised functions" -msgstr "Algunas funciones no categorizadas" +msgid "``ANY-INTEGER``" +msgstr "``ANY-INTEGER``" -msgid "General without ``id``" -msgstr "General sin ``id``" +msgid "``ANY-NUMERICAL``" +msgstr "``ANY-NUMERICAL``" -msgid "General with (X,Y)" -msgstr "General con (X,Y)" +msgid "Cost for going from start_vid to end_vid" +msgstr "Costo para pasar de start_vid a end_vid" -msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." -msgstr "Cuando es negativo: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo." +msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" +msgstr "Devuelve el CONJUNTO DE ``(seq, node, cost, agg_cost)``" -msgid "Weight of the edge (``target``, ``source``)," -msgstr "Peso de la arista (``target``, ``source``)," +msgid "Row sequence." +msgstr "Secuencia de filas." -msgid "``x1``" -msgstr "``x1``" +msgid "**node**" +msgstr "**node**" -msgid "X coordinate of ``source`` vertex." -msgstr "Coordenada X del vértice ``source``." +msgid "Identifier of the node/coordinate/point." +msgstr "Identificador del nodo/coordenada/punto." -msgid "``y1``" -msgstr "``y1``" +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgstr "Coste que se debe recorrer desde el ``nodo`` al siguiente ``nodo`` en la secuencia de ruta." -msgid "Y coordinate of ``source`` vertex." -msgstr "Coordenada Y del vértice ``source``." +msgid "``0`` for the last row in the tour sequence." +msgstr "``0`` para la última fila en la secuencia del recorrido." -msgid "``x2``" -msgstr "``x2``" +msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." +msgstr "Costo agregado del ``nodo`` en ``seq = 1`` hacia el nodo actual." -msgid "X coordinate of ``target`` vertex." -msgstr "Coordenada X del vértice ``target``." +msgid "``0`` for the first row in the tour sequence." +msgstr "``0`` para la primera fila en la secuencia del recorrido." -msgid "``y2``" -msgstr "``y2``" +msgid "Start from vertex :math:`1`" +msgstr "Inicio en el vértice :math:`1`" -msgid "Y coordinate of ``target`` vertex." -msgstr "Coordenada Y del vértice ``target``." +msgid "**Line 6** ``start_vid => 1``" +msgstr "**Linea 6** ``start_vid => 1``" -msgid "Flow" -msgstr "Flujo" +msgid "Using points of interest to generate an asymmetric matrix." +msgstr "Usar los puntos de interés para generar una matriz asimétrica." -msgid "Edges SQL for :doc:`flow-family`" -msgstr "SQL de aristas para :doc:`flow-family`" +msgid "To generate an asymmetric matrix:" +msgstr "Para generar una matriz asimétrica:" -msgid "Edges SQL for the following functions of :doc:`flow-family`" -msgstr "SQL de aristas para las siguientes funciones de :doc:`flow-family`" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgstr "**Línea 4** La información ``side`` de ``pointsOfInterset`` se ignora al no incluirla en la consulta" -msgid "Used in combination signatures" -msgstr "Utilizado en combinación firmas" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" +msgstr "**Línea 6** Generación de una matriz asimétrica con ``directed => true``" -msgid "Points SQL for" -msgstr "SQL de puntos para" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` se considera como el ``agg_cost``" -msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." -msgstr "El parámetro principal de la mayoría de las funciones pgRouting es una consulta que selecciona las aristas del grafo." +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgstr "La solución que puede ser mayor que *el doble de larga que el tour óptimo* porque:" -msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." -msgstr "Dependiendo de la familia o categoría de una función tendrá parámetros adicionales, algunos de ellos son obligatorios y otros opcionales." +msgid "Triangle inequality might not be satisfied." +msgstr "La desigualdad del triángulo podría no estar satisfecha." -msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." -msgstr "Los parámetros obligatorios no tienen nombre y deben indicarse en el orden requerido. Los parámetros opcionales son parámetros con nombre y tendrán un valor por defecto." +msgid "``start_id != 0 AND end_id != 0``" +msgstr "``start_id != 0 Y end_id != 0``" -msgid "Parameters for the Via functions" -msgstr "Párametros para las funciones Via" +msgid "Connected incomplete data" +msgstr "Datos incompletos conectados" -msgid "SQL query as described." -msgstr "Consulta SQL como se describe." +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgstr "Usando aristas seleccionadas :math:`\\{2, 4, 5, 8, 9, 15\\}` la matriz no es completa." -msgid "When ``true`` Graph is considered `Directed`" -msgstr "Cuando ``true`` el gráfo se considera `Dirigido`" +msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." +msgstr "Valor del cost para :math:`17 \\rightarrow 10` no existe en la matriz, pero el valor se toma de :math:`10 \\rightarrow 17`." -msgid "When ``false`` the graph is considered as Undirected." -msgstr "Cuando ``false`` el gráfico se considera como No Dirigido." +msgid "``pgr_TSPeuclidean``" +msgstr "``pgr_TSPeuclidean``" -msgid "``strict``" -msgstr "``strict``" +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSPeuclidean`` - Aproximación usando el algoritmo *métrico*." -msgid "``false``" -msgstr "``false``" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" -msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" -msgstr "Cuando ``true`` si un camino le faltan paradas y regresa **EMPTY SET**" +msgid "Using `Boost: metric TSP approx `__" +msgstr "Usando `Boost: Algoritmo de aproximación Métrica de TSP `__" -msgid "When ``false`` ignores missing paths returning all paths found" -msgstr "Cuando ``false``, ignora las rutas faltantes y devuelve todas las rutas encontradas" +msgid "Version 3.0.0" +msgstr "Versión 3.0.0" -msgid "``U_turn_on_edge``" -msgstr "``U_turn_on_edge``" +msgid "Name change from pgr_eucledianTSP" +msgstr "Cambio de nombre de pgr_eucledianTSP" -msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." -msgstr "Cuando ``true`` saliendo de un vértice visitado no intentará evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se permite la vuelta en U usando la arista con el mismo identificador." +msgid "New official function." +msgstr "Nueva función oficial." -msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." -msgstr "Cuando ``false`` al salir de un vértice visitado intenta evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se utiliza la vuelta en U utilizando la arista con el mismo identificador cuando no se encuentra ninguna otra ruta." +msgid "Results change depending on input order of the `Coordinates SQL`_" +msgstr "" -msgid "For the TRSP functions" -msgstr "Para las funciones de TRSP" +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgstr "Cualquier identificador duplicado será ignorado. Las coordenadas que se mantendrán son arbitrarias." -msgid "Array of identifiers of destination vertices." -msgstr "Arreglo de identificadores de vértices destino." +msgid "The coordinates are quite similar for the same identifier, for example ::" +msgstr "Las coordenadas son bastante similares para el mismo identificador, por ejemplo:" -msgid "There are several kinds of columns returned are depending of the function." -msgstr "Hay varios tipos de columnas devueltas que dependen de la función." +msgid "The coordinates are quite different for the same identifier, for example ::" +msgstr "Las coordenadas son bastante diferentes para el mismo identificador, por ejemplo:" -msgid "Result columns for single path functions" -msgstr "Columnas de resultados para funciones de ruta única" +msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSPeuclidean(`SQL de Coordenadas`_, ``[start_id, end_id]``)" -msgid "Used in functions that return one path solution per departure and destination." -msgstr "Se utiliza en funciones que devuelven solo una solución de ruta por salida y destino." +msgid "With default values" +msgstr "Con valores predeterminados" -msgid ":doc:`pgr_dijkstraNear`" -msgstr ":doc:`pgr_dijkstraNear`" +msgid "`Coordinates SQL`_" +msgstr "`SQL coordenadas`_" -msgid "Returns |short-generic-result|" -msgstr "Devuelve |short-generic-result|" +msgid "`Coordinates SQL`_ as described below" +msgstr "`SQL de coordenadas`_ descritas más adelante" -msgid "``path_seq``" -msgstr "``path_seq``" +msgid "Coordinates SQL" +msgstr "Coordenadas SQL" -msgid "Relative position in the path. Has value **1** for the beginning of a path." -msgstr "Posición relativa en la ruta. Tiene el valor **1** para el inicio de una ruta." +msgid "``x``" +msgstr "``x``" -msgid "Identifier of the starting vertex of the current path." -msgstr "Identificador del vértice inicial de la ruta actual." +msgid "X value of the coordinate." +msgstr "Valor X de la coordenada." -msgid "Identifier of the ending vertex of the current path." -msgstr "Identificador del vértice final de la ruta actual." +msgid "``y``" +msgstr "``y``" -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." -msgstr "Identificador del nodo en la ruta de ``start_vid`` a ``end_vid``." +msgid "Y value of the coordinate." +msgstr "Valor Y de la coordenada." -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." -msgstr "Identificador de la arista utilizado para ir del ``node`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta." +msgid "Test 29 cities of Western Sahara" +msgstr "Prueba 29 ciudades del Sáhara Occidental" -msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." -msgstr "Costo para atravesar desde ``node`` usando ``edge`` hasta el siguiente nodo en la secuencia de la ruta." +msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgstr "Este ejemplo muestra cómo hacer pruebas de rendimiento utilizando los `datos de ejemplo `__ de la Universidad de Waterloo utilizando el conjunto de datos de 29 ciudades del `Sáhara Occidental `__" -msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." -msgstr "Cuando las columnas ``start_vid`` o ``end_vid`` tienen valores negativos, el identificador corresponde a un Punto." +msgid "Creating a table for the data and storing the data" +msgstr "Creación de una tabla para datos y almacenamiento de los datos" -msgid "Result columns for multiple paths functions" -msgstr "Columnas de resultados para funciones de rutas múltiples" +msgid "Adding a geometry (for visual purposes)" +msgstr "Agregar una geometría (con fines visuales)" -msgid "Used in functions that return many paths solutions per departure and destination." -msgstr "Se utiliza en funciones que devuelven muchas soluciones de rutas por salida y destino." +msgid "Total tour cost" +msgstr "Costo total del tour" -msgid ":doc:`pgr_KSP`" -msgstr ":doc:`pgr_KSP`" +msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" +msgstr "Al obtener un costo total del recorrido, comparar el valor con la duración de un recorrido óptimo, que es 27603, dado en el conjunto de datos" -msgid ":doc:`pgr_withPointsKSP`" -msgstr ":doc:`pgr_withPointsKSP`" +msgid "Getting a geometry of the tour" +msgstr "Obtener una geometría del recorrido" -msgid "Returns set of |generic-result|" -msgstr "Regresa el conjunto de |generic-result|" +msgid "Visual results" +msgstr "Resultados visuales" -msgid "``path_id``" -msgstr "``path_id``" +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgstr "Visualmente, la primera imagen es la `solución óptima `__ y la segunda imagen es la solución obtenida con ``pgr_TSPeuclidean``." -msgid "Path identifier." -msgstr "Identificador del camino." +msgid "``pgr_aStar`` — Shortest path using the A* algorithm." +msgstr "``pgr_aStar`` — La ruta más corta utilizando el algoritmo A*." -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." -msgstr "Tiene valor **1** para el primero de la ruta de ``start_vid`` a ``end_vid``." +msgid "Combinations signature promoted to official." +msgstr "Firmas de combinaciones promovidas a oficial." -msgid "Result columns for cost functions" -msgstr "Columnas de resultados de las funciones de costes" +msgid "Standardizing output columns to |short-generic-result|" +msgstr "Estandarización de las columnas de salida a |short-generic-result|" -msgid "Used by:" -msgstr "Utilizado por:" +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_aStar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." -msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." -msgstr "Cuando las columnas del vértice inicial o del destino continen valores negativos, el identificador es para un Punto." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "pgr_aStar(Uno a Muchos) ha añadido la columna ``end_vid``." -msgid "Result columns for flow functions" -msgstr "Columnas de resultados para funciones de flujo" +msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgstr "pgr_aStar(Muchos a Uno) ha añadido la columna ``start_vid``." -msgid "Result columns for spanning tree functions" -msgstr "Columnas de resultados para funciones de árbol de expansión" +msgid "Version 3.2.0" +msgstr "Versión 3.2.0" -msgid "Used in functions that return a tree solution per departure." -msgstr "Se utiliza en funciones que devuelven una solución de árbol por salida." +msgid "New proposed signature:" +msgstr "Nuevas firmas propuesta:" -msgid "Result columns for simple spanning tree functions" -msgstr "Columnas de resultados para funciones de árbol de expansión simple" +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(Combinaciones)" -msgid "Returns set of ``(edge, cost)``" -msgstr "Regresa el conjunto de ``(edge, cost)``" +msgid "Function promoted to official." +msgstr "Función promovida a oficial." -msgid "Cost to traverse the edge." -msgstr "Coste para atravezar el borde." +msgid "Version 2.4.0" +msgstr "Versión 2.4.0" -msgid "Performance Tips" -msgstr "Consejos de Rendimiento" +msgid "pgr_aStar(One to Many)" +msgstr "pgr_aStar(Uno a Muchos)" -msgid "For the Routing functions" -msgstr "Para las funciones de Ruteo" +msgid "pgr_aStar(Many to One)" +msgstr "pgr_aStar(Muchos a Uno)" -msgid "To get faster results bound the queries to an area of interest of routing." -msgstr "Para obtener resultados más rápidos, delimitar las consultas a un área de interés para el ruteo." +msgid "pgr_aStar(Many to Many)" +msgstr "pgr_aStar(Muchos a Muchos)" -msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." -msgstr "En este ejemplo, usar una consulta SQL interna que no incluya algunas aristas en la función de ruteo y dentro del área de los resultados." +msgid "Signature change on pgr_aStar(One to One)" +msgstr "Cambio de firma en pgr_aStar(Uno a Uno)" -msgid "Given this area:" -msgstr "Dada esta área:" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_aStar( `Uno a Uno`_ ) en:" -msgid "Calculate a route:" -msgstr "Calcular una ruta:" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" -msgid "How to contribute" -msgstr "Cómo contribuir" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" -msgid "Wiki" -msgstr "Wiki" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" -msgid "Edit an existing `pgRouting Wiki `__ page." -msgstr "Edita una página existente `Wiki de pgRouting `_." +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])" -msgid "Or create a new Wiki page" -msgstr "O crea una nueva página Wiki" +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "Create a page on the `pgRouting Wiki `__" -msgstr "Crear una página en el `Wiki de pgRouting `_" +msgid "**options:** ``[directed, heuristic, factor, epsilon]``" +msgstr "**opcionales:** ``[directed, heuristic, factor, epsilon]``" -msgid "Give the title an appropriate name" -msgstr "Asigne al título un nombre apropiado" +msgid "Returns set of |short-generic-result|" +msgstr "Regresa el conjunto de |short-generic-result|" -msgid "`Example `__" -msgstr "`Ejemplo `__" +msgid "Optional parameters are `named parameters` and have a default value." +msgstr "Los parámetros opcionales son `parámetros con nombre` y tienen un valor predeterminado." -msgid "Adding Functionality to pgRouting" -msgstr "Agregando Funcionalidad a pgRouting" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" +msgstr "De vértice :math:`6` a vértice :math:`12` en un grafo **dirigido** usando la heurística :math:`2`" -msgid "Consult the `developer's documentation `__" -msgstr "Consultar la `documentation de desarrolladores `__" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgstr "Desde el vértice :math:`6` a los vértices :math:`\\{12, 10\\}` en un grafo **dirigido** usando la heurística :math:`3` con factor :math:`3.5`" -msgid "Installation" -msgstr "Instalación" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgstr "De los vértices :math:`\\{6, 8\\}` al vértice :math:`10` en un grafo **no dirigido** usando la heurística :math:`4`" -msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" -msgstr "Las instrucciones para descargar e instalar los binarios para diferentes sistemas operativos, notas adicionales y correcciones no incluidas en esta documentación se pueden encontrar en `Installation wiki `__" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgstr "De los vértices :math:`\\{6, 8\\}` a los vértices :math:`\\{10, 12\\}` en un gráfico **dirigido** con factor :math:`0.5`" -msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" -msgstr "Para utilizar pgRouting, PostGIS necesita ser instalado, por favor lea la información sobre la instalación en esta `Guía de Instalación `__" +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgstr "Usando una tabla de combinaciones en un grafo **dirigido** con factor :math:`0.5`." -msgid "Short Version" -msgstr "Versión corta" +msgid "Example 1" +msgstr "Ejemplo 1" -msgid "Extracting the tar ball" -msgstr "Extraer la bola de alquitrán" +msgid "Demonstration of repeated values are ignored, and result is sorted." +msgstr "Demostración de ignorar los valores repertidos, y resultado ordenado." -msgid "To compile assuming you have all the dependencies in your search path:" -msgstr "Para compilar suponiendo que tiene todas las dependencias en su ruta de búsqueda:" +msgid "Example 2" +msgstr "Ejemplo 2" -msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." -msgstr "Una vez que pgRouting está instalado, debe habilitarse en cada base de datos individual en la que desee utilizarlo." +msgid "Making **start vids** the same as **end vids**." +msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." -msgid "Get the sources" -msgstr "Obtener las fuentes" +msgid "Example 3" +msgstr "Ejemplo 3" -msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" -msgstr "La última versión de pgRouting se puede encontrar en https://github.com/pgRouting/pgrouting/releases/latest" +msgid "Manually assigned vertex combinations." +msgstr "Manualmente asignar combinaciones de vértices." -msgid "To download this release:" -msgstr "Para descargar esta versión:" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" -msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." -msgstr "Ir a :ref:`install-short` para más instrucciones sobre la extraccion de la bola tar y la compilación de pgRouting." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr "``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo A*." -msgid "git" -msgstr "git" +msgid "pgr_aStarCost(Combinations)" +msgstr "pgr_aStarCost(Combinaciones)" -msgid "To download the repository" -msgstr "Para descargar el repositorio" +msgid "New proposed function." +msgstr "Nueva función propuesta." -msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." -msgstr "Ir a :ref:`install-short` para más instrucciones sobre la compilación de pgRouting (no hay bola tar involucrada al descargar el repositorio pgRouting desde GitHub)." +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." +msgstr "La función ``pgr_aStarCost`` suma el coste del camino más corto utilizando el algoritmo A*." -msgid "Enabling and upgrading in the database" -msgstr "Habilitación y actualización en la base de datos" +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" +msgstr "Sea el caso de que los resultados se almacenen en una tabla, el índice unico lo conformarían el par `(start_vid, end_vid)`" -msgid "Enabling the database" -msgstr "Habilitación de la base de datos" +msgid "For undirected graphs, the results are symmetric." +msgstr "Para grafos no dirigidos, los resultados son simétricos." -msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." -msgstr "pgRouting es una extensión de PostgreSQL y depende de PostGIS para proporcionar funcionalidades al usuario final. A continuación se muestra el código demuestra que permite PostGIS y pgRouting en la base de datos." +msgid "The returned values are ordered in ascending order:" +msgstr "Loas valores regresandos son ordenados en orden ascendente:" -msgid "Checking PostGIS and pgRouting version after enabling them in the database." -msgstr "Comprobación de la versión de PostGIS y pgRouting después de habilitarlos en la base de datos." +msgid "`start_vid` ascending" +msgstr "`start_vid` ascendente" -msgid "Upgrading the database" -msgstr "Actualización de la base de datos" +msgid "`end_vid` ascending" +msgstr "`end_vid` ascendente" -msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" -msgstr "Para actualizar pgRouting en la base de datos a la versión 4.1.0 utilice el siguiente comando:" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" -msgstr "Puede hallar más información en https://www.postgresql.org/docs/current/sql-createextension.html" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -msgid "Dependencies" -msgstr "Dependencias" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "Compilation Dependencies" -msgstr "Dependencias de Compilación" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" -msgstr "Para poder compilar pgRouting, asegúrese de que se cumplen las siguientes dependencias:" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "C and C++0x compilers" -msgstr "Compiladores C y C++0x" +msgid "Returns set of |matrix-result|" +msgstr "Regresa el conjunto de |matrix-result|" -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" -msgstr "Compilar con Boost 1.56 hasta Boost 1.74 requiere un compilador C++ con soporte estandard para C++03 o C++11" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [opciones])" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" -msgstr "La compilación con Boost 1.75 requiere un compilador de C++ compatible con el estándar C++14" +msgid "``pgr_aStarCostMatrix``" +msgstr "``pgr_aStarCostMatrix``" -msgid "Postgresql version >= 13" -msgstr "Postgresql version >= 13" +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgstr "``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_aStar`." -msgid "The Boost Graph Library (BGL) >= 1.56.0" -msgstr "La Librería de Grafos Boost (BGL) >= 1.56.0" +msgid "Using internally the :doc:`pgr_aStar` algorithm" +msgstr "Uso interno del algoritmo :doc:`pgr_aStar`" -msgid "CMake >= 3.12" -msgstr "CMake >= 3.12" +msgid "Returns a cost matrix." +msgstr "Devuelve una matriz de costes." -msgid "For user's documentation" -msgstr "Para la documentación del usuario" +msgid "No ordering is performed" +msgstr "No se realiza ningún pedido" -msgid "Sphinx >= 4.0" -msgstr "Sphinx >= 4.0" +msgid "let `v` and `u` are nodes on the graph:" +msgstr "Sean `v` y `u` nodos en el grafo:" -msgid "For developer's documentation" -msgstr "Para la documentación del desarrollador" +msgid "when there is no path from `v` to `u`:" +msgstr "cuando no hay ruta de `v` a `u`:" -msgid "Doxygen >= 1.7" -msgstr "Doxygen >= 1.7" +msgid "cost from `v` to `u` is :math:`\\inf`" +msgstr "costo de `v` a `u` es :math:`\\inf`" -msgid "For testing" -msgstr "Para pruebas" +msgid "when :math:`v = u` then" +msgstr "cuando :math:`v = u` entonces" -msgid "pgtap" -msgstr "pgtap" +msgid "cost from `v` to `u` is :math:`0`" +msgstr "costo de `v` a `u` es :math:`0`" -msgid "pg_prove" -msgstr "pg_prove" +msgid "When the graph is **undirected** the cost matrix is symmetric" +msgstr "Cuando el grafo es **no dirigido**, la matriz de costes es simétrica" -msgid "For using:" -msgstr "Para uso:" +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_aStarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" -msgid "PostGIS version >= 3.0.0" -msgstr "PostGIS versión >= 3.0.0" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgstr "Matriz simétrica de costes para los vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido** usando la heurística :math:`2`" -msgid "Example: Installing dependencies on linux" -msgstr "Ejemplo: Instalación de dependencias en linux" +msgid "Use with :doc:`pgr_TSP`" +msgstr "Uso con :doc:`pgr_TSP`" -msgid "Installing the compilation dependencies" -msgstr "Instalación de las dependencias de compilación" +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" -msgid "Build dependencies" -msgstr "Construir dependencias" +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgstr "``pgr_articulationPoints`` - Devuelve los puntos de articulación de un grafo no dirigido." -msgid "Optional dependencies" -msgstr "Dependencias opcionales" +msgid "Result columns change: ``seq`` is removed" +msgstr "Cambio de columnas de resultados: ``seq`` se elimina" -msgid "For documentation" -msgstr "Para la documentación" +msgid "Version 2.5.0" +msgstr "Versión 2.5.0" -msgid "Configuring" -msgstr "Configuración" +msgid "New experimental function." +msgstr "Nueva función experimental." -msgid "pgRouting uses the `cmake` system to do the configuration." -msgstr "pgRouting utiliza el sistema 'cmake' para realizar la configuración." - -msgid "Configurable variables" -msgstr "Variables configurables" +msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." +msgstr "Los vértices que pertenecen a más de un componente biconectado se denominan puntos de articulación o, equivalentemente, corte de vértices. Los puntos de articulación son vértices cuya eliminación aumentaría el número de componentes conectados en el grafo. Esta implementación solo se puede utilizar con un grafo no dirigido." -msgid "To see the variables that can be configured" -msgstr "Para ver las variables que se pueden configurar" +msgid "Works for **undirected** graphs." +msgstr "Funciona para grafos **no dirigidos**." -msgid "The build directory is different from the source directory" -msgstr "El directorio de compilación es diferente del directorio de origen" +msgid "``node`` ascending" +msgstr "``node`` ascendente" -msgid "Configuring The Documentation" -msgstr "Configurar la documentación" +msgid "Running time: :math:`O(V + E)`" +msgstr "Tiempo de ejecución: :math:`O(V + E)`" -msgid "User and developers documentation are not build if prerequisites are not found." -msgstr "" +msgid "pgr_articulationPoints(`Edges SQL`_)" +msgstr "pgr_articulationPoints(`SQL de aristas`_)" -msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" -msgstr "La mayor parte del esfuerzo de la documentación ha estado en los archivos HTML. Algunas variables para construir la documentación:" +msgid "Returns set of |result-node|" +msgstr "Regresa conjunto de |result-node|" -msgid "Variable" -msgstr "Variable" +msgid "The articulation points of the graph" +msgstr "Los puntos de articulación del grafo" -msgid "Comment" -msgstr "Comentario" +msgid "Nodes in red are the articulation points." +msgstr "Nodos en rojo son los puntos de articulación." -msgid "BUILD_HTML" -msgstr "BUILD_HTML" +msgid "Identifier of the vertex." +msgstr "Identificador del vértice." -msgid "BOOL=ON" -msgstr "BOOL=ON" +msgid "`Boost: Biconnected components & articulation points `__" +msgstr "`Boost: Componentes biconectados y puntos de articulación `__" -msgid "If ON, turn on/off building HTML for user's documentation" -msgstr "Si está activado, active/desactive la creación de HTML para la documentación del usuario" +msgid "wikipedia: `Biconnected component `__" +msgstr "wikipedia: `Componentes biconnectados `__" -msgid "BUILD_DOXY" -msgstr "BUILD_DOXY" +msgid "``pgr_bandwidth`` - Experimental" +msgstr "``pgr_bandwidth`` - Experimental" -msgid "If ON, turn on/off building HTML for developer's documentation" -msgstr "Si está activado, active o desactive la creación de HTML para la documentación del desarrollador" +msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" +msgstr "" -msgid "BUILD_LATEX" -msgstr "BUILD_LATEX" +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgstr "" -msgid "BOOL=OFF" -msgstr "BOOL=OFF" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" +msgstr "" -msgid "If ON, turn on/off building PDF" -msgstr "Si está activado, active/desactive la creación de PDF" +msgid "The bandwidth is the maximum of all these distances" +msgstr "" -msgid "BUILD_MAN" -msgstr "BUILD_MAN" +msgid "The implementation is for undirected graphs" +msgstr "La implementación es para grafos no dirigidos" -msgid "If ON, turn on/off building MAN pages" -msgstr "Si está activado, active/desactive las páginas MAN de construcción" +msgid "Run time is 0.160789 seconds" +msgstr "" -msgid "DOC_USE_BOOTSTRAP" -msgstr "DOC_USE_BOOTSTRAP" +msgid "pgr_bandwidth(`Edges SQL`_)" +msgstr "pgr_bandwidth(`SQL de aristas`_)" -msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" -msgstr "Si está activado, utilice sphinx-bootstrap para las páginas HTML de la documentación de los usuarios" +msgid "Returns ``BIGINT``" +msgstr "Devuelve ``BIGINT``" -msgid "EN" -msgstr "" +msgid "For an undirected graph with edges." +msgstr "Para un grafo no dirigido con aristas." -msgid "if OFF the English documentation will no be built" -msgstr "si está en OFF no se creará la documentación en inglés" +msgid "Returns a bigint ``(pgr_bandwidth)``" +msgstr "Devuelve un bigint ``(pgr_bandwidth)``" -msgid "ES" -msgstr "" +msgid "``pgr_bandwidth``" +msgstr "``pgr_bandwidth``" -msgid "if OFF the Spanish documentation will no be built" -msgstr "si OFF la documentación en español no se construirá" +msgid "gives the bandwidth of the graph." +msgstr "da el ancho de banda del grafo." -msgid "SV" -msgstr "" +msgid "Undirected graph with edges before optimization." +msgstr "Grafo no dirigido con aristas antes de la optimización." -msgid "if OFF the Swedish documentation will no be built" -msgstr "si OFF la documentación en sueco no se construirá" +msgid "Undirected graph with edges after optimization." +msgstr "Grafo no dirigido con aristas tras la optimización." -msgid "ZH_HANS" -msgstr "" +msgid "`Boost: bandwidth `_" +msgstr "`Boost: bandwidth `_" -msgid "if OFF the Chinese simplified documentation will no be built" -msgstr "" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" -msgid "Building" -msgstr "Compilando" +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstar`` — Devuelve la ruta más corta usando el algoritmo Bidireccional A*." -msgid "Using ``make`` to build the code and the documentation" -msgstr "Uso de ``make`` para compilar el código y la documentación" +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_bdAstar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." -msgid "The following instructions start from ``path/to/pgrouting/build``" -msgstr "Las siguientes instrucciones parten de ``path/to/pgrouting/build``" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgstr "pgr_bdAstar(Uno a Muchos) ha añadido la columna ``end_vid``." -msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." -msgstr "Hemos probado en varias plataformas, Para instalar o reinstalar todos los pasos son necesarios." +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgstr "pgr_bdAstar(Muchos a Uno) ha añadido la columna ``start_vid``." -msgid "Linux" -msgstr "Linux" +msgid "pgr_bdAstar(Combinations)" +msgstr "pgr_bdAstar(Combinaciones)" -msgid "The following instructions start from ``path/to/pgrouting``" -msgstr "Las siguientes instrucciones parten de ``path/to/pgrouting``" +msgid "pgr_bdAstar(One to Many)" +msgstr "pgr_bdAstar(Uno a Muchos)" -msgid "Testing" -msgstr "Pruebas" +msgid "pgr_bdAstar(Many to One)" +msgstr "pgr_bdAstar(Muchos a Uno)" -msgid "Currently there is no :code:`make test` and testing is done as follows" -msgstr "Actualmente no hay :code:`make test` y las pruebas se realizan de la siguiente manera" +msgid "pgr_bdAstar(Many to Many)" +msgstr "pgr_bdAstar(Muchos a Muchos)" -msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." -msgstr "pgRouting es una extensión de la base de datos geoespacial `PostGIS `__ y `PostgreSQL `__ y agrega ruteo y otras funciones de análisis de redes. Un predecesor de pgRouting – pgDijkstra, escrito por Sylvain Pasche de `Camptocamp `__, fue más tarde extendido por Orkney y renombrado a pgRouting. El proyecto ahora es apoyado y mantenido por Georepublic `__, `Paragon Corporation `__ y una amplia comunidad de usuarios." +msgid "Signature change on pgr_bdAstar(One to One)" +msgstr "Cambio de firma en pgr_bdAstar(Uno a Uno)" -msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." -msgstr "pgRouting es parte de la `Comunidad de Proyectos de OSGeo ` __ de la `Fundación OSGeo ` __ y se incluye en`OSGeoLive `__." +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" +msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_bdAStar(Uno a Uno) en el:" -msgid "Licensing" -msgstr "Licencias" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -msgid "The following licenses can be found in pgRouting:" -msgstr "Las siguientes licencias pueden ser encontradas en pgRouting:" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -msgid "**License**" -msgstr "**Licencia**" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "GNU General Public License v2.0 or later" -msgstr "Licencia Pública General GNU v2.0 o posterior" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." -msgstr "La mayoría de las características de pgRouting están disponibles en `Licencia Pública General v2.0 o posterior `_." +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "Boost Software License - Version 1.0" -msgstr "Licencia de Software Boost - Version 1.0" +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" -msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." -msgstr "Algunas extensiones de Boost están disponibles bajo `Boost Software License - Version 1.0 `_." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el algoritmo bidireccional A*." -msgid "MIT-X License" -msgstr "Licencia MIT-X" +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(Combinaciones)" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." -msgstr "Parte del código es contribución de iMaptools.com y está disponibe bajo la licencia MIT-X." +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." +msgstr "La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando el algoritmo bidireccional A*." -msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." -msgstr "El Manual de pgRouting está disponible bajo una licencia `Creative Commons Attribution-Share Alike 3.0 License `_." +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -msgid "In general license information should be included in the header of each source file." -msgstr "En general, la información de las licencias debe estar incluida en la cabecera de cada archivo de origen." +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -msgid "Contributors" -msgstr "Colaboradores" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "This Release Contributors" -msgstr "Colaboradores de esta Versión" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -msgid "Individuals in this release v4.0.0 (in alphabetical order)" -msgstr "Personas en esta versión v4.0.0 (por orden alfabético)" +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" -msgstr "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" -msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgstr "Y a toda la gente que nos regala un poco de su tiempo haciendo comentarios, encontrando problemas, haciendo pull requests etc. en cualquiera de nuestros productos: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." +msgstr "``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_bdAstar`." -msgid "Translators (in alphabetical order)" -msgstr "Traductores (en orden alfabético)" +msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." +msgstr "Internamente utiliza el algoritmo :doc:`pgr_bdAstar`." -msgid "Chinese:" -msgstr "" +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_bdAstarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" -msgid "Dapeng Wang" -msgstr "" +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo Bidireccional de Dijkstra." -msgid "Spanish:" -msgstr "" +msgid "Output columns standardized to |short-generic-result|" +msgstr "Las columnas de resultados estandarizadas a |short-generic-result|" -msgid "Vicky Vergara" -msgstr "Vicky Vergara" +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(Combinaciones)" -msgid "Swedish:" -msgstr "" +msgid "pgr_bdDijkstra(One to Many)" +msgstr "pgr_bdDijkstra(Uno a Muchos)" -msgid "Daniel Nylander" -msgstr "" +msgid "pgr_bdDijkstra(Many to One)" +msgstr "pgr_bdDijkstra(Muchos a Uno)" -msgid "Corporate Sponsors in this release (in alphabetical order)" -msgstr "Patrocinadores corporativos de este lanzamiento (en orden alfabético)" +msgid "pgr_bdDijkstra(Many to Many)" +msgstr "pgr_bdDijkstra(Muchos a Muchos)" -msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" -msgstr "Estas son las entidades corporativas que han contribuido con tiempo de desarrollo, alojamiento, o financiamiento monetario directo al proyecto de pgRouting:" +msgid "Signature change on pgr_bdDijkstra(One to One)" +msgstr "Cambio de firma en pgr_bdDijsktra(Uno a Uno)" -msgid "`OSGeo `__" -msgstr "`OSGeo `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "`OSGeo UK `__" -msgstr "`OSGeo UK `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "`Google Summer of Code `__" -msgstr "`Google Summer of Code `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "`HighGo Software `__" -msgstr "`HighGo Software `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "`Paragon Corporation `__" -msgstr "`Paragon Corporation `__" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "Contributors Past & Present:" -msgstr "Colaboradores, Pasado y Presente:" +msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo **dirigido**" -msgid "Individuals (in alphabetical order)" -msgstr "Personas (en orden alfabético)" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **dirigido**" -msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgstr "De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo **dirigido**" -msgid "Corporate Sponsors (in alphabetical order)" -msgstr "Patrocinadores corporativos (en orden alfabético)" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**" -msgid "Camptocamp" -msgstr "Camptocamp" +msgid "Using a combinations table on an **undirected** graph" +msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**" -msgid "CSIS (University of Tokyo)" -msgstr "CSIS (University of Tokyo)" +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" -msgid "Georepublic" -msgstr "Georepublic" +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" -msgid "Google Summer of Code" -msgstr "Google Summer of Code" +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando el algoritmo Bidireccional de Dijkstra." -msgid "HighGo Software" -msgstr "" +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(Combinaciones)" -msgid "iMaptools" -msgstr "iMaptools" +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgstr "La función ``pgr_bdDijkstraCost`` suma el costo de la ruta más corta utilizando el algoritmo de bidirecional de Dijkstra." -msgid "Leopark" -msgstr "Leopark" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "Orkney" -msgstr "Orkney" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "OSGeo" -msgstr "OSGeo" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "OSGeo UK" -msgstr "OSGeo UK" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "Paragon Corporation" -msgstr "Paragon Corporation" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [ ``directed``])" -msgid "Versaterm Inc." -msgstr "Versaterm Inc." +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "More Information" -msgstr "Más Información" +msgid "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." -msgstr "Lo último en software, documentación y noticias, se encuentra disponible en el sitio web de pgRouting https://pgrouting.org." +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgstr "``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_bdDijkstra`." -msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." -msgstr "Servidor de base de datos PostgreSQL en el sitio principal de PostgreSQL https://www.postgresql.org." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgstr "Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una matriz de costos." -msgid "PostGIS extension at the PostGIS project web site https://postgis.net." -msgstr "PostGIS extension en el sitio web del projecto PostGIS https://postgis.net." +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_bdDijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" -msgid "Boost C++ source libraries at https://www.boost.org." -msgstr "Bibliotecas de código Boost C++ en https://www.boost.org." +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgstr "Matriz de costos simétrica para vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido**" -msgid ":doc:`migration`" -msgstr ":doc:`migration`" +msgid "Use with :doc:`pgr_TSP`." +msgstr "Usar con :doc:`pgr_TSP`." -msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "``pgr_KSP`` — Devuelve las K rutas más cortas usando Dijkstra ." +msgid "``pgr_bellmanFord`` - Experimental" +msgstr "``pgr_bellmanFord`` - Experimental" -msgid "Availability" -msgstr "Disponibilidad" +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgstr "``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-Ford." -msgid "Version 4.0.0" -msgstr "Versión 4.0.0" +msgid "New experimental signature:" +msgstr "Nueva firma experimental:" -msgid "Version 3.6.0" -msgstr "Versión 3.6.0" +msgid "pgr_bellmanFord(Combinations)" +msgstr "pgr_bellmanFord(Combinaciones)" -msgid "Standardizing output columns to |nksp-result|" -msgstr "Estandarización de columnas de resultados a |nksp-result|" +msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." +msgstr "El algoritmo de Bellman-Ford, lleva el nombre de Richard Bellman y Lester Ford, quienes lo publicaron por primera vez en 1958 y 1956, respectivamente. Es un algoritmo de búsqueda de grafos que calcula las rutas más cortas desde un vértice inicial (``start_vid``) hasta un vértice final (``end_vid``) en un grafo donde algunos de los pesos de borde pueden ser números negativos. Aunque es más versátil, es más lento que el algoritmo de Dijkstra/ Esta implementación se puede utilizar con un grafo dirigido y un grafo no dirigido." -msgid "pgr_ksp(One to One)" -msgstr "pgr_ksp(Uno a Uno)" +msgid "Process is valid for edges with both positive and negative edge weights." +msgstr "El proceso es válido para aristas con grosores de arista positivos y negativos." -msgid "Added ``start_vid`` and ``end_vid`` result columns." -msgstr "Añadidas las columnas de resultados ``start_vid`` y ``end_vid``." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgstr "Cuando el vértice inicial y el vértice final son los mismos, no hay ruta. El agg_cost sería :math:`0`." -msgid "New proposed signatures:" -msgstr "Nuevas firmas propuestas:" +msgid "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." +msgstr "Cuando el vértice inicial y el vértice final son diferentes, y existe una ruta entre ellos sin tener un *ciclo negativo*. El agg_cost sería un valor finito que indica la distancia más corta entre ellos." -msgid "pgr_ksp(One to Many)" -msgstr "pgr_ksp(Uno a muchos)" +msgid "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." +msgstr "Cuando el vértice inicial y el vértice final son diferentes y existe una ruta entre ellos, pero contiene un *ciclo negativo*. En tal caso, agg_cost para esos vértices siguen disminuyendo además, por lo tanto agg_cost no se puede definir para ellos." -msgid "pgr_ksp(Many to One)" -msgstr "pgr_ksp(Muchos a uno)" +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgstr "Cuando el vértice inicial y el vértice final son diferentes y no hay ruta. El agg_cost es :math:`\\infty`." -msgid "pgr_ksp(Many to Many)" -msgstr "pgr_ksp(Muchos a muchos)" +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgstr "Para fines de optimización, se ignora cualquier valor duplicado en `start_vids` o `end_vids`." -msgid "pgr_ksp(Combinations)" -msgstr "pgr_ksp(Combinaciones)" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +msgstr "Tiempo de ejecución :math:`O(| start\\_vids | * ( V * E))`" -msgid "Version 2.1.0" -msgstr "Versión 2.1.0" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "Signature change" -msgstr "Cambio de firma" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "Old signature no longer supported" -msgstr "Firma antigua ya no soportada" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "Version 2.0.0" -msgstr "Versión 2.0.0" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "Official function." -msgstr "Función oficial." +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." -msgstr "El algoritmo de ruteo para obtener la ruta más corta K basado en el algoritmo de Yen . \"K\" es el número de rutas más cortas deseadas." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido" -msgid "|Boost| Boost Graph Inside" -msgstr "|Boost| Adentro: Boost Graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgstr "De los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo dirigido" -msgid "Boost Graph inside" -msgstr "Adentro: Boost Graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" +msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo no dirigido" -msgid "Signatures" -msgstr "Firmas" +msgid "Using a combinations table on an undirected graph" +msgstr "Usando una tabla de combinaciones en un grafo no dirigido" -msgid "Summary" -msgstr "Resumen" +msgid "`Boost: Bellman Ford `__" +msgstr "`Boost: Bellman Ford `__" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "``pgr_betweennessCentrality`` - Experimental" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgstr "``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa mediante el algoritmo de Brandes" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])" +msgid "Version 3.7.0" +msgstr "Versión 3.7.0" -msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgstr "pgr_KSP(`SQL de aristas`_, `SQL de combinaciones`_, **K**, [**opciones**])" +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgstr "El algoritmo Brandes aprovecha los grafos dispersos para evaluar la puntuación de centralidad intermedia de todos los vértices." -msgid "**options:** ``[directed, heap_paths]``" -msgstr "**opcionales:** ``[directed, heap_paths]``" +msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." +msgstr "La centralidad de interrelación mide hasta qué punto un vértice se encuentra en las rutas más cortas entre todos los demás pares de vértices. Los vértices con una alta centralidad entre pares pueden tener una influencia considerable en una red gracias a su control sobre los caminos más cortos que pasan entre ellos." -msgid "Returns set of |nksp-result|" -msgstr "Regresa conjunto de |nksp-result|" +msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." +msgstr "La eliminación de estos vértices afectará a la red al perturbarla, ya que la mayoría de los caminos más cortos entre vértices pasan por ellos." -msgid "OR EMPTY SET" -msgstr "O CONJUNTO VACÍO" +msgid "This implementation work for both directed and undirected graphs." +msgstr "Esta implementación funciona tanto para grafos dirigidos como no dirigidos." -msgid "Example" -msgstr "Ejemplo" +msgid "Running time: :math:`\\Theta(VE)`" +msgstr "Tiempo de ejecución: :math:`\\Theta(VE)`" -msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." -msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo dirigido." +msgid "Running space: :math:`\\Theta(VE)`" +msgstr "Espacio de ejecución: :math:`\\Theta(VE)`" -msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." -msgstr "Obtener 2 rutas del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido." +msgid "Throws when there are no edges in the graph" +msgstr "Lanza cuando no hay aristas en el grafo" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." -msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo dirigido." +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgstr "pgr_betweennessCentrality(`SQL de aristas`_, [``directed``])" -msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." -msgstr "Obtener 2 rutas los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido." +msgid "Returns set of ``(vid, centrality)``" +msgstr "Regresa el conjunto de ``(vid, centrality)``" -msgid "Using a combinations table on an directed graph" -msgstr "Usando una tabla de combinaciones en un grafo dirigido" +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "Para un grafo dirigido con aristas :math:`\\{1, 2, 3, 4\\}`." -msgid "The combinations table:" -msgstr "La tabla de combinaciones:" +msgid "Explanation" +msgstr "Explicación" -msgid "The query:" -msgstr "La consulta:" +msgid "The betweenness centrality are between parenthesis." +msgstr "La centralidad intermedia está entre paréntesis." -msgid "Identifier of the destination vertex." -msgstr "Identificador del vértice destino." +msgid "The leaf vertices have betweenness centrality :math:`0`." +msgstr "Los vértices de las hojas tienen una centralidad intermedia :math:`0`." -msgid "**K**" -msgstr "**K**" +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +msgstr "La centralidad de entrecruzamiento del vértice :math:`6` es mayor que la del vértice :math:`10`." -msgid "Number of required paths." -msgstr "Cantidad de rutas requeridas." +msgid "Removing vertex :math:`6` will create three graph components." +msgstr "Al eliminar el vértice :math:`6` se crearían tres componentes." -msgid "KSP Optional parameters" -msgstr "Parámetros opcionales de KSP" +msgid "Removing vertex :math:`10` will create two graph components." +msgstr "Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." -msgid "``heap_paths``" -msgstr "``heap_paths``" +msgid "``vid``" +msgstr "``vid``" -msgid "When ``false`` Returns at most K paths." -msgstr "Cuando ``false`` Regresa a lo más K caminos." +msgid "``centrality``" +msgstr "``centrality``" -msgid "When ``true`` all the calculated paths while processing are returned." -msgstr "Cuando ``true`` se regresan todos los caminos calulados mientras se procesa." +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgstr "Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])" -msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." -msgstr "Aproximadamente, si la ruta más corta tiene ``N`` aristas, las procesadas contendrán aproximadamente ``N * K`` rutas para valores pequeños de ``K`` y ``K > 5``." +msgid "`Boost: betweenness centrality `_" +msgstr "`Boost: Centralidad de intermediación `__" -msgid "Additional Examples" -msgstr "Ejemplos Adicionales" +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" -msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" -msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo no dirigido" +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +msgstr "``pgr_biconnectedComponents`` — Componentes biconectados de un grafo no dirigido." -msgid "Also get the paths in the heap." -msgstr "También obtener los caminos procesados." +msgid "Result columns change:" +msgstr "Las columnas de resultados cambian:" -msgid "Get 2 paths using combinations table on an undirected graph" -msgstr "Obtener dos rutas usando una tabla de combinaciones en un grafo no dirigido" +msgid "``n_seq`` is removed" +msgstr "``n_seq`` se elimina" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." -msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo no dirigido." +msgid "``seq`` changed type to ``BIGINT``" +msgstr "``seq`` cambió el tipo a ``BIGINT``'" -msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgid "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." +msgstr "Los componentes biconectados de un grafo no dirigido son los subconjuntos máximos de vértices de modo que la eliminación de un vértice de un componente determinado no desconectará el mismo. A diferencia de los componentes conectados, los vértices pueden pertenecer a varios componentes biconectados. Los vértices pueden estar presentes en varios componentes biconectados, pero cada arista solo puede estar contenida en un único componente biconectado." -msgid "``pgr_TSP``" -msgstr "``pgr_TSP``" +msgid "Components are described by edges." +msgstr "Los componentes se describen mediante aristas." -msgid "``pgr_TSP`` - Approximation using *metric* algorithm." -msgstr "``pgr_TSP`` - Aproximación usando el algoritmo *métrico*." +msgid "``component`` ascending." +msgstr "``componente`` ascendente." -msgid "Availability:" -msgstr "Disponibilidad:" +msgid "``edge`` ascending." +msgstr "``edge`` ascendente." -msgid "Version 3.2.1" -msgstr "Versión 3.2.1" +msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgstr "pgr_biconnectedComponents(`SQL de aristas`_)" -msgid "Metric Algorithm from `Boost library `__" -msgstr "Algoritmo Metrico de la `Librería Boost `__" +msgid "Returns set of |result-component-E|" +msgstr "Regresa conjunto de |result-component-E|" -msgid "Simulated Annealing Algorithm no longer supported" -msgstr "El algoritmo de recocido simulado ya no es utilizado" +msgid "The biconnected components of the graph" +msgstr "Los componentes biconectados del grafo" -msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgstr "Se ignoran los parámetros relacionados con el algoritmo de recocido simulado: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgid "``component``" +msgstr "``component``" -msgid "Version 2.3.0" -msgstr "Versión 2.3.0" +msgid "Component identifier." +msgstr "Identificador de componente." -msgid "Results change depending on input order of the `Matrix SQL`_" -msgstr "" +msgid "Has the value of the minimum edge identifier in the component." +msgstr "Contiene el identificador mínimo de arista en el componente." -msgid "Negative costs are ignored." -msgstr "Costos negativos son ignorados." +msgid "Identifier of the edge that belongs to the ``component``." +msgstr "Identificador de arista que pertenece a ``component``." -msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." -msgstr "Se puede utilizar con funciones :doc:`costMatrix-category` preferiblemente con `directed => false`." +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgid "With ``directed => false``" -msgstr "Con ``directed => false``" +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgstr "``pgr_binaryBreadthFirstSearch`` - Devuelve el camino más corto en un grafo binario." -msgid "Will generate a graph that:" -msgstr "Generará un grafo que:" +msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." +msgstr "Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' es un entero no negativo, se le llama 'grafo binario'." -msgid "is undirected" -msgstr "es no dirigido" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" -msgid "is fully connected (As long as the graph has one component)" -msgstr "está completamente conectado (siempre que el grafo tenga un componente)" +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +msgstr "Es bien sabido que los caminos más cortos entre un único origen y todos los demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. También se puede interpretar este grafo como un grafo ponderado, en el que cada arista tiene el peso :math:`1`. Si no todas las aristas del grafo tienen el mismo peso, se necesita un algoritmo más general, como el Algoritmo de Dijkstra, que se ejecuta en tiempo :math:`O(|E|log|V|)`." -msgid "all traveling costs on edges obey the triangle inequality." -msgstr "todos los costos de viaje en los segmentos vumplen con la desigualdad del triángulo." +msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." +msgstr "Sin embargo, si los pesos están más restringidos, podemos usar un algoritmo más rápido. Este algoritmo, llamado 'búsqueda binaria de primero profundidad' así como '0-1 BFS', es una variación del problema estándar de búsqueda de primero profundidad para resolver el problema SSSP (ruta más corta de una sola fuente) en :math:`O(|E|)`, si los pesos de cada arista pertenecen al conjunto de caracteres de {0,X}, donde 'X' es cualquier entero no negativo." -msgid "When ``start_vid = 0 OR end_vid = 0``" -msgstr "Cuando ``start_vid = 0 Ó end_vid = 0``" +msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" +msgstr "El proceso se realiza sólo en 'grafos binarios'. ('Grafo binario': Cualquier grafo cuyos pesos de aristas pertenezcan al conjunto {0, X}, donde 'X' es cualquier entero real no negativo.)" -msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" -msgstr "Se garantiza que las soluciones generadas sean *en el peor de los casos el doble de largas que el recorrido óptimo*" +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" +msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * |E|)`" -msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgstr "Cuando ``start_vid != 0 Y end_vid != 0 Y start_vid != end_vid``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." -msgstr "No está **garantizado** que la solución sea, en el peor de los casos, el doble de larga que el recorrido óptimo, debido a que `end_vid` está forzado a estar en una posición fija." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "With ``directed => true``" -msgstr "Con ``directed => true``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" -msgstr "No está **garantizado** que la solución sea, en el peor de los casos, dos veces más larga que el recorrido óptimo" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "is directed" -msgstr "es dirigido" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "some (or all) traveling costs on edges might not obey the triangle inequality." -msgstr "algunos (o todos) los costos de viaje en los segmentos podrían no obedecer a la desigualdad del triángulo." +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgstr "**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los mismos (i.e :math:`1``)" -msgid "As an undirected graph is required, the directed graph is transformed as follows:" -msgstr "Como se requiere un grafo no dirigido, el grafo dirigido se transforma de la siguiente manera:" +msgid "`Boost: Breadth First Search `__" +msgstr "`Boost: Primera búsqueda en amplitud `__" -msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" -msgstr "los segmentos `(u, v)` y `(v, u)` se consideran el mismo segmentos (denotado `(u, v)`" +msgid "https://cp-algorithms.com/graph/01_bfs.html" +msgstr "https://cp-algorithms.com/graph/01_bfs.html" -msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" -msgstr "Si '``agg_cost`` difiere entre una o más instancias del segmento `(u, v)`" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" -msgstr "El valor mínimo de ``agg_cost`` en todas las instancias de la arista `(u, v)` se considera como el ``agg_cost`` de la arista `(u, v)`" +msgid "``pgr_bipartite`` - Experimental" +msgstr "``pgr_bipartite`` - Experimental" -msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." -msgstr "Algunos (o todos) los costos de viaje en los segmentos aún podrían no obedecer a la desigualdad del triángulo." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +msgstr "``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el mismo conjunto son adjacentes." -msgid "When the data does not come from an undirected graph or its not fully connected:" -msgstr "" +msgid "Output columns standardized to |result_node_color|" +msgstr "Columnas de resultados estandarizados a |result_node_color|" -msgid "Missing values will be calculated with dijkstra algorithm." -msgstr "Los valores perdidos se calcularán con el algoritmo de Dijkstra." +msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgstr "Un grafo bipartito es un grafo con dos conjuntos de vértices que están conectados entre sí, pero no dentro de sí mismos. Un gráfico bipartito es posible si el color del gráfico es posible utilizando dos colores, de modo que los vértices de un conjunto se colorean con el mismo color." -msgid "When the graph has more than one component:" -msgstr "Cuando el grafo tiene más de un componente:" +msgid "The algorithm works in undirected graph only." +msgstr "El algoritmo solo funciona en un grafo no dirigido." -msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." -msgstr "" +msgid "The returned values are not ordered." +msgstr "Los valores devueltos no están ordenados." -msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." -msgstr "" +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgstr "El algoritmo comprueba si el grafo es bipartito o no. Si es bipartito entonces devuelve el nodo junto con dos colores `0` y `1` que representan dos conjuntos diferentes." -msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." -msgstr "" +msgid "If graph is not bipartite then algorithm returns empty set." +msgstr "Si el grafo no es bipartito, el algoritmo devuelve un conjunto vacío." -msgid "One cycle attempt to remove crossing edges is done to the TSP results." -msgstr "" +msgid "pgr_bipartite(`Edges SQL`_)" +msgstr "pgr_bipartite(`SQL de aristas`_)" -msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSP(`SQL de martiz`_, ``[start_id, end_id]``)" +msgid "When the graph is bipartite" +msgstr "Cuando el grafo es bi-partido" -msgid "Returns set of |tsp-result|" -msgstr "Regresa el conjunto de |nksp-result|" +msgid "Additional Example" +msgstr "Ejemplo Adicional" -msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" -msgstr "Usando :doc:`pgr_dijkstraCostMatrix` para generar la información de la matriz" +msgid "The odd length cyclic graph can not be bipartite." +msgstr "El gráfico cíclico de longitud impar no puede ser bipartito." -msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." -msgstr "**Línea 5** Los vértices :math:`\\{2, 4, 13, 14\\}` no están incluidos porque no están conectados." +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgstr "La arista :math:`5 \\rightarrow 1` hace que el sub-grafo con vértices:math:`\\{1, 3, 7, 6, 5\\}` se un grafo de ciclo impar, ya que ciclo tiene 5 vértices." -msgid "`Matrix SQL`_ as described below" -msgstr "`SQL de matriz`_ como se describe más adelante" +msgid "Edges in blue represent odd length cycle subgraph." +msgstr "Aristas en azul representan un grafo de ciclo impar." -msgid "``ANY-INTEGER``" -msgstr "``ANY-INTEGER``" +msgid "`Boost: is_bipartite `__" +msgstr "`Boost: es bipartido `__" -msgid "``ANY-NUMERICAL``" -msgstr "``ANY-NUMERICAL``" +msgid "`Wikipedia: bipartite graph `__" +msgstr "`Wikipedia: grafo bipartito `__" -msgid "Cost for going from start_vid to end_vid" -msgstr "Costo para pasar de start_vid a end_vid" +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" -msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" -msgstr "Devuelve el CONJUNTO DE ``(seq, node, cost, agg_cost)``" +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgstr "``pgr_boykovKolmogorov`` — Calcula el flujo en las aristas del grafo que maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo Boykov Kolmogorov." -msgid "Row sequence." -msgstr "Secuencia de filas." +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov(Combinaciones)" -msgid "**node**" -msgstr "**node**" +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgstr "Renombrado de ``pgr_maxFlowBoykovKolmogorov``" -msgid "Identifier of the node/coordinate/point." -msgstr "Identificador del nodo/coordenada/punto." +msgid "Function promoted to proposed." +msgstr "Función promovida a propuesta." -msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." -msgstr "Coste que se debe recorrer desde el ``nodo`` al siguiente ``nodo`` en la secuencia de ruta." +msgid "Running time: Polynomial" +msgstr "Tiempo de ejecución: Polinomio" -msgid "``0`` for the last row in the tour sequence." -msgstr "``0`` para la última fila en la secuencia del recorrido." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destino**)" -msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." -msgstr "Costo agregado del ``nodo`` en ``seq = 1`` hacia el nodo actual." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destinos**)" -msgid "``0`` for the first row in the tour sequence." -msgstr "``0`` para la primera fila en la secuencia del recorrido." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destino**)" -msgid "Start from vertex :math:`1`" -msgstr "Inicio en el vértice :math:`1`" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destinos**)" -msgid "**Line 6** ``start_vid => 1``" -msgstr "**Linea 6** ``start_vid => 1``" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "Using points of interest to generate an asymmetric matrix." -msgstr "Usar los puntos de interés para generar una matriz asimétrica." +msgid "Returns set of |result-flow|" +msgstr "Regresa el conjunto de |result-flow|" -msgid "To generate an asymmetric matrix:" -msgstr "Para generar una matriz asimétrica:" +msgid "From vertex :math:`11` to vertex :math:`12`" +msgstr "Del vértice :math:`11` al vértice :math:`12`" -msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" -msgstr "**Línea 4** La información ``side`` de ``pointsOfInterset`` se ignora al no incluirla en la consulta" +msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "Desde el vértice :math:`11` a los vértices :math:`\\{5, 10, 12\\}`" -msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" -msgstr "**Línea 6** Generación de una matriz asimétrica con ``directed => true``" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" +msgstr "De los vértices vertices :math:`\\{11, 3, 17\\}` al vértice :math:`12`" -msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" -msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` se considera como el ``agg_cost``" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}`" -msgid "The solution that can be larger than *twice as long as the optimal tour* because:" -msgstr "La solución que puede ser mayor que *el doble de larga que el tour óptimo* porque:" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}`." -msgid "Triangle inequality might not be satisfied." -msgstr "La desigualdad del triángulo podría no estar satisfecha." +msgid "`Boost: Boykov Kolmogorov max flow `__" +msgstr "`Boost: Flujo máximo Boykov Kolmogorov `__" -msgid "``start_id != 0 AND end_id != 0``" -msgstr "``start_id != 0 Y end_id != 0``" +msgid "``pgr_breadthFirstSearch`` - Experimental" +msgstr "``pgr_breadthFirstSearch`` - Experimental" -msgid "Connected incomplete data" -msgstr "Datos incompletos conectados" +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgstr "``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante el algoritmo Breadth First Search." -msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." -msgstr "Usando aristas seleccionadas :math:`\\{2, 4, 5, 8, 9, 15\\}` la matriz no es completa." +msgid "Version 4.0.0:" +msgstr "Versión 4.0.0:" -msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." -msgstr "Valor del cost para :math:`17 \\rightarrow 10` no existe en la matriz, pero el valor se toma de :math:`10 \\rightarrow 17`." +msgid "Standardizing output columns to |result-spantree|" +msgstr "Columnas de resultados estandarizados a |result-spantree|" -msgid "``pgr_TSPeuclidean``" -msgstr "``pgr_TSPeuclidean``" +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgstr "Proporciona el orden transversal de Primera Búsqueda de Amplitud desde un vértice raíz hasta una profundidad particular." -msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." -msgstr "``pgr_TSPeuclidean`` - Aproximación usando el algoritmo *métrico*." +msgid "The implementation will work on any type of graph." +msgstr "La implementación funcionará en cualquier tipo de grafo." -msgid "Using `Boost: metric TSP approx `__" -msgstr "Usando `Boost: Algoritmo de aproximación Métrica de TSP `__" +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgstr "Proporciona el orden de recorrido de Búsqueda de Primero Amplitud desde un nodo de origen a un nivel de profundidad objetivo." -msgid "Name change from pgr_eucledianTSP" -msgstr "Cambio de nombre de pgr_eucledianTSP" +msgid "Running time: :math:`O(E + V)`" +msgstr "Tiempo de ejecución: :math:`O(E + V)`" -msgid "New official function." -msgstr "Nueva función oficial." +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raíz**, [**options**])" -msgid "Results change depending on input order of the `Coordinates SQL`_" -msgstr "" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raices**, [**options**])" -msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." -msgstr "Cualquier identificador duplicado será ignorado. Las coordenadas que se mantendrán son arbitrarias." +msgid "**options:** ``[max_depth, directed]``" +msgstr "**opcionales:** ``[max_depth, directed]``" -msgid "The coordinates are quite similar for the same identifier, for example ::" -msgstr "Las coordenadas son bastante similares para el mismo identificador, por ejemplo:" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgstr "Desde el vértice raíz :math:`6` en un grafo **dirigido** con aristas en orden ascendente de ``id``" -msgid "The coordinates are quite different for the same identifier, for example ::" -msgstr "Las coordenadas son bastante diferentes para el mismo identificador, por ejemplo:" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgstr "A partir de los vértices de la raíz :math:`\\{12, 6\\}` en un grafo **no dirigido** con **profundidad** :math:`<= 2` y aristas ordenadas ascendentemente in términos de ``id``" -msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSPeuclidean(`SQL de Coordenadas`_, ``[start_id, end_id]``)" +msgid "DFS optional parameters" +msgstr "Parámetros opcionales de DFS" -msgid "With default values" -msgstr "Con valores predeterminados" +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." +msgstr "Igual que `Vértice único`_ con aritas en orden ascendente de ``id``." -msgid "`Coordinates SQL`_" -msgstr "`SQL coordenadas`_" +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgstr "Igual que `Vértice único`_ con aritas en orden descendente de ``id``." -msgid "`Coordinates SQL`_ as described below" -msgstr "`SQL de coordenadas`_ descritas más adelante" +msgid "The resulting traversal is different." +msgstr "El recorrido resultante es diferente." -msgid "Coordinates SQL" -msgstr "Coordenadas SQL" +msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." +msgstr "La imagen izquierda muestra el resultado con el orden ascendente de los ids y la imagen derecha muestra con el orden descendente de los identificadores de aristas." -msgid "``x``" -msgstr "``x``" +msgid "|ascending| |descending|" +msgstr "|ascending| |descending|" -msgid "X value of the coordinate." -msgstr "Valor X de la coordenada." +msgid "ascending" +msgstr "ascendente" -msgid "``y``" -msgstr "``y``" +msgid "descending" +msgstr "descendente" -msgid "Y value of the coordinate." -msgstr "Valor Y de la coordenada." +msgid "`Wikipedia: Breadth First Search algorithm `__" +msgstr "`Wikipedia: Breadth First Search `__" -msgid "Test 29 cities of Western Sahara" -msgstr "Prueba 29 ciudades del Sáhara Occidental" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" -msgstr "Este ejemplo muestra cómo hacer pruebas de rendimiento utilizando los `datos de ejemplo `__ de la Universidad de Waterloo utilizando el conjunto de datos de 29 ciudades del `Sáhara Occidental `__" +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +msgstr "``pgr_bridges`` - Calcula los puentes de un grafo no dirigido." -msgid "Creating a table for the data and storing the data" -msgstr "Creación de una tabla para datos y almacenamiento de los datos" +msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." +msgstr "Un puente es un borde de un grafo no dirigido cuya eliminación aumenta su número de componentes conectados. Esta implementación solo se puede utilizar con un grafo no dirigido." -msgid "Adding a geometry (for visual purposes)" -msgstr "Agregar una geometría (con fines visuales)" +msgid "``edge`` ascending" +msgstr "``edge`` ascendente" -msgid "Total tour cost" -msgstr "Costo total del tour" +msgid "Running time: :math:`O(E * (V + E))`" +msgstr "Tiempo de ejecución: :math:`O(E * (V + E))`" -msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" -msgstr "Al obtener un costo total del recorrido, comparar el valor con la duración de un recorrido óptimo, que es 27603, dado en el conjunto de datos" +msgid "pgr_bridges(`Edges SQL`_)" +msgstr "pgr_bridges(`SQL de aristas`_)" -msgid "Getting a geometry of the tour" -msgstr "Obtener una geometría del recorrido" +msgid "Returns set of |result-edge|" +msgstr "Regresa conjunto de |result-edge|" -msgid "Visual results" -msgstr "Resultados visuales" +msgid "The bridges of the graph" +msgstr "Los puentes del grafo" -msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." -msgstr "Visualmente, la primera imagen es la `solución óptima `__ y la segunda imagen es la solución obtenida con ``pgr_TSPeuclidean``." +msgid "Identifier of the edge that is a bridge." +msgstr "Identificador del borde que es un puente." -msgid "``pgr_aStar`` — Shortest path using the A* algorithm." -msgstr "``pgr_aStar`` — La ruta más corta utilizando el algoritmo A*." +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgid "Standardizing output columns to |short-generic-result|" -msgstr "Estandarización de las columnas de salida a |short-generic-result|" +msgid "`Boost: Connected components `__" +msgstr "`Boost: Componentes conectados `__" -msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_aStar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." +msgid "``pgr_chinesePostman`` - Experimental" +msgstr "``pgr_chinesePostman`` - Experimental" -msgid "pgr_aStar(One to Many) added ``end_vid`` column." -msgstr "pgr_aStar(Uno a Muchos) ha añadido la columna ``end_vid``." +msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostman`` — Calcula la ruta de circuito más corta que contiene cada arista en un grafo dirigido y comienza y termina en el mismo vértice." -msgid "pgr_aStar(Many to One) added ``start_vid`` column." -msgstr "pgr_aStar(Muchos a Uno) ha añadido la columna ``start_vid``." +msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgstr "Devuelve ``EMPTY SET`` en un grafo desconectado" -msgid "New proposed signature:" -msgstr "Nuevas firmas propuesta:" +msgid "pgr_chinesePostman(`Edges SQL`_)" +msgstr "pgr_chinesePostman(`SQL de aristas`_)" -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(Combinaciones)" +msgid "Returns set of |result-1-1-no-seq|" +msgstr "Regresa el conjunto de |result-1-1-no-seq|" -msgid "Version 2.4.0" -msgstr "Versión 2.4.0" +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" -msgid "pgr_aStar(One to Many)" -msgstr "pgr_aStar(Uno a Muchos)" +msgid "Sequential value starting from ``1``" +msgstr "Valor secuencial a partir de ``1``" -msgid "pgr_aStar(Many to One)" -msgstr "pgr_aStar(Muchos a Uno)" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgstr "Identificador del borde utilizado para ir del ``nodo`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta." -msgid "pgr_aStar(Many to Many)" -msgstr "pgr_aStar(Muchos a Muchos)" +msgid "Aggregate cost from ``start_v`` to ``node``." +msgstr "Coste agregado de ``start_v`` to ``node``." -msgid "Signature change on pgr_aStar(One to One)" -msgstr "Cambio de firma en pgr_aStar(Uno a Uno)" +msgid "``pgr_chinesePostmanCost`` - Experimental" +msgstr "``pgr_chinesePostmanCost`` - Experimental" -msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" -msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_aStar( `Uno a Uno`_ ) en:" +msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostmanCost`` — Calcula los costes mínimos de una ruta de circuito que contiene cada arista de un grafo dirigido y comienza y termina en el mismo vértice." -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" +msgid "Return value when the graph if disconnected" +msgstr "Valor devuelto cuando el grafo está desconectado" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgstr "pgr_chinesePostmanCost(`SQL de aristas`_)" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" +msgid "RETURNS ``FLOAT``" +msgstr "DEVUELVE ``FLOAT``" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])" +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" -msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgid "Minimum costs of a circuit path." +msgstr "Costes mínimos de una trayectoria de circuito." -msgid "**options:** ``[directed, heuristic, factor, epsilon]``" -msgstr "**opcionales:** ``[directed, heuristic, factor, epsilon]``" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" -msgid "Returns set of |short-generic-result|" -msgstr "Regresa el conjunto de |short-generic-result|" +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgstr "``pgr_connectedComponents`` — Componentes conectados de un grafo no dirigido mediante un enfoque basado en DFS." -msgid "Optional parameters are `named parameters` and have a default value." -msgstr "Los parámetros opcionales son `parámetros con nombre` y tienen un valor predeterminado." +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgstr "Un componente conectado de un gráfico no direccionado es un conjunto de vértices que son todos accesibles entre sí." -msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" -msgstr "De vértice :math:`6` a vértice :math:`12` en un grafo **dirigido** usando la heurística :math:`2`" +msgid "Components are described by vertices" +msgstr "Los componentes se describen mediante vértices" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" -msgstr "Desde el vértice :math:`6` a los vértices :math:`\\{12, 10\\}` en un grafo **dirigido** usando la heurística :math:`3` con factor :math:`3.5`" +msgid "``component`` ascending" +msgstr "``component`` ascendente" -msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" -msgstr "De los vértices :math:`\\{6, 8\\}` al vértice :math:`10` en un grafo **no dirigido** usando la heurística :math:`4`" +msgid "pgr_connectedComponents(`Edges SQL`_)" +msgstr "pgr_connectedComponents(`SQL de aristas`_)" -msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" -msgstr "De los vértices :math:`\\{6, 8\\}` a los vértices :math:`\\{10, 12\\}` en un gráfico **dirigido** con factor :math:`0.5`" +msgid "Returns set of |result-component-V|" +msgstr "Regresa conjunto de |result-component-V|" -msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." -msgstr "Usando una tabla de combinaciones en un grafo **dirigido** con factor :math:`0.5`." +msgid "The connected components of the graph" +msgstr "Los componentes conectados del grafo" -msgid "Example 1" -msgstr "Ejemplo 1" +msgid "Has the value of the minimum node identifier in the component." +msgstr "Continene le valor mínimo de identificador de nodo en el componente." -msgid "Demonstration of repeated values are ignored, and result is sorted." -msgstr "Demostración de ignorar los valores repertidos, y resultado ordenado." +msgid "Identifier of the vertex that belongs to the ``component``." +msgstr "Identificador del vértice que pertenece al ``component``." -msgid "Example 2" -msgstr "Ejemplo 2" +msgid "Connecting disconnected components" +msgstr "Conectando componentes desconectados" -msgid "Making **start vids** the same as **end vids**." -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgid "wikipedia: `Connected component `__" +msgstr "wikipedia: `Componente conectado `__" -msgid "Example 3" -msgstr "Ejemplo 3" +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" -msgid "Manually assigned vertex combinations." -msgstr "Manualmente asignar combinaciones de vértices." +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contraction`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." -msgid "``pgr_aStarCost``" -msgstr "``pgr_aStarCost``" +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr "``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo A*." +msgid "Version 3.8.0" +msgstr "Versión 3.8.0" -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(Combinaciones)" +msgid "New signature:" +msgstr "Nueva firma:" -msgid "New proposed function." -msgstr "Nueva función propuesta." +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgstr "El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional con el nombre ``methods``." -msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." -msgstr "La función ``pgr_aStarCost`` suma el coste del camino más corto utilizando el algoritmo A*." +msgid "New name and order of optional parameters." +msgstr "Nuevo nombre y orden de parámetros opcionales." -msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" -msgstr "Sea el caso de que los resultados se almacenen en una tabla, el índice unico lo conformarían el par `(start_vid, end_vid)`" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "Firma obsoleta pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "For undirected graphs, the results are symmetric." -msgstr "Para grafos no dirigidos, los resultados son simétricos." +msgid "Name change from ``pgr_contractGraph``" +msgstr "Cambio de nombre de ``pgr_contractGraph``" -msgid "The returned values are ordered in ascending order:" -msgstr "Loas valores regresandos son ordenados en orden ascendente:" +msgid "Bug fixes" +msgstr "Correcciones" -msgid "`start_vid` ascending" -msgstr "`start_vid` ascendente" +msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." +msgstr "La contracción reduce el tamaño del grafo eliminando algunos de los vértices y aristas, también por ejemplo, podría agregar aristas que representan una secuencia de aristas originales disminuyendo el tiempo total y el espacio utilizados en los algoritmos de grafo." -msgid "`end_vid` ascending" -msgstr "`end_vid` ascendente" +msgid "Does not return the full contracted graph." +msgstr "No devuelve el grafo contraído completo." -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +msgid "Only changes on the graph are returned." +msgstr "Solo se devuelven los cambios en el grafo." -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgid "The returned values include:" +msgstr "Los valores devueltos incluyen:" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgid "The new edges generated by linear contraction." +msgstr "Las nuevas aristas generadas por la contracción lineal." -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "The modified vertices generated by dead end contraction." +msgstr "Los vértices modificados por contracción sin salida." -msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgid "The returned values are ordered as follows:" +msgstr "Los valores devueltos se ordenan de la siguiente manera:" -msgid "Returns set of |matrix-result|" -msgstr "Regresa el conjunto de |matrix-result|" +msgid "column ``id`` ascending when its a modified vertex." +msgstr "columna ``id`` ascendente cuando es un vértice modificado." -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [opciones])" +msgid "column ``id`` with negative numbers descending when its a new edge." +msgstr "columna ``id`` con números negativos descendentes cuando es una nueva arista." -msgid "``pgr_aStarCostMatrix``" -msgstr "``pgr_aStarCostMatrix``" +msgid "Currently there are two types of contraction methods included in this function:" +msgstr "Actualmente hay dos tipos de métodos de contracción incluidos en esta función:" -msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." -msgstr "``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_aStar`." +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgstr "Contracción sin salida. Véase :doc:`pgr_contractionDeadEnd`." -msgid "Using internally the :doc:`pgr_aStar` algorithm" -msgstr "Uso interno del algoritmo :doc:`pgr_aStar`" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgstr "" -msgid "Returns a cost matrix." -msgstr "Devuelve una matriz de costes." +msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgstr "pgr_contraction(`SQL de aristas`_, [**opciones**])" -msgid "No ordering is performed" -msgstr "No se realiza ningún pedido" +msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgstr "**opciones:** ``[directed, methods, cycles, forbidden]``" -msgid "let `v` and `u` are nodes on the graph:" -msgstr "Sean `v` y `u` nodos en el grafo:" +msgid "Returns set of |result-contract|" +msgstr "Regresa conjunto de |result-contract|" -msgid "when there is no path from `v` to `u`:" -msgstr "cuando no hay ruta de `v` a `u`:" +msgid "Dead end and linear contraction in that order on an undirected graph." +msgstr "Hacer una contracción de callejón sin salida y una contracción lineal en ese orden en un grafo no dirigido." -msgid "cost from `v` to `u` is :math:`\\inf`" -msgstr "costo de `v` a `u` es :math:`\\inf`" +msgid "Contraction optional parameters" +msgstr "Parámetros opcionales de Contracción" -msgid "when :math:`v = u` then" -msgstr "cuando :math:`v = u` entonces" +msgid "``methods``" +msgstr "``methods``" -msgid "cost from `v` to `u` is :math:`0`" -msgstr "costo de `v` a `u` es :math:`0`" +msgid "``INTEGER[]``" +msgstr "``INTEGER[]``" -msgid "When the graph is **undirected** the cost matrix is symmetric" -msgstr "Cuando el grafo es **no dirigido**, la matriz de costes es simétrica" +msgid "``ARRAY[1,2]``" +msgstr "``ARRAY[1,2]``" -msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_aStarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" +msgid "Ordered contraction operations." +msgstr "Operaciones de contracción ordenadas." -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" -msgstr "Matriz simétrica de costes para los vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido** usando la heurística :math:`2`" +msgid "1 = Dead end contraction" +msgstr "1 = Contracción sin salida" -msgid "Use with :doc:`pgr_TSP`" -msgstr "Uso con :doc:`pgr_TSP`" +msgid "2 = Linear contraction" +msgstr "2 - Contracción lineal" -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "``cycles``" +msgstr "``cycles``" -msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." -msgstr "``pgr_articulationPoints`` - Devuelve los puntos de articulación de un grafo no dirigido." +msgid ":math:`1`" +msgstr ":math:`1`" -msgid "Result columns change: ``seq`` is removed" -msgstr "Cambio de columnas de resultados: ``seq`` se elimina" +msgid "Number of times the contraction methods will be performed." +msgstr "Número de veces que se realizarán las operaciones de contracción." -msgid "Version 2.5.0" -msgstr "Versión 2.5.0" +msgid "``forbidden``" +msgstr "``forbidden``" -msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." -msgstr "Los vértices que pertenecen a más de un componente biconectado se denominan puntos de articulación o, equivalentemente, corte de vértices. Los puntos de articulación son vértices cuya eliminación aumentaría el número de componentes conectados en el grafo. Esta implementación solo se puede utilizar con un grafo no dirigido." +msgid "``BIGINT[]``" +msgstr "``BIGINT[]``" -msgid "Works for **undirected** graphs." -msgstr "Funciona para grafos **no dirigidos**." +msgid "``ARRAY[]::BIGINT[]``" +msgstr "``ARRAY[]::BIGINT[]``" -msgid "``node`` ascending" -msgstr "``node`` ascendente" +msgid "Identifiers of vertices forbidden for contraction." +msgstr "Identificadores de vértices prohibidos para contracción." -msgid "Running time: :math:`O(V + E)`" -msgstr "Tiempo de ejecución: :math:`O(V + E)`" +msgid "The function returns a single row. The columns of the row are:" +msgstr "La función devuelve una sola fila. Las columnas de la fila son:" -msgid "pgr_articulationPoints(`Edges SQL`_)" -msgstr "pgr_articulationPoints(`SQL de aristas`_)" +msgid "``type``" +msgstr "``type``" -msgid "Returns set of |result-node|" -msgstr "Regresa conjunto de |result-node|" +msgid "Type of the row." +msgstr "Tipo de la fila." -msgid "The articulation points of the graph" -msgstr "Los puntos de articulación del grafo" +msgid "``v`` when the row is a vertex." +msgstr "``v`` cuando la fila es un vértice." -msgid "Nodes in red are the articulation points." -msgstr "Nodos en rojo son los puntos de articulación." +msgid "Column ``id`` has a positive value." +msgstr "Columna ``id`` tiene valor positivo." -msgid "Identifier of the vertex." -msgstr "Identificador del vértice." +msgid "``e`` when the row is an edge." +msgstr "``e`` cuando la fila es una arista." -msgid "`Boost: Biconnected components & articulation points `__" -msgstr "`Boost: Componentes biconectados y puntos de articulación `__" +msgid "Column ``id`` has a negative value." +msgstr "Columna ``id`` tiene valor negativo." -msgid "wikipedia: `Biconnected component `__" -msgstr "wikipedia: `Componentes biconnectados `__" +msgid "All numbers on this column are ``DISTINCT``" +msgstr "Todos los números de esta columna son ''DISTINTOS''" -msgid "``pgr_bandwidth`` - Experimental" -msgstr "``pgr_bandwidth`` - Experimental" +msgid "When ``type`` = **'v'**." +msgstr "En caso de ``type`` = **'v'**." -msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" -msgstr "" +msgid "Identifier of the modified vertex." +msgstr "Identificador del vértice modificado." -msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." -msgstr "" +msgid "When ``type`` = **'e'**." +msgstr "En caso de ``type`` = **'e'**." -msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" -msgstr "" +msgid "Decreasing sequence starting from **-1**." +msgstr "Disminución de la secuencia a partir de **-1**." -msgid "The bandwidth is the maximum of all these distances" -msgstr "" +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgstr "Representando un pseudo `id` como no incorporado en el conjunto de aristas originales." -msgid "The implementation is for undirected graphs" -msgstr "La implementación es para grafos no dirigidos" +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" -msgid "Run time is 0.160789 seconds" -msgstr "" +msgid "Array of contracted vertex identifiers." +msgstr "Arreglo de identificadores de vértices contraídos." -msgid "pgr_bandwidth(`Edges SQL`_)" -msgstr "pgr_bandwidth(`SQL de aristas`_)" +msgid "When ``type`` = **'v'**: :math:`-1`" +msgstr "En caso de ``type`` = **'v'**: :math:`-1`" -msgid "Returns ``BIGINT``" -msgstr "Devuelve ``BIGINT``" +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgstr "En caso de ``type`` = **'e'**: Identificador del vétice de la arista actual (``source``, ``target``)." -msgid "For an undirected graph with edges." -msgstr "Para un grafo no dirigido con aristas." +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgstr "En caso de ``type`` = **'e'**: Identificador del vértice objetivo de la arista actual (``source``, ``target``)." -msgid "Returns a bigint ``(pgr_bandwidth)``" -msgstr "Devuelve un bigint ``(pgr_bandwidth)``" +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgstr "En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, ``target``)." -msgid "``pgr_bandwidth``" -msgstr "``pgr_bandwidth``" +msgid "Only dead end contraction" +msgstr "Sólo contracción sin salida" -msgid "gives the bandwidth of the graph." -msgstr "da el ancho de banda del grafo." +msgid "Only linear contraction" +msgstr "Sólo contracción lineal" -msgid "Undirected graph with edges before optimization." -msgstr "Grafo no dirigido con aristas antes de la optimización." +msgid "The cycle" +msgstr "El ciclo" -msgid "Undirected graph with edges after optimization." -msgstr "Grafo no dirigido con aristas tras la optimización." +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgstr "Contraer un grafo se puede hacer con más de una operación. El orden de las operaciones afecta al grafo contraído resultante, después de aplicar una operación, el conjunto de vértices que se pueden contraer con otra operación cambia." -msgid "`Boost: bandwidth `_" -msgstr "`Boost: bandwidth `_" +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgstr "Esta implementación cicla `` cycles`` veces a través de los ``methods``." -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +msgid "Contracting sample data" +msgstr "Contracción de los datos de muestra" -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstar`` — Devuelve la ruta más corta usando el algoritmo Bidireccional A*." +msgid "In this section, building and using a contracted graph will be shown by example." +msgstr "En esta sección, la creación y el uso de un grafo contraído se mostrarán en el ejemplo." -msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_bdAstar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." +msgid "The :doc:`sampledata` for an undirected graph is used" +msgstr "Se usa :doc:`sampledata` para un grafo no dirigido" -msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." -msgstr "pgr_bdAstar(Uno a Muchos) ha añadido la columna ``end_vid``." +msgid "a dead end operation first followed by a linear operation." +msgstr "una operación sin salida primero seguida de una operación lineal." -msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." -msgstr "pgr_bdAstar(Muchos a Uno) ha añadido la columna ``start_vid``." +msgid "Construction of the graph in the database" +msgstr "Construcción del grafo en la base de datos" -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(Combinaciones)" +msgid "The original graph:" +msgstr "El grafo original:" -msgid "pgr_bdAstar(One to Many)" -msgstr "pgr_bdAstar(Uno a Muchos)" +msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." +msgstr "Los resultados no representan al grafo contraído. Representan los cambios que necesitan hacerse en el grafo después de aplicar los métodos de contracción." -msgid "pgr_bdAstar(Many to One)" -msgstr "pgr_bdAstar(Muchos a Uno)" +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgstr "Observe que los vértices, por ejemplo, :math:`6` , no aparecen en los resultados porque no se vieron afectados por el algoritmo de contracción." -msgid "pgr_bdAstar(Many to Many)" -msgstr "pgr_bdAstar(Muchos a Muchos)" +msgid "After doing the dead end contraction operation:" +msgstr "Después de realizar la operación de contracción sin salida:" -msgid "Signature change on pgr_bdAstar(One to One)" -msgstr "Cambio de firma en pgr_bdAstar(Uno a Uno)" +msgid "After doing the linear contraction operation to the graph above:" +msgstr "Después de hacer la operación de contracción lineal al grafo anterior:" -msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" -msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_bdAStar(Uno a Uno) en el:" +msgid "The process to create the contraction graph on the database:" +msgstr "El proceso para crear el grafo de contracción en la base de datos:" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +msgid "Add additional columns" +msgstr "Añadir columnas adicionales" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" +msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgid "Column." +msgstr "Columna." -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "The vertices set belonging to the vertex/edge" +msgstr "El conjunto de vértices que pertenecen al vértice/arista" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgid "``is_contracted``" +msgstr "``is_contracted``" -msgid "``pgr_bdAstarCost``" -msgstr "``pgr_bdAstarCost``" +msgid "On the vertex table" +msgstr "En la tabla de vértices" -msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el algoritmo bidireccional A*." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgstr "En caso de ''true'' se contrae el vértice, no forma parte del grafo contraído." -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(Combinaciones)" +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgstr "En caso de ''false'' el vértice no se contrae, su parte del grafo contraído." -msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." -msgstr "La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando el algoritmo bidireccional A*." +msgid "``is_new``" +msgstr "``is_new``" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +msgid "On the edge table" +msgstr "En la tabla de aristas" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgstr "En caso de `` true``, la arista se generó por el algoritmo de contracción. Es parte del grafo contraído." -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgstr "En caso de ``false`` , la arista es una arista original, podría ser o no parte del grafo contraído." -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "Store contraction information" +msgstr "Almacenar información de contracción" -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgid "Store the contraction results in a table." +msgstr "Almacenar los resultados de la contracción en una tabla." -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +msgid "Update the edges and vertices tables" +msgstr "Actualizar las tablas de aristas y vértices" -msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." -msgstr "``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_bdAstar`." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgstr "Usar la columna ``is_contracted`` para indicar los vértices contraídos." -msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." -msgstr "Internamente utiliza el algoritmo :doc:`pgr_bdAstar`." +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgstr "Llenar ``contracted_vertices`` con la información de los resultados que pertenecen a los vértices." -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_bdAstarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" +msgid "Insert the new edges generated by pgr_contraction." +msgstr "Inserte las nuevas aristas generadas por pgr_contraction." -msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." -msgstr "``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo Bidireccional de Dijkstra." +msgid "The contracted graph" +msgstr "El grafo contraído" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(Combinaciones)" +msgid "Vertices that belong to the contracted graph." +msgstr "Vértices que pertenecen al grafo contraído." -msgid "pgr_bdDijkstra(One to Many)" -msgstr "pgr_bdDijkstra(Uno a Muchos)" +msgid "Edges that belong to the contracted graph." +msgstr "Aristas que pertenecen al grafo contraído." -msgid "pgr_bdDijkstra(Many to One)" -msgstr "pgr_bdDijkstra(Muchos a Uno)" +msgid "Visually:" +msgstr "Visualmente:" -msgid "pgr_bdDijkstra(Many to Many)" -msgstr "pgr_bdDijkstra(Muchos a Muchos)" +msgid "Using the contracted graph" +msgstr "Usando el grafo contraído" -msgid "Signature change on pgr_bdDijkstra(One to One)" -msgstr "Cambio de firma en pgr_bdDijsktra(Uno a Uno)" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgstr "Hay tres casos al calcular la ruta más corta entre un origen y un destino determinados en un grafo contraído:" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "Case 1: Both source and target belong to the contracted graph." +msgstr "Caso 1: Tanto el origen como el destino pertenecen al grafo contraído." -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "Case 2: Source and/or target belong to an edge subgraph." +msgstr "Caso 2: El origen y/o el destino pertenecen a un subgrafo de aristas." -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "Case 3: Source and/or target belong to a vertex." +msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice." -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "The final application should consider all of those cases." +msgstr "" -msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" -msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo **dirigido**" +msgid "Create a view (or table) of the contracted graph:" +msgstr "Crear una vista (o tabla) del grafo Contraído:" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" -msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **dirigido**" +msgid "Create the function that will use the contracted graph." +msgstr "Crear la función que va a utilizar el grafo contraído." -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" -msgstr "De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo **dirigido**" +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgstr "Caso 2: El origen y/o el destino pertenecen a una arista que ha contraído vertices." -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" -msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**" +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice que ha sido contraído." -msgid "Using a combinations table on an **undirected** graph" -msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**" +msgid "``pgr_contractionDeadEnd`` - Proposed" +msgstr "``pgr_contractionDeadEnd`` - Propuesto" -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" -msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionDeadEnd`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +msgid "A node is considered a dead end node when:" +msgstr "Un nodo se considera sin salida cuando:" -msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." -msgstr "``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando el algoritmo Bidireccional de Dijkstra." +msgid "On undirected graphs:" +msgstr "En grafos no dirigidos:" -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(Combinaciones)" +msgid "The number of adjacent vertices is 1." +msgstr "El número de vértices adyacentes es 1." -msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." -msgstr "La función ``pgr_bdDijkstraCost`` suma el costo de la ruta más corta utilizando el algoritmo de bidirecional de Dijkstra." +msgid "On directed graphs:" +msgstr "En grafos dirigidos:" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "When there is only one adjacent vertex or" +msgstr "Cuando hay solo un vértice adyacente o" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "When all edges are incoming regardless of the number of adjacent vertices." +msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" -msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionDeadEnd(`SQL de aristas`_, [**opciones**])" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "**options:** ``[directed, forbidden]``" +msgstr "**opciones:** ``[directed, forbidden]``" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [ ``directed``])" +msgid "Dead end contraction on an undirected graph." +msgstr "Contracción de vértice sin salida en un grafo no dirigido." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "The green nodes are dead end nodes." +msgstr "Los nodos verdes son nodos sin salida." -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgstr "El nodo :math:`3` es sin salida después de haberse contraído el nodo :math:`1`." -msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." -msgstr "``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_bdDijkstra`." +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" -msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." -msgstr "Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una matriz de costos." +msgid "**Empty**" +msgstr "**vacío**" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_bdDijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" +msgid "Value = ``e`` indicating the row is an edge." +msgstr "Valor = ``e`` cuando la fila es una arista." -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" -msgstr "Matriz de costos simétrica para vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido**" +msgid "A pseudo `id` of the edge." +msgstr "Un pseudo `identificador` de la arista." -msgid "Use with :doc:`pgr_TSP`." -msgstr "Usar con :doc:`pgr_TSP`." +msgid "Identifier of the source vertex of the current edge." +msgstr "Identificador del vértice de origen de la arista actual." -msgid "``pgr_bellmanFord`` - Experimental" -msgstr "``pgr_bellmanFord`` - Experimental" +msgid "Identifier of the target vertex of the current edge." +msgstr "Identificador del vértice destino de la arista actual." -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." -msgstr "``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-Ford." +msgid "Weight of the current edge." +msgstr "Peso de la arista actual." -msgid "pgr_bellmanFord(Combinations)" -msgstr "pgr_bellmanFord(Combinaciones)" +msgid "Dead end vertex on undirected graph" +msgstr "Vértice sin salida en un grafo sin dirigir" -msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." -msgstr "El algoritmo de Bellman-Ford, lleva el nombre de Richard Bellman y Lester Ford, quienes lo publicaron por primera vez en 1958 y 1956, respectivamente. Es un algoritmo de búsqueda de grafos que calcula las rutas más cortas desde un vértice inicial (``start_vid``) hasta un vértice final (``end_vid``) en un grafo donde algunos de los pesos de borde pueden ser números negativos. Aunque es más versátil, es más lento que el algoritmo de Dijkstra/ Esta implementación se puede utilizar con un grafo dirigido y un grafo no dirigido." +msgid "They have only one adjacent node." +msgstr "" -msgid "Process is valid for edges with both positive and negative edge weights." -msgstr "El proceso es válido para aristas con grosores de arista positivos y negativos." +msgid "Dead end vertex on directed graph" +msgstr "Vértice sin salida en un grafo dirigido" -msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." -msgstr "Cuando el vértice inicial y el vértice final son los mismos, no hay ruta. El agg_cost sería :math:`0`." +msgid "The green nodes are dead end nodes" +msgstr "Los nodos verdes son nodos sin salida" -msgid "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." -msgstr "Cuando el vértice inicial y el vértice final son diferentes, y existe una ruta entre ellos sin tener un *ciclo negativo*. El agg_cost sería un valor finito que indica la distancia más corta entre ellos." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgstr "Los nodos azules tienen un número ilimitado de aristas entrantes y/o salientes." -msgid "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." -msgstr "Cuando el vértice inicial y el vértice final son diferentes y existe una ruta entre ellos, pero contiene un *ciclo negativo*. En tal caso, agg_cost para esos vértices siguen disminuyendo además, por lo tanto agg_cost no se puede definir para ellos." +msgid "Node" +msgstr "Nodo" -msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." -msgstr "Cuando el vértice inicial y el vértice final son diferentes y no hay ruta. El agg_cost es :math:`\\infty`." +msgid "Adjacent nodes" +msgstr "Nodos adyacentes" -msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." -msgstr "Para fines de optimización, se ignora cualquier valor duplicado en `start_vids` o `end_vids`." +msgid "Dead end" +msgstr "Sin salida" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" -msgstr "Tiempo de ejecución :math:`O(| start\\_vids | * ( V * E))`" +msgid "Reason" +msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid ":math:`6`" +msgstr ":math:`6`" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid ":math:`\\{1\\}`" +msgstr ":math:`\\{1\\}`" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "Yes" +msgstr "Si" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "Has only one adjacent node." +msgstr "Solo tiene un nodo adyacente." -msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bellmanFord(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid ":math:`7`" +msgstr ":math:`7`" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" -msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido" +msgid ":math:`\\{2\\}`" +msgstr ":math:`\\{2\\}`" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" -msgstr "De los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo dirigido" +msgid ":math:`8`" +msgstr ":math:`8`" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" -msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo no dirigido" +msgid ":math:`\\{2, 3\\}`" +msgstr ":math:`\\{2, 3\\}`" -msgid "Using a combinations table on an undirected graph" -msgstr "Usando una tabla de combinaciones en un grafo no dirigido" +msgid "Has more than one adjacent node and all edges are incoming." +msgstr "" -msgid "`Boost: Bellman Ford `__" -msgstr "`Boost: Bellman Ford `__" +msgid ":math:`\\{4\\}`" +msgstr ":math:`\\{4\\}`" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid ":math:`10`" +msgstr ":math:`10`" -msgid "``pgr_betweennessCentrality`` - Experimental" -msgstr "``pgr_betweennessCentrality`` - Experimental" +msgid ":math:`\\{4, 5\\}`" +msgstr ":math:`\\{4, 5\\}`" -msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" -msgstr "``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa mediante el algoritmo de Brandes" +msgid "No" +msgstr "No" -msgid "Version 3.7.0" -msgstr "Versión 3.7.0" +msgid "Has more than one adjacent node and all edges are outgoing." +msgstr "" -msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." -msgstr "El algoritmo Brandes aprovecha los grafos dispersos para evaluar la puntuación de centralidad intermedia de todos los vértices." +msgid ":math:`1,2,3,4,5`" +msgstr ":math:`1,2,3,4,5`" -msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." -msgstr "La centralidad de interrelación mide hasta qué punto un vértice se encuentra en las rutas más cortas entre todos los demás pares de vértices. Los vértices con una alta centralidad entre pares pueden tener una influencia considerable en una red gracias a su control sobre los caminos más cortos que pasan entre ellos." +msgid "Many adjacent nodes." +msgstr "Muchos nodos adyacentes." -msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." -msgstr "La eliminación de estos vértices afectará a la red al perturbarla, ya que la mayoría de los caminos más cortos entre vértices pasan por ellos." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." +msgstr "" -msgid "This implementation work for both directed and undirected graphs." -msgstr "Esta implementación funciona tanto para grafos dirigidos como no dirigidos." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgstr "De arriba, nodes :math:`\\{6, 7, 9\\}` son sin salida por que el número de vértices adyacentes es 1." -msgid "Running time: :math:`\\Theta(VE)`" -msgstr "Tiempo de ejecución: :math:`\\Theta(VE)`" +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." +msgstr "" -msgid "Running space: :math:`\\Theta(VE)`" -msgstr "Espacio de ejecución: :math:`\\Theta(VE)`" +msgid "Step by step dead end contraction" +msgstr "Paso a paso contracción sin salida" -msgid "Throws when there are no edges in the graph" -msgstr "Lanza cuando no hay aristas en el grafo" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgstr "La contracción sin salida se detendrá hasta que no haya más nodos sin salida. Por ejemplo, del siguiente grafo donde :math:`3` es el nodo sin salida:" -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgstr "pgr_betweennessCentrality(`SQL de aristas`_, [``directed``])" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgstr "Después de contraer :math:`3`, el nodo ` :math:`2` es ahora un nodo sin salida y es contraído:" -msgid "Returns set of ``(vid, centrality)``" -msgstr "Regresa el conjunto de ``(vid, centrality)``" +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgstr "Después de contraer :math:`2`, detener. El nodo :math:`1` tiene la información de los nodos que se contraen." -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "Para un grafo dirigido con aristas :math:`\\{1, 2, 3, 4\\}`." +msgid "Creating the contracted graph" +msgstr "Creando el grafo contraído" -msgid "Explanation" -msgstr "Explicación" +msgid "Steps for the creation of the contracted graph" +msgstr "Pasos para la creación del grafo contraído" -msgid "The betweenness centrality are between parenthesis." -msgstr "La centralidad intermedia está entre paréntesis." +msgid "Add additional columns." +msgstr "Añadir columnas adicionales." -msgid "The leaf vertices have betweenness centrality :math:`0`." -msgstr "Los vértices de las hojas tienen una centralidad intermedia :math:`0`." +msgid "Save results into a table." +msgstr "Almacenar los resultados en una tabla." -msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." -msgstr "La centralidad de entrecruzamiento del vértice :math:`6` es mayor que la del vértice :math:`10`." +msgid "The contracted vertices are not part of the contracted graph." +msgstr "Los vértices contraído no forman parte del grafo contraído." -msgid "Removing vertex :math:`6` will create three graph components." -msgstr "Al eliminar el vértice :math:`6` se crearían tres componentes." +msgid "Using when departure and destination are in the contracted graph" +msgstr "Usando cuando la salida como el destino pertenecen al grafo contraído" -msgid "Removing vertex :math:`10` will create two graph components." -msgstr "Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." +msgid "Using when departure/destination is not in the contracted graph" +msgstr "Usando cuando la salida /destino no pertenecen al grafo contraído" -msgid "``vid``" -msgstr "``vid``" +msgid "Using when departure and destination are not in the contracted graph" +msgstr "Usando cuando la salida y el destino no están en el grafo contraído" -msgid "``centrality``" -msgstr "``centrality``" +msgid "``pgr_contractionHierarchies`` - Experimental" +msgstr "``pgr_contractionHierarchies`` - Experimental" -msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" -msgstr "Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])" +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgstr "``pgr_contractionHierarchies`` - Realiza la contracción del grafo según el método de jerarquías de contracción y devuelve los vértices contraídos y las aristas de acceso directo creadas." -msgid "`Boost: betweenness centrality `_" -msgstr "`Boost: Centralidad de intermediación `__" +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgstr "" -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgstr "" -msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." -msgstr "``pgr_biconnectedComponents`` — Componentes biconectados de un grafo no dirigido." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgstr "" -msgid "Result columns change:" -msgstr "Las columnas de resultados cambian:" +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgstr "" -msgid "``n_seq`` is removed" -msgstr "``n_seq`` se elimina" +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgstr "" -msgid "``seq`` changed type to ``BIGINT``" -msgstr "``seq`` cambió el tipo a ``BIGINT``'" +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgstr "" -msgid "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." -msgstr "Los componentes biconectados de un grafo no dirigido son los subconjuntos máximos de vértices de modo que la eliminación de un vértice de un componente determinado no desconectará el mismo. A diferencia de los componentes conectados, los vértices pueden pertenecer a varios componentes biconectados. Los vértices pueden estar presentes en varios componentes biconectados, pero cada arista solo puede estar contenida en un único componente biconectado." +msgid "The process is done on graphs having only edges with positive costs." +msgstr "El proceso se realiza en grafos que sólo tienen aristas con costos positivos." -msgid "Components are described by edges." -msgstr "Los componentes se describen mediante aristas." +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgstr "" -msgid "``component`` ascending." -msgstr "``componente`` ascendente." +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgstr "" -msgid "``edge`` ascending." -msgstr "``edge`` ascendente." +msgid "added shortcut edges, with negative identifiers;" +msgstr "" -msgid "pgr_biconnectedComponents(`Edges SQL`_)" -msgstr "pgr_biconnectedComponents(`SQL de aristas`_)" +msgid "contracted nodes with an order." +msgstr "" -msgid "Returns set of |result-component-E|" -msgstr "Regresa conjunto de |result-component-E|" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" +msgstr "La función ``pgr_contractionHierarchies`` tiene la siguiente firma:" -msgid "The biconnected components of the graph" -msgstr "Los componentes biconectados del grafo" +msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionHierarchies(`SQL de aristas`_, [**opciones**])" -msgid "``component``" -msgstr "``component``" +msgid "Returns set of |result-contraction-hierarchies|" +msgstr "Devuelve el conjunto de |result-contraction-hierarchies|" -msgid "Component identifier." -msgstr "Identificador de componente." +msgid "Contraction hierarchies optional parameters" +msgstr "Parámetros opcionales de las jerarquías de contracción" -msgid "Has the value of the minimum edge identifier in the component." -msgstr "Contiene el identificador mínimo de arista en el componente." - -msgid "Identifier of the edge that belongs to the ``component``." -msgstr "Identificador de arista que pertenece a ``component``." +msgid "True if the graph is directed, False otherwise." +msgstr "True si el grafo es dirigido, False en caso contrario." -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" +msgstr "La función devuelve muchas filas (una por vértice y una por cada atajo de arista creada). Las columnas de las filas son:" -msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." -msgstr "``pgr_binaryBreadthFirstSearch`` - Devuelve el camino más corto en un grafo binario." +msgid "Type of the ``id``." +msgstr "Tipo del ``id``." -msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." -msgstr "Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' es un entero no negativo, se le llama 'grafo binario'." +msgid "Column ``id`` has a positive value" +msgstr "Columna ``id`` tiene valor positivo" -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" +msgid "Column ``id`` has a negative value" +msgstr "Columna ``id`` tiene valor negativo" -msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." -msgstr "Es bien sabido que los caminos más cortos entre un único origen y todos los demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. También se puede interpretar este grafo como un grafo ponderado, en el que cada arista tiene el peso :math:`1`. Si no todas las aristas del grafo tienen el mismo peso, se necesita un algoritmo más general, como el Algoritmo de Dijkstra, que se ejecuta en tiempo :math:`O(|E|log|V|)`." +msgid "``metric``" +msgstr "``metric``" -msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." -msgstr "Sin embargo, si los pesos están más restringidos, podemos usar un algoritmo más rápido. Este algoritmo, llamado 'búsqueda binaria de primero profundidad' así como '0-1 BFS', es una variación del problema estándar de búsqueda de primero profundidad para resolver el problema SSSP (ruta más corta de una sola fuente) en :math:`O(|E|)`, si los pesos de cada arista pertenecen al conjunto de caracteres de {0,X}, donde 'X' es cualquier entero no negativo." +msgid "``vertex_order``" +msgstr "``vertex_order``" -msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" -msgstr "El proceso se realiza sólo en 'grafos binarios'. ('Grafo binario': Cualquier grafo cuyos pesos de aristas pertenezcan al conjunto {0, X}, donde 'X' es cualquier entero real no negativo.)" +msgid "On an undirected graph" +msgstr "En un grafo no dirigido" -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" -msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * |E|)`" +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." +msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "building contraction hierarchies on the whole graph" +msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "After computing the contraction hierarchies, an order is now given to the vertices," +msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "We obtain the contracted graph above:" +msgstr "Se obtiene el grafo contraído anterior:" -msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" -msgstr "**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los mismos (i.e :math:`1``)" +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." +msgstr "" -msgid "`Boost: Breadth First Search `__" -msgstr "`Boost: Primera búsqueda en amplitud `__" +msgid "On an undirected graph with forbidden vertices" +msgstr "En un grafo no dirigido con vértices prohibidos" -msgid "https://cp-algorithms.com/graph/01_bfs.html" -msgstr "https://cp-algorithms.com/graph/01_bfs.html" +msgid "building contraction with a set of forbidden vertices" +msgstr "construir la contracción en un conjunto de nodos prohibidos" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "Contraction process steps details" +msgstr "Detalles de los pasos del proceso de contracción" -msgid "``pgr_bipartite`` - Experimental" -msgstr "``pgr_bipartite`` - Experimental" +msgid "Shortcut building process" +msgstr "Proceso de construcción de atajos" -msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." -msgstr "``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el mismo conjunto son adjacentes." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgstr "" -msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." -msgstr "Un grafo bipartito es un grafo con dos conjuntos de vértices que están conectados entre sí, pero no dentro de sí mismos. Un gráfico bipartito es posible si el color del gráfico es posible utilizando dos colores, de modo que los vértices de un conjunto se colorean con el mismo color." +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgstr "" -msgid "The algorithm works in undirected graph only." -msgstr "El algoritmo solo funciona en un grafo no dirigido." +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgstr "" -msgid "The returned values are not ordered." -msgstr "Los valores devueltos no están ordenados." +msgid "Initialize the queue with a first vertices order" +msgstr "" -msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." -msgstr "El algoritmo comprueba si el grafo es bipartito o no. Si es bipartito entonces devuelve el nodo junto con dos colores `0` y `1` que representan dos conjuntos diferentes." +msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" +msgstr "" -msgid "If graph is not bipartite then algorithm returns empty set." -msgstr "Si el grafo no es bipartito, el algoritmo devuelve un conjunto vacío." +msgid ":math:`v`" +msgstr ":math:`v`" -msgid "pgr_bipartite(`Edges SQL`_)" -msgstr "pgr_bipartite(`SQL de aristas`_)" +msgid ":math:`\\{p, r, u\\}`" +msgstr ":math:`\\{p, r, u\\}`" -msgid "When the graph is bipartite" -msgstr "Cuando el grafo es bi-partido" +msgid ":math:`p`" +msgstr ":math:`p`" -msgid "Additional Example" -msgstr "Ejemplo Adicional" +msgid ":math:`\\{u, v\\}`" +msgstr ":math:`\\{u, v\\}`" -msgid "The odd length cyclic graph can not be bipartite." -msgstr "El gráfico cíclico de longitud impar no puede ser bipartito." +msgid ":math:`u`" +msgstr ":math:`u`" -msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." -msgstr "La arista :math:`5 \\rightarrow 1` hace que el sub-grafo con vértices:math:`\\{1, 3, 7, 6, 5\\}` se un grafo de ciclo impar, ya que ciclo tiene 5 vértices." +msgid ":math:`\\{p, v, w\\}`" +msgstr ":math:`\\{p, v, w\\}`" -msgid "Edges in blue represent odd length cycle subgraph." -msgstr "Aristas en azul representan un grafo de ciclo impar." +msgid ":math:`r`" +msgstr ":math:`r`" -msgid "`Boost: is_bipartite `__" -msgstr "`Boost: es bipartido `__" +msgid ":math:`\\{v, w\\}`" +msgstr ":math:`\\{v, w\\}`" -msgid "`Wikipedia: bipartite graph `__" -msgstr "`Wikipedia: grafo bipartito `__" +msgid ":math:`w`" +msgstr ":math:`w`" -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +msgid ":math:`\\{r, u\\}`" +msgstr ":math:`\\{r, u\\}`" -msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." -msgstr "``pgr_boykovKolmogorov`` — Calcula el flujo en las aristas del grafo que maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo Boykov Kolmogorov." +msgid "Adjacent edges are removed." +msgstr "" -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov(Combinaciones)" +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgstr "" -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" -msgstr "Renombrado de ``pgr_maxFlowBoykovKolmogorov``" +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgstr "" -msgid "Function promoted to proposed." -msgstr "Función promovida a propuesta." +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgstr "" -msgid "Running time: Polynomial" -msgstr "Tiempo de ejecución: Polinomio" +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." +msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destino**)" +msgid "Build the final vertex order" +msgstr "Construir el orden final de los vértices" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destinos**)" +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destino**)" +#, fuzzy +msgid "Add shortcuts to the initial graph" +msgstr "corte mínimo de el subgrafo principal" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destinos**)" +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, `SQL de combinaciones`_)" +#, fuzzy +msgid "Use the contraction" +msgstr "Contracción sin salida" -msgid "Returns set of |result-flow|" -msgstr "Regresa el conjunto de |result-flow|" +#, fuzzy +msgid "Build the contraction" +msgstr "Contracción sin salida" -msgid "From vertex :math:`11` to vertex :math:`12`" -msgstr "Del vértice :math:`11` al vértice :math:`12`" +msgid "Add shortcuts and hierarchy in the existing tables" +msgstr "" -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "Desde el vértice :math:`11` a los vértices :math:`\\{5, 10, 12\\}`" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" +msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" -msgstr "De los vértices vertices :math:`\\{11, 3, 17\\}` al vértice :math:`12`" +msgid "Update and insert the results in the two tables." +msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}`" +msgid "Use a Dijkstra shortest path algorithm on it" +msgstr "Aplicarle el algoritmo Dijkstra del camino más corto" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." -msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}`." +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgstr "" -msgid "`Boost: Boykov Kolmogorov max flow `__" -msgstr "`Boost: Flujo máximo Boykov Kolmogorov `__" +msgid "``pgr_contractionLinear`` - Proposed" +msgstr "``pgr_contractionLinear`` - Propuesto" -msgid "``pgr_breadthFirstSearch`` - Experimental" -msgstr "``pgr_breadthFirstSearch`` - Experimental" +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." -msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." -msgstr "``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante el algoritmo Breadth First Search." +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionLinear(`SQL de aristas`_, [**opciones**])" -msgid "Version 4.0.0:" -msgstr "Versión 4.0.0:" +msgid "Linear contraction on an undirected graph." +msgstr "Contracción lineal en un grafo no dirigido." -msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." -msgstr "Proporciona el orden transversal de Primera Búsqueda de Amplitud desde un vértice raíz hasta una profundidad particular." +msgid "The green nodes are linear nodes and will not be part of the contracted graph." +msgstr "Los nodos verdes son lineales y no forman parte del grafo contraído." -msgid "The implementation will work on any type of graph." -msgstr "La implementación funcionará en cualquier tipo de grafo." +msgid "All edges adjacent will not be part of the contracted graph." +msgstr "Aristas adyacentes no forman parte del grafo contraído." -msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." -msgstr "Proporciona el orden de recorrido de Búsqueda de Primero Amplitud desde un nodo de origen a un nivel de profundidad objetivo." +msgid "The red lines will be new edges of the contracted graph." +msgstr "Las lineas verdes son aristas que pertenecen al grafo contraído." -msgid "Running time: :math:`O(E + V)`" -msgstr "Tiempo de ejecución: :math:`O(E + V)`" +msgid "**contraction Order**" +msgstr "**Orden de contracciones**" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raíz**, [**options**])" +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgstr "Número de veces que se realizarán las operaciones de contracción en el orden ``contraction_order``." -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raices**, [**options**])" +msgid "A node connects two (or more) `linear` edges when" +msgstr "" -msgid "**options:** ``[max_depth, directed]``" -msgstr "**opcionales:** ``[max_depth, directed]``" +msgid "The number of adjacent vertices is 2." +msgstr "El número de vértices adyacentes es 2." -msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" -msgstr "Desde el vértice raíz :math:`6` en un grafo **dirigido** con aristas en orden ascendente de ``id``" +msgid "In case of a directed graph, a node is considered a `linear` node when" +msgstr "En el caso de un grafo dirigido, un nodo se considera `lineal` cuando" -msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" -msgstr "A partir de los vértices de la raíz :math:`\\{12, 6\\}` en un grafo **no dirigido** con **profundidad** :math:`<= 2` y aristas ordenadas ascendentemente in términos de ``id``" +msgid "Linearity is symmetrical." +msgstr "La linealidad es simétrica." -msgid "DFS optional parameters" -msgstr "Parámetros opcionales de DFS" +msgid "Linearity is not symmetrical" +msgstr "La linealidad no es simétrica" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." -msgstr "Igual que `Vértice único`_ con aritas en orden ascendente de ``id``." +msgid "Graph where linearity is not symmetrical." +msgstr "Grafo cuando la linealidad no es simétrica." -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." -msgstr "Igual que `Vértice único`_ con aritas en orden descendente de ``id``." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." +msgstr "" -msgid "The resulting traversal is different." -msgstr "El recorrido resultante es diferente." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." +msgstr "" -msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." -msgstr "La imagen izquierda muestra el resultado con el orden ascendente de los ids y la imagen derecha muestra con el orden descendente de los identificadores de aristas." +msgid "The three edges can be replaced by one undirected edge" +msgstr "Las tres aristas pueden ser reemplazadas por una arista no dirigida" -msgid "|ascending| |descending|" -msgstr "|ascending| |descending|" +msgid "Edge :math:`1 - 3`." +msgstr "Arista :math:`1 - 3`." -msgid "ascending" -msgstr "ascendente" +msgid "With cost: :math:`4`." +msgstr "Con costo: :math:`4`." -msgid "descending" -msgstr "descendente" +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgstr "Vértices contraídos en la arista: :math:`\\{2\\}`." -msgid "`Wikipedia: Breadth First Search algorithm `__" -msgstr "`Wikipedia: Breadth First Search `__" +msgid "Linearity is symmetrical" +msgstr "La linealidad es simétrica" -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" +msgid "Graph where linearity is symmetrical." +msgstr "Grafo donde la linealidad es simétrica." -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." -msgstr "``pgr_bridges`` - Calcula los puentes de un grafo no dirigido." +msgid "The four edges can be replaced by two directed edges." +msgstr "Las cuatro aristas pueden ser reemplazadas con dos aristas dirigidas." -msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." -msgstr "Un puente es un borde de un grafo no dirigido cuya eliminación aumenta su número de componentes conectados. Esta implementación solo se puede utilizar con un grafo no dirigido." +msgid "Edge :math:`3 - 1`." +msgstr "Arista :math:`3 - 1`." -msgid "``edge`` ascending" -msgstr "``edge`` ascendente" +msgid "With cost: :math:`6`." +msgstr "Con costo: :math:`6`." -msgid "Running time: :math:`O(E * (V + E))`" -msgstr "Tiempo de ejecución: :math:`O(E * (V + E))`" +msgid "The four edges can be replaced by one undirected edge." +msgstr "Las cuatro aristas pueden ser reemplazadas con una arista no dirigida." -msgid "pgr_bridges(`Edges SQL`_)" -msgstr "pgr_bridges(`SQL de aristas`_)" +msgid "Step by step linear contraction" +msgstr "Contracción lineal, paso a paso" -msgid "Returns set of |result-edge|" -msgstr "Regresa conjunto de |result-edge|" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgstr "La contracción lineal se detendrá hasta que no hayan más aristas lineales. Por ejemplo, en el siguiente grafo hay aristas lineales" -msgid "The bridges of the graph" -msgstr "Los puentes del grafo" +msgid "Contracting vertex :math:`3`," +msgstr "Contrayendo el vértice :math:`3`," -msgid "Identifier of the edge that is a bridge." -msgstr "Identificador del borde que es un puente." +msgid "The vertex :math:`3` is removed from the graph" +msgstr "El vértice :math:`3` se elimina del grafo" -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "Los aristas :math:`2 \\rightarrow 3` y :math:`w \\rightarrow z` fueron eliminados del grafo." -msgid "`Boost: Connected components `__" -msgstr "`Boost: Componentes conectados `__" +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgstr "Se inserta una nuevo arista :math:`2 \\rightarrow 4` y se representa con color rojo." -msgid "``pgr_chinesePostman`` - Experimental" -msgstr "``pgr_chinesePostman`` - Experimental" +msgid "Contracting vertex :math:`2`:" +msgstr "Contrayendo el vértice :math:`2`:" -msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." -msgstr "``pgr_chinesePostman`` — Calcula la ruta de circuito más corta que contiene cada arista en un grafo dirigido y comienza y termina en el mismo vértice." +msgid "The vertex :math:`2` is removed from the graph" +msgstr "El vértice :math:`2` se elimina del grafo" -msgid "Returns ``EMPTY SET`` on a disconnected graph" -msgstr "Devuelve ``EMPTY SET`` en un grafo desconectado" +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgstr "Los aristas :math:`1 \\rightarrow 2` y :math:`2 \\rightarrow 3` son eliminados del grafo." -msgid "pgr_chinesePostman(`Edges SQL`_)" -msgstr "pgr_chinesePostman(`SQL de aristas`_)" +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgstr "Se inserta una nuevo arista :math:`1 \\rightarrow 3` y se representa con color rojo." -msgid "Returns set of |result-1-1-no-seq|" -msgstr "Regresa el conjunto de |result-1-1-no-seq|" +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." +msgstr "El arista :math:`1 \\rightarrow 3` tiene la información de los costos y nodos que fueron contraídos." -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" -msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" +msgid "Create the contracted graph." +msgstr "Crear el grafo contraído." -msgid "Sequential value starting from ``1``" -msgstr "Valor secuencial a partir de ``1``" +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "``pgr_cuthillMckeeOrdering`` - Experimental" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." -msgstr "Identificador del borde utilizado para ir del ``nodo`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta." +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" -msgid "Aggregate cost from ``start_v`` to ``node``." -msgstr "Coste agregado de ``start_v`` to ``node``." +msgid "Version 3.4.0" +msgstr "Versión 3.4.0" -msgid "``pgr_chinesePostmanCost`` - Experimental" -msgstr "``pgr_chinesePostmanCost`` - Experimental" +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgstr "En álgebra lineal numérica, el algoritmo Cuthill-McKee (CM), llamado así por Elizabeth Cuthill y James McKee, es un algoritmo para permutar una matriz dispersa que tiene un patrón de dispersidad simétrico en una forma de matriz de banda con un ancho de banda pequeño." -msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." -msgstr "``pgr_chinesePostmanCost`` — Calcula los costes mínimos de una ruta de circuito que contiene cada arista de un grafo dirigido y comienza y termina en el mismo vértice." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgstr "Básicamente, se asigna a los vértices un orden de búsqueda breadth-first, con la salvedad de que, en cada paso, los vértices adyacentes se colocan en la cola por orden creciente de grado." -msgid "Return value when the graph if disconnected" -msgstr "Valor devuelto cuando el grafo está desconectado" +msgid "The implementation is for **undirected** graphs." +msgstr "La implementación es para grafos **no dirigidos**." -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" -msgstr "pgr_chinesePostmanCost(`SQL de aristas`_)" +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "Los problemas de minimización del ancho de banda se consideran problemas NP-completos." -msgid "RETURNS ``FLOAT``" -msgstr "DEVUELVE ``FLOAT``" +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`" -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" +msgid "where :math:`|V|` is the number of vertices," +msgstr "donde :math:`|V|` es el número de vértices," -msgid "Minimum costs of a circuit path." -msgstr "Costes mínimos de una trayectoria de circuito." +msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgstr ":math:`m` es el grado máximo de los vértices en el grafo." -msgid "``pgr_connectedComponents``" -msgstr "``pgr_connectedComponents``" +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "pgr_cuthillMckeeOrdering(`SQL de aristas`_)" -msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." -msgstr "``pgr_connectedComponents`` — Componentes conectados de un grafo no dirigido mediante un enfoque basado en DFS." +msgid "Returns set of |result_node_order|" +msgstr "Regresa el conjunto de |result_node_order|" -msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." -msgstr "Un componente conectado de un gráfico no direccionado es un conjunto de vértices que son todos accesibles entre sí." +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "Ordenamiento del grafo de los :doc:`sampledata` de pgRouting" -msgid "Components are described by vertices" -msgstr "Los componentes se describen mediante vértices" +msgid "Returns set of ``(seq, node)``" +msgstr "Regresa el conjunto de ``(seq, node)``" -msgid "``component`` ascending" -msgstr "``component`` ascendente" +msgid "Sequence of the order starting from 1." +msgstr "Valor secuencial a partir de 1." -msgid "pgr_connectedComponents(`Edges SQL`_)" -msgstr "pgr_connectedComponents(`SQL de aristas`_)" +msgid "New ordering in reverse order." +msgstr "Nuevo ordenamiento es en orden inverso." -msgid "Returns set of |result-component-V|" -msgstr "Regresa conjunto de |result-component-V|" +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Ordernamiento Cuthill-McKee `__" -msgid "The connected components of the graph" -msgstr "Los componentes conectados del grafo" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Ordenamiento Cuthill-McKee `__" -msgid "Has the value of the minimum node identifier in the component." -msgstr "Continene le valor mínimo de identificador de nodo en el componente." +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimental" -msgid "Identifier of the vertex that belongs to the ``component``." -msgstr "Identificador del vértice que pertenece al ``component``." +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgstr "``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de caminos más cortos DAG implementado por Boost.Graph." -msgid "Connecting disconnected components" -msgstr "Conectando componentes desconectados" +msgid "pgr_dagShortestPath(Combinations)" +msgstr "pgr_dagShortestPath(Combinaciones)" -msgid "wikipedia: `Connected component `__" -msgstr "wikipedia: `Componente conectado `__" +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgstr "Ruta Más Corta para grafos acíclicos dirigidos (DAG) es un algoritmo de búsqueda de grafos que resuelve el problema de ruta más corta para el grafo acíclico dirigido ponderado, produciendo una ruta más corta desde un vértice inicial (``start_vid``) a un vértice final (``end_vid``)." -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgstr "Esta implementación solo se puede utilizar con un grafo **dirigido** sin ciclos i.e., es decir, un grafo acíclico dirigido." -msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contraction`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgstr "El algoritmo se basa en la ordenación topológica del dag para imponer un orden lineal en los vértices, y por lo tanto es más eficaz para DAG que el algoritmo Dijkstra o Bellman-Ford." -msgid "Version 3.8.0" -msgstr "Versión 3.8.0" +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgstr "El proceso solo es válido para grafos acíclicos dirigidos ponderados, de lo contrario lanzará advertencias." -msgid "New signature:" -msgstr "Nueva firma:" +msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es `0`" -msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." -msgstr "El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional con el nombre ``methods``." +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgstr "El ``agg_cost`` de los valores no incluídos ``(u, v)`` es :math: `\\infty`" -msgid "New name and order of optional parameters." -msgstr "Nuevo nombre y orden de parámetros opcionales." +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V + E))`" -msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "Firma obsoleta pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destino**)" -msgid "Name change from ``pgr_contractGraph``" -msgstr "Cambio de nombre de ``pgr_contractGraph``" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destinos**)" -msgid "Bug fixes" -msgstr "Correcciones" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destino**)" -msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." -msgstr "La contracción reduce el tamaño del grafo eliminando algunos de los vértices y aristas, también por ejemplo, podría agregar aristas que representan una secuencia de aristas originales disminuyendo el tiempo total y el espacio utilizados en los algoritmos de grafo." +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destinos**)" -msgid "Does not return the full contracted graph." -msgstr "No devuelve el grafo contraído completo." +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "Only changes on the graph are returned." -msgstr "Solo se devuelven los cambios en el grafo." +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgstr "Del vértice :math:`5` al vértice :math:`11` en un grafo **dirigido**" -msgid "The returned values include:" -msgstr "Los valores devueltos incluyen:" +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "Desde el vértice :math:`5` a los vértices :math:`\\{ 7, 11\\}`" -msgid "The new edges generated by linear contraction." -msgstr "Las nuevas aristas generadas por la contracción lineal." +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgstr "Desde los vértices :math:`\\{5, 10\\}` al vértice :math:`11`" -msgid "The modified vertices generated by dead end contraction." -msgstr "Los vértices modificados por contracción sin salida." +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "Desde los vértices :math:`\\{5, 15\\}` a los vértices :math:`\\{11, 17\\}` en un grafo **no dirigido**" -msgid "The returned values are ordered as follows:" -msgstr "Los valores devueltos se ordenan de la siguiente manera:" +msgid "Return columns" +msgstr "Columnas de Resultados" -msgid "column ``id`` ascending when its a modified vertex." -msgstr "columna ``id`` ascendente cuando es un vértice modificado." +msgid "Making **start_vids** the same as **end_vids**" +msgstr "Haciendo **vértices de salida** igual que **vértices destino**" -msgid "column ``id`` with negative numbers descending when its a new edge." -msgstr "columna ``id`` con números negativos descendentes cuando es una nueva arista." +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: Caminos mas cortos en DAG `__" -msgid "Currently there are two types of contraction methods included in this function:" -msgstr "Actualmente hay dos tipos de métodos de contracción incluidos en esta función:" +msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgstr "https://en.wikipedia.org/wiki/Topological_sorting" -msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." -msgstr "Contracción sin salida. Véase :doc:`pgr_contractionDeadEnd`." +msgid "``pgr_degree``" +msgstr "``pgr_degree``" -msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." -msgstr "" +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgstr "``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el número de aristas incidentes en el vértice." -msgid "pgr_contraction(`Edges SQL`_, [**options**])" -msgstr "pgr_contraction(`SQL de aristas`_, [**opciones**])" +msgid "Error messages adjustment." +msgstr "" -msgid "**options:** ``[directed, methods, cycles, forbidden]``" -msgstr "**opciones:** ``[directed, methods, cycles, forbidden]``" +msgid "New signature with only Edges SQL." +msgstr "" -msgid "Returns set of |result-contract|" -msgstr "Regresa conjunto de |result-contract|" +msgid "Calculates the degree of the vertices of an undirected graph" +msgstr "Calcula el grado de los vértices de un grafo no dirigido" -msgid "Dead end and linear contraction in that order on an undirected graph." -msgstr "Hacer una contracción de callejón sin salida y una contracción lineal en ese orden en un grafo no dirigido." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgstr "El grado (o valencia) de un vértice de un grafo es el número de aristas incidentes al vértice." -msgid "Contraction optional parameters" -msgstr "Parámetros opcionales de Contracción" +msgid "A loop contributes 2 to a vertex's degree." +msgstr "" -msgid "``methods``" -msgstr "``methods``" +msgid "A vertex with degree 0 is called an isolated vertex." +msgstr "" -msgid "``INTEGER[]``" -msgstr "``INTEGER[]``" +msgid "Isolated vertex is not part of the result" +msgstr "Vértice aislado no forma parte del resultado" -msgid "``ARRAY[1,2]``" -msgstr "``ARRAY[1,2]``" +msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgstr "" -msgid "Ordered contraction operations." -msgstr "Operaciones de contracción ordenadas." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgstr "Dado que se trata de una ejecución ``dryrun``, el código de todos los cálculos se muestra en el ``NOTICE`` de PostgreSQL." -msgid "1 = Dead end contraction" -msgstr "1 = Contracción sin salida" +msgid "The code can be used as base code for the particular application requirements." +msgstr "" -msgid "2 = Linear contraction" -msgstr "2 - Contracción lineal" +msgid "No ordering is performed." +msgstr "No se realiza ningún ordenamiento." -msgid "``cycles``" -msgstr "``cycles``" +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgstr "pgr_degree(`Edges SQL`_ , [``dryrun``])" -msgid ":math:`1`" -msgstr ":math:`1`" +msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgstr "pgr_degree(`SQL de aristas`_ , `SQL de vértices`_, [``dryrun``])" -msgid "Number of times the contraction methods will be performed." -msgstr "Número de veces que se realizarán las operaciones de contracción." +msgid "RETURNS SETOF |result-degree|" +msgstr "REGRESA CONJUNTO DE |result-degree|" -msgid "``forbidden``" -msgstr "``forbidden``" +msgid "Edges" +msgstr "" -msgid "``BIGINT[]``" -msgstr "``BIGINT[]``" +msgid "example" +msgstr "ejemplo" -msgid "``ARRAY[]::BIGINT[]``" -msgstr "``ARRAY[]::BIGINT[]``" +msgid "Get the degree of the vertices defined on the edges table" +msgstr "Obtener el grado de los vértices definidos en la tabla de aristas" -msgid "Identifiers of vertices forbidden for contraction." -msgstr "Identificadores de vértices prohibidos para contracción." +msgid "Edges and Vertices" +msgstr "Aristas y Vértices" -msgid "The function returns a single row. The columns of the row are:" -msgstr "La función devuelve una sola fila. Las columnas de la fila son:" +msgid "Extracting the vertex information" +msgstr "Extraer la información del vértice" -msgid "``type``" -msgstr "``type``" +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgstr "" -msgid "Type of the row." -msgstr "Tipo de la fila." +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgstr "" -msgid "``v`` when the row is a vertex." -msgstr "``v`` cuando la fila es un vértice." +msgid "Calculate the degree of the nodes:" +msgstr "Calcula el grado de los vértices:" -msgid "Column ``id`` has a positive value." -msgstr "Columna ``id`` tiene valor positivo." +msgid "`Vertex SQL`_" +msgstr "`SQL de vértices`_" -msgid "``e`` when the row is an edge." -msgstr "``e`` cuando la fila es una arista." +msgid "`Vertex SQL`_ as described below" +msgstr "`Vertex SQL`_ como se describe abajo" -msgid "Column ``id`` has a negative value." -msgstr "Columna ``id`` tiene valor negativo." +msgid "``dryrun``" +msgstr "``dryrun``" -msgid "All numbers on this column are ``DISTINCT``" -msgstr "Todos los números de esta columna son ''DISTINTOS''" +msgid "When true do not process and get in a NOTICE the resulting query." +msgstr "Cuando verdadero, no procesar y recibir un AVISO de la consulta resultante." -msgid "When ``type`` = **'v'**." -msgstr "En caso de ``type`` = **'v'**." +msgid "For the `Edges and Vertices`_ signature:" +msgstr "Para la firma `Aristas y Vértices`_:" -msgid "Identifier of the modified vertex." -msgstr "Identificador del vértice modificado." +msgid "For the `Edges`_ signature:" +msgstr "Para la firma `Aristas`_:" -msgid "When ``type`` = **'e'**." -msgstr "En caso de ``type`` = **'e'**." +msgid "Vertex SQL" +msgstr "SQL de vértices" -msgid "Decreasing sequence starting from **-1**." -msgstr "Disminución de la secuencia a partir de **-1**." +msgid "``in_edges``" +msgstr "``in_edges``" -msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." -msgstr "Representando un pseudo `id` como no incorporado en el conjunto de aristas originales." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *primer punto final*." -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" +msgid "When missing, ``out_edges`` must exist." +msgstr "Si falta, ``out_edges`` debe existir." -msgid "Array of contracted vertex identifiers." -msgstr "Arreglo de identificadores de vértices contraídos." +msgid "``out_edges``" +msgstr "``out_edges``" -msgid "When ``type`` = **'v'**: :math:`-1`" -msgstr "En caso de ``type`` = **'v'**: :math:`-1`" +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *segundo punto final*." -msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." -msgstr "En caso de ``type`` = **'e'**: Identificador del vétice de la arista actual (``source``, ``target``)." +msgid "When missing, ``in_edges`` must exist." +msgstr "Si falta, ``in_edges`` debe existir." -msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." -msgstr "En caso de ``type`` = **'e'**: Identificador del vértice objetivo de la arista actual (``source``, ``target``)." +msgid "Vertex identifier" +msgstr "Identificador de vértice" -msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." -msgstr "En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, ``target``)." +msgid "``degree``" +msgstr "``degree``" -msgid "Only dead end contraction" -msgstr "Sólo contracción sin salida" +msgid "Number of edges that are incident to the vertex ``id``" +msgstr "Número de aristas incidentes al vértice ``id``" -msgid "Only linear contraction" -msgstr "Sólo contracción lineal" +msgid "Degree of a loop" +msgstr "Grado de un bucle" -msgid "The cycle" -msgstr "El ciclo" +msgid "Using the `Edges`_ signature." +msgstr "Usando la firma `Aristas`_." -msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." -msgstr "Contraer un grafo se puede hacer con más de una operación. El orden de las operaciones afecta al grafo contraído resultante, después de aplicar una operación, el conjunto de vértices que se pueden contraer con otra operación cambia." +msgid "Using the `Edges and Vertices`_ signature." +msgstr "" -msgid "This implementation cycles ``cycles`` times through the ``methods`` ." -msgstr "Esta implementación cicla `` cycles`` veces a través de los ``methods``." +msgid "Degree of a sub graph" +msgstr "Grado de un subgrafo" -msgid "Contracting sample data" -msgstr "Contracción de los datos de muestra" +msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgstr "Para el siguiente sub-grafo de :doc:`sampledata`:" -msgid "In this section, building and using a contracted graph will be shown by example." -msgstr "En esta sección, la creación y el uso de un grafo contraído se mostrarán en el ejemplo." +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr "" -msgid "The :doc:`sampledata` for an undirected graph is used" -msgstr "Se usa :doc:`sampledata` para un grafo no dirigido" +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgstr "" -msgid "a dead end operation first followed by a linear operation." -msgstr "una operación sin salida primero seguida de una operación lineal." +msgid "The vertices not participating on the edge are considered isolated" +msgstr "" -msgid "Construction of the graph in the database" -msgstr "Construcción del grafo en la base de datos" +msgid "their degree is 0 in the subgraph and" +msgstr "" -msgid "The original graph:" -msgstr "El grafo original:" +msgid "their degree is not shown in the output." +msgstr "" -msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." -msgstr "Los resultados no representan al grafo contraído. Representan los cambios que necesitan hacerse en el grafo después de aplicar los métodos de contracción." +msgid "Using a vertex table" +msgstr "Usando una tabla de vértices" -msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." -msgstr "Observe que los vértices, por ejemplo, :math:`6` , no aparecen en los resultados porque no se vieron afectados por el algoritmo de contracción." +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgstr "Para un tamaño de red razonable, es mejor preparar previamente una tabla de vértices y utilizarla en las llamadas a ``pgr_degree``." -msgid "After doing the dead end contraction operation:" -msgstr "Después de realizar la operación de contracción sin salida:" +msgid "Extract the vertex information and save into a table:" +msgstr "Extraer la información del vértice y almacenar en una tabla:" -msgid "After doing the linear contraction operation to the graph above:" -msgstr "Después de hacer la operación de contracción lineal al grafo anterior:" +msgid "Dry run execution" +msgstr "Ejecución de prueba" -msgid "The process to create the contraction graph on the database:" -msgstr "El proceso para crear el grafo de contracción en la base de datos:" +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilizar ``dryrun := true``." -msgid "Add additional columns" -msgstr "Añadir columnas adicionales" +msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgstr "Los resultados se pueden usar como código base para realizar un refinamiento basado en las necesidades de desarrollo de back-end." -msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" -msgstr "" +msgid "Finding dead ends" +msgstr "Encontrando callejones sin salida" -msgid "Column." -msgstr "Columna." +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgstr "Si se tiene una tabla de vértices ya construida usando ``pgr_extractVertices`` y se quiere el grado de todo el grafo en lugar de un subconjunto, se puede trabajar con las columnas ``in_edges`` y ``out_edges`` directamente." -msgid "The vertices set belonging to the vertex/edge" -msgstr "El conjunto de vértices que pertenecen al vértice/arista" +msgid "The degree of a dead end is 1." +msgstr "El grado de un sin salida es 1." -msgid "``is_contracted``" -msgstr "``is_contracted``" +msgid "Finding linear vertices" +msgstr "Encontrando vértices lineales" -msgid "On the vertex table" -msgstr "En la tabla de vértices" +msgid "The degree of a linear vertex is 2." +msgstr "El grado de un vértice lineal es 2." -msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." -msgstr "En caso de ''true'' se contrae el vértice, no forma parte del grafo contraído." +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "Cuando hay una tabla de vértices construida usando ``pgr_extractVertices``" -msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." -msgstr "En caso de ''false'' el vértice no se contrae, su parte del grafo contraído." +msgid ":doc:`pgr_extractVertices`" +msgstr ":doc:`pgr_extractVertices`" -msgid "``is_new``" -msgstr "``is_new``" +msgid "``pgr_depthFirstSearch`` - Proposed" +msgstr "``pgr_depthFirstSearch`` - Propusto" -msgid "On the edge table" -msgstr "En la tabla de aristas" +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "``pgr_depthFirstSearch`` — Devuelve un recorrido de búsqueda de profundidad del grafo. El grafo puede ser dirigido o no dirigido." -msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." -msgstr "En caso de `` true``, la arista se generó por el algoritmo de contracción. Es parte del grafo contraído." +msgid "Version 3.3.0" +msgstr "Versión 3.3.0" -msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." -msgstr "En caso de ``false`` , la arista es una arista original, podría ser o no parte del grafo contraído." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "El algoritmo de Primera Búsqueda de Profundidad es un algoritmo de recorrido que comienza desde un vértice raíz, va lo más profundo posible y retrocede una vez que se alcanza un vértice sin vértices adyacentes o con todos los vértices adyacentes visitados. El recorrido continúa hasta que se visitan todos los vértices accesibles desde el vértice raíz." -msgid "Store contraction information" -msgstr "Almacenar información de contracción" +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "La implementación funciona para los grafos **dirigidos** y **no dirigidos**." -msgid "Store the contraction results in a table." -msgstr "Almacenar los resultados de la contracción en una tabla." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgstr "Proporciona el recorrido de Búsqueda de Primero Profundidad desde un vértice raíz o desde un conjunto de vértices raíz." -msgid "Update the edges and vertices tables" -msgstr "Actualizar las tablas de aristas y vértices" +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgstr "Un parámetro opcional de profundidad máxima no negativo para limitar los resultados hasta una profundidad particular." -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "Usar la columna ``is_contracted`` para indicar los vértices contraídos." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgstr "Para fines de optimización, se omiten los valores duplicados en los `Root vids`." -msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." -msgstr "Llenar ``contracted_vertices`` con la información de los resultados que pertenecen a los vértices." +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "No produce la ruta más corta desde un vértice de origen a un vértice de destino." -msgid "Insert the new edges generated by pgr_contraction." -msgstr "Inserte las nuevas aristas generadas por pgr_contraction." +msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgstr "No se garantiza que el coste agregado del recorrido sea mínimo." -msgid "The contracted graph" -msgstr "El grafo contraído" +msgid "The returned values are ordered in ascending order of `start_vid`." +msgstr "Los valores devueltos se ordenan en orden ascendente de `start_vid`." -msgid "Vertices that belong to the contracted graph." -msgstr "Vértices que pertenecen al grafo contraído." +msgid "Depth First Search Running time: :math:`O(E + V)`" +msgstr "Tiempo de ejecución de la Primera Búsqueda de Profundidad: :math:`O(E + V)`" -msgid "Edges that belong to the contracted graph." -msgstr "Aristas que pertenecen al grafo contraído." +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raíz**, [**opciones**])" -msgid "Visually:" -msgstr "Visualmente:" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raices**, [**opciones**])" -msgid "Using the contracted graph" -msgstr "Usando el grafo contraído" +msgid "**options:** ``[directed, max_depth]``" +msgstr "**opcionales:** ``[directed, max_depth]``" -msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" -msgstr "" +msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgstr "Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``." -msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" -msgstr "Hay tres casos al calcular la ruta más corta entre un origen y un destino determinados en un grafo contraído:" +msgid "`Boost: Depth First Search `__" +msgstr "`Boost: Primera Búsqueda de Profundidad `__" -msgid "Case 1: Both source and target belong to the contracted graph." -msgstr "Caso 1: Tanto el origen como el destino pertenecen al grafo contraído." +msgid "`Boost: Undirected DFS `__" +msgstr "`Boost: DFS No dirigido `__" -msgid "Case 2: Source and/or target belong to an edge subgraph." -msgstr "Caso 2: El origen y/o el destino pertenecen a un subgrafo de aristas." +msgid "`Wikipedia: Depth First Search algorithm `__" +msgstr "'Wikipedia: Algoritmo de la Primera Búsqueda de Profundidad `__" -msgid "Case 3: Source and/or target belong to a vertex." -msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgstr "``pgr_dijkstra`` - Camino más corto utilizando el algoritmo de Dijkstra." -msgid "The final application should consider all of those cases." -msgstr "" +msgid "Version 3.5.0" +msgstr "Versión 3.5.0" -msgid "Create a view (or table) of the contracted graph:" -msgstr "Crear una vista (o tabla) del grafo Contraído:" +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_dijkstra(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." -msgid "Create the function that will use the contracted graph." -msgstr "Crear la función que va a utilizar el grafo contraído." +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgstr "pgr_dijkstra(Uno a Muchos) ha añadido la columna ``end_vid``." -msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." -msgstr "Caso 2: El origen y/o el destino pertenecen a una arista que ha contraído vertices." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgstr "pgr_dijkstra(Muchos a Uno) ha añadido la columna ``start_vid``." -msgid "Case 3: Source and/or target belong to a vertex that has been contracted." -msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice que ha sido contraído." +msgid "Version 3.1.0" +msgstr "Versión 3.1.0" -msgid "``pgr_contractionDeadEnd`` - Proposed" -msgstr "``pgr_contractionDeadEnd`` - Propuesto" +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(Combinaciones)" -msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contractionDeadEnd`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." +msgid "Version 2.2.0" +msgstr "Version 2.2.0" -msgid "A node is considered a dead end node when:" -msgstr "Un nodo se considera sin salida cuando:" +msgid "pgr_dijkstra(One to Many)" +msgstr "pgr_dijkstra(Uno a Muchos)" -msgid "On undirected graphs:" -msgstr "En grafos no dirigidos:" +msgid "pgr_dijkstra(Many to One)" +msgstr "pgr_dijkstra(Muchos a Uno)" -msgid "The number of adjacent vertices is 1." -msgstr "El número de vértices adyacentes es 1." +msgid "pgr_dijkstra(Many to Many)" +msgstr "pgr_dijkstra(Muchos a Muchos)" -msgid "On directed graphs:" -msgstr "En grafos dirigidos:" +msgid "Signature change on pgr_dijkstra(One to One)" +msgstr "Cambio de firma en pgr_dijkstra(Uno a Uno)" -msgid "When there is only one adjacent vertex or" -msgstr "Cuando hay solo un vértice adyacente o" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "When all edges are incoming regardless of the number of adjacent vertices." -msgstr "" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionDeadEnd(`SQL de aristas`_, [**opciones**])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "**options:** ``[directed, forbidden]``" -msgstr "**opciones:** ``[directed, forbidden]``" +msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "Dead end contraction on an undirected graph." -msgstr "Contracción de vértice sin salida en un grafo no dirigido." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**" -msgid "The green nodes are dead end nodes." -msgstr "Los nodos verdes son nodos sin salida." +msgid "The examples of this section are based on the :doc:`sampledata` network." +msgstr "Los ejemplos de esta sección se basan en la red :doc:`sampledata`." -msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." -msgstr "El nodo :math:`3` es sin salida después de haberse contraído el nodo :math:`1`." +msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" +msgstr "Para grafos **dirigidos** con columnas ``cost`` and ``reverse_cost``" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" +msgid "Directed graph with cost and reverse cost columns" +msgstr "Grafo dirigido con columnas de costo y costo de regreso" -msgid "**Empty**" -msgstr "**vacío**" +msgid "1) Path from :math:`6` to :math:`10`" +msgstr "1) Ruta de :math:`6` a :math:`10`" -msgid "Value = ``e`` indicating the row is an edge." -msgstr "Valor = ``e`` cuando la fila es una arista." +msgid "2) Path from :math:`6` to :math:`7`" +msgstr "2) Ruta de :math:`6` a :math:`7`" -msgid "A pseudo `id` of the edge." -msgstr "Un pseudo `identificador` de la arista." +msgid "3) Path from :math:`12` to :math:`10`" +msgstr "3) Ruta de :math:`12` a :math:`10`" -msgid "Identifier of the source vertex of the current edge." -msgstr "Identificador del vértice de origen de la arista actual." +msgid "4) Path from :math:`12` to :math:`7`" +msgstr "4) Ruta de :math:`12` a :math:`7`" -msgid "Identifier of the target vertex of the current edge." -msgstr "Identificador del vértice destino de la arista actual." +msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" +msgstr "5) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 1 y 2" -msgid "Weight of the current edge." -msgstr "Peso de la arista actual." +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" -msgid "Dead end vertex on undirected graph" -msgstr "Vértice sin salida en un grafo sin dirigir" +msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" +msgstr "6) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 2 y 4" -msgid "They have only one adjacent node." -msgstr "" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" -msgid "Dead end vertex on directed graph" -msgstr "Vértice sin salida en un grafo dirigido" +msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" +msgstr "7) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 1 y 4" -msgid "The green nodes are dead end nodes" -msgstr "Los nodos verdes son nodos sin salida" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." -msgstr "Los nodos azules tienen un número ilimitado de aristas entrantes y/o salientes." +msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" +msgstr "8) Usando `Combinaciones`_ para obtener la solución de los ejemplos 1 a 3" -msgid "Node" -msgstr "Nodo" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgid "Adjacent nodes" -msgstr "Nodos adyacentes" +msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" +msgstr "Para grafos **no dirigidos** con columnas ``cost`` y ``reverse_cost``" -msgid "Dead end" -msgstr "Sin salida" +msgid "Undirected graph with cost and reverse cost columns" +msgstr "Grafo no dirigido con columnas de costo y costo de regreso" -msgid "Reason" -msgstr "" +msgid "9) Path from :math:`6` to :math:`10`" +msgstr "9) Ruta de :math:`6` a :math:`10`" -msgid ":math:`6`" -msgstr ":math:`6`" +msgid "10) Path from :math:`6` to :math:`7`" +msgstr "10) Ruta de :math:`6` a :math:`7`" -msgid ":math:`\\{1\\}`" -msgstr ":math:`\\{1\\}`" +msgid "11) Path from :math:`12` to :math:`10`" +msgstr "11) Ruta de :math:`12` a :math:`10`" -msgid "Yes" -msgstr "Si" +msgid "12) Path from :math:`12` to :math:`7`" +msgstr "12) Ruta de :math:`12` a :math:`7`" -msgid "Has only one adjacent node." -msgstr "Solo tiene un nodo adyacente." +msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" +msgstr "13) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 9 y 10" -msgid ":math:`7`" -msgstr ":math:`7`" +msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" +msgstr "14) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 10 y 12" -msgid ":math:`\\{2\\}`" -msgstr ":math:`\\{2\\}`" +msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" +msgstr "15) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 9 y 12" -msgid ":math:`8`" -msgstr ":math:`8`" +msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" +msgstr "16) Usando `Combinaciones`_ para obtener la solución de los ejemplos 9 a 13" -msgid ":math:`\\{2, 3\\}`" -msgstr ":math:`\\{2, 3\\}`" +msgid "For **directed** graphs only with ``cost`` column" +msgstr "Para grafos **dirigidos** con columna``cost``" -msgid "Has more than one adjacent node and all edges are incoming." -msgstr "" +msgid "Directed graph only with cost column" +msgstr "Grafo dirigido con solo la columna costo" -msgid ":math:`\\{4\\}`" -msgstr ":math:`\\{4\\}`" +msgid "17) Path from :math:`6` to :math:`10`" +msgstr "17) Ruta de :math:`6` a :math:`10`" -msgid ":math:`10`" -msgstr ":math:`10`" +msgid "18) Path from :math:`6` to :math:`7`" +msgstr "18) Ruta de :math:`6` a :math:`7`" -msgid ":math:`\\{4, 5\\}`" -msgstr ":math:`\\{4, 5\\}`" +msgid "19) Path from :math:`12` to :math:`10`" +msgstr "19) Ruta de :math:`12` a :math:`10`" -msgid "No" -msgstr "No" +msgid "20) Path from :math:`12` to :math:`7`" +msgstr "20) Ruta de :math:`12` a :math:`7`" -msgid "Has more than one adjacent node and all edges are outgoing." -msgstr "" +msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" +msgstr "21) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 17 y 18" -msgid ":math:`1,2,3,4,5`" -msgstr ":math:`1,2,3,4,5`" +msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" +msgstr "22) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 18 y 20" -msgid "Many adjacent nodes." -msgstr "Muchos nodos adyacentes." +msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" +msgstr "23) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 17 y 20" -msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." -msgstr "" +msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" +msgstr "24) Usando `Combinaciones`_ para obtener la solución de los ejemplos 17 a 19" -msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." -msgstr "De arriba, nodes :math:`\\{6, 7, 9\\}` son sin salida por que el número de vértices adyacentes es 1." +msgid "For **undirected** graphs only with ``cost`` column" +msgstr "Para grafos **no dirigidos** con columna``cost``" -msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." -msgstr "" +msgid "Undirected graph only with cost column" +msgstr "Grafo no dirigido con solo la columna costo" -msgid "Step by step dead end contraction" -msgstr "Paso a paso contracción sin salida" +msgid "25) Path from :math:`6` to :math:`10`" +msgstr "25) Ruta de :math:`6` a :math:`10`" -msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" -msgstr "La contracción sin salida se detendrá hasta que no haya más nodos sin salida. Por ejemplo, del siguiente grafo donde :math:`3` es el nodo sin salida:" +msgid "26) Path from :math:`6` to :math:`7`" +msgstr "26) Ruta de :math:`6` a :math:`7`" -msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" -msgstr "Después de contraer :math:`3`, el nodo ` :math:`2` es ahora un nodo sin salida y es contraído:" +msgid "27) Path from :math:`12` to :math:`10`" +msgstr "27) Ruta de :math:`12` a :math:`10`" -msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." -msgstr "Después de contraer :math:`2`, detener. El nodo :math:`1` tiene la información de los nodos que se contraen." +msgid "28) Path from :math:`12` to :math:`7`" +msgstr "28) Ruta de :math:`12` a :math:`7`" -msgid "Creating the contracted graph" -msgstr "Creando el grafo contraído" +msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" +msgstr "29) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 25 y 26" -msgid "Steps for the creation of the contracted graph" -msgstr "Pasos para la creación del grafo contraído" +msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" +msgstr "30) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 26 y 28" -msgid "Add additional columns." -msgstr "Añadir columnas adicionales." +msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" +msgstr "31) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 25 y 28" -msgid "Save results into a table." -msgstr "Almacenar los resultados en una tabla." +msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" +msgstr "32) Usando `Combinaciones`_ para obtener la solución de los ejemplos 25 a 27" -msgid "The contracted vertices are not part of the contracted graph." -msgstr "Los vértices contraído no forman parte del grafo contraído." +msgid "Equvalences between signatures" +msgstr "Equivalencias entre firmas" -msgid "Using when departure and destination are in the contracted graph" -msgstr "Usando cuando la salida como el destino pertenecen al grafo contraído" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgstr "Los siguientes ejemplos son para la ruta :math:`\\{6\\}\\rightarrow\\{10\\}`" -msgid "Using when departure/destination is not in the contracted graph" -msgstr "Usando cuando la salida /destino no pertenecen al grafo contraído" +msgid "33) Using `One to One`_" +msgstr "33) Usando `Uno a Uno`_" -msgid "Using when departure and destination are not in the contracted graph" -msgstr "Usando cuando la salida y el destino no están en el grafo contraído" +msgid "34) Using `One to Many`_" +msgstr "34) Usando `Uno a Muchos`_" -msgid "``pgr_contractionHierarchies`` - Experimental" -msgstr "``pgr_contractionHierarchies`` - Experimental" +msgid "35) Using `Many to One`_" +msgstr "35) Usando `Muchos a Uno`_" -msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." -msgstr "``pgr_contractionHierarchies`` - Realiza la contracción del grafo según el método de jerarquías de contracción y devuelve los vértices contraídos y las aristas de acceso directo creadas." +msgid "36) Using `Many to Many`_" +msgstr "36) Usando `Muchos a Muchos`_" -msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." -msgstr "" +msgid "37) Using `Combinations`_" +msgstr "37) Usando `Combinaciones`_" -msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." -msgstr "" +msgid "`Boost: Dijkstra shortest paths `__" +msgstr "`Boost: Camino mas corto Dijkstra `__" -msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." -msgstr "" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." -msgstr "" +msgid "``pgr_dijkstraCost``" +msgstr "``pgr_dijkstraCost``" -msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." -msgstr "" +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgstr "``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el algoritmo de Dijkstra." -msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." -msgstr "" +msgid "pgr_dijkstraCost(Combinations)" +msgstr "pgr_dijkstraCost(Combinaciones)" #, fuzzy -msgid "The process is done on graphs having only edges with positive costs." -msgstr "El proceso se realiza sólo en aristas con costos positivos." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr "La función ``pgr_dijkstraCost`` suma el coste del camino más corto utilizando el Algoritmo de Dijkstra." -msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." -msgstr "" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" -msgstr "" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "added shortcut edges, with negative identifiers;" -msgstr "" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "contracted nodes with an order." -msgstr "" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -#, fuzzy -msgid "The ``pgr_contractionHierarchies`` function has the following signature:" -msgstr "La función pgr_transitiveClosure tiene la siguiente firma:" +msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -#, fuzzy -msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionLinear(`SQL de aristas`_, [**opciones**])" +msgid "``pgr_dijkstraCostMatrix``" +msgstr "``pgr_dijkstraCostMatrix``" -#, fuzzy -msgid "Returns set of |result-contraction-hierarchies|" -msgstr "Regresa conjunto de |result-contract|" +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgstr "``pgr_dijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_dijkstra`." -#, fuzzy -msgid "Contraction hierarchies optional parameters" -msgstr "Parámetros opcionales de Contracción" +msgid "Using Dijkstra algorithm, calculate and return a cost matrix." +msgstr "Utilizando el algoritmo Dijkstra, calcula y devuelve una matriz de costes." -#, fuzzy -msgid "True if the graph is directed, False otherwise." -msgstr "Cuando el grafo es dirigido el resultado es dirigido." +msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_dijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" -#, fuzzy -msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" -msgstr "La función devuelve una sola fila. Las columnas de la fila son:" +msgid "``pgr_dijkstraNear``" +msgstr "``pgr_dijkstraNear``" -#, fuzzy -msgid "Type of the ``id``." -msgstr "Tipo de la fila." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNear`` — Utilizando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano." -msgid "Column ``id`` has a positive value" -msgstr "Columna ``id`` tiene valor positivo" +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgstr "Dado un grafo, un vértice inicial y un conjunto de vértices finales, esta función encuentra la ruta más corta desde el vértice inicial hasta el vértice final más cercano." -msgid "Column ``id`` has a negative value" -msgstr "Columna ``id`` tiene valor negativo" +msgid "Uses Dijkstra algorithm." +msgstr "Utiliza el algoritmo Dijkstra." -msgid "``metric``" -msgstr "``metric``" +msgid "Works for **directed** and **undirected** graphs." +msgstr "Funciona para grafos **dirigidos** y **no dirigidos**." -msgid "``vertex_order``" -msgstr "``vertex_order``" +msgid "When there are more than one path to the same vertex with same cost:" +msgstr "Cuando hay más de una ruta al mismo vértice con el mismo coste:" -msgid "On an undirected graph" -msgstr "En un grafo no dirigido" +msgid "The algorithm will return just one path" +msgstr "El algoritmo devolverá solo una ruta" -msgid "The following query shows the original data involved in the contraction operation on an undirected graph." -msgstr "" +msgid "Optionally allows to find more than one path." +msgstr "Opcionalmente permite encontrar más de una ruta." -msgid "building contraction hierarchies on the whole graph" -msgstr "" +msgid "When more than one path is to be returned:" +msgstr "Cuando se va a devolver más de una ruta:" -msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." -msgstr "" +msgid "Results are sorted in increasing order of:" +msgstr "Los resultados se ordenan en orden creciente de:" -msgid "After computing the contraction hierarchies, an order is now given to the vertices," -msgstr "" +msgid "aggregate cost" +msgstr "costo agregado" -msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." -msgstr "" +msgid "Within the same value of aggregate costs:" +msgstr "Dentro del mismo valor de los costes agregados:" -msgid "We obtain the contracted graph above:" -msgstr "Se obtiene el grafo contraído anterior:" +msgid "results are sorted by (source, target)" +msgstr "los resultados se ordenan por (fuente, destino)" -msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." -msgstr "" +msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" +msgstr "Tiempo de ejecución: Dijkstra tiempo de ejecución: :math:`drt = O((|E| + |V|)log|V|)`" -#, fuzzy -msgid "On an undirected graph with forbidden vertices" -msgstr "Usando un grafo **no dirigido** para el ruteo de peatones" +msgid "One to Many; :math:`drt`" +msgstr "Uno a Muchos; :math:`drt`" -msgid "building contraction with a set of forbidden vertices" -msgstr "construir la contracción en un conjunto de nodos prohibidos" +msgid "Many to One: :math:`drt`" +msgstr "Muchos a Uno: :math:`drt`" -#, fuzzy -msgid "Contraction process steps details" -msgstr "Contracción de los datos de muestra" +msgid "Many to Many: :math:`drt * |Starting vids|`" +msgstr "Muchos a Muchos: :math:`drt * |Starting vids|`" -#, fuzzy -msgid "Shortcut building process" -msgstr "Proceso de compilación con CMake" +msgid "Combinations: :math:`drt * |Starting vids|`" +msgstr "Combinaciones: :math:`drt * |Starting vids|`" -msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." -msgstr "" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])" -msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." -msgstr "" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])" -msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." -msgstr "" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])" -msgid "Initialize the queue with a first vertices order" -msgstr "" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])" -msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" -msgstr "" +msgid "**options A:** ``[directed, cap]``" +msgstr "**opciones A:** ``[directed, cap]``" -#, fuzzy -msgid ":math:`v`" -msgstr ":math:`9`" +msgid "**options B:** ``[directed, cap, global]``" +msgstr "**opciones B:** ``[directed, cap, global]``" -#, fuzzy -msgid ":math:`\\{p, r, u\\}`" -msgstr ":math:`\\{2, 3\\}`" - -#, fuzzy -msgid ":math:`p`" -msgstr ":math:`9`" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -#, fuzzy -msgid ":math:`\\{u, v\\}`" -msgstr ":math:`\\{2, 3\\}`" +msgid "**options:** ``[directed, cap]``" +msgstr "**opcionales:** ``[directed, cap]``" -#, fuzzy -msgid ":math:`u`" -msgstr ":math:`9`" +msgid "Departing on car from vertex :math:`6` find the nearest subway station." +msgstr "Saliendo en coche desde el vértice :math:`6` encontrar la estación de metro más cercana." -#, fuzzy -msgid ":math:`\\{p, v, w\\}`" -msgstr ":math:`\\{2, 3\\}`" +msgid "Using a **directed** graph for car routing." +msgstr "Usando un grafo **dirigido** para el ruteo de automóviles." -#, fuzzy -msgid ":math:`r`" -msgstr ":math:`9`" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgstr "Las estaciones de metro se encuentran en los siguientes vértices :math:`\\{1, 10, 11\\}`" -#, fuzzy -msgid ":math:`\\{v, w\\}`" -msgstr ":math:`\\{2, 3\\}`" +msgid "The defaults used:" +msgstr "Los valores predeterminados utilizados:" -#, fuzzy -msgid ":math:`w`" -msgstr ":math:`9`" +msgid "`directed => true`" +msgstr "`directed => true`" -#, fuzzy -msgid ":math:`\\{r, u\\}`" -msgstr ":math:`\\{2, 3\\}`" +msgid "`cap => 1`" +msgstr "`cap => 1`" -msgid "Adjacent edges are removed." -msgstr "" +msgid "The result shows that station at vertex :math:`11` is the nearest." +msgstr "El resultado muestra que la estación en el vértice :math:`11` es la más cercana." -msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." -msgstr "" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." -msgstr "" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" +msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`2`" -msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." -msgstr "" +msgid "On line `4`: using the positional parameter: `directed` set to ``true``" +msgstr "En la línea `4`: utilizando el parámetro posicional: `directed` configurado en ``true``" -msgid "A hierarchy will now be constructed by contracting again the vertices in this order." -msgstr "" +msgid "In line `5`: using named parameter `cap => 2`" +msgstr "En la línea `5`: usando el parámetro con nombre `cap => 2`" -msgid "Build the final vertex order" -msgstr "Construir el orden final de los vértices" +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgstr "El resultado muestra que la estación en el vértice :math:`10` es la más cercana y la siguiente mejor es :math:`11`." -msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." -msgstr "" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -#, fuzzy -msgid "Add shortcuts to the initial graph" -msgstr "corte mínimo de el subgrafo principal" +msgid "**options:** ``[directed, cap, global]``" +msgstr "**opcionales:** ``[directed, cap, global]``" -msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." -msgstr "" +msgid "Find the best pedestrian connection between two lines of buses" +msgstr "Encuentra la mejor conexión peatonal entre dos líneas de autobuses" #, fuzzy -msgid "Use the contraction" -msgstr "Contracción sin salida" +msgid "Using an **undirected** graph for pedestrian routing" +msgstr "Usando un grafo **no dirigido** para el ruteo de peatones" -#, fuzzy -msgid "Build the contraction" -msgstr "Contracción sin salida" +msgid "The first subway line stations are at :math:`\\{15, 16\\}`" +msgstr "Las estaciones de la primera línea de metro están en :math:`\\{15, 16\\}`" -msgid "Add shortcuts and hierarchy in the existing tables" -msgstr "" +msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{1, 10, 11\\}`" -msgid "Add new columns in the `vertices` and `edges` tables to store the results:" -msgstr "" +msgid "On line `4`: using the named parameter: `directed => false`" +msgstr "En la línea `4`: utilizando el parámetro con nombre: `directed => false`" -msgid "Update and insert the results in the two tables." -msgstr "" +msgid "`global => true`" +msgstr "`global => true`" -msgid "Use a Dijkstra shortest path algorithm on it" -msgstr "Aplicarle el algoritmo Dijkstra del camino más corto" +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgstr "Para un peatón la mejor conexión es subir/bajar en el vértice :math:`15` de la primera línea de metro y en el vértice :math:`10` de la segunda línea de metro." -msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" -msgstr "" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgstr "Solo se devuelve `una` ruta porque `global` es ``true`` y `cap` es ``1``" -msgid "``pgr_contractionLinear`` - Proposed" -msgstr "``pgr_contractionLinear`` - Propuesto" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." +msgid "Find the best car connection between all the stations of two subway lines" +msgstr "Encuentra la mejor conexión de coche entre todas las estaciones de dos líneas de metro" -msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionLinear(`SQL de aristas`_, [**opciones**])" +msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgstr "Las estaciones de la primera línea de metro están en :math:`\\{1, 10, 11\\}`" -msgid "Linear contraction on an undirected graph." -msgstr "Contracción lineal en un grafo no dirigido." +msgid "The second subway line stations are at :math:`\\{15, 16\\}`" +msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{15, 16\\}`" -msgid "The green nodes are linear nodes and will not be part of the contracted graph." -msgstr "Los nodos verdes son lineales y no forman parte del grafo contraído." +msgid "The combinations contents:" +msgstr "El contenido de las combinaciones:" -msgid "All edges adjacent will not be part of the contracted graph." -msgstr "Aristas adyacentes no forman parte del grafo contraído." +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgstr "líneas `3~4` establece los vértices de inicio de la primera línea de metro y los vértices finales de la segunda línea de metro" -msgid "The red lines will be new edges of the contracted graph." -msgstr "Las lineas verdes son aristas que pertenecen al grafo contraído." +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgstr "la línea `6~7` establecen los vértices de inicio de la primera línea de metro y los vértices finales de la primera línea de metro" -msgid "**contraction Order**" -msgstr "**Orden de contracciones**" +msgid "On line `8`: using the named parameter is `global => false`" +msgstr "En la línea `8`: usando el parámetro con nombre `global => false`" -msgid "Number of times the contraction operations on ``contraction_order`` will be performed." -msgstr "Número de veces que se realizarán las operaciones de contracción en el orden ``contraction_order``." +msgid "From the results:" +msgstr "A partir de los resultados:" -msgid "A node connects two (or more) `linear` edges when" -msgstr "" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgstr "haciendo una conexión desde la primera línea de metro :math:`\\{1, 10, 11\\}` a la segunda :math:`\\{15, 16\\}`:" -msgid "The number of adjacent vertices is 2." -msgstr "El número de vértices adyacentes es 2." +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgstr "Las mejores conecciones de todas las estaciones desde la primera línea son: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgid "In case of a directed graph, a node is considered a `linear` node when" -msgstr "En el caso de un grafo dirigido, un nodo se considera `lineal` cuando" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgstr "La mejor es:math:`(11 \\rightarrow 16)` con un costo de :math:`1` (líneas: `11` y `12`)" -msgid "Linearity is symmetrical." -msgstr "La linealidad es simétrica." +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgstr "haciendo una conexión desde la segunda línea de metro :math:`\\{15, 16\\}` a la primera :math:`\\{1, 10, 11\\}`:" -msgid "Linearity is not symmetrical" -msgstr "La linealidad no es simétrica" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgstr "Las mejores conecciones de todas las estaciones desde la segunda línea son: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgid "Graph where linearity is not symmetrical." -msgstr "Grafo cuando la linealidad no es simétrica." +#, fuzzy +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgstr "Ambas son igualmente buenas, como también tienen el mismo costo. (lines: `13` and `14` and lines: `15` and `16`)" -msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." -msgstr "" +msgid "Dijkstra optional parameters" +msgstr "Parámetros opcionales de Dijkstra" -msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." -msgstr "" +msgid "Near optional parameters" +msgstr "Parámetros opcionales de Cercanía" -msgid "The three edges can be replaced by one undirected edge" -msgstr "Las tres aristas pueden ser reemplazadas por una arista no dirigida" +msgid "``cap``" +msgstr "``cap``" -msgid "Edge :math:`1 - 3`." -msgstr "Arista :math:`1 - 3`." +msgid "Find at most ``cap`` number of nearest shortest paths" +msgstr "Encuentra como máximo el número ``cap`` de los caminos más cortos y más cercanos" -msgid "With cost: :math:`4`." -msgstr "Con costo: :math:`4`." +msgid "``global``" +msgstr "``global``" -msgid "Contracted vertices in the edge: :math:`\\{2\\}`." -msgstr "Vértices contraídos en la arista: :math:`\\{2\\}`." +msgid "When ``true``: only ``cap`` limit results will be returned" +msgstr "Cuando ``true``: solo se devolverán los resultados del límite ``cap``" -msgid "Linearity is symmetrical" -msgstr "La linealidad es simétrica" +msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" +msgstr "Cuando ``false``: ``cap`` límite por ``Start vid`` será devuelto" -msgid "Graph where linearity is symmetrical." -msgstr "Grafo donde la linealidad es simétrica." +msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgid "The four edges can be replaced by two directed edges." -msgstr "Las cuatro aristas pueden ser reemplazadas con dos aristas dirigidas." +msgid "``pgr_dijkstraNearCost``" +msgstr "``pgr_dijkstraNearCost``" -msgid "Edge :math:`3 - 1`." -msgstr "Arista :math:`3 - 1`." +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNearCost`` — Usando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano." -msgid "With cost: :math:`6`." -msgstr "Con costo: :math:`6`." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])" -msgid "The four edges can be replaced by one undirected edge." -msgstr "Las cuatro aristas pueden ser reemplazadas con una arista no dirigida." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])" -msgid "Step by step linear contraction" -msgstr "Contracción lineal, paso a paso" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])" -msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" -msgstr "La contracción lineal se detendrá hasta que no hayan más aristas lineales. Por ejemplo, en el siguiente grafo hay aristas lineales" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])" -msgid "Contracting vertex :math:`3`," -msgstr "Contrayendo el vértice :math:`3`," +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -msgid "The vertex :math:`3` is removed from the graph" -msgstr "El vértice :math:`3` se elimina del grafo" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos*, [**opciones**])" -msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." -msgstr "Los aristas :math:`2 \\rightarrow 3` y :math:`w \\rightarrow z` fueron eliminados del grafo." +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" +msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`6`" -msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." -msgstr "Se inserta una nuevo arista :math:`2 \\rightarrow 4` y se representa con color rojo." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -msgid "Contracting vertex :math:`2`:" -msgstr "Contrayendo el vértice :math:`2`:" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "The vertex :math:`2` is removed from the graph" -msgstr "El vértice :math:`2` se elimina del grafo" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgstr "La mejor es :math:`(11 \\rightarrow 16)` con un costo de :math:`1` (line: `1`)" -msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." -msgstr "Los aristas :math:`1 \\rightarrow 2` y :math:`2 \\rightarrow 3` son eliminados del grafo." +#, fuzzy +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgstr "Ambos son igualmente buenos ya que tienen el mismo costo. (lines: `12` and `13`)" -msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." -msgstr "Se inserta una nuevo arista :math:`1 \\rightarrow 3` y se representa con color rojo." +msgid "``pgr_dijkstraVia``" +msgstr "``pgr_dijkstraVia``" -msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." -msgstr "El arista :math:`1 \\rightarrow 3` tiene la información de los costos y nodos que fueron contraídos." +msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." +msgstr "``pgr_dijkstraVia`` - Ruta que recorre una lista de vértices." -msgid "Create the contracted graph." -msgstr "Crear el grafo contraído." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "Dada una lista de vértices y un grafo, esta función equivale a encontrar el camino más corto entre :math:`vértice_i` y :math:`vértice_{i+1}` para todo :math:`i < tamaño\\_de(vía\\;vértices)`." -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "``pgr_cuthillMckeeOrdering`` - Experimental" +msgid "Route" +msgstr "Ruta" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" -msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" +msgid "is a sequence of paths." +msgstr "es una secuencia de trayectorias." -msgid "Version 3.4.0" -msgstr "Versión 3.4.0" +msgid "Path" +msgstr "Ruta" -msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." -msgstr "En álgebra lineal numérica, el algoritmo Cuthill-McKee (CM), llamado así por Elizabeth Cuthill y James McKee, es un algoritmo para permutar una matriz dispersa que tiene un patrón de dispersidad simétrico en una forma de matriz de banda con un ancho de banda pequeño." +msgid "is a section of the route." +msgstr "es una sección de la ruta." -msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." -msgstr "Básicamente, se asigna a los vértices un orden de búsqueda breadth-first, con la salvedad de que, en cada paso, los vértices adyacentes se colocan en la cola por orden creciente de grado." +msgid "One Via" +msgstr "Una Vía" -msgid "The implementation is for **undirected** graphs." -msgstr "La implementación es para grafos **no dirigidos**." +msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgstr "pgr_dijkstraVia(`SQL de aristas`_, **vértices**, [**opciones**])" -msgid "The bandwidth minimization problems are considered NP-complete problems." -msgstr "Los problemas de minimización del ancho de banda se consideran problemas NP-completos." +msgid "**options:** ``[directed, strict, U_turn_on_edge]``" +msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" -msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`" +msgid "Returns set of |via-result|" +msgstr "Regresa el conjunto de |via-result|" -msgid "where :math:`|V|` is the number of vertices," -msgstr "donde :math:`|V|` es el número de vértices," +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido." -msgid ":math:`m` is the maximum degree of the vertices in the graph." -msgstr ":math:`m` es el grado máximo de los vértices en el grafo." +msgid "Via optional parameters" +msgstr "Parámetros opcionales Vía" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" -msgstr "pgr_cuthillMckeeOrdering(`SQL de aristas`_)" +msgid "When ``true`` departing from a visited vertex will not try to avoid" +msgstr "Cuando ``true`` saliendo desde un vértice visitado no intentara esquivarlo" -msgid "Returns set of |result_node_order|" -msgstr "Regresa el conjunto de |result_node_order|" +msgid "Identifier of a path. Has value **1** for the first path." +msgstr "Identificador del camino. Tiene valor **1** para el primer camino." -msgid "Graph ordering of pgRouting :doc:`sampledata`" -msgstr "Ordenamiento del grafo de los :doc:`sampledata` de pgRouting" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgstr "Identificador de la arsita utilizada para ir del ``node`` al siguiente nodo de la secuencia de ruta." -msgid "Returns set of ``(seq, node)``" -msgstr "Regresa el conjunto de ``(seq, node)``" +msgid "-1 for the last node of the path." +msgstr "-1 para el último nodo de la ruta." -msgid "Sequence of the order starting from 1." -msgstr "Valor secuencial a partir de 1." +msgid "-2 for the last node of the route." +msgstr "-2 para el último nodo de la ruta." -msgid "New ordering in reverse order." -msgstr "Nuevo ordenamiento es en orden inverso." +msgid "``route_agg_cost``" +msgstr "``route_agg_cost``" -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "`Boost: Ordernamiento Cuthill-McKee `__" +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgstr "Costo total desde ``start_vid`` en ``seq = 1`` hasta ``end_vid`` del ``seq`` actual." -msgid "`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "`Wikipedia: Ordenamiento Cuthill-McKee `__" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo **dirigido**." -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr "``pgr_dagShortestPath`` - Experimental" +msgid "The main query" +msgstr "La consulta principal" -msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." -msgstr "``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de caminos más cortos DAG implementado por Boost.Graph." +msgid "Aggregate cost of the third path." +msgstr "Costo agregado de la tercera ruta." -msgid "pgr_dagShortestPath(Combinations)" -msgstr "pgr_dagShortestPath(Combinaciones)" +msgid "Route's aggregate cost of the route at the end of the third path." +msgstr "Costo agregado al final de la tercera ruta." -msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." -msgstr "Ruta Más Corta para grafos acíclicos dirigidos (DAG) es un algoritmo de búsqueda de grafos que resuelve el problema de ruta más corta para el grafo acíclico dirigido ponderado, produciendo una ruta más corta desde un vértice inicial (``start_vid``) a un vértice final (``end_vid``)." +msgid "Nodes visited in the route." +msgstr "Nodos visitados en la ruta." -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." -msgstr "Esta implementación solo se puede utilizar con un grafo **dirigido** sin ciclos i.e., es decir, un grafo acíclico dirigido." +msgid "The aggregate costs of the route when the visited vertices are reached." +msgstr "Costo agregado de la ruta al llegar a los vértices visitados." -msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." -msgstr "El algoritmo se basa en la ordenación topológica del dag para imponer un orden lineal en los vértices, y por lo tanto es más eficaz para DAG que el algoritmo Dijkstra o Bellman-Ford." +msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgstr "Estado de \"pasa enfrente\" o \"visita\" los nodos." -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." -msgstr "El proceso solo es válido para grafos acíclicos dirigidos ponderados, de lo contrario lanzará advertencias." +msgid ":doc:`via-category`." +msgstr ":doc:`via-category`." -msgid "The `agg_cost` the non included values `(v, v)` is `0`" -msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es `0`" +msgid ":doc:`dijkstra-family`." +msgstr ":doc:`dijkstra-family`." -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" -msgstr "El ``agg_cost`` de los valores no incluídos ``(u, v)`` es :math: `\\infty`" +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgstr "``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de inicio." -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" -msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V + E))`" +msgid "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance(Vértice único)" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destino**)" +msgid "Added ``depth`` and ``start_vid`` result columns." +msgstr "Agregado las columnas de resultados``depth`` y ``start_vid``." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destinos**)" +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance(Múltiples vértices)" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destino**)" +msgid "Result column name change: ``from_v`` to ``start_vid``." +msgstr "Cambio de nombre en la columna de resultados: ``from_v`` a ``start_vid``." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destinos**)" +msgid "Added ``depth`` and ``pred`` result columns." +msgstr "Agregado las columnas de resultados``depth`` y ``pred``." -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, `SQL de combinaciones`_)" +msgid "Signature change:" +msgstr "Cambio de firma:" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" -msgstr "Del vértice :math:`5` al vértice :math:`11` en un grafo **dirigido**" +msgid "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance(vértice único)" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" -msgstr "Desde el vértice :math:`5` a los vértices :math:`\\{ 7, 11\\}`" +msgid "New official signature:" +msgstr "Nueva firma oficial:" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" -msgstr "Desde los vértices :math:`\\{5, 10\\}` al vértice :math:`11`" +msgid "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance(múltiples vértices)" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" -msgstr "Desde los vértices :math:`\\{5, 15\\}` a los vértices :math:`\\{11, 17\\}` en un grafo **no dirigido**" +#, fuzzy +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgstr "Usando el algoritmo Dijkstra, se extraen todos los nodos que tienen costes menores o iguales al valor ``distance``. Los bordes extraídos se ajustarán al árbol de expansión correspondiente." -msgid "Return columns" -msgstr "Columnas de Resultados" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgstr "pgr_drivingDistance(`SQL de aristas`_, **Raíz**, **distancia**, [``directed``])" -msgid "Making **start_vids** the same as **end_vids**" -msgstr "Haciendo **vértices de salida** igual que **vértices destino**" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgstr "pgr_drivingDistance(`SQL de aristas`_, **raices**, **distancia**, [**opciones**])" -msgid "`Boost: DAG shortest paths `__" -msgstr "`Boost: Caminos mas cortos en DAG `__" +msgid "**options:** [directed, equicost]" +msgstr "**opcionales:** [directed, equicost]" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" -msgstr "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Single Vertex" +msgstr "Vértice Único" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +msgid "From vertex :math:`11` for a distance of :math:`3.0`" +msgstr "Desde el vértice :math:`11` por una distancia de :math:`3.0`" -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." -msgstr "``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el número de aristas incidentes en el vértice." +msgid "Multiple Vertices" +msgstr "Múltiples Vértices" -msgid "Error messages adjustment." -msgstr "" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgstr "Desde los vertices :math:`\\{11, 16\\}` por una distancia de :math:`3.0` con equi-cost en un grafo dirigido" -msgid "New signature with only Edges SQL." -msgstr "" +msgid "Driving distance optional parameters" +msgstr "Parámetros opcionales de distancia de manejo" -msgid "Calculates the degree of the vertices of an undirected graph" -msgstr "Calcula el grado de los vértices de un grafo no dirigido" +msgid "``equicost``" +msgstr "``equicost``" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." -msgstr "El grado (o valencia) de un vértice de un grafo es el número de aristas incidentes al vértice." +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgstr "Cuando ``true`` el nodo solo aparece en la lista más cercana a ``start_vid``. Empates son rotos arbitrareamente." -msgid "A loop contributes 2 to a vertex's degree." -msgstr "" +msgid "When ``false`` which resembles several calls using the single vertex signature." +msgstr "Cuando ``false`` se asemeja a varias llamadas usando la firma de vértice único." -msgid "A vertex with degree 0 is called an isolated vertex." +msgid "end-before" msgstr "" -msgid "Isolated vertex is not part of the result" -msgstr "Vértice aislado no forma parte del resultado" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgstr "Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un grafo no dirigido" -msgid "Vertex not participating on the subgraph is considered and isolated vertex." -msgstr "" +msgid "``pgr_edgeColoring`` - Experimental" +msgstr "``pgr_edgeColoring`` - Experimental" -msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." -msgstr "Dado que se trata de una ejecución ``dryrun``, el código de todos los cálculos se muestra en el ``NOTICE`` de PostgreSQL." +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgstr "``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos acíclicos" -msgid "The code can be used as base code for the particular application requirements." -msgstr "" +msgid "Output columns standardized to |result_edge_color|" +msgstr "Columnas de resultados estandarizados a |result_edge_color|" -msgid "No ordering is performed." -msgstr "No se realiza ningún ordenamiento." +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgstr "Coloración de arístas es un algoritmo utilizado para colorear aristas para los vértices de un grafo. Es una asignación de colores a las aristas del grafo de tal manera que dos aristas adjacentes no tengan el mismo color." -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" -msgstr "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgid "The implementation is for **undirected** and **loop-free** graphs" +msgstr "La implementación es para grafos **no dirigidos** sin **auto-ciclos**" -msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" -msgstr "pgr_degree(`SQL de aristas`_ , `SQL de vértices`_, [``dryrun``])" +msgid "loop free" +msgstr "Sin auto ciclos" -msgid "RETURNS SETOF |result-degree|" -msgstr "REGRESA CONJUNTO DE |result-degree|" +msgid "no self-loops and no parallel edges." +msgstr "Sin auto ciclos ni aristas paralelas." -msgid "Edges" -msgstr "" +msgid "Provides the color to be assigned to all the edges present in the graph." +msgstr "Provee el color asignado a todas las aristas existentes en el grafo." -msgid "example" -msgstr "ejemplo" +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +msgstr "A lo más :math:`\\Delta + 1` colores son usados, donde :math:`\\Delta` is el grado del grafo." -msgid "Get the degree of the vertices defined on the edges table" -msgstr "Obtener el grado de los vértices definidos en la tabla de aristas" +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgstr "Esto es óptimo para algunos gráfos. y por el teorema de Vizing, utiliza a lo más un color extra que el óptimo para todos los demás." -msgid "Edges and Vertices" -msgstr "Aristas y Vértices" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgstr "el número cromático :math:`x'(G)` (número mínimo de colores necesarios para colorear correctamente las aristas del grafo) es igual al grado :math:`\\Delta + 1` del grafo, (:math:`x'(G) = \\Delta`)" -msgid "Extracting the vertex information" -msgstr "Extraer la información del vértice" +msgid "The algorithm tries to assign the least possible color to every edge." +msgstr "El algoritmo trata de asignar el menor color a cada arista." -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." -msgstr "" +msgid "Does not always produce optimal coloring." +msgstr "No produce siempre produce la coloración ótpima." -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" -msgstr "" +msgid "The returned rows are ordered in ascending order of the edge identifier." +msgstr "Las filas de resultados son ordenados ascendentemente respecto al identificador de la arista." -msgid "Calculate the degree of the nodes:" -msgstr "Calcula el grado de los vértices:" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" +msgstr "Coloración eficiente de un grafo es un problema NP-Duro, por lo que:" -msgid "`Vertex SQL`_" -msgstr "`SQL de vértices`_" +msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" +msgstr "El tiempo de ejecución de esta implementación es: :math:`O(|E|*|V|)`" -msgid "`Vertex SQL`_ as described below" -msgstr "`Vertex SQL`_ como se describe abajo" +msgid "where :math:`|E|` is the number of edges in the graph," +msgstr "donde :math:`|E|` es la cantidad de arístas en el grafo," -msgid "``dryrun``" -msgstr "``dryrun``" +msgid ":math:`|V|` is the number of vertices in the graph." +msgstr ":math:`|V|` es la cantidad de vertices del grafo." -msgid "When true do not process and get in a NOTICE the resulting query." -msgstr "Cuando verdadero, no procesar y recibir un AVISO de la consulta resultante." +msgid "pgr_edgeColoring(`Edges SQL`_)" +msgstr "pgr_edgeColoring(`SQL de aristas`_)" -msgid "For the `Edges and Vertices`_ signature:" -msgstr "Para la firma `Aristas y Vértices`_:" +msgid "Graph coloring of pgRouting :doc:`sampledata`" +msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" -msgid "For the `Edges`_ signature:" -msgstr "Para la firma `Aristas`_:" +msgid "`Boost: Edge Coloring `__" +msgstr "`Boost: Coloración de Segmentos `__" -msgid "Vertex SQL" -msgstr "SQL de vértices" +msgid "`Wikipedia: Graph coloring `__" +msgstr "`Wikipedia: Coloración de grafos `__" -msgid "``in_edges``" -msgstr "``in_edges``" +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgstr "``pgr_edgeDisjointPaths`` — Calcula las rutas de aristas desarticuladas entre dos grupos de vértices." -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." -msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *primer punto final*." +msgid "Output columns standardized to |generic-result|" +msgstr "Columnas de resultados estandarizados a |generic-result|" -msgid "When missing, ``out_edges`` must exist." -msgstr "Si falta, ``out_edges`` debe existir." +msgid "pgr_edgeDisjointPaths(Combinations)" +msgstr "pgr_edgeDisjointPaths(Combinaciones)" -msgid "``out_edges``" -msgstr "``out_edges``" +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices. Utiliza algoritmos de flujo máximo subyacentes para calcular las rutas." -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." -msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *segundo punto final*." +msgid "The main characterics are:" +msgstr "Los principales características son:" -msgid "When missing, ``in_edges`` must exist." -msgstr "Si falta, ``in_edges`` debe existir." +msgid "Calculates the edge disjoint paths between any two groups of vertices." +msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices cualquiera." -msgid "Vertex identifier" -msgstr "Identificador de vértice" +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgstr "Devuelve un conjunto vacío EMPTY SET cuando el origen y el destino son los mismos o no se puede llegar." -msgid "``degree``" -msgstr "``degree``" +msgid "The graph can be directed or undirected." +msgstr "El gráfico puede dirigido o no." -msgid "Number of edges that are incident to the vertex ``id``" -msgstr "Número de aristas incidentes al vértice ``id``" +msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." +msgstr "Utiliza :doc:`pgr_boykovKolmogorov` para calcular las rutas." -msgid "Degree of a loop" -msgstr "Grado de un bucle" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "Using the `Edges`_ signature." -msgstr "Usando la firma `Aristas`_." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "Using the `Edges and Vertices`_ signature." -msgstr "" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "Degree of a sub graph" -msgstr "Grado de un subgrafo" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "For the following is a subgraph of the :doc:`sampledata`:" -msgstr "Para el siguiente sub-grafo de :doc:`sampledata`:" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" -msgstr "" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}` en un grafo no dirigido." -msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" -msgstr "" +msgid "Manually assigned vertex combinations on an undirected graph." +msgstr "Asignando manualmente las combinaciones de vértices en un grafo no dirigido." -msgid "The vertices not participating on the edge are considered isolated" -msgstr "" +msgid "``pgr_edmondsKarp``" +msgstr "``pgr_edmondsKarp``" -msgid "their degree is 0 in the subgraph and" -msgstr "" +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgstr "``pgr_edmondsKarp`` — Calcula el flujo en las aristas del grafo que maximizan el flujo de las fuentes a los destinos usando el algoritmo de Edmonds Karp." -msgid "their degree is not shown in the output." -msgstr "" +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(Combinaciones)" -msgid "Using a vertex table" -msgstr "Usando una tabla de vértices" +msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" +msgstr "Renombrado desde ``pgr_maxFlowEdmondsKarp``" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." -msgstr "Para un tamaño de red razonable, es mejor preparar previamente una tabla de vértices y utilizarla en las llamadas a ``pgr_degree``." +msgid "Running time: :math:`O( V * E ^ 2)`" +msgstr "Tiempo de ejecución: :math:`O( V * E ^ 2)`" -msgid "Extract the vertex information and save into a table:" -msgstr "Extraer la información del vértice y almacenar en una tabla:" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destino**)" -msgid "Dry run execution" -msgstr "Ejecución de prueba" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destinos**)" -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." -msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilizar ``dryrun := true``." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destino**)" -msgid "The results can be used as base code to make a refinement based on the backend development needs." -msgstr "Los resultados se pueden usar como código base para realizar un refinamiento basado en las necesidades de desarrollo de back-end." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destinos**)" -msgid "Finding dead ends" -msgstr "Encontrando callejones sin salida" +msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_edmondsKarp(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." -msgstr "Si se tiene una tabla de vértices ya construida usando ``pgr_extractVertices`` y se quiere el grado de todo el grafo en lugar de un subconjunto, se puede trabajar con las columnas ``in_edges`` y ``out_edges`` directamente." +msgid "`Boost: Edmonds Karp max flow `__" +msgstr "`Boost: Edmonds Karp max flow `__" -msgid "The degree of a dead end is 1." -msgstr "El grado de un sin salida es 1." +msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgid "Finding linear vertices" -msgstr "Encontrando vértices lineales" +msgid "``pgr_edwardMoore`` - Experimental" +msgstr "``pgr_edwardMoore`` - Experimental" -msgid "The degree of a linear vertex is 2." -msgstr "El grado de un vértice lineal es 2." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgstr "``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-Moore." -msgid "If there is a vertices table already built using the ``pgr_extractVertices``" -msgstr "Cuando hay una tabla de vértices construida usando ``pgr_extractVertices``" +msgid "pgr_edwardMoore(Combinations)" +msgstr "pgr_edwardMoore(Combinaciones)" -msgid ":doc:`pgr_extractVertices`" -msgstr ":doc:`pgr_extractVertices`" +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgstr "Algoritmo de Edward Moore es una mejora del algoritmo Bellman-Ford. Puede calcular las rutas más cortas desde un único vértice de origen a todos los demás vértices de un grafo dirigido ponderado. La principal diferencia entre algoritmo de Edward Moore y algoritmo de Bellman Ford radica en el tiempo de ejecución." -msgid "``pgr_depthFirstSearch`` - Proposed" -msgstr "``pgr_depthFirstSearch`` - Propusto" +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgstr "El peor de los casos de funcionamiento del algoritmo es :math:`O(| V | * | E |)` similar a la complejidad temporal del algoritmo Bellman-Ford. Sin embargo, los experimentos sugieren que este algoritmo tiene una complejidad de tiempo de ejecución promedio de :math:`O( | E | )` para grafos aleatorios. Esto es significativamente más rápido en términos de velocidad de cálculo." -msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." -msgstr "``pgr_depthFirstSearch`` — Devuelve un recorrido de búsqueda de profundidad del grafo. El grafo puede ser dirigido o no dirigido." +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgstr "Por lo tanto, el algoritmo es, en el mejor de los casos, significativamente más rápido que el algoritmo Bellman-Ford y es en el peor de los casos, tan bueno como el algoritmo Bellman-Ford" -msgid "Version 3.3.0" -msgstr "Versión 3.3.0" +msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" +msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es :math:`0`" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." -msgstr "El algoritmo de Primera Búsqueda de Profundidad es un algoritmo de recorrido que comienza desde un vértice raíz, va lo más profundo posible y retrocede una vez que se alcanza un vértice sin vértices adyacentes o con todos los vértices adyacentes visitados. El recorrido continúa hasta que se visitan todos los vértices accesibles desde el vértice raíz." +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`." -msgid "The implementation works for both **directed** and **undirected** graphs." -msgstr "La implementación funciona para los grafos **dirigidos** y **no dirigidos**." +msgid "Running time:" +msgstr "Tiempo de ejecución:" -msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." -msgstr "Proporciona el recorrido de Búsqueda de Primero Profundidad desde un vértice raíz o desde un conjunto de vértices raíz." +msgid "Worst case: :math:`O(| V | * | E |)`" +msgstr "Peor caso: :math:`O(| V | * | E |)`" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." -msgstr "Un parámetro opcional de profundidad máxima no negativo para limitar los resultados hasta una profundidad particular." +msgid "Average case: :math:`O( | E | )`" +msgstr "Caso promedio: :math:`O( | E | )`" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." -msgstr "Para fines de optimización, se omiten los valores duplicados en los `Root vids`." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "It does not produce the shortest path from a root vertex to a target vertex." -msgstr "No produce la ruta más corta desde un vértice de origen a un vértice de destino." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." -msgstr "No se garantiza que el coste agregado del recorrido sea mínimo." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "The returned values are ordered in ascending order of `start_vid`." -msgstr "Los valores devueltos se ordenan en orden ascendente de `start_vid`." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "Depth First Search Running time: :math:`O(E + V)`" -msgstr "Tiempo de ejecución de la Primera Búsqueda de Profundidad: :math:`O(E + V)`" +msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raíz**, [**opciones**])" +msgid "Using a combinations table on an **undirected** graph." +msgstr "Uso de una tabla de combinaciones en un grafo **no dirigido**." -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raices**, [**opciones**])" +msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgid "**options:** ``[directed, max_depth]``" -msgstr "**opcionales:** ``[directed, max_depth]``" +msgid "``pgr_extractVertices``" +msgstr "``pgr_extractVertices``" -msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." -msgstr "Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``." +msgid "``pgr_extractVertices`` — Extracts the vertices information" +msgstr "``pgr_extractVertices`` — Extrae la información de los vértices" -msgid "`Boost: Depth First Search `__" -msgstr "`Boost: Primera Búsqueda de Profundidad `__" +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo." -msgid "`Boost: Undirected DFS `__" -msgstr "`Boost: DFS No dirigido `__" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgstr "Cuando se proporciona el identificador de arista, también se calcularán las aristas de entrada y salida" -msgid "`Wikipedia: Depth First Search algorithm `__" -msgstr "'Wikipedia: Algoritmo de la Primera Búsqueda de Profundidad `__" +msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" -msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." -msgstr "``pgr_dijkstra`` - Camino más corto utilizando el algoritmo de Dijkstra." +msgid "RETURNS SETOF |result-extract|" +msgstr "REGRESA CONJUNTO DE |result-extract|" -msgid "Version 3.5.0" -msgstr "Versión 3.5.0" +msgid "When line geometry is known" +msgstr "Cuando se conoce la geometría de línea" -msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_dijkstra(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." +msgid "(Optional) identifier of the edge." +msgstr "(Opcional) identificador de la arista." -msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." -msgstr "pgr_dijkstra(Uno a Muchos) ha añadido la columna ``end_vid``." +msgid "``geom``" +msgstr "``geom``" -msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." -msgstr "pgr_dijkstra(Muchos a Uno) ha añadido la columna ``start_vid``." +msgid "``LINESTRING``" +msgstr "``LINESTRING``" -msgid "Version 3.1.0" -msgstr "Versión 3.1.0" +msgid "Geometry of the edge." +msgstr "Geometría de la arista." -msgid "pgr_dijkstra(Combinations)" -msgstr "pgr_dijkstra(Combinaciones)" +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgstr "Esta consulta interna tiene prioridad sobre las dos consultas internas siguientes, por lo que se omiten otras columnas cuando aparece la columna ''geom''." -msgid "Version 2.2.0" -msgstr "Version 2.2.0" +msgid "Ignored columns:" +msgstr "Columnas ignoradas:" -msgid "pgr_dijkstra(One to Many)" -msgstr "pgr_dijkstra(Uno a Muchos)" +msgid "``startpoint``" +msgstr "``startpoint``" -msgid "pgr_dijkstra(Many to One)" -msgstr "pgr_dijkstra(Muchos a Uno)" +msgid "``endpoint``" +msgstr "``endpoint``" -msgid "pgr_dijkstra(Many to Many)" -msgstr "pgr_dijkstra(Muchos a Muchos)" +msgid "When vertex geometry is known" +msgstr "Cuando se conoce la geometría de vértices" -msgid "Signature change on pgr_dijkstra(One to One)" -msgstr "Cambio de firma en pgr_dijkstra(Uno a Uno)" +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgstr "Para utilizar esta consulta interna, la columna ``geom`` no debe formar parte del conjunto de columnas." -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "``POINT``" +msgstr "``POINT``" -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "POINT geometry of the starting vertex." +msgstr "Geometría POINT del vértice inicial." -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "POINT geometry of the ending vertex." +msgstr "Geometría POINT del vértice final." -msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgstr "Esta consulta interna tiene prioridad sobre la siguiente consulta interna, por lo que otras columnas son ignoradas cuando aparecen las columnas ``startpoint`` y ``endpoint``." -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" -msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**" +msgid "When identifiers of vertices are known" +msgstr "Cuando se conocen identificadores de vértices" -msgid "The examples of this section are based on the :doc:`sampledata` network." -msgstr "Los ejemplos de esta sección se basan en la red :doc:`sampledata`." +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgstr "Para utilizar esta consulta interna, las columnas ``geom``, ``startpoint`` y ``endpoint`` no deben formar parte del conjunto de columnas." -msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "Para grafos **dirigidos** con columnas ``cost`` and ``reverse_cost``" +msgid "``NULL`` When the ``id`` is not part of the inner query" +msgstr "``NULL`` When the ``id`` no forma parte de la consulta interna" -msgid "Directed graph with cost and reverse cost columns" -msgstr "Grafo dirigido con columnas de costo y costo de regreso" +msgid "X value of the point geometry" +msgstr "Valor X de la geometría del punto" -msgid "1) Path from :math:`6` to :math:`10`" -msgstr "1) Ruta de :math:`6` a :math:`10`" +msgid "``NULL`` When no geometry is provided" +msgstr "``NULL`` Cuando no se proporciona geometría" -msgid "2) Path from :math:`6` to :math:`7`" -msgstr "2) Ruta de :math:`6` a :math:`7`" +msgid "Geometry of the point" +msgstr "Geometría del punto" -msgid "3) Path from :math:`12` to :math:`10`" -msgstr "3) Ruta de :math:`12` a :math:`10`" +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilice ``dryrun := true``." -msgid "4) Path from :math:`12` to :math:`7`" -msgstr "4) Ruta de :math:`12` a :math:`7`" +msgid "Create a routing topology" +msgstr "Creación de una topología de ruteo" -msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" -msgstr "5) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 1 y 2" +msgid "Make sure the database does not have the ``vertices_table``" +msgstr "Asegurarse de que la base de datos no tiene ``vertices_table``" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" -msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgid "Clean up the columns of the routing topology to be created" +msgstr "Limpieza de las columnas de la topología de ruteo que se creará" -msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" -msgstr "6) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 2 y 4" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgstr "Cuando ``LINESTRING`` tiene un SRID entonces usa ``geom::geometry(POINT, )``" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" -msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgid "For big edge tables that are been prepared," +msgstr "Para grandes tablas de aristas que han sido preparadas," -msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" -msgstr "7) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 1 y 4" +msgid "Create it as ``UNLOGGED`` and" +msgstr "Crearlo como ``UNLOGGED`` y" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" -msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" +msgstr "Después de crear la tabla ``ALTER TABLE .. SET LOGGED``" -msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" -msgstr "8) Usando `Combinaciones`_ para obtener la solución de los ejemplos 1 a 3" +msgid "Inspect the vertices table" +msgstr "Inspeccionar la tabla de vértices" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Create the routing topology on the edge table" +msgstr "Creación de la topología de ruteo en la tabla de aristas" -msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "Para grafos **no dirigidos** con columnas ``cost`` y ``reverse_cost``" +msgid "Updating the ``source`` information" +msgstr "Actualizar de la información de ``source``" -msgid "Undirected graph with cost and reverse cost columns" -msgstr "Grafo no dirigido con columnas de costo y costo de regreso" +msgid "Updating the ``target`` information" +msgstr "Actualización de la información de ``target``" -msgid "9) Path from :math:`6` to :math:`10`" -msgstr "9) Ruta de :math:`6` a :math:`10`" +msgid "Inspect the routing topology" +msgstr "Inspección de la topología de ruteo" -msgid "10) Path from :math:`6` to :math:`7`" -msgstr "10) Ruta de :math:`6` a :math:`7`" +msgid "**Generated topology**" +msgstr "**Topología generada**" -msgid "11) Path from :math:`12` to :math:`10`" -msgstr "11) Ruta de :math:`12` a :math:`10`" +msgid "``pgr_findCloseEdges``" +msgstr "``pgr_findCloseEdges``" -msgid "12) Path from :math:`12` to :math:`7`" -msgstr "12) Ruta de :math:`12` a :math:`7`" +msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." +msgstr "``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría puntual." -msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" -msgstr "13) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 9 y 10" +msgid "``partial`` option is removed." +msgstr "Opción ``partial`` se elimina." -msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" -msgstr "14) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 10 y 12" +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgstr "``pgr_findCloseEdges`` - Función de utilidad que encuentra la arista más cercana a una geometría de puntos." -msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" -msgstr "15) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 9 y 12" +msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgstr "Las geometrías deben estar en el mismo sistema de coordenadas (tener el mismo SRID)." -msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" -msgstr "16) Usando `Combinaciones`_ para obtener la solución de los ejemplos 9 a 13" +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgstr "El código para realizar los cálculos puede obtenerse para realizar los ajustes específicos que necesite la aplicación." -msgid "For **directed** graphs only with ``cost`` column" -msgstr "Para grafos **dirigidos** con columna``cost``" +msgid "``EMPTY SET`` is returned on dryrun executions" +msgstr "``EMPTY SET`` se devuelve en ejecuciones en seco" -msgid "Directed graph only with cost column" -msgstr "Grafo dirigido con solo la columna costo" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **punto**, **tolerancia**, [**options**])" -msgid "17) Path from :math:`6` to :math:`10`" -msgstr "17) Ruta de :math:`6` a :math:`10`" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **puntos**, **tolerancia**, [**options**])" -msgid "18) Path from :math:`6` to :math:`7`" -msgstr "18) Ruta de :math:`6` a :math:`7`" +msgid "**options:** ``[cap, dryrun]``" +msgstr "**opciones:** ``[cap, dryrun]``" -msgid "19) Path from :math:`12` to :math:`10`" -msgstr "19) Ruta de :math:`12` a :math:`10`" +msgid "Returns set of |result-find|" +msgstr "Regresa conjunto de |result-find|" -msgid "20) Path from :math:`12` to :math:`7`" -msgstr "20) Ruta de :math:`12` a :math:`7`" +msgid "One point" +msgstr "Un punto" -msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" -msgstr "21) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 17 y 18" +msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgstr "" -msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" -msgstr "22) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 18 y 20" +msgid "``cap => 2``" +msgstr "``cap => 2``" -msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" -msgstr "23) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 17 y 20" +msgid "Many points" +msgstr "Muchos puntos" -msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" -msgstr "24) Usando `Combinaciones`_ para obtener la solución de los ejemplos 17 a 19" +msgid "For each points of interests, find the closest edge." +msgstr "" -msgid "For **undirected** graphs only with ``cost`` column" -msgstr "Para grafos **no dirigidos** con columna``cost``" +msgid "**point**" +msgstr "**punto**" -msgid "Undirected graph only with cost column" -msgstr "Grafo no dirigido con solo la columna costo" +msgid "The point geometry" +msgstr "La geometría del punto" -msgid "25) Path from :math:`6` to :math:`10`" -msgstr "25) Ruta de :math:`6` a :math:`10`" +msgid "**points**" +msgstr "**puntos**" -msgid "26) Path from :math:`6` to :math:`7`" -msgstr "26) Ruta de :math:`6` a :math:`7`" +msgid "``POINT[]``" +msgstr "``POINT``" -msgid "27) Path from :math:`12` to :math:`10`" -msgstr "27) Ruta de :math:`12` a :math:`10`" +msgid "An array of point geometries" +msgstr "Una matriz de geometrías de puntos" -msgid "28) Path from :math:`12` to :math:`7`" -msgstr "28) Ruta de :math:`12` a :math:`7`" +msgid "**tolerance**" +msgstr "**tolerancia**" -msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" -msgstr "29) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 25 y 26" +msgid "Max distance between geometries" +msgstr "Distancia máxima entre geometrías" -msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" -msgstr "30) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 26 y 28" +msgid "Limit output rows" +msgstr "Limitar las filas de salida" -msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" -msgstr "31) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 25 y 28" +msgid "When ``false`` calculations are performed." +msgstr "Cuando ``false`` se realizan los cálculos." -msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" -msgstr "32) Usando `Combinaciones`_ para obtener la solución de los ejemplos 25 a 27" +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgstr "Cuando ``true`` los cálculos no se realizan y la consulta para hacer los cálculos se expone en un ``NOTICE`` de PostgreSQL." -msgid "Equvalences between signatures" -msgstr "Equivalencias entre firmas" +msgid "``geometry``" +msgstr "``geometry``" -msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" -msgstr "Los siguientes ejemplos son para la ruta :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The ``LINESTRING`` geometry of the edge." +msgstr "La geometría ``LINESTRING`` de la arista." -msgid "33) Using `One to One`_" -msgstr "33) Usando `Uno a Uno`_" +msgid "When :math:`cap = 1`, it is the closest edge." +msgstr "Cuando :math:`cap = 1`, es la arista más cercana." -msgid "34) Using `One to Many`_" -msgstr "34) Usando `Uno a Muchos`_" +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgstr "Valor entre <0,1> indica la posición relativa desde el primer punto de la arista." -msgid "35) Using `Many to One`_" -msgstr "35) Usando `Muchos a Uno`_" - -msgid "36) Using `Many to Many`_" -msgstr "36) Usando `Muchos a Muchos`_" +msgid "Value in ``[r, l]`` indicating if the point is:" +msgstr "Valor en ``[r, l]`` que indica si el punto es:" -msgid "37) Using `Combinations`_" -msgstr "37) Usando `Combinaciones`_" +msgid "At the right ``r`` of the segment." +msgstr "A la derecha ``r`` del segmento." -msgid "`Boost: Dijkstra shortest paths `__" -msgstr "`Boost: Camino mas corto Dijkstra `__" +msgid "When the point is on the line it is considered to be on the right." +msgstr "Cuando el punto está en la línea se considera que está a la derecha." -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "At the left ``l`` of the segment." +msgstr "A la izquierda ``l`` del segmento." -msgid "``pgr_dijkstraCost``" -msgstr "``pgr_dijkstraCost``" +msgid "``distance``" +msgstr "``distance``" -msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." -msgstr "``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el algoritmo de Dijkstra." +msgid "Distance from the point to the edge." +msgstr "Distancia del punto a la arista." -msgid "pgr_dijkstraCost(Combinations)" -msgstr "pgr_dijkstraCost(Combinaciones)" +msgid "Original ``POINT`` geometry." +msgstr "Geometría original ``POINT``." -#, fuzzy -msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." -msgstr "La función ``pgr_dijkstraCost`` suma el coste del camino más corto utilizando el Algoritmo de Dijkstra." +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgstr "Geometría ``LINESTRING`` desde el **punto** original hasta el punto más cercano de la arista con identificador ``edge_id``" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "One point in an edge" +msgstr "Un punto en la arista" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "The green node is the original point." +msgstr "El nodo verde es el punto original." -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "``geom`` has the value of the original point." +msgstr "``geom`` Tiene el valor del punto original." -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgstr "La geometría ``edge``, es una línea que conecta al punto original con el punto más cercano de la arista :math:`sp \\rightarrow ep`." -msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "The point is located at the left of the edge." +msgstr "El punto original está situado a la izquierda de la arista." -msgid "``pgr_dijkstraCostMatrix``" -msgstr "``pgr_dijkstraCostMatrix``" +msgid "One point dry run execution" +msgstr "Ejecución en seco de un punto" -msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." -msgstr "``pgr_dijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_dijkstra`." +msgid "Using the query from the previous example:" +msgstr "Usando la consulta del ejemplo anterior:" -msgid "Using Dijkstra algorithm, calculate and return a cost matrix." -msgstr "Utilizando el algoritmo Dijkstra, calcula y devuelve una matriz de costes." +msgid "Returns ``EMPTY SET``." +msgstr "Devuelve ``CONJUNTO VACÍO``." -msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_dijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" +msgid "``dryrun => true``" +msgstr "``dryrun => true``" -msgid "``pgr_dijkstraNear``" -msgstr "``pgr_dijkstraNear``" +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." +msgstr "Genera un ``NOTICE`` de PostgreSQL con el código utilizado." -msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." -msgstr "``pgr_dijkstraNear`` — Utilizando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." +msgstr "" -msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." -msgstr "Dado un grafo, un vértice inicial y un conjunto de vértices finales, esta función encuentra la ruta más corta desde el vértice inicial hasta el vértice final más cercano." +msgid "Many points in an edge" +msgstr "Ejemplos de muchos puntos en una arista" -msgid "Uses Dijkstra algorithm." -msgstr "Utiliza el algoritmo Dijkstra." +msgid "The green nodes are the **original points**" +msgstr "Los nodos verdes son los **puntos originales**" -msgid "Works for **directed** and **undirected** graphs." -msgstr "Funciona para grafos **dirigidos** y **no dirigidos**." +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgstr "La geometría ``geom``, marcada como **g1** y **g2** son los **puntos originales**" -msgid "When there are more than one path to the same vertex with same cost:" -msgstr "Cuando hay más de una ruta al mismo vértice con el mismo coste:" +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgstr "La geometría ``edge``, marcada como **edge1** y **edge2** es una línea que conecta el **punto original** con el punto más cercano de la arista :math:`sp \\rightarrow ep`." -msgid "The algorithm will return just one path" -msgstr "El algoritmo devolverá solo una ruta" +msgid "Many points dry run execution" +msgstr "Ejecución en seco de muchos puntos" -msgid "Optionally allows to find more than one path." -msgstr "Opcionalmente permite encontrar más de una ruta." +msgid "Do not process query" +msgstr "No procesar la consulta" -msgid "When more than one path is to be returned:" -msgstr "Cuando se va a devolver más de una ruta:" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgstr "Generar un ``NOTICE`` de PostgreSQL con el código utilizado para calcular todas las columnas" -msgid "Results are sorted in increasing order of:" -msgstr "Los resultados se ordenan en orden creciente de:" +msgid "Find at most two routes to a given point" +msgstr "Encontrar como máximo dos rutas a un punto dado" -msgid "aggregate cost" -msgstr "costo agregado" +msgid "Using :doc:`pgr_withPoints`" +msgstr "Usando :doc:`pgr_withPoints`" -msgid "Within the same value of aggregate costs:" -msgstr "Dentro del mismo valor de los costes agregados:" +msgid "A point of interest table" +msgstr "Una tabla de puntos de interés" -msgid "results are sorted by (source, target)" -msgstr "los resultados se ordenan por (fuente, destino)" +msgid "Handling points outside the graph." +msgstr "Manejo de puntos fuera del gráfico." -msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" -msgstr "Tiempo de ejecución: Dijkstra tiempo de ejecución: :math:`drt = O((|E| + |V|)log|V|)`" +msgid "Points of interest" +msgstr "Puntos de interés" -msgid "One to Many; :math:`drt`" -msgstr "Uno a Muchos; :math:`drt`" +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgstr "Algunas veces las aplicaciones trabajan \"sobre la marcha\" comenzando desde una localización que no es un vértice en el grafo. Esas localizaciones, en pgRrouting se llaman puntos de interés." -msgid "Many to One: :math:`drt`" -msgstr "Muchos a Uno: :math:`drt`" +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." +msgstr "La información necesaria en los puntos de interés es ``pid``, ``edge_id``, ``side``, ``fraction``." -msgid "Many to Many: :math:`drt * |Starting vids|`" -msgstr "Muchos a Muchos: :math:`drt * |Starting vids|`" +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgstr "En esta documentación habrá unos 6 puntos de interés fijos y se almacenarán en una tabla." -msgid "Combinations: :math:`drt * |Starting vids|`" -msgstr "Combinaciones: :math:`drt * |Starting vids|`" +msgid "A unique identifier." +msgstr "Un identificador único." -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])" +msgid "Identifier of the nearest segment." +msgstr "Identificador del segmento mas próximo." -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])" +msgid "Is it on the left, right or both sides of the segment ``edge_id``." +msgstr "Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``." -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])" +msgid "Where in the segment is the point located." +msgstr "En qué parte del segmento se encuentra el punto." -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])" +msgid "The geometry of the points." +msgstr "La geometría de los puntos." -msgid "**options A:** ``[directed, cap]``" -msgstr "**opciones A:** ``[directed, cap]``" +msgid "The distance between ``geom`` and the segment ``edge_id``." +msgstr "La distancia entre ``geom`` y el segmento ``edge_id``." -msgid "**options B:** ``[directed, cap, global]``" -msgstr "**opciones B:** ``[directed, cap, global]``" +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." +msgstr "Un segmento que conecta la ``geom`` del punto al punto mas cercano al segmento ``edge_id``." -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgid "``newPoint``" +msgstr "``newPoint``" -msgid "**options:** ``[directed, cap]``" -msgstr "**opcionales:** ``[directed, cap]``" +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgstr "" -msgid "Departing on car from vertex :math:`6` find the nearest subway station." -msgstr "Saliendo en coche desde el vértice :math:`6` encontrar la estación de metro más cercana." +msgid "Points of interest fill up" +msgstr "Llenado de puntos de interés" -msgid "Using a **directed** graph for car routing." -msgstr "Usando un grafo **dirigido** para el ruteo de automóviles." +msgid "Inserting the points of interest." +msgstr "Insertando los puntos de interés." -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" -msgstr "Las estaciones de metro se encuentran en los siguientes vértices :math:`\\{1, 10, 11\\}`" +msgid "Filling the rest of the table." +msgstr "Llenando el resto de la tabla." -msgid "The defaults used:" -msgstr "Los valores predeterminados utilizados:" +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." +msgstr "" -msgid "`directed => true`" -msgstr "`directed => true`" +msgid "The points of interest:" +msgstr "Los puntos de interés:" -msgid "`cap => 1`" -msgstr "`cap => 1`" +msgid "``pgr_floydWarshall``" +msgstr "``pgr_floydWarshall``" -msgid "The result shows that station at vertex :math:`11` is the nearest." -msgstr "El resultado muestra que la estación en el vértice :math:`11` es la más cercana." +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgstr "``pgr_floydWarshall`` - Devuelve la suma de los costos de la ruta más corta para cada par de nodos en el grafo mediante el algoritmo Floyd-Warshall." -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgstr "El algoritmo Floyd-Warshall, también conocido como algoritmo de Floyd, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos densos*. Usamos la implementación de Boost que se ejecuta en :math:`\\Theta(V^3)` tiempo," -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" -msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`2`" +msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgstr "pgr_floydWarshall(`SQL de aristas`_, [``directed``])" -msgid "On line `4`: using the positional parameter: `directed` set to ``true``" -msgstr "En la línea `4`: utilizando el parámetro posicional: `directed` configurado en ``true``" +msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "Para sub-grafo con aristas :math:`\\{1, 2, 3, 4\\}`." -msgid "In line `5`: using named parameter `cap => 2`" -msgstr "En la línea `5`: usando el parámetro con nombre `cap => 2`" +#, fuzzy +msgid "Boost `Floyd-Warshall `_" +msgstr "Boost `Algoritmo floyd-Warshall `_" -msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." -msgstr "El resultado muestra que la estación en el vértice :math:`10` es la más cercana y la siguiente mejor es :math:`11`." +msgid "``pgr_full_version``" +msgstr "``pgr_full_version``" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgstr "``pgr_full_version`` — Obtener los detalles de la información de la versión de pgRouting." -msgid "**options:** ``[directed, cap, global]``" -msgstr "**opcionales:** ``[directed, cap, global]``" +msgid "Get complete details of pgRouting version information" +msgstr "Obtener los detalles de la información de la versión de pgRouting" -msgid "Find the best pedestrian connection between two lines of buses" -msgstr "Encuentra la mejor conexión peatonal entre dos líneas de autobuses" +msgid "pgr_full_version()" +msgstr "pgr_full_version()" -#, fuzzy -msgid "Using an **undirected** graph for pedestrian routing" -msgstr "Usando un grafo **no dirigido** para el ruteo de peatones" +msgid "RETURNS |result-version|" +msgstr "REGRESA |result-version|" -msgid "The first subway line stations are at :math:`\\{15, 16\\}`" -msgstr "Las estaciones de la primera línea de metro están en :math:`\\{15, 16\\}`" +msgid "Information about when this documentation was built" +msgstr "Información sobre cuándo se construyó esta documentación" -msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{1, 10, 11\\}`" +msgid "``version``" +msgstr "``version``" -msgid "On line `4`: using the named parameter: `directed => false`" -msgstr "En la línea `4`: utilizando el parámetro con nombre: `directed => false`" +msgid "pgRouting version" +msgstr "Versión de pgRouting" -msgid "`global => true`" -msgstr "`global => true`" +msgid "``build_type``" +msgstr "``build_type``" -msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." -msgstr "Para un peatón la mejor conexión es subir/bajar en el vértice :math:`15` de la primera línea de metro y en el vértice :math:`10` de la segunda línea de metro." +msgid "The Build type" +msgstr "El tipo de Compilación" -msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" -msgstr "Solo se devuelve `una` ruta porque `global` es ``true`` y `cap` es ``1``" +msgid "``compile_date``" +msgstr "``compile_date``" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgid "Compilation date" +msgstr "Fecha de compilación" -msgid "Find the best car connection between all the stations of two subway lines" -msgstr "Encuentra la mejor conexión de coche entre todas las estaciones de dos líneas de metro" +msgid "``library``" +msgstr "``library``" -msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "Las estaciones de la primera línea de metro están en :math:`\\{1, 10, 11\\}`" +msgid "Library name and version" +msgstr "Nombre y versión de la biblioteca" -msgid "The second subway line stations are at :math:`\\{15, 16\\}`" -msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{15, 16\\}`" +msgid "``system``" +msgstr "``system``" -msgid "The combinations contents:" -msgstr "El contenido de las combinaciones:" +msgid "Operative system" +msgstr "Sistema operativo" -msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" -msgstr "líneas `3~4` establece los vértices de inicio de la primera línea de metro y los vértices finales de la segunda línea de metro" +msgid "``postgreSQL``" +msgstr "``postgreSQL``" -msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" -msgstr "la línea `6~7` establecen los vértices de inicio de la primera línea de metro y los vértices finales de la primera línea de metro" +msgid "pgsql used" +msgstr "pgsql utilizado" -msgid "On line `8`: using the named parameter is `global => false`" -msgstr "En la línea `8`: usando el parámetro con nombre `global => false`" +msgid "``compiler``" +msgstr "``compiler``" -msgid "From the results:" -msgstr "A partir de los resultados:" +msgid "Compiler and version" +msgstr "Compilador y versión" -msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" -msgstr "haciendo una conexión desde la primera línea de metro :math:`\\{1, 10, 11\\}` a la segunda :math:`\\{15, 16\\}`:" +msgid "``boost``" +msgstr "``boost``" -msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgstr "Las mejores conecciones de todas las estaciones desde la primera línea son: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "Boost version" +msgstr "Versión de Boost" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" -msgstr "La mejor es:math:`(11 \\rightarrow 16)` con un costo de :math:`1` (líneas: `11` y `12`)" +msgid "``hash``" +msgstr "``hash``" -msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" -msgstr "haciendo una conexión desde la segunda línea de metro :math:`\\{15, 16\\}` a la primera :math:`\\{1, 10, 11\\}`:" +msgid "Git hash of pgRouting build" +msgstr "Hash de Git de pgRouting" -msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgstr "Las mejores conecciones de todas las estaciones desde la segunda línea son: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr "``pgr_hawickCircuits`` - Experimental" #, fuzzy -msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" -msgstr "Ambas son igualmente buenas, como también tienen el mismo costo. (lines: `13` and `14` and lines: `15` and `16`)" +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgstr "``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de circutos de Hawick." -msgid "Dijkstra optional parameters" -msgstr "Parámetros opcionales de Dijkstra" +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgstr "El algoritmo Hawick Circuit fue publicado en 2008 por Ken Hawick y Health A. James. Este algoritmo resuelve el problema de detectar y enumerar circuitos en grafos. Es capaz de enumerar circuitos en grafos con arcos dirigidos, arcos múltiples y autoarcos con una implementación eficiente en memoria y de alto rendimiento. Es una extensión del Algoritmo de Johnson para encontrar todos los circuitos elementales de un grafo dirigido." -msgid "Near optional parameters" -msgstr "Parámetros opcionales de Cercanía" +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgstr "Hay 2 variaciones definidas en la librería Boost Graph. Aquí hemos implementado sólo la segunda, ya que es la más adecuada y práctica. En esta variación obtenemos los circuitos después de filtrar los circuitos causados por aristas paralelas. Los circuitos de aristas paralelas tienen más casos de uso cuando se quiere contar el número de circuitos." -msgid "``cap``" -msgstr "``cap``" +msgid "The algorithm implementation works only for directed graph" +msgstr "La implementación del algoritmo sirve solo para grafos dirigidos" -msgid "Find at most ``cap`` number of nearest shortest paths" -msgstr "Encuentra como máximo el número ``cap`` de los caminos más cortos y más cercanos" +msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgstr "Es una variación del algoritmo de Johnson para la enumeración de circuitos." -msgid "``global``" -msgstr "``global``" +msgid "The algorithm outputs the distinct circuits present in the graph." +msgstr "El algoritmo da como resultado los distintos circuitos presentes en el grafo." -msgid "When ``true``: only ``cap`` limit results will be returned" -msgstr "Cuando ``true``: solo se devolverán los resultados del límite ``cap``" +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgstr "Complejidad temporal: :math:`O((V + E) (c + 1))`" -msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" -msgstr "Cuando ``false``: ``cap`` límite por ``Start vid`` será devuelto" +msgid ":math:`|c|` is the number of circuits in the graph." +msgstr ":math:`|c|` es la cantidad de circuitos en el grafo." -msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgstr "pgr_hawickCircuits(`SQL de aristas`_)" -msgid "``pgr_dijkstraNearCost``" -msgstr "``pgr_dijkstraNearCost``" +msgid "Circuits present in the pgRouting :doc:`sampledata`" +msgstr "Circuitos dentro de los :doc:`sampledata` de pgRouting" -msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." -msgstr "``pgr_dijkstraNearCost`` — Usando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano." +msgid "Id of the circuit starting from ``1``" +msgstr "Identificador del circuito comenzando con ``1``" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])" +#, fuzzy +msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgstr "Posición relativa en la camino. Tiene el valor ``0`` para el inicio de la ruta" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])" +msgid "Identifier of the starting vertex of the circuit." +msgstr "Identificador del vértice inicial del circuito." -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])" +msgid "Identifier of the ending vertex of the circuit." +msgstr "Identificador del vértice final del circuito." -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])" +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "Identificador del nodo en la ruta de un vértice al siguiente vértice." -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost: Algoritmo de Circutios de Hawick `__" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos*, [**opciones**])" +msgid "``pgr_isPlanar`` - Experimental" +msgstr "``pgr_isPlanar`` - Experimental" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" -msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`6`" +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgstr "``pgr_isPlanar`` — Devuelve un valor boolean dependiendo de la planaridad del grafo." -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgstr "Un grafo es planar si se puede dibujar en un espacio bidimensional sin que se crucen dos de sus aristas. Este dibujo de un grafo planaro es llamado dibujo de plano. Cada grafo planar también admite un dibujo de línea recta, que es un dibujo de plano donde cada arista está representada por un segmento de línea. Cuando un grafo tiene :math:`K_5` or :math:`K_{3,3}` como subgrafo, entonces el grafo no es planar." -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgid "This implementation use the Boyer-Myrvold Planarity Testing." +msgstr "Esta implementación utiliza la Prueba de Planaridad de Boyer-Myrvold." -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" -msgstr "La mejor es :math:`(11 \\rightarrow 16)` con un costo de :math:`1` (line: `1`)" +msgid "It will return a boolean value depending upon the planarity of the graph." +msgstr "Devolverá un valor boolean dependiendo de la planaridad del grrafo." -#, fuzzy -msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" -msgstr "Ambos son igualmente buenos ya que tienen el mismo costo. (lines: `12` and `13`)" +msgid "Applicable only for **undirected** graphs." +msgstr "Aplicable solo para grafos **no dirigidos**." -msgid "``pgr_dijkstraVia``" -msgstr "``pgr_dijkstraVia``" +msgid "The algorithm does not considers traversal costs in the calculations." +msgstr "El algoritmo no considera los costos transversales en los cálculos." -msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." -msgstr "``pgr_dijkstraVia`` - Ruta que recorre una lista de vértices." +msgid "Running time: :math:`O(|V|)`" +msgstr "Tiempo de ejecución: :math:`O(|V|)`" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." -msgstr "Dada una lista de vértices y un grafo, esta función equivale a encontrar el camino más corto entre :math:`vértice_i` y :math:`vértice_{i+1}` para todo :math:`i < tamaño\\_de(vía\\;vértices)`." +msgid "pgr_isPlanar(`Edges SQL`)" +msgstr "pgr_isPlanar(`SQL de aristas`)" -msgid "Route" -msgstr "Ruta" +msgid "RETURNS ``BOOLEAN``" +msgstr "DEVUELVE ``BOOLEAN``" -msgid "is a sequence of paths." -msgstr "es una secuencia de trayectorias." +msgid "Returns a boolean ``(pgr_isplanar)``" +msgstr "Devuelve un valor boolean ``(pgr_isplanar)``" -msgid "Path" -msgstr "Ruta" +msgid "``pgr_isplanar``" +msgstr "``pgr_isplanar``" -msgid "is a section of the route." -msgstr "es una sección de la ruta." +msgid "`true` when the graph is planar." +msgstr "`true` cuando el grafo es planar." -msgid "One Via" -msgstr "Una Vía" +msgid "`false` when the graph is not planar." +msgstr "`false` cuando el grafo no es planar." -msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" -msgstr "pgr_dijkstraVia(`SQL de aristas`_, **vértices**, [**opciones**])" +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgstr "Las siguientes aristas harán de el subgrafo con los vértices {10, 15, 11, 16, 13} un grafo :math:`K_5`." -msgid "**options:** ``[directed, strict, U_turn_on_edge]``" -msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``" +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgstr "El nuevo grafo no es planar porque tiene un subgráfico :math:`K_5`. Las aristas en azul representan el subgrafo :math:`K_5`." -msgid "Returns set of |via-result|" -msgstr "Regresa el conjunto de |via-result|" +msgid "`Boost: Boyer Myrvold `__" +msgstr "`Boost: Boyer Myrvold `__" -msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." -msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido." +msgid "``pgr_johnson``" +msgstr "``pgr_johnson``" -msgid "Via optional parameters" -msgstr "Parámetros opcionales Vía" +#, fuzzy +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgstr "``pgr_johnson`` - Devuelve la suma de los costes de la ruta más corta para cada par de nodos del grafo mediante el algoritmo Floyd-Warshall." -msgid "When ``true`` departing from a visited vertex will not try to avoid" -msgstr "Cuando ``true`` saliendo desde un vértice visitado no intentara esquivarlo" +#, fuzzy +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgstr "El algoritmo Johnson, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos dispersos*. Utiliza la implementación del Boost que se ejecuta en :math:`O(V E \\log V)` tiempo," -msgid "Identifier of a path. Has value **1** for the first path." -msgstr "Identificador del camino. Tiene valor **1** para el primer camino." +msgid "pgr johnson(`Edges SQL`_, [``directed``])" +msgstr "johnson(`SQL de aristas`_ , [``dryrun``])" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." -msgstr "Identificador de la arsita utilizada para ir del ``node`` al siguiente nodo de la secuencia de ruta." +msgid "Boost `Johnson `_" +msgstr "Boost `Algoritmo de Johnson `_" -msgid "-1 for the last node of the path." -msgstr "-1 para el último nodo de la ruta." +#, fuzzy +msgid "``pgr_kingOrdering`` - Experimental" +msgstr "``pgr_edgeColoring`` - Experimental" -msgid "-2 for the last node of the route." -msgstr "-2 para el último nodo de la ruta." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgstr "``pgr_kingOrdering`` - Regresa el ordenamiento King de un grafo no dirigido." -msgid "``route_agg_cost``" -msgstr "``route_agg_cost``" +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." +msgstr "" -msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." -msgstr "Costo total desde ``start_vid`` en ``seq = 1`` hasta ``end_vid`` del ``seq`` actual." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." +msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." -msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo **dirigido**." +#, fuzzy +msgid "The implementation targets undirected graphs." +msgstr "La implementación es para grafos **no dirigidos**." -msgid "The main query" -msgstr "La consulta principal" +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." +msgstr "" -msgid "Aggregate cost of the third path." -msgstr "Costo agregado de la tercera ruta." +#, fuzzy +msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" +msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`" -msgid "Route's aggregate cost of the route at the end of the third path." -msgstr "Costo agregado al final de la tercera ruta." +#, fuzzy +msgid "where :math:`|E|` is the number of edges," +msgstr "donde :math:`|V|` es el número de vértices," -msgid "Nodes visited in the route." -msgstr "Nodos visitados en la ruta." - -msgid "The aggregate costs of the route when the visited vertices are reached." -msgstr "Costo agregado de la ruta al llegar a los vértices visitados." +#, fuzzy +msgid ":math:`m` is the maximum degree among all vertices." +msgstr ":math:`m` es el grado máximo de los vértices en el grafo." -msgid "Status of \"passes in front\" or \"visits\" of the nodes." -msgstr "Estado de \"pasa enfrente\" o \"visita\" los nodos." +#, fuzzy +msgid "pgr_kingOrdering(`Edges SQL`_)" +msgstr "pgr_edgeColoring(`SQL de aristas`_)" -msgid ":doc:`via-category`." -msgstr ":doc:`via-category`." +#, fuzzy +msgid "`Boost: King Ordering `__" +msgstr "`Boost: Coloración de Segmentos `__" -msgid ":doc:`dijkstra-family`." -msgstr ":doc:`dijkstra-family`." +msgid "``pgr_kruskal``" +msgstr "``pgr_kruskal``" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." -msgstr "``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de inicio." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgstr "``pgr_kruskal`` — Devuelve el árbol de expansión mínimo del grafo utilizando el algoritmo Kruskal." -msgid "pgr_drivingDistance(Single vertex)" -msgstr "pgr_drivingDistance(Vértice único)" +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Kruskal." -msgid "Added ``depth`` and ``start_vid`` result columns." -msgstr "Agregado las columnas de resultados``depth`` y ``start_vid``." +msgid "EMPTY SET is returned when there are no edges in the graph." +msgstr "EMPTY SET es regresado cuando no hay aristas en el grafo." -msgid "pgr_drivingDistance(Multiple vertices)" -msgstr "pgr_drivingDistance(Múltiples vértices)" +msgid "pgr_kruskal(`Edges SQL`_)" +msgstr "pgr_kruskal(`SQL de aristas`_)" -msgid "Result column name change: ``from_v`` to ``start_vid``." -msgstr "Cambio de nombre en la columna de resultados: ``from_v`` a ``start_vid``." +msgid "Returns set of |result-mst|" +msgstr "Regresa el conjunto de |result-mst|" -msgid "Added ``depth`` and ``pred`` result columns." -msgstr "Agregado las columnas de resultados``depth`` y ``pred``." +msgid "Minimum spanning forest" +msgstr "Bosque de expansión mínimo" -msgid "Signature change:" -msgstr "Cambio de firma:" +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgstr "``pgr_kruskalBFS`` — Algoritmo de Kruskal para el Árbol de Expansión Mínimo con orden de Primera Búsqueda en Anchura." -msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance(vértice único)" +msgid "Added ``pred`` result columns." +msgstr "Agregado columna de resultados ``pred``." -msgid "New official signature:" -msgstr "Nueva firma oficial:" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Visita y extrae la información de los nodos en la orden de Primera Búsqueda en Anchura del Árbol de Expansión Mínimo creado con el algoritmo de Kruskal." -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance(múltiples vértices)" +msgid "Returned tree nodes from a root vertex are on Breath First Search order" +msgstr "Los nodos de árbol devueltos desde un vértice raíz están en orden de la Primera Búsqueda de Anchura" -#, fuzzy -msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." -msgstr "Usando el algoritmo Dijkstra, se extraen todos los nodos que tienen costes menores o iguales al valor ``distance``. Los bordes extraídos se ajustarán al árbol de expansión correspondiente." +msgid "Breath First Search Running time: :math:`O(E + V)`" +msgstr "Tiempo de ejecución de la Primera Búsqueda de Anchura: :math:`O(E + V)`" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgstr "pgr_drivingDistance(`SQL de aristas`_, **Raíz**, **distancia**, [``directed``])" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_kruskalBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" -msgstr "pgr_drivingDistance(`SQL de aristas`_, **raices**, **distancia**, [**opciones**])" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_kruskalBFS(`SQL de aristas`_, **raices**, [``max_depth``])" -msgid "**options:** [directed, equicost]" -msgstr "**opcionales:** [directed, equicost]" +msgid "The Minimum Spanning Tree having as root vertex :math:`6`" +msgstr "El Árbol de Expansión Mínimo que tiene como vértice raíz :math:`6`" -msgid "Single Vertex" -msgstr "Vértice Único" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgstr "El Árbol de Expansión Mínimo que comienza en los vértices :math:`\\{9, 6\\}` con ::math:`depth \\leq 3`" -msgid "From vertex :math:`11` for a distance of :math:`3.0`" -msgstr "Desde el vértice :math:`11` por una distancia de :math:`3.0`" +msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." +msgstr "``pgr_kruskalDD`` — Nodos de captación utilizando el algoritmo de Kruskal." -msgid "Multiple Vertices" -msgstr "Múltiples Vértices" +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgstr "Usando el algoritmo de Kruskal, extraerá los nodos que tienen costos agregados menores o iguales a la **distancia** desde un vértice (o vértices) **raíz** dentro del árbol de expansión mínimo calculado." -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" -msgstr "Desde los vertices :math:`\\{11, 16\\}` por una distancia de :math:`3.0` con equi-cost en un grafo dirigido" +msgid "Returned tree nodes from a root vertex are on Depth First Search order." +msgstr "Los nodos de árbol devueltos de un vértice raíz están en el orden de Primera Búsqueda de Profundidad." -msgid "Driving distance optional parameters" -msgstr "Parámetros opcionales de distancia de manejo" +msgid "Depth First Search running time: :math:`O(E + V)`" +msgstr "Primera Búsqueda de Profundidad, tiempo de ejecución: :math:`O(E + V)`" -msgid "``equicost``" -msgstr "``equicost``" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" +msgstr "pgr_kruskalDD(`SQL de aristas`_, **raíz**, **distancia**)" -msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." -msgstr "Cuando ``true`` el nodo solo aparece en la lista más cercana a ``start_vid``. Empates son rotos arbitrareamente." +msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" +msgstr "pgr_kruskalDD(`SQL de aristas`_, **raices**, **distancia**)" -msgid "When ``false`` which resembles several calls using the single vertex signature." -msgstr "Cuando ``false`` se asemeja a varias llamadas usando la firma de vértice único." +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgstr "El mínimo árbol de expansión que comienza en el vértice:math:`6` con :math:`distance \\leq 3.5`" -msgid "end-before" -msgstr "" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgstr "El árbol de expansión mínimo que comienza en los vértices :math:`\\{9, 6\\}` con :math:`distance \\leq 3.5`" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" -msgstr "Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un grafo no dirigido" +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_kruskalDFS`` — Algoritmo Kruskal para el Árbol de Expansión Mínima con orden de Búsqueda Primero en Profundidad." -msgid "``pgr_edgeColoring`` - Experimental" -msgstr "``pgr_edgeColoring`` - Experimental" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Visita y extrae la información de los nodos en el orden de Búsqueda en Primera Profundidad del Árbol de Expansión Mínima creado con el algoritmo de Kruskal." -msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" -msgstr "``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos acíclicos" +msgid "Returned tree nodes from a root vertex are on Depth First Search order" +msgstr "Los nodos de árbol devueltos desde un vértice raíz están en el orden de Primera Búsqueda de Profundidad" -msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." -msgstr "Coloración de arístas es un algoritmo utilizado para colorear aristas para los vértices de un grafo. Es una asignación de colores a las aristas del grafo de tal manera que dos aristas adjacentes no tengan el mismo color." +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raíz**, [``max_depth``])" -msgid "The implementation is for **undirected** and **loop-free** graphs" -msgstr "La implementación es para grafos **no dirigidos** sin **auto-ciclos**" +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raices**, [``max_depth``])" -msgid "loop free" -msgstr "Sin auto ciclos" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimental" -msgid "no self-loops and no parallel edges." -msgstr "Sin auto ciclos ni aristas paralelas." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgstr "``pgr_lengauerTarjanDominatorTree`` — Devuelve el dominador inmediato de todos los vértices." -msgid "Provides the color to be assigned to all the edges present in the graph." -msgstr "Provee el color asignado a todas las aristas existentes en el grafo." +#, fuzzy +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgstr "El algoritmo calcula el *dominador inmediato* de cada vértice llamado **idom**, una vez que se calcula la **idom** de cada vértice y, a continuación, haciendo que cada **idom** de cada vértice como su elemento primario, se pueda construir el árbol del dominador." -msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." -msgstr "A lo más :math:`\\Delta + 1` colores son usados, donde :math:`\\Delta` is el grado del grafo." +msgid "The algorithm works in directed graph only." +msgstr "El algoritmo solo funciona en el grafo dirigido." -msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." -msgstr "Esto es óptimo para algunos gráfos. y por el teorema de Vizing, utiliza a lo más un color extra que el óptimo para todos los demás." +msgid "The algorithm returns *idom* of each vertex." +msgstr "El algoritmo devuelve *idom* de cada vértice." -msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" -msgstr "el número cromático :math:`x'(G)` (número mínimo de colores necesarios para colorear correctamente las aristas del grafo) es igual al grado :math:`\\Delta + 1` del grafo, (:math:`x'(G) = \\Delta`)" +msgid "If the *root vertex* not present in the graph then it returns empty set." +msgstr "Si el *vértice raíz* no está presente en el grafo, devuelve un conjunto vacío." -msgid "The algorithm tries to assign the least possible color to every edge." -msgstr "El algoritmo trata de asignar el menor color a cada arista." +msgid "Running time: :math:`O((V+E)log(V+E))`" +msgstr "Tiempo de ejecución: :math:`O((V+E)log(V+E))`" -msgid "Does not always produce optimal coloring." -msgstr "No produce siempre produce la coloración ótpima." +msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" +msgstr "pgr_lengauerTarjanDominatorTree(`SQL de aristas`_, **raíz**)" -msgid "The returned rows are ordered in ascending order of the edge identifier." -msgstr "Las filas de resultados son ordenados ascendentemente respecto al identificador de la arista." +msgid "Returns set of |result-idom|" +msgstr "Regresa el conjunto de |result-idom|" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" -msgstr "Coloración eficiente de un grafo es un problema NP-Duro, por lo que:" +msgid "The dominator tree with root vertex :math:`5`" +msgstr "El árbol dominante con vértice raíz :math:`5`" -msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" -msgstr "El tiempo de ejecución de esta implementación es: :math:`O(|E|*|V|)`" +msgid "SQL query as described above." +msgstr "Consulta SQL como se describió anteriormente." -msgid "where :math:`|E|` is the number of edges in the graph," -msgstr "donde :math:`|E|` es la cantidad de arístas en el grafo," +msgid "**root vertex**" +msgstr "**vértice raíz**" -msgid ":math:`|V|` is the number of vertices in the graph." -msgstr ":math:`|V|` es la cantidad de vertices del grafo." +msgid "Returns set of ``(seq, vertex_id, idom)``" +msgstr "Devuelve el conjunto de ``(seq, vertex_id, idom)``" -msgid "pgr_edgeColoring(`Edges SQL`_)" -msgstr "pgr_edgeColoring(`SQL de aristas`_)" +msgid "``vertex_id``" +msgstr "``vertex_id``" -msgid "Graph coloring of pgRouting :doc:`sampledata`" -msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" +msgid "Identifier of vertex ." +msgstr "Identificador de vértice." -msgid "`Boost: Edge Coloring `__" -msgstr "`Boost: Coloración de Segmentos `__" +msgid "``idom``" +msgstr "``idom``" -msgid "`Wikipedia: Graph coloring `__" -msgstr "`Wikipedia: Coloración de grafos `__" +msgid "Immediate dominator of vertex." +msgstr "Dominador inmediato del vértice." -msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." -msgstr "``pgr_edgeDisjointPaths`` — Calcula las rutas de aristas desarticuladas entre dos grupos de vértices." +msgid "Dominator tree of another component." +msgstr "Árbnol dominante de otro componente." -msgid "pgr_edgeDisjointPaths(Combinations)" -msgstr "pgr_edgeDisjointPaths(Combinaciones)" +msgid "`Boost: Lengauer-Tarjan dominator `__" +msgstr "`Boost: Árbol dominante Lengauer-Tarjan `__" -msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." -msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices. Utiliza algoritmos de flujo máximo subyacentes para calcular las rutas." +msgid "`Wikipedia: dominator tree `__" +msgstr "'Wikipedia: árbol de dominador' `__" -msgid "The main characterics are:" -msgstr "Los principales características son:" +msgid "``pgr_lineGraph`` - Proposed" +msgstr "``pgr_lineGraph`` - Propuesto" -msgid "Calculates the edge disjoint paths between any two groups of vertices." -msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices cualquiera." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgstr "``pgr_lineGraph`` — Transforma un grafo dado en su grafo correspondiente basado en aristas." -msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." -msgstr "Devuelve un conjunto vacío EMPTY SET cuando el origen y el destino son los mismos o no se puede llegar." +msgid "Works for directed and undirected graphs." +msgstr "Funciona para grafos dirigidos y no dirigidos." -msgid "The graph can be directed or undirected." -msgstr "El gráfico puede dirigido o no." +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgstr "Dado un grafo :math:`G`, su grafo lineal :math:`L(G)` es un grafo tal que:" -msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." -msgstr "Utiliza :doc:`pgr_boykovKolmogorov` para calcular las rutas." +msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." +msgstr "Cada vértice de :math:`L(G)` representa una arista de :math:`G`." -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgstr "Dos vértices de :math:`L(G)` son adyacentes si y sólo si sus aristas correspondientes comparten un punto final común en :math:`G`" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgstr "Las columnas ``cost`` y ``reverse_cost`` del resultado representan la existencia de la arista." -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "When the graph is directed the result is directed." +msgstr "Cuando el grafo es dirigido el resultado es dirigido." -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." +msgstr "Para obtener el Grafo lineal completo utilizar identificadores únicos en las aristas de doble sentido (Ver `Ejemplos Adicionales`_)." -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "When the graph is undirected the result is undirected." +msgstr "Cuando el grafo es no dirigido el resultado es no dirigido." -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." -msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}` en un grafo no dirigido." +msgid "The ``reverse_cost`` is always :math:`-1`." +msgstr "El ``reverse_cost`` es siempre :math:`-1`." -msgid "Manually assigned vertex combinations on an undirected graph." -msgstr "Asignando manualmente las combinaciones de vértices en un grafo no dirigido." +msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" +msgstr "pgr_lineGraph(`SQL de aristas`_, [``directed``])" -msgid "``pgr_edmondsKarp``" -msgstr "``pgr_edmondsKarp``" +msgid "Returns set of |result-lineg|" +msgstr "Regresa el conjunto de |result-lineg|" -msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." -msgstr "``pgr_edmondsKarp`` — Calcula el flujo en las aristas del grafo que maximizan el flujo de las fuentes a los destinos usando el algoritmo de Edmonds Karp." +msgid "For an undirected graph with edges :math:'{2,4,5,8}'" +msgstr "Para un grafo no dirigido con aristas :math:'{2,4,5,8}'" -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(Combinaciones)" +msgid "Gives a local identifier for the edge" +msgstr "Da un identificador local de la arista" -msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" -msgstr "Renombrado desde ``pgr_maxFlowEdmondsKarp``" +msgid "When `negative`: the source is the reverse edge in the original graph." +msgstr "Cuando es 'negativo': el origen es la arista inversa en el grafo original." -msgid "Running time: :math:`O( V * E ^ 2)`" -msgstr "Tiempo de ejecución: :math:`O( V * E ^ 2)`" +msgid "When `negative`: the target is the reverse edge in the original graph." +msgstr "Cuando es `negativo`: el destino es la arista inversa en el grafo original." -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destino**)" +msgid "Weight of the edge (``source``, ``target``)." +msgstr "Peso de la arista (``source``, ``target``)." -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destinos**)" +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." +msgstr "Cuando `negative`: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo." -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destino**)" +msgid "Weight of the edge (``target``, ``source``)." +msgstr "Peso de la arista (``target``, ``source``)." -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destinos**)" +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgstr "Cuando `negative`: la arista (``target``, ``source``) no existe, por lo tanto no es parte del grafo." -msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_edmondsKarp(`SQL de aristas`_, `SQL de combinaciones`_)" +msgid "Given the following directed graph" +msgstr "Dado el siguente grafo dirigido" -msgid "`Boost: Edmonds Karp max flow `__" -msgstr "`Boost: Edmonds Karp max flow `__" +msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3})`" -msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgid "Representation as directed with shared edge identifiers" +msgstr "Representación como dirigida con identificadores de arista compartidos" -msgid "``pgr_edwardMoore`` - Experimental" -msgstr "``pgr_edwardMoore`` - Experimental" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" +msgstr "" -msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." -msgstr "``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-Moore." +msgid "hundreds" +msgstr "cientos" -msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." -msgstr "Algoritmo de Edward Moore es una mejora del algoritmo Bellman-Ford. Puede calcular las rutas más cortas desde un único vértice de origen a todos los demás vértices de un grafo dirigido ponderado. La principal diferencia entre algoritmo de Edward Moore y algoritmo de Bellman Ford radica en el tiempo de ejecución." +msgid "the source vertex" +msgstr "el vértice de origen" -msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." -msgstr "El peor de los casos de funcionamiento del algoritmo es :math:`O(| V | * | E |)` similar a la complejidad temporal del algoritmo Bellman-Ford. Sin embargo, los experimentos sugieren que este algoritmo tiene una complejidad de tiempo de ejecución promedio de :math:`O( | E | )` para grafos aleatorios. Esto es significativamente más rápido en términos de velocidad de cálculo." +msgid "tens" +msgstr "decenas" -msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" -msgstr "Por lo tanto, el algoritmo es, en el mejor de los casos, significativamente más rápido que el algoritmo Bellman-Ford y es en el peor de los casos, tan bueno como el algoritmo Bellman-Ford" +msgid "always 0, acts as a separator" +msgstr "siempre 0, actúa como separador" -msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" -msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es :math:`0`" +msgid "units" +msgstr "unidades" -msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." -msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`." +msgid "the target vertex" +msgstr "el vértice de destino" -msgid "Running time:" -msgstr "Tiempo de ejecución:" +msgid "In this image," +msgstr "En esta imagen," -msgid "Worst case: :math:`O(| V | * | E |)`" -msgstr "Peor caso: :math:`O(| V | * | E |)`" +msgid "Single or double head arrows represent one edge (row) on the edges table." +msgstr "Las puntas de flechas simples o dobles representan una arista (fila) en la tabla de aristas." -msgid "Average case: :math:`O( | E | )`" -msgstr "Caso promedio: :math:`O( | E | )`" +msgid "The numbers in the yellow shadow are the edge identifiers." +msgstr "Los números en la sombra amarilla son los identificadores de las aristas." -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgstr "Dos pares de aristas comparten el mismo identificador cuando se utiliza la columna ``reverse_cost``." -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con una fila de aristas con :math:`id=203`." -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgstr "Las aristas :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` se representan con una fila de aristas con :math:`id=304`." -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "The graph can be created as follows:" +msgstr "El grafo puede crearse del siguiente modo:" -msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_edwardMoore(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "Line Graph of a directed graph represented with shared edges" +msgstr "Grafo lineal de un grafo dirigido representado con aristas compartidas" -msgid "Using a combinations table on an **undirected** graph." -msgstr "Uso de una tabla de combinaciones en un grafo **no dirigido**." +msgid "The result is a directed graph." +msgstr "El resultado es un grafo dirigido." -msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgstr "Para :math:`seq=4` desde :math:`203 \\leftrightarrow 304` representa dos arsitas" -msgid "``pgr_extractVertices``" -msgstr "``pgr_extractVertices``" +msgid "For all the other values of ``seq`` represent one edge." +msgstr "Todos los demás valores de ``seq`` representan una arista." -msgid "``pgr_extractVertices`` — Extracts the vertices information" -msgstr "``pgr_extractVertices`` — Extrae la información de los vértices" +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgstr "Los valores ``cost`` y ``reverse_cost`` representan la existencia de la arista." -msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." -msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo." +msgid "When positive: the edge exists." +msgstr "Cuando es positivo: la arista existe." -msgid "When the edge identifier is given, then it will also calculate the in and out edges" -msgstr "Cuando se proporciona el identificador de arista, también se calcularán las aristas de entrada y salida" +msgid "When negative: the edge does not exist." +msgstr "Cuando es negativo: la arista no existe." -msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" -msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" +msgid "Representation as directed with unique edge identifiers" +msgstr "Representación dirigida con identificadores de arista únicos" -msgid "RETURNS SETOF |result-extract|" -msgstr "REGRESA CONJUNTO DE |result-extract|" +msgid "Single head arrows represent one edge (row) on the edges table." +msgstr "Las flechas de una cabeza representan una arista (fila) en la tabla de aristas." -msgid "When line geometry is known" -msgstr "Cuando se conoce la geometría de línea" +msgid "There are no double head arrows" +msgstr "No hay flechas de doble punta" -msgid "(Optional) identifier of the edge." -msgstr "(Opcional) identificador de la arista." +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgstr "Dos pares de aristas comparten los mismos nodos finales y no se utiliza la columna ``reverse_cost``." -msgid "``geom``" -msgstr "``geom``" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con dos aristas :math:`id=203` y :math:`id=302` respectivamente." -msgid "``LINESTRING``" -msgstr "``LINESTRING``" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgstr "" -msgid "Geometry of the edge." -msgstr "Geometría de la arista." +msgid "Line Graph of a directed graph represented with unique edges" +msgstr "Gráfico lineal de un grafo dirigido representado con aristas únicas" -msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." -msgstr "Esta consulta interna tiene prioridad sobre las dos consultas internas siguientes, por lo que se omiten otras columnas cuando aparece la columna ''geom''." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgstr "Para :math:`seq=7` desde :math:`203 \\leftrightarrow 302` representan dos aristas." -msgid "Ignored columns:" -msgstr "Columnas ignoradas:" +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgstr "Para :math:`seq=8` desde :math:`304 \\leftrightarrow 403` representan dos aristas." -msgid "``startpoint``" -msgstr "``startpoint``" +msgid "wikipedia: `Line Graph `__" +msgstr "wikipedia: `Grafo lineal `__" -msgid "``endpoint``" -msgstr "``endpoint``" +msgid "mathworld: `Line Graph `__" +msgstr "" -msgid "When vertex geometry is known" -msgstr "Cuando se conoce la geometría de vértices" +msgid "``pgr_lineGraphFull`` - Experimental" +msgstr "``pgr_lineGraphFull`` - Experimental" -msgid "To use this inner query the column ``geom`` should not be part of the set of columns." -msgstr "Para utilizar esta consulta interna, la columna ``geom`` no debe formar parte del conjunto de columnas." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgstr "``pgr_lineGraphFull`` — Transforma un grafo dado en uno nuevo donde todos los vértices del grafo original se convierten en grafos de líneas." -msgid "``POINT``" -msgstr "``POINT``" +msgid "Version 2.6.0" +msgstr "Versión 2.6.0" -msgid "POINT geometry of the starting vertex." -msgstr "Geometría POINT del vértice inicial." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgstr "``pgr_lineGraphFull``, convierte un grafo dirigido a un grafo dirigido lineal, convirtiendo cada vértice en un grafo completo y manteniendo todas las aristas originales. Las nuevas aristas de conexión tienen un costo de 0 y van entre las aristas originales adyacentes, respetando la direccionalidad." -msgid "POINT geometry of the ending vertex." -msgstr "Geometría POINT del vértice final." +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgstr "Una posible aplicación del grafo resultante es **\"ruteo con restricciones en dos aristas\"**:" -msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." -msgstr "Esta consulta interna tiene prioridad sobre la siguiente consulta interna, por lo que otras columnas son ignoradas cuando aparecen las columnas ``startpoint`` y ``endpoint``." +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgstr "Establecer un coste de uso del vértice al enrutar entre aristas en la arista de conexión" -msgid "When identifiers of vertices are known" -msgstr "Cuando se conocen identificadores de vértices" +msgid "Forbid the routing between two edges by removing the connecting edge" +msgstr "Prohibir el ruteo entre dos aristas al quitar el arista de conexión" -msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." -msgstr "Para utilizar esta consulta interna, las columnas ``geom``, ``startpoint`` y ``endpoint`` no deben formar parte del conjunto de columnas." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgstr "Esto es posible porque cada una de las intersecciones (vértices) en el grafo original ahora son grafos completos que tienen una nueva arista para cada posible giro a través de esa intersección." -msgid "``NULL`` When the ``id`` is not part of the inner query" -msgstr "``NULL`` When the ``id`` no forma parte de la consulta interna" +msgid "This function is for **directed** graphs." +msgstr "Esta función es para grafos **dirigidos**." -msgid "X value of the point geometry" -msgstr "Valor X de la geometría del punto" +msgid "Results are undefined when a negative vertex id is used in the input graph." +msgstr "Los resultados son indefinidos cuando se utiliza un identificador de vértice negativo en el grafo de entrada." -msgid "``NULL`` When no geometry is provided" -msgstr "``NULL`` Cuando no se proporciona geometría" +msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgstr "Los resultados son indefinidos cuando se utiliza un identificador de borde duplicado en el grafo de entrada." -msgid "Geometry of the point" -msgstr "Geometría del punto" +msgid "Running time: TBD" +msgstr "Tiempo de ejecución: TBD" -msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." -msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilice ``dryrun := true``." +msgid "pgr_lineGraphFull(`Edges SQL`_)" +msgstr "pgr_lineGraphFull(`SQL de aristas`_)" -msgid "Create a routing topology" -msgstr "Creación de una topología de ruteo" +msgid "Returns set of |result-linegf|" +msgstr "Regresa el conjunto de |result-linegf|" -msgid "Make sure the database does not have the ``vertices_table``" -msgstr "Asegurarse de que la base de datos no tiene ``vertices_table``" +msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" +msgstr "Grafo de línea completa del subgrafo de las aristas :math:`\\{4, 7, 8, 10\\}`" -msgid "Clean up the columns of the routing topology to be created" -msgstr "Limpieza de las columnas de la topología de ruteo que se creará" +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgstr "Los ejemplos incluyen el sub-grafo que incluye las aristas 4, 7, 8 y 10 con ``reverse_cost``." -msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" -msgstr "Cuando ``LINESTRING`` tiene un SRID entonces usa ``geom::geometry(POINT, )``" +msgid "The data" +msgstr "Los datos" -msgid "For big edge tables that are been prepared," -msgstr "Para grandes tablas de aristas que han sido preparadas," +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgstr "En este ejemplo se muestra cómo funciona esta transformación de grafo para crear aristas adicionales para cada giro posible en un grafoáfico." -msgid "Create it as ``UNLOGGED`` and" -msgstr "Crearlo como ``UNLOGGED`` y" +msgid "|first|" +msgstr "|first|" -msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" -msgstr "Después de crear la tabla ``ALTER TABLE .. SET LOGGED``" +msgid "first" +msgstr "primero" -msgid "Inspect the vertices table" -msgstr "Inspeccionar la tabla de vértices" +msgid "The transformation" +msgstr "La transformación" -msgid "Create the routing topology on the edge table" -msgstr "Creación de la topología de ruteo en la tabla de aristas" +msgid "|second|" +msgstr "|second|" -msgid "Updating the ``source`` information" -msgstr "Actualizar de la información de ``source``" +msgid "second" +msgstr "segundo" -msgid "Updating the ``target`` information" -msgstr "Actualización de la información de ``target``" +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgstr "En el grafo transformado, todas las aristas del grafo original siguen presentes (amarillos), pero ahora hay aristas adicionales para cada giro que se podría hacer a través del vértice 7 (naranja)." -msgid "Inspect the routing topology" -msgstr "Inspección de la topología de ruteo" +msgid "Creating table that identifies transformed vertices" +msgstr "Crear una tabla que identifica los vértices transformados" -msgid "**Generated topology**" -msgstr "**Topología generada**" +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgstr "Los vértices del grafo transformado se crean dividiendo los vértices en el grafo original. A menos que un vértice en el grafo original sea un vértice hoja, generará más de un vértice en el grafo transformado. A uno de los vértices recién creados en el grafo transformado se le dará el mismo identificador del vértice desde el cual se creó en el grafo original, pero el resto de los vértices recién creados tendrán identificadores de vértices negativos." -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgstr "" -msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." -msgstr "``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría puntual." +msgid "Store edge results" +msgstr "Almacenar resultados de aristas" -msgid "``partial`` option is removed." -msgstr "Opción ``partial`` se elimina." +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" +msgstr "" -msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." -msgstr "``pgr_findCloseEdges`` - Función de utilidad que encuentra la arista más cercana a una geometría de puntos." +msgid "Create the mapping table" +msgstr "" -msgid "The geometries must be in the same coordinate system (have the same SRID)." -msgstr "Las geometrías deben estar en el mismo sistema de coordenadas (tener el mismo SRID)." +msgid "From the original graph's vertex information" +msgstr "" -msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." -msgstr "El código para realizar los cálculos puede obtenerse para realizar los ajustes específicos que necesite la aplicación." +msgid "Add the new vertices" +msgstr "Agregar nuevos vértices" -msgid "``EMPTY SET`` is returned on dryrun executions" -msgstr "``EMPTY SET`` se devuelve en ejecuciones en seco" +msgid "Filling the mapping table" +msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgstr "pgr_findCloseEdges(`Edges SQL`_, **punto**, **tolerancia**, [**options**])" +msgid "The positive vertex identifiers are the original identifiers" +msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgstr "pgr_findCloseEdges(`Edges SQL`_, **puntos**, **tolerancia**, [**options**])" +msgid "Inspecting the vertices map" +msgstr "" -msgid "**options:** ``[cap, dryrun]``" -msgstr "**opciones:** ``[cap, dryrun]``" +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgstr "" -msgid "Returns set of |result-find|" -msgstr "Regresa conjunto de |result-find|" +msgid "Updating values from self loops" +msgstr "" -msgid "One point" -msgstr "Un punto" +msgid "Inspecting the vertices table" +msgstr "Inspeccionando la tabla de vértices" -msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgid "Updating from inner self loops" msgstr "" -msgid "``cap => 2``" -msgstr "``cap => 2``" - -msgid "Many points" -msgstr "Muchos puntos" +msgid "Adding a soft restriction" +msgstr "" -msgid "For each points of interests, find the closest edge." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" -msgid "**point**" -msgstr "**punto**" +#, fuzzy +msgid "Identifying the restriction" +msgstr "Agregando las restricciones" -msgid "The point geometry" -msgstr "La geometría del punto" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgstr "" -msgid "**points**" -msgstr "**puntos**" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgstr "" -msgid "``POINT[]``" -msgstr "``POINT``" +msgid "Adding a value to the restriction" +msgstr "" -msgid "An array of point geometries" -msgstr "Una matriz de geometrías de puntos" +msgid "Updating the cost to the edge:" +msgstr "" -msgid "**tolerance**" -msgstr "**tolerancia**" +msgid "Routing from :math:`6` to :math:`3`" +msgstr "" -msgid "Max distance between geometries" -msgstr "Distancia máxima entre geometrías" +msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." +msgstr "" -msgid "Limit output rows" -msgstr "Limitar las filas de salida" +msgid "Simplifying leaf vertices" +msgstr "" -msgid "When ``false`` calculations are performed." -msgstr "Cuando ``false`` se realizan los cálculos." +msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgstr "" -msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." -msgstr "Cuando ``true`` los cálculos no se realizan y la consulta para hacer los cálculos se expone en un ``NOTICE`` de PostgreSQL." +msgid "Using the vertex map give the leaf verices their original value." +msgstr "" -msgid "``geometry``" -msgstr "``geometry``" +msgid "On the source column" +msgstr "" -msgid "The ``LINESTRING`` geometry of the edge." -msgstr "La geometría ``LINESTRING`` de la arista." +msgid "On the target column" +msgstr "" -msgid "When :math:`cap = 1`, it is the closest edge." -msgstr "Cuando :math:`cap = 1`, es la arista más cercana." +msgid "Removing self loops on leaf nodes" +msgstr "" -msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." -msgstr "Valor entre <0,1> indica la posición relativa desde el primer punto de la arista." +msgid "The self loops of the leaf nodes are" +msgstr "" -msgid "Value in ``[r, l]`` indicating if the point is:" -msgstr "Valor en ``[r, l]`` que indica si el punto es:" +msgid "Which can be removed" +msgstr "" -msgid "At the right ``r`` of the segment." -msgstr "A la derecha ``r`` del segmento." +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgstr "" -msgid "When the point is on the line it is considered to be on the right." -msgstr "Cuando el punto está en la línea se considera que está a la derecha." +msgid "Complete routing graph" +msgstr "" -msgid "At the left ``l`` of the segment." -msgstr "A la izquierda ``l`` del segmento." +msgid "Add edges from the original graph" +msgstr "" -msgid "``distance``" -msgstr "``distance``" +msgid "Add all the edges that are not involved in the line graph process to the new table" +msgstr "" -msgid "Distance from the point to the edge." -msgstr "Distancia del punto a la arista." +msgid "Some administrative tasks to get new identifiers for the edges" +msgstr "" -msgid "Original ``POINT`` geometry." -msgstr "Geometría original ``POINT``." +msgid "Add the newly calculated edges" +msgstr "" -msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" -msgstr "Geometría ``LINESTRING`` desde el **punto** original hasta el punto más cercano de la arista con identificador ``edge_id``" +msgid "Using the routing graph" +msgstr "" -msgid "One point in an edge" -msgstr "Un punto en la arista" +msgid "When using this method for routing with soft restrictions there will be uturns" +msgstr "" -msgid "The green node is the original point." -msgstr "El nodo verde es el punto original." +msgid "Routing from :math:`5` to :math:`1`" +msgstr "" -msgid "``geom`` has the value of the original point." -msgstr "``geom`` Tiene el valor del punto original." +msgid "https://en.wikipedia.org/wiki/Line_graph" +msgstr "https://en.wikipedia.org/wiki/Line_graph" -msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." -msgstr "La geometría ``edge``, es una línea que conecta al punto original con el punto más cercano de la arista :math:`sp \\rightarrow ep`." +msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgstr "https://en.wikipedia.org/wiki/Complete_graph" -msgid "The point is located at the left of the edge." -msgstr "El punto original está situado a la izquierda de la arista." +msgid "``pgr_makeConnected`` - Experimental" +msgstr "``pgr_makeConnected`` - Experimental" -msgid "One point dry run execution" -msgstr "Ejecución en seco de un punto" +msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." +msgstr "``pgr_makeConnected`` — Conjunto de aristas que conectan el grafo." -msgid "Using the query from the previous example:" -msgstr "Usando la consulta del ejemplo anterior:" +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgstr "Agrega el número mínimo de bordes necesarios para conectar el gráfico de entrada. El algoritmo primero identifica todos los componentes conectados en el gráfico, luego agrega bordes para conectar esos componentes en una ruta. Por ejemplo, si un gráfico contiene tres componentes conectados A, B y C, make_connected agregará dos bordes. Las dos aristas agregadas podrían consistir en una que conecta un vértice en A con un vértice en B y otra que conecta un vértice en B con un vértice en C." -msgid "Returns ``EMPTY SET``." -msgstr "Devuelve ``CONJUNTO VACÍO``." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgstr "Dará la lista mínima de los bordes que se necesitan en el grafo para conectarlo." -msgid "``dryrun => true``" -msgstr "``dryrun => true``" +msgid "The algorithm does not considers geometric topology in the calculations." +msgstr "El algoritmo no considera la topología geométrica en los cálculos." -msgid "Generates a PostgreSQL ``NOTICE`` with the code used." -msgstr "Genera un ``NOTICE`` de PostgreSQL con el código utilizado." +msgid "pgr_makeConnected(`Edges SQL`_)" +msgstr "pgr_makeConnected(`SQL de aristas`_)" -msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." -msgstr "" +msgid "Returns set of |result-component-make|" +msgstr "Regresa conjunto de |result-component-make|" -msgid "Many points in an edge" -msgstr "Ejemplos de muchos puntos en una arista" +msgid "List of edges that are needed to connect the graph." +msgstr "Lista de aristas que se necesitan para conectar el grafo." -msgid "The green nodes are the **original points**" -msgstr "Los nodos verdes son los **puntos originales**" +msgid "`Boost: make connected `__" +msgstr "`Boost: conectar `__" -msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" -msgstr "La geometría ``geom``, marcada como **g1** y **g2** son los **puntos originales**" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" -msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." -msgstr "La geometría ``edge``, marcada como **edge1** y **edge2** es una línea que conecta el **punto original** con el punto más cercano de la arista :math:`sp \\rightarrow ep`." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad máxima en un grafo." -msgid "Many points dry run execution" -msgstr "Ejecución en seco de muchos puntos" +msgid "pgr_maxCardinalityMatch(text,boolean)" +msgstr "pgr_maxCardinalityMatch(text,boolean)" -msgid "Do not process query" -msgstr "No procesar la consulta" +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "pgr_maxCardinalityMatch(text) regresa solamente la columna ``edge``." -msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" -msgstr "Generar un ``NOTICE`` de PostgreSQL con el código utilizado para calcular todas las columnas" +msgid "Deprecated signature" +msgstr "" -msgid "Find at most two routes to a given point" -msgstr "Encontrar como máximo dos rutas a un punto dado" +msgid "directed => ``false`` when used." +msgstr "Con directed => `` false`` cuando se usa." -msgid "Using :doc:`pgr_withPoints`" -msgstr "Usando :doc:`pgr_withPoints`" +msgid "Renamed from ``pgr_maximumCardinalityMatching``" +msgstr "Renombrado de ``pgr_maximumCardinalityMatching``" -msgid "A point of interest table" -msgstr "Una tabla de puntos de interés" +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgstr "Un conjunto de aristas coincidente o independiente en un grafo es un conjunto de aristas sin vértices comunes." -msgid "Handling points outside the graph." -msgstr "Manejo de puntos fuera del gráfico." +msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgstr "Una coincidencia máxima es una coincidencia que contiene el mayor número posible de aristas." -msgid "Points of interest" -msgstr "Puntos de interés" +msgid "There may be many maximum matchings." +msgstr "Puede haber muchas coincidencias máximas." -msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." -msgstr "Algunas veces las aplicaciones trabajan \"sobre la marcha\" comenzando desde una localización que no es un vértice en el grafo. Esas localizaciones, en pgRrouting se llaman puntos de interés." +msgid "Calculates one possible maximum cardinality matching in a graph." +msgstr "Calcula una posible coincidencia máxima de cardinalidad en un grafo." -msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." -msgstr "La información necesaria en los puntos de interés es ``pid``, ``edge_id``, ``side``, ``fraction``." +msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" +msgstr "Tiempo de ejecución: :math:`O( E*V * \\alpha(E,V))`" -msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." -msgstr "En esta documentación habrá unos 6 puntos de interés fijos y se almacenarán en una tabla." +msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." +msgstr ":math:`\\alpha(E,V)` es inverso a `Ackermann function`_." -msgid "A unique identifier." -msgstr "Un identificador único." +msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" +msgstr "pgr_maxCardinalityMatch(`SQL de aristas`_)" -msgid "Identifier of the nearest segment." -msgstr "Identificador del segmento mas próximo." +msgid "Using all edges." +msgstr "" -msgid "Is it on the left, right or both sides of the segment ``edge_id``." -msgstr "Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``." +msgid "SQL query, which should return a set of rows with the following columns:" +msgstr "Una consulta SQL, que debe regresar un conjunto de filas con las siguientes columnas:" -msgid "Where in the segment is the point located." -msgstr "En qué parte del segmento se encuentra el punto." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgstr "Un valor positivo representa la existencia de la arista (``source``, ``target``)." -msgid "The geometry of the points." -msgstr "La geometría de los puntos." +msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgstr "Un valor positivo representa la existencia de la arista (``target``, ``source``)" -msgid "The distance between ``geom`` and the segment ``edge_id``." -msgstr "La distancia entre ``geom`` y el segmento ``edge_id``." +msgid "Identifier of the edge in the original query." +msgstr "Identificador de la arista en la consulta original." -msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." -msgstr "Un segmento que conecta la ``geom`` del punto al punto mas cercano al segmento ``edge_id``." +msgid "`Boost: maximum_matching `__" +msgstr "`Boost: Coincidencia máxima `__" -msgid "``newPoint``" -msgstr "``newPoint``" +msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" -msgid "A point on segment ``edge_id`` that is the closest to ``geom``." -msgstr "" +msgid "https://en.wikipedia.org/wiki/Ackermann_function" +msgstr "https://en.wikipedia.org/wiki/Ackermann_function" -msgid "Points of interest fill up" -msgstr "Llenado de puntos de interés" +msgid "``pgr_maxFlow``" +msgstr "``pgr_maxFlow``" -msgid "Inserting the points of interest." -msgstr "Insertando los puntos de interés." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgstr "``pgr_maxFlow`` — Calcula el flujo máximo en un gráfico dirigido desde los orígene(s) a los destino(s) mediante el algoritmo Push Relabel." -msgid "Filling the rest of the table." -msgstr "Llenando el resto de la tabla." +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(Combinaciones)" -msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." -msgstr "" +msgid "Calculates the maximum flow from the sources to the targets." +msgstr "Calcula el flujo máximo de las fuentes a los objetivos." -msgid "The points of interest:" -msgstr "Los puntos de interés:" +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgstr "Cuando el flujo máximo es **0**, entonces no hay flujo y se devuelve **0**." -msgid "``pgr_floydWarshall``" -msgstr "``pgr_floydWarshall``" +msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." +msgstr "Use el algoritmo :doc:`pgr_pushRelabel ` ." -msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." -msgstr "``pgr_floydWarshall`` - Devuelve la suma de los costos de la ruta más corta para cada par de nodos en el grafo mediante el algoritmo Floyd-Warshall." +msgid "Running time: :math:`O( V ^ 3)`" +msgstr "Tiempo de ejecución: :math:`O( V ^ 3)`" -msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," -msgstr "El algoritmo Floyd-Warshall, también conocido como algoritmo de Floyd, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos densos*. Usamos la implementación de Boost que se ejecuta en :math:`\\Theta(V^3)` tiempo," +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destino**)" -msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" -msgstr "pgr_floydWarshall(`SQL de aristas`_, [``directed``])" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destinos**)" -msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "Para sub-grafo con aristas :math:`\\{1, 2, 3, 4\\}`." +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destino**)" -#, fuzzy -msgid "Boost `Floyd-Warshall `_" -msgstr "Boost `Algoritmo floyd-Warshall `_" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destinos**)" -msgid "``pgr_full_version``" -msgstr "``pgr_full_version``" +msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlow(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "``pgr_full_version`` — Get the details of pgRouting version information." -msgstr "``pgr_full_version`` — Obtener los detalles de la información de la versión de pgRouting." +msgid "RETURNS ``BIGINT``" +msgstr "" -msgid "Get complete details of pgRouting version information" -msgstr "Obtener los detalles de la información de la versión de pgRouting" +msgid "Maximum flow possible from the source(s) to the target(s)" +msgstr "Flujo máximo posible desde el/los orígen(es) hacia el/los destino(s)" -msgid "pgr_full_version()" -msgstr "pgr_full_version()" +msgid "`Boost: push relabel max flow `__" +msgstr "`Boost: Flujo máximo empujar reetiquetar `__" -msgid "RETURNS |result-version|" -msgstr "REGRESA |result-version|" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgid "Information about when this documentation was built" -msgstr "Información sobre cuándo se construyó esta documentación" +msgid "``pgr_maxFlowMinCost`` - Experimental" +msgstr "``pgr_maxFlowMinCost`` - Experimental" -msgid "``version``" -msgstr "``version``" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo maximo en un grafo" -msgid "pgRouting version" -msgstr "Versión de pgRouting" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "pgr_maxFlowMinCost(Combinaciones)" -msgid "``build_type``" -msgstr "``build_type``" +msgid "|Boost| Boost Graph Inside." +msgstr "|Boost| Boost Graph Adentro." -msgid "The Build type" -msgstr "El tipo de Compilación" +msgid "**TODO** check which statement is true:" +msgstr "**Por hacer** comprobar qué declaración es verdadera:" -msgid "``compile_date``" -msgstr "``compile_date``" +msgid "The cost value of all input edges must be nonnegative." +msgstr "El valor de coste de todas las aristas de entrada debe ser no negativo." -msgid "Compilation date" -msgstr "Fecha de compilación" +msgid "Process is done when the cost value of all input edges is nonnegative." +msgstr "El proceso se realiza cuando el valor de coste de todas las aristas de entrada no es negativo." -msgid "``library``" -msgstr "``library``" +msgid "Process is done on edges with nonnegative cost." +msgstr "El proceso se realiza en aristas con coste no negativo." -msgid "Library name and version" -msgstr "Nombre y versión de la biblioteca" +msgid "Running time: :math:`O(U * (E + V * logV))`" +msgstr "Tiempo de ejecución: :math:`O(U * (E + V * log V))`" -msgid "``system``" -msgstr "``system``" +msgid "where :math:`U` is the value of the max flow." +msgstr "donde :math:`U` es el valor de flujo máximo." -msgid "Operative system" -msgstr "Sistema operativo" +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr ":math:`U` es el límite superior de la cantidad de iteraciones. En muchos casos de la vida reales, la cantidad de iteraciones es mucho menor que :math:`U`." -msgid "``postgreSQL``" -msgstr "``postgreSQL``" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destino**)" -msgid "pgsql used" -msgstr "pgsql utilizado" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destinos**)" -msgid "``compiler``" -msgstr "``compiler``" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destino**)" -msgid "Compiler and version" -msgstr "Compilador y versión" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destinos**)" -msgid "``boost``" -msgstr "``boost``" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "Boost version" -msgstr "Versión de Boost" +msgid "Returns set of |result-flow-mincost|" +msgstr "Regresa el conjunto de |result-flow-mincost|" -msgid "``hash``" -msgstr "``hash``" +msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" +msgstr "``pgr_maxFlowMinCost_Cost`` - Experimental" -msgid "Git hash of pgRouting build" -msgstr "Hash de Git de pgRouting" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost_Cost`` — Calcula el costo mínimo para el máximo flujo en un grafo" -msgid "``pgr_hawickCircuits`` - Experimental" -msgstr "``pgr_hawickCircuits`` - Experimental" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)" -#, fuzzy -msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." -msgstr "``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de circutos de Hawick." +msgid "**The cost value of all input edges must be nonnegative.**" +msgstr "**El valor de coste de todas las aristas de entrada debe ser no negativo.**" -msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." -msgstr "El algoritmo Hawick Circuit fue publicado en 2008 por Ken Hawick y Health A. James. Este algoritmo resuelve el problema de detectar y enumerar circuitos en grafos. Es capaz de enumerar circuitos en grafos con arcos dirigidos, arcos múltiples y autoarcos con una implementación eficiente en memoria y de alto rendimiento. Es una extensión del Algoritmo de Johnson para encontrar todos los circuitos elementales de un grafo dirigido." +msgid "When the maximum flow is 0 then there is no flow and **0** is returned." +msgstr "Cuando el flujo máximo es 0 entonces no hay flujo y se devuelve un **0** ." -msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." -msgstr "Hay 2 variaciones definidas en la librería Boost Graph. Aquí hemos implementado sólo la segunda, ya que es la más adecuada y práctica. En esta variación obtenemos los circuitos después de filtrar los circuitos causados por aristas paralelas. Los circuitos de aristas paralelas tienen más casos de uso cuando se quiere contar el número de circuitos." +msgid "Uses :doc:`pgr_maxFlowMinCost`." +msgstr "Usa :doc:`pgr_maxFlowMinCost`." -msgid "The algorithm implementation works only for directed graph" -msgstr "La implementación del algoritmo sirve solo para grafos dirigidos" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destino**)" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." -msgstr "Es una variación del algoritmo de Johnson para la enumeración de circuitos." +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destinos**)" -msgid "The algorithm outputs the distinct circuits present in the graph." -msgstr "El algoritmo da como resultado los distintos circuitos presentes en el grafo." +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destino**)" -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" -msgstr "Complejidad temporal: :math:`O((V + E) (c + 1))`" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destinos**)" -msgid ":math:`|c|` is the number of circuits in the graph." -msgstr ":math:`|c|` es la cantidad de circuitos en el grafo." +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "pgr_hawickCircuits(`Edges SQL`_)" -msgstr "pgr_hawickCircuits(`SQL de aristas`_)" +msgid "RETURNS FLOAT" +msgstr "" -msgid "Circuits present in the pgRouting :doc:`sampledata`" -msgstr "Circuitos dentro de los :doc:`sampledata` de pgRouting" +msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" +msgstr "Coste Mínimo Flujo Máximo posible desde el/los origen(es) hasta el/los objetivo(s)" -msgid "Id of the circuit starting from ``1``" -msgstr "Identificador del circuito comenzando con ``1``" +msgid "``pgr_pickDeliver`` - Experimental" +msgstr "``pgr_pickDeliver`` - Experimental" -#, fuzzy -msgid "Relative position in the path. Has value ``0`` for beginning of the path" -msgstr "Posición relativa en la camino. Tiene el valor ``0`` para el inicio de la ruta" +msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliver`` - Problema de enrutamiento del vehículo de recogida y entrega" -msgid "Identifier of the starting vertex of the circuit." -msgstr "Identificador del vértice inicial del circuito." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgstr "Problema: Distribuya y optimice los pares de recogida-entrega en una flota de vehículos." -msgid "Identifier of the ending vertex of the circuit." -msgstr "Identificador del vértice final del circuito." +msgid "Optimization problem is NP-hard." +msgstr "El problema de optimización es NP-hard." -msgid "Identifier of the node in the path from a vid to next vid." -msgstr "Identificador del nodo en la ruta de un vértice al siguiente vértice." +msgid "pickup and Delivery with time windows." +msgstr "recogida y Entrega con ventanas de tiempo." -msgid "`Boost: Hawick Circuit Algorithm `__" -msgstr "`Boost: Algoritmo de Circutios de Hawick `__" +msgid "All vehicles are equal." +msgstr "Todos los vehículos son iguales." -msgid "``pgr_isPlanar`` - Experimental" -msgstr "``pgr_isPlanar`` - Experimental" +msgid "Same Starting location." +msgstr "La misma ubicación de Inicio." -msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." -msgstr "``pgr_isPlanar`` — Devuelve un valor boolean dependiendo de la planaridad del grafo." +msgid "Same Ending location which is the same as Starting location." +msgstr "La misma ubicación Final que es la misma que la ubicación de Inicio." -msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." -msgstr "Un grafo es planar si se puede dibujar en un espacio bidimensional sin que se crucen dos de sus aristas. Este dibujo de un grafo planaro es llamado dibujo de plano. Cada grafo planar también admite un dibujo de línea recta, que es un dibujo de plano donde cada arista está representada por un segmento de línea. Cuando un grafo tiene :math:`K_5` or :math:`K_{3,3}` como subgrafo, entonces el grafo no es planar." +msgid "All vehicles travel at the same speed." +msgstr "Todos los vehículos viajan a la misma velocidad." -msgid "This implementation use the Boyer-Myrvold Planarity Testing." -msgstr "Esta implementación utiliza la Prueba de Planaridad de Boyer-Myrvold." +msgid "A customer is for doing a pickup or doing a deliver." +msgstr "Un cliente es para hacer una recogida o hacer una entrega." -msgid "It will return a boolean value depending upon the planarity of the graph." -msgstr "Devolverá un valor boolean dependiendo de la planaridad del grrafo." +msgid "has an open time." +msgstr "tiene un tiempo abierto." -msgid "Applicable only for **undirected** graphs." -msgstr "Aplicable solo para grafos **no dirigidos**." +msgid "has a closing time." +msgstr "tiene tiempo de cierre." -msgid "The algorithm does not considers traversal costs in the calculations." -msgstr "El algoritmo no considera los costos transversales en los cálculos." +msgid "has a service time." +msgstr "tiene un tiempo de servicio." -msgid "Running time: :math:`O(|V|)`" -msgstr "Tiempo de ejecución: :math:`O(|V|)`" +msgid "has an (x, y) location." +msgstr "tiene una ubicación (x, y)." -msgid "pgr_isPlanar(`Edges SQL`)" -msgstr "pgr_isPlanar(`SQL de aristas`)" +msgid "There is a customer where to deliver a pickup." +msgstr "Hay un cliente donde entregar una recogida." -msgid "RETURNS ``BOOLEAN``" -msgstr "DEVUELVE ``BOOLEAN``" +msgid "travel time between customers is distance / speed" +msgstr "tiempo de viaje entre los clientes es distancia / velocidad" -msgid "Returns a boolean ``(pgr_isplanar)``" -msgstr "Devuelve un valor boolean ``(pgr_isplanar)``" +msgid "pickup and delivery pair is done with the same vehicle." +msgstr "La recogida y entrega se realizan con el mismo vehículo." -msgid "``pgr_isplanar``" -msgstr "``pgr_isplanar``" +msgid "All trucks depart at time 0." +msgstr "Todos los camiones salen en el momento 0." -msgid "`true` when the graph is planar." -msgstr "`true` cuando el grafo es planar." +msgid "the algorithm will raise an exception when" +msgstr "el algoritmo generará una excepción cuando" -msgid "`false` when the graph is not planar." -msgstr "`false` cuando el grafo no es planar." +msgid "If there is a pickup-deliver pair than violates time window" +msgstr "Si hay un par de recogida-entrega que viola la ventana de tiempo" -msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." -msgstr "Las siguientes aristas harán de el subgrafo con los vértices {10, 15, 11, 16, 13} un grafo :math:`K_5`." +msgid "The speed, max_cycles, ma_capacity have illegal values" +msgstr "La velocidad, max_cycles, max_capacity tienen valores ilegales" -msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." -msgstr "El nuevo grafo no es planar porque tiene un subgráfico :math:`K_5`. Las aristas en azul representan el subgrafo :math:`K_5`." +msgid "Six different initial will be optimized - the best solution found will be result" +msgstr "Seoptimizarán seis iniciales diferentes - la mejor solución encontrada será el resultado" -msgid "`Boost: Boyer Myrvold `__" -msgstr "`Boost: Boyer Myrvold `__" +msgid "Signature" +msgstr "Firma" -msgid "``pgr_johnson``" -msgstr "``pgr_johnson``" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgstr "pgr_pickDeliver(`SQL de ordenes`_, `SQL de vehículos`_, `SQL de matriz`_, [**opciones**])" -#, fuzzy -msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." -msgstr "``pgr_johnson`` - Devuelve la suma de los costes de la ruta más corta para cada par de nodos del grafo mediante el algoritmo Floyd-Warshall." +msgid "**options:** ``[factor, max_cycles, initial_sol]``" +msgstr "**opcionales:** ``[factor, max_cycles, initial_sol]``" -#, fuzzy -msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," -msgstr "El algoritmo Johnson, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos dispersos*. Utiliza la implementación del Boost que se ejecuta en :math:`O(V E \\log V)` tiempo," +msgid "Returns set of |result-pickdrop|" +msgstr "Regresa el conjunto de |result-pickdrop|" -msgid "pgr johnson(`Edges SQL`_, [``directed``])" -msgstr "johnson(`SQL de aristas`_ , [``dryrun``])" +msgid "Solve the following problem" +msgstr "" -msgid "Boost `Johnson `_" -msgstr "Boost `Algoritmo de Johnson `_" +msgid "Given the vehicles:" +msgstr "Dados los vehículos:" -#, fuzzy -msgid "``pgr_kingOrdering`` - Experimental" -msgstr "``pgr_edgeColoring`` - Experimental" +msgid "and the orders:" +msgstr "" -msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." -msgstr "``pgr_kingOrdering`` - Regresa el ordenamiento King de un grafo no dirigido." +msgid "The parameters are:" +msgstr "Los parámetros son:" -msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." +msgid "A `SELECT` statement that returns the following columns:" +msgstr "Una instrucción `SELECT` que devuelve las siguientes columnas:" + +msgid "id, demand" +msgstr "id, demand" + +msgid "p_node_id, p_open, p_close, [p_service,]" msgstr "" -msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." +msgid "d_node_id, d_open, d_close, [d_service,]" msgstr "" -#, fuzzy -msgid "The implementation targets undirected graphs." -msgstr "La implementación es para grafos **no dirigidos**." +msgid "id, capacity" +msgstr "id, capacity" -msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." +msgid "start_node_id, start_open, start_close [, start_service,]" msgstr "" -#, fuzzy -msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" -msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`" +msgid "[end_node_id, end_open, end_close, end_service]" +msgstr "" -#, fuzzy -msgid "where :math:`|E|` is the number of edges," -msgstr "donde :math:`|V|` es el número de vértices," +msgid "``pgr_pickDeliverEuclidean`` - Experimental" +msgstr "``pgr_pickDeliverEuclidean`` - Experimental" -#, fuzzy -msgid ":math:`m` is the maximum degree among all vertices." -msgstr ":math:`m` es el grado máximo de los vértices en el grafo." +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliverEuclidean`` - Problema de Ruteo del Vehículo de Recogida y Entrega" -#, fuzzy -msgid "pgr_kingOrdering(`Edges SQL`_)" -msgstr "pgr_edgeColoring(`SQL de aristas`_)" +msgid "Replaces ``pgr_gsoc_vrppdtw``" +msgstr "Reemplaza ``pgr_gsoc_vrppdtw``" -#, fuzzy -msgid "`Boost: King Ordering `__" -msgstr "`Boost: Coloración de Segmentos `__" +msgid "Pickup and Delivery:" +msgstr "Recogida y Entrega:" -msgid "``pgr_kruskal``" -msgstr "``pgr_kruskal``" +msgid "capacitated" +msgstr "capacitado" -msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." -msgstr "``pgr_kruskal`` — Devuelve el árbol de expansión mínimo del grafo utilizando el algoritmo Kruskal." +msgid "with time windows." +msgstr "con ventanas de tiempo." -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." -msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Kruskal." +msgid "have (x, y) start and ending locations." +msgstr "tienen (x, y) ubicaciones de inicio y finalización." -msgid "EMPTY SET is returned when there are no edges in the graph." -msgstr "EMPTY SET es regresado cuando no hay aristas en el grafo." +msgid "have a start and ending service times." +msgstr "tener un inicio y un final de los tiempos de servicio." -msgid "pgr_kruskal(`Edges SQL`_)" -msgstr "pgr_kruskal(`SQL de aristas`_)" +msgid "An order is for doing a pickup and a a deliver." +msgstr "Un pedido es para hacer una recogida y una entrega." -msgid "Returns set of |result-mst|" -msgstr "Regresa el conjunto de |result-mst|" +msgid "has (x, y) pickup and delivery locations." +msgstr "tiene (x, y) ubicaciones de recogida y entrega." -msgid "Minimum spanning forest" -msgstr "Bosque de expansión mínimo" +msgid "has opening and closing times for the pickup and delivery locations." +msgstr "tiene horarios de apertura y cierre para los lugares de recogida y entrega." -msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." -msgstr "``pgr_kruskalBFS`` — Algoritmo de Kruskal para el Árbol de Expansión Mínimo con orden de Primera Búsqueda en Anchura." +msgid "has a pickup and deliver service times." +msgstr "tiene una recogida y entrega de tiempos de servicio." -msgid "Added ``pred`` result columns." -msgstr "Agregado columna de resultados ``pred``." +msgid "Six different optional different initial solutions" +msgstr "Seis diferentes soluciones iniciales opcionales" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "Visita y extrae la información de los nodos en la orden de Primera Búsqueda en Anchura del Árbol de Expansión Mínimo creado con el algoritmo de Kruskal." +msgid "the best solution found will be result" +msgstr "la mejor solución encontrada será el resultado" -msgid "Returned tree nodes from a root vertex are on Breath First Search order" -msgstr "Los nodos de árbol devueltos desde un vértice raíz están en orden de la Primera Búsqueda de Anchura" +msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgstr "pgr_pickDeliverEuclidean(`SQL de órdenes`_, `SQL de vehículos`_, [**opciones**])" -msgid "Breath First Search Running time: :math:`O(E + V)`" -msgstr "Tiempo de ejecución de la Primera Búsqueda de Anchura: :math:`O(E + V)`" +msgid "p_x, p_y, p_open, p_close, [p_service,]" +msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_kruskalBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" +msgid "d_x, d_y, d_open, d_close, [d_service]" +msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_kruskalBFS(`SQL de aristas`_, **raices**, [``max_depth``])" +msgid "start_x, start_y, start_open, start_close [, start_service, ]" +msgstr "" -msgid "The Minimum Spanning Tree having as root vertex :math:`6`" -msgstr "El Árbol de Expansión Mínimo que tiene como vértice raíz :math:`6`" +msgid "[ end_x, end_y, end_open, end_close, end_service ]" +msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" -msgstr "El Árbol de Expansión Mínimo que comienza en los vértices :math:`\\{9, 6\\}` con ::math:`depth \\leq 3`" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgstr "" -msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." -msgstr "``pgr_kruskalDD`` — Nodos de captación utilizando el algoritmo de Kruskal." +msgid "There are 25 vehicles in the problem all with the same characteristics." +msgstr "" -msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." -msgstr "Usando el algoritmo de Kruskal, extraerá los nodos que tienen costos agregados menores o iguales a la **distancia** desde un vértice (o vértices) **raíz** dentro del árbol de expansión mínimo calculado." +msgid "The original orders" +msgstr "" -msgid "Returned tree nodes from a root vertex are on Depth First Search order." -msgstr "Los nodos de árbol devueltos de un vértice raíz están en el orden de Primera Búsqueda de Profundidad." +msgid "The data comes in different rows for the pickup and the delivery of the same order." +msgstr "" -msgid "Depth First Search running time: :math:`O(E + V)`" -msgstr "Primera Búsqueda de Profundidad, tiempo de ejecución: :math:`O(E + V)`" +msgid "The original data needs to be converted to an appropriate table:" +msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "pgr_kruskalDD(`SQL de aristas`_, **raíz**, **distancia**)" +msgid "The query" +msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "pgr_kruskalDD(`SQL de aristas`_, **raices**, **distancia**)" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgstr "" -msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" -msgstr "El mínimo árbol de expansión que comienza en el vértice:math:`6` con :math:`distance \\leq 3.5`" +msgid "The best solution found for **lc101** is a travel time: 828.94" +msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" -msgstr "El árbol de expansión mínimo que comienza en los vértices :math:`\\{9, 6\\}` con :math:`distance \\leq 3.5`" +msgid "This implementation's travel time: 854.54" +msgstr "" -msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_kruskalDFS`` — Algoritmo Kruskal para el Árbol de Expansión Mínima con orden de Búsqueda Primero en Profundidad." - -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "Visita y extrae la información de los nodos en el orden de Búsqueda en Primera Profundidad del Árbol de Expansión Mínima creado con el algoritmo de Kruskal." +msgid "``pgr_prim``" +msgstr "``pgr_prim``" -msgid "Returned tree nodes from a root vertex are on Depth First Search order" -msgstr "Los nodos de árbol devueltos desde un vértice raíz están en el orden de Primera Búsqueda de Profundidad" +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgstr "``pgr_prim`` — Mínimo bosque de expansión de un grafo, utilizando el algoritmo de Prim." -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raíz**, [``max_depth``])" +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Prim." -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raices**, [``max_depth``])" +msgid "Prim's running time: :math:`O(E * log V)`" +msgstr "Tiempo de ejecución de Prim: :math:`O(E*log V)`" -msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" -msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgid "pgr_prim(`Edges SQL`_)" +msgstr "pgr_prim(`SQL de aristas`_)" -msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." -msgstr "``pgr_lengauerTarjanDominatorTree`` — Devuelve el dominador inmediato de todos los vértices." +msgid "Minimum spanning forest of a subgraph" +msgstr "Bosque de Expansión Mínimo de un subgrafo" -#, fuzzy -msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." -msgstr "El algoritmo calcula el *dominador inmediato* de cada vértice llamado **idom**, una vez que se calcula la **idom** de cada vértice y, a continuación, haciendo que cada **idom** de cada vértice como su elemento primario, se pueda construir el árbol del dominador." +msgid "`Boost: Prim's algorithm documentation `__" +msgstr "`Boost: algoritmo de Prim `__" -msgid "The algorithm works in directed graph only." -msgstr "El algoritmo solo funciona en el grafo dirigido." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primBFS`` — Algoritmo de Prim para el árbol de expansión mínimo con orden de primera búsqueda de profundidad." -msgid "The algorithm returns *idom* of each vertex." -msgstr "El algoritmo devuelve *idom* de cada vértice." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Visita y extrae la información de los nodos en el ordenamiento de la primera búsqueda de amplitud del árbol de expansión mínima creado mediante el algoritmo de Prim." -msgid "If the *root vertex* not present in the graph then it returns empty set." -msgstr "Si el *vértice raíz* no está presente en el grafo, devuelve un conjunto vacío." +msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" -msgid "Running time: :math:`O((V+E)log(V+E))`" -msgstr "Tiempo de ejecución: :math:`O((V+E)log(V+E))`" +msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primBFS(`SQL de aristas`_, **Raíces**, [``max_depth``])" -msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" -msgstr "pgr_lengauerTarjanDominatorTree(`SQL de aristas`_, **raíz**)" +msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." +msgstr "``pgr_primDD`` — Nodos de captación mediante el algoritmo de Prim." -msgid "Returns set of |result-idom|" -msgstr "Regresa el conjunto de |result-idom|" +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgstr "Mediante el algoritmo de Prim, extrae los nodos que tienen costes agregados inferiores o iguales a una distancia desde un vértice raíz (o vértices) dentro del árbol de expansión mínimo calculado." -msgid "The dominator tree with root vertex :math:`5`" -msgstr "El árbol dominante con vértice raíz :math:`5`" +msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +msgstr "pgr_primDD(`SQL de aristas`_, **raíz**, **distancia**)" -msgid "SQL query as described above." -msgstr "Consulta SQL como se describió anteriormente." +msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgstr "pgr_primDD(`SQL de aristas`_, **raices**, **distancia**)" -msgid "**root vertex**" -msgstr "**vértice raíz**" +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "''pgr_primDFS'' — Algoritmo Prim para el Árbol de Expansión Mínima con orden de la Primera Búsqueda de Profundidad." -msgid "Returns set of ``(seq, vertex_id, idom)``" -msgstr "Devuelve el conjunto de ``(seq, vertex_id, idom)``" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Visita y extrae la información de los nodos en el orden de la Primera Búsqueda de Profundidad del Árbol de Expansión Mínima creado utilizando el algoritmo de Prim." -msgid "``vertex_id``" -msgstr "``vertex_id``" +msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primDFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" -msgid "Identifier of vertex ." -msgstr "Identificador de vértice." +msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primDFS(`SQL de aristas`_, **Raíces**, [``max_depth``])" -msgid "``idom``" -msgstr "``idom``" +msgid "``pgr_pushRelabel``" +msgstr "``pgr_pushRelabel``" -msgid "Immediate dominator of vertex." -msgstr "Dominador inmediato del vértice." +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgstr "``pgr_pushRelabel`` — Calcula el flujo en los bordes del grafo que maximiza el flujo de los orígenes a los destinos mediante el Algoritmo Push Relabel." -msgid "Dominator tree of another component." -msgstr "Árbnol dominante de otro componente." +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(Combinaciones)" -msgid "`Boost: Lengauer-Tarjan dominator `__" -msgstr "`Boost: Árbol dominante Lengauer-Tarjan `__" +msgid "Renamed from ``pgr_maxFlowPushRelabel``" +msgstr "Renombrado de ``pgr_maxFlowPushRelabel``" -msgid "`Wikipedia: dominator tree `__" -msgstr "'Wikipedia: árbol de dominador' `__" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destino**)" -msgid "``pgr_lineGraph`` - Proposed" -msgstr "``pgr_lineGraph`` - Propuesto" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destinos**)" -msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." -msgstr "``pgr_lineGraph`` — Transforma un grafo dado en su grafo correspondiente basado en aristas." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destino**)" -msgid "Works for directed and undirected graphs." -msgstr "Funciona para grafos dirigidos y no dirigidos." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destinos**)" -msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" -msgstr "Dado un grafo :math:`G`, su grafo lineal :math:`L(G)` es un grafo tal que:" +msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_pushRelabel(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." -msgstr "Cada vértice de :math:`L(G)` representa una arista de :math:`G`." +msgid "``pgr_separateCrossing``" +msgstr "``pgr_separateCrossing``" -msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" -msgstr "Dos vértices de :math:`L(G)` son adyacentes si y sólo si sus aristas correspondientes comparten un punto final común en :math:`G`" +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." +msgstr "" -msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." -msgstr "Las columnas ``cost`` y ``reverse_cost`` del resultado representan la existencia de la arista." +msgid "Proposed function." +msgstr "Función propuesta." -msgid "When the graph is directed the result is directed." -msgstr "Cuando el grafo es dirigido el resultado es dirigido." +#, fuzzy +msgid "This is an auxiliary function for separating crossing edges." +msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo." -msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." -msgstr "Para obtener el Grafo lineal completo utilizar identificadores únicos en las aristas de doble sentido (Ver `Ejemplos Adicionales`_)." +#, fuzzy +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" -msgid "When the graph is undirected the result is undirected." -msgstr "Cuando el grafo es no dirigido el resultado es no dirigido." +#, fuzzy +msgid "RETURNS |result-separate|" +msgstr "REGRESA |result-version|" -msgid "The ``reverse_cost`` is always :math:`-1`." -msgstr "El ``reverse_cost`` es siempre :math:`-1`." +msgid "Get the segments of the crossing geometries" +msgstr "Obtener los segmentos de las geometrías que se cruzan" -msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" -msgstr "pgr_lineGraph(`SQL de aristas`_, [``directed``])" +msgid "``tolerance``" +msgstr "``tolerance``" -msgid "Returns set of |result-lineg|" -msgstr "Regresa el conjunto de |result-lineg|" +#, fuzzy +msgid "0.01" +msgstr "0.010" -msgid "For an undirected graph with edges :math:'{2,4,5,8}'" -msgstr "Para un grafo no dirigido con aristas :math:'{2,4,5,8}'" +msgid "Used in ST_Snap before ST_Split" +msgstr "" -msgid "Gives a local identifier for the edge" -msgstr "Da un identificador local de la arista" +#, fuzzy +msgid "Get the code for further refinement." +msgstr "En cualquier lado del segmento." -msgid "When `negative`: the source is the reverse edge in the original graph." -msgstr "Cuando es 'negativo': el origen es la arista inversa en el grafo original." +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgstr "" -msgid "When `negative`: the target is the reverse edge in the original graph." -msgstr "Cuando es `negativo`: el destino es la arista inversa en el grafo original." +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" -msgid "Weight of the edge (``source``, ``target``)." -msgstr "Peso de la arista (``source``, ``target``)." +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" +msgstr "" -msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." -msgstr "Cuando `negative`: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." +msgstr "" -msgid "Weight of the edge (``target``, ``source``)." -msgstr "Peso de la arista (``target``, ``source``)." +#, fuzzy +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" -msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." -msgstr "Cuando `negative`: la arista (``target``, ``source``) no existe, por lo tanto no es parte del grafo." +msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgstr "``pgr_sequentialVertexColoring`` - Propuesto" -msgid "Given the following directed graph" -msgstr "Dado el siguente grafo dirigido" +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgstr "``pgr_sequentialVertexColoring`` — Devuelve el color de vértice de un grafo no dirigido, utilizando un enfoque codicioso." -msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" -msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3})`" +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgstr "El algoritmo de Coloración de Vértices Secuenciales es un algoritmo de coloración de grafos en el que se asignan identificadores de color a los vértices de un grafo de forma secuencial, de modo que ninguna arista conecte dos vértices de colores idénticos." -msgid "Representation as directed with shared edge identifiers" -msgstr "Representación como dirigida con identificadores de arista compartidos" +msgid "The implementation is applicable only for **undirected** graphs." +msgstr "La implementación solo es aplicable a los grafos **no dirigidos**." -msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" -msgstr "" +msgid "Provides the color to be assigned to all the vertices present in the graph." +msgstr "Proporciona el color que se asignará a todos los vértices presentes en el grafo." -msgid "hundreds" -msgstr "cientos" +msgid "Color identifiers values are in the Range :math:`[1, |V|]`" +msgstr "Los valores de los identificadores de color se encuentran en el rango :math:`[1, |V|]`" -msgid "the source vertex" -msgstr "el vértice de origen" +msgid "The algorithm tries to assign the least possible color to every vertex." +msgstr "El algoritmo intenta asignar el menor color posible a cada vértice." -msgid "tens" -msgstr "decenas" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgstr "El color de grafos eficientes es un problema NP-Hard, y por lo tanto, este algoritmo no siempre produce un coloración óptima. Sigue una estrategia expansiva recorriendo en iteración todos los vértices secuencialmente y asignando el color más pequeño posible que no sea utilizado por sus vecinos, a cada vértice." -msgid "always 0, acts as a separator" -msgstr "siempre 0, actúa como separador" +msgid "The returned rows are ordered in ascending order of the vertex value." +msgstr "Las filas devueltas se ordenan en orden ascendente del valor de vértice." -msgid "units" -msgstr "unidades" +msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" +msgstr "Tiempo de Ejecución de Coloración de Vértices Secuenciales: :math:`O(|V|*(d + k))`" -msgid "the target vertex" -msgstr "el vértice de destino" +msgid ":math:`d` is the maximum degree of the vertices in the graph," +msgstr ":math:`d` es el grado máximo de los vértices en el grafo," -msgid "In this image," -msgstr "En esta imagen," +msgid ":math:`k` is the number of colors used." +msgstr ":math:`k` es el número de colores utilizados." -msgid "Single or double head arrows represent one edge (row) on the edges table." -msgstr "Las puntas de flechas simples o dobles representan una arista (fila) en la tabla de aristas." +msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgstr "pgr_sequentialVertexColoring(`SQL de aristas`_)" -msgid "The numbers in the yellow shadow are the edge identifiers." -msgstr "Los números en la sombra amarilla son los identificadores de las aristas." +msgid "`Boost: Sequential Vertex Coloring `__" +msgstr "`Boost: Coloración Secuencial de Vértices `__" -msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." -msgstr "Dos pares de aristas comparten el mismo identificador cuando se utiliza la columna ``reverse_cost``." +#, fuzzy +msgid "``pgr_sloanOrdering`` - Experimental" +msgstr "``pgr_edgeColoring`` - Experimental" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." -msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con una fila de aristas con :math:`id=203`." +#, fuzzy +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." -msgstr "Las aristas :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` se representan con una fila de aristas con :math:`id=304`." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." +msgstr "" -msgid "The graph can be created as follows:" -msgstr "El grafo puede crearse del siguiente modo:" +msgid "Finds a pseudoperipheral vertex pair to determine good starting points" +msgstr "" -msgid "Line Graph of a directed graph represented with shared edges" -msgstr "Grafo lineal de un grafo dirigido representado con aristas compartidas" +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." +msgstr "" -msgid "The result is a directed graph." -msgstr "El resultado es un grafo dirigido." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." +msgstr "" -msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" -msgstr "Para :math:`seq=4` desde :math:`203 \\leftrightarrow 304` representa dos arsitas" +msgid "Typically produces better orderings than simple breadth-first approaches." +msgstr "" -msgid "For all the other values of ``seq`` represent one edge." -msgstr "Todos los demás valores de ``seq`` representan una arista." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." +msgstr "" -msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." -msgstr "Los valores ``cost`` y ``reverse_cost`` representan la existencia de la arista." +#, fuzzy +msgid "pgr_sloanOrdering(`Edges SQL`_)" +msgstr "pgr_edgeColoring(`SQL de aristas`_)" -msgid "When positive: the edge exists." -msgstr "Cuando es positivo: la arista existe." +msgid ":Example : Sloan ordering without specifying start vertex" +msgstr "" -msgid "When negative: the edge does not exist." -msgstr "Cuando es negativo: la arista no existe." +#, fuzzy +msgid "New sloan ordering order." +msgstr "Nuevo ordenamiento es en orden inverso." -msgid "Representation as directed with unique edge identifiers" -msgstr "Representación dirigida con identificadores de arista únicos" +msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." +msgstr "" -msgid "Single head arrows represent one edge (row) on the edges table." -msgstr "Las flechas de una cabeza representan una arista (fila) en la tabla de aristas." +#, fuzzy +msgid "`Boost: Sloan Ordering `__" +msgstr "`Boost: Coloración de Segmentos `__" -msgid "There are no double head arrows" -msgstr "No hay flechas de doble punta" +msgid "``pgr_stoerWagner`` - Experimental" +msgstr "``pgr_stoerWagner`` - Experimental" -msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." -msgstr "Dos pares de aristas comparten los mismos nodos finales y no se utiliza la columna ``reverse_cost``." +msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." +msgstr "``pgr_stoerWagner`` — El corte mínimo del grafo usando el algoritmo Stoer-Wagner." -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." -msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con dos aristas :math:`id=203` y :math:`id=302` respectivamente." +msgid "Version 3.0" +msgstr "Versión 3.0" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." -msgstr "" +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgstr "En teoría de grafos, el algoritmo Stoer-Wagner es un algoritmo recursivo para resolver el problema de corte mínimo en gráficos ponderados no dirigidos con pesos no negativos. La idea esencial de este algoritmo es encoger el grafo mediante la fusión de los vértices más intensivos, hasta que el grafo sólo contiene dos conjuntos de vértices combinados. En cada fase, el algoritmo encuentra el corte s-t mínimo para dos vértices s y t elegidos a su voluntad. A continuación, el algoritmo encoge la arista entre s y t para buscar cortes no s-t. El corte mínimo encontrado en todas las fases será el corte ponderado mínimo del grafo." -msgid "Line Graph of a directed graph represented with unique edges" -msgstr "Gráfico lineal de un grafo dirigido representado con aristas únicas" +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgstr "Un corte es una partición de los vértices de un grafo en dos subconjuntos separados. Un corte mínimo es un corte para el que el tamaño o peso del corte no es mayor que el tamaño de cualquier otro corte. Para un grafo no ponderado, el corte mínimo sería simplemente el corte con menos aristas. Para un grafo ponderado, la suma del peso de todas las aristas en el corte determina si se trata de un corte mínimo." -msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." -msgstr "Para :math:`seq=7` desde :math:`203 \\leftrightarrow 302` representan dos aristas." +msgid "Sum of the weights of all edges between the two sets is mincut." +msgstr "La suma de los pesos de todas las aristas entre los dos conjuntos es mincut." -msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." -msgstr "Para :math:`seq=8` desde :math:`304 \\leftrightarrow 403` representan dos aristas." +msgid "A **mincut** is a cut having the least weight." +msgstr "Un **mincut** es un corte que tiene el menor peso." -msgid "wikipedia: `Line Graph `__" -msgstr "wikipedia: `Grafo lineal `__" +msgid "Values are returned when graph is connected." +msgstr "Los valores se devuelven cuando se conecta el grafo." -msgid "mathworld: `Line Graph `__" -msgstr "" +msgid "When there is no edge in graph then EMPTY SET is return." +msgstr "Cuando no hay arista en el grafo se devuelve EMPTY SET." -msgid "``pgr_lineGraphFull`` - Experimental" -msgstr "``pgr_lineGraphFull`` - Experimental" +msgid "When the graph is unconnected then EMPTY SET is return." +msgstr "Cuando el gráfico está desconectado, se devuelve un conjunto vacío o EMPTY SET." -msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." -msgstr "``pgr_lineGraphFull`` — Transforma un grafo dado en uno nuevo donde todos los vértices del grafo original se convierten en grafos de líneas." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgstr "A veces un grafo tiene varios cortes mínimos, pero todos tienen el mismo peso. Esta función determina exactamente uno de los cortes mínimos, así como su peso." -msgid "Version 2.6.0" -msgstr "Versión 2.6.0" +msgid "Running time: :math:`O(V*E + V^2*log V)`." +msgstr "Tiempo de ejecución: :math:`O(V*E + V^2*log V)`." -msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." -msgstr "``pgr_lineGraphFull``, convierte un grafo dirigido a un grafo dirigido lineal, convirtiendo cada vértice en un grafo completo y manteniendo todas las aristas originales. Las nuevas aristas de conexión tienen un costo de 0 y van entre las aristas originales adyacentes, respetando la direccionalidad." +msgid "pgr_stoerWagner(`Edges SQL`_)" +msgstr "pgr_stoerWagner(`SQL de aristas`_)" -msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" -msgstr "Una posible aplicación del grafo resultante es **\"ruteo con restricciones en dos aristas\"**:" +msgid "Returns set of |result-mincut|" +msgstr "Regresa el conjunto de |result-mincut|" -msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" -msgstr "Establecer un coste de uso del vértice al enrutar entre aristas en la arista de conexión" +msgid "min cut of the main subgraph" +msgstr "corte mínimo de el subgrafo principal" -msgid "Forbid the routing between two edges by removing the connecting edge" -msgstr "Prohibir el ruteo entre dos aristas al quitar el arista de conexión" +msgid "Returns set of ``(seq, edge, cost, mincut)``" +msgstr "Devuelve conjunto de ``(seq, edge, cost, mincut)``" -msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." -msgstr "Esto es posible porque cada una de las intersecciones (vértices) en el grafo original ahora son grafos completos que tienen una nueva arista para cada posible giro a través de esa intersección." +msgid "Edges which divides the set of vertices into two." +msgstr "Aristas que dividen el conjunto de vértices en dos." -msgid "This function is for **directed** graphs." -msgstr "Esta función es para grafos **dirigidos**." +msgid "Cost to traverse of edge." +msgstr "Costo para atravesar la arista." -msgid "Results are undefined when a negative vertex id is used in the input graph." -msgstr "Los resultados son indefinidos cuando se utiliza un identificador de vértice negativo en el grafo de entrada." +msgid "**mincut**" +msgstr "**mincut**" -msgid "Results are undefined when a duplicated edge id is used in the input graph." -msgstr "Los resultados son indefinidos cuando se utiliza un identificador de borde duplicado en el grafo de entrada." +msgid "Min-cut weight of a undirected graph." +msgstr "Peso de corte mínimo de un grafo no dirigido." -msgid "Running time: TBD" -msgstr "Tiempo de ejecución: TBD" +msgid "Additional Example:" +msgstr "Ejemplo Adicional:" -msgid "pgr_lineGraphFull(`Edges SQL`_)" -msgstr "pgr_lineGraphFull(`SQL de aristas`_)" +msgid "min cut of an edge" +msgstr "corte mínimo de una arista" -msgid "Returns set of |result-linegf|" -msgstr "Regresa el conjunto de |result-linegf|" +msgid "Using :doc:`pgr_connectedComponents`" +msgstr "Usando :doc:`pgr_connectedComponents`" -msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" -msgstr "Grafo de línea completa del subgrafo de las aristas :math:`\\{4, 7, 8, 10\\}`" +msgid "`Boost: Stoer Wagner min cut `__" +msgstr "`Boost: Corte mínimo Stoer Wagner `__" -msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." -msgstr "Los ejemplos incluyen el sub-grafo que incluye las aristas 4, 7, 8 y 10 con ``reverse_cost``." +msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" -msgid "The data" -msgstr "Los datos" +msgid "``pgr_strongComponents``" +msgstr "``pgr_strongComponents``" -msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." -msgstr "En este ejemplo se muestra cómo funciona esta transformación de grafo para crear aristas adicionales para cada giro posible en un grafoáfico." +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgstr "``pgr_strongComponents`` — Componentes fuertemente conectados de un grafo dirigido utilizando el algoritmo de Tarjan basado en DFS." -msgid "|first|" -msgstr "|first|" +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." +msgstr "Un componente fuertemente conectado de un gráfico dirigido es un conjunto de vértices que son todos accesibles entre sí." -msgid "first" -msgstr "primero" +msgid "Works for **directed** graphs." +msgstr "Funciona paragrafos **dirigidos**." -msgid "The transformation" -msgstr "La transformación" +msgid "Components are described by vertices identifiers." +msgstr "Los componentes se describen mediante identificadores de vértices." -msgid "|second|" -msgstr "|second|" +msgid "pgr_strongComponents(`Edges SQL`_)" +msgstr "pgr_strongComponents(`SQL de aristas`_)" -msgid "second" -msgstr "segundo" +msgid "The strong components of the graph" +msgstr "Los componentes fuertes del grafo" -msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." -msgstr "En el grafo transformado, todas las aristas del grafo original siguen presentes (amarillos), pero ahora hay aristas adicionales para cada giro que se podría hacer a través del vértice 7 (naranja)." +msgid "`Boost: Strong components `__" +msgstr "`Boost: Componentes fuertemente conectados `__" -msgid "Creating table that identifies transformed vertices" -msgstr "Crear una tabla que identifica los vértices transformados" +msgid "wikipedia: `Strongly connected component `__" +msgstr "Wikipedia: `Componentes fuertemente conectados `__" -msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." -msgstr "Los vértices del grafo transformado se crean dividiendo los vértices en el grafo original. A menos que un vértice en el grafo original sea un vértice hoja, generará más de un vértice en el grafo transformado. A uno de los vértices recién creados en el grafo transformado se le dará el mismo identificador del vértice desde el cual se creó en el grafo original, pero el resto de los vértices recién creados tendrán identificadores de vértices negativos." +msgid "``pgr_topologicalSort`` - Experimental" +msgstr "``pgr_topologicalSort`` - Experimental" -msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" -msgstr "" +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgstr "``pgr_topologicalSort`` — Devuelve el orden lineal de los vértices para los grafos acíclicos dirigidos ponderados (DAG)." -msgid "Store edge results" -msgstr "Almacenar resultados de aristas" +msgid "Standardize output to |result_node_order|" +msgstr "Columnas de resultados estandarizados a|result_node_order|" -msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" -msgstr "" +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgstr "El algoritmo de ordenación topológica crea un orden lineal de los vértices de tal manera que si la arista :math:`(u,v)` aparece en el grafo, entonces :math:`v` viene antes de :math:`u` en el orden." -msgid "Create the mapping table" -msgstr "" +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgstr "El proceso solo es válido para grafos acíclicos dirigidos. de lo contrario lanzará advertencias." -msgid "From the original graph's vertex information" +msgid "For optimization purposes, if there are more than one answer, the function" +msgstr "Para fines de optimización, si hay más de una respuesta, la función" + +msgid "will return one of them." msgstr "" -msgid "Add the new vertices" -msgstr "Agregar nuevos vértices" +msgid "The returned values are ordered in topological order:" +msgstr "Los valores devueltos se ordenan en orden topológico:" -msgid "Filling the mapping table" -msgstr "" +msgid "pgr_topologicalSort(`Edges SQL`_)" +msgstr "pgr_topologicalSort(`SQL de aristas`_)" -msgid "The positive vertex identifiers are the original identifiers" +msgid "Topologically sorting the graph" msgstr "" -msgid "Inspecting the vertices map" -msgstr "" +msgid "Sequential value starting from :math:`1`" +msgstr "Valor secuencial a partir de :math:`1`" -msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgid "Linear topological ordering of the vertices" msgstr "" -msgid "Updating values from self loops" +msgid "Additional examples" msgstr "" -msgid "Inspecting the vertices table" -msgstr "Inspeccionando la tabla de vértices" - -msgid "Updating from inner self loops" +msgid "Topologically sorting the one way segments" msgstr "" -msgid "Adding a soft restriction" +msgid "Graph is not a DAG" msgstr "" -msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." -msgstr "" +msgid "`Boost: topological sort `__" +msgstr "`Boost: Ordenamiento topológico `__" -#, fuzzy -msgid "Identifying the restriction" -msgstr "Agregando las restricciones" +msgid "``pgr_transitiveClosure`` - Experimental" +msgstr "``pgr_transitiveClosure`` - Experimental" -msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" -msgstr "" +msgid "Standardized output to |result-closure|" +msgstr "Estandarización de columnas de resultados a |result-closure|" -msgid "Adding a value to the restriction" -msgstr "" +msgid "Transforms the input directed graph into the transitive closure of the graph." +msgstr "Transforma el grafo de entrada en grafo de cierre transitivo." -msgid "Updating the cost to the edge:" +msgid "Process is valid for directed graphs." msgstr "" -msgid "Routing from :math:`6` to :math:`3`" +msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" -msgid "Simplifying leaf vertices" -msgstr "" +msgid "The returned values are not ordered" +msgstr "Los valores devueltos no se ordenan" -msgid "In this example, there is no additional cost for traversing a leaf vertex." -msgstr "" +#, fuzzy +msgid "The returned graph is compressed" +msgstr "Cuando el grafo es conectado" -msgid "Using the vertex map give the leaf verices their original value." -msgstr "" +msgid "Running time: :math:`O(|V||E|)`" +msgstr "Tiempo de ejecución: :math:`O(|V||E|)`" -msgid "On the source column" -msgstr "" +msgid "The pgr_transitiveClosure function has the following signature:" +msgstr "La función pgr_transitiveClosure tiene la siguiente firma:" -msgid "On the target column" -msgstr "" +msgid "pgr_transitiveClosure(`Edges SQL`_)" +msgstr "pgr_transitiveClosure(`SQL de aristas`_)" -msgid "Removing self loops on leaf nodes" -msgstr "" +msgid "Returns set of |result-closure|" +msgstr "Regresa el conjunto de |result-closure|" -msgid "The self loops of the leaf nodes are" +msgid "Rechability of a subgraph" msgstr "" -msgid "Which can be removed" -msgstr "" +msgid "Identifier of the source of the edges" +msgstr "Identificador del nodo inicial de las aristas" -msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" -msgstr "" +msgid "``target_array``" +msgstr "``target_array``" -msgid "Complete routing graph" -msgstr "" +msgid "Identifiers of the targets of the edges" +msgstr "Identificador del nodo final de las aristas" -msgid "Add edges from the original graph" -msgstr "" +msgid "Identifiers of the vertices that are reachable from vertex v." +msgstr "Identificadores de los vértices que son alcanzables desde el vértice v." -msgid "Add all the edges that are not involved in the line graph process to the new table" -msgstr "" +msgid "`Boost: transitive closure `__" +msgstr "`Boost: Cierre transitivo `__" -msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "Add the newly calculated edges" -msgstr "" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" -msgid "Using the routing graph" -msgstr "" +msgid "``pgr_trsp`` - routing vertices with restrictions." +msgstr "``pgr_trsp`` - Ruteo con restricciones." -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid "Routing from :math:`5` to :math:`1`" -msgstr "" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "https://en.wikipedia.org/wiki/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +msgid "pgr_trsp(One to One)" +msgstr "pgr_trsp(Uno a Uno)" -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +msgid "pgr_trsp(One to Many)" +msgstr "pgr_trsp(Uno a Muchos)" -msgid "``pgr_makeConnected`` - Experimental" -msgstr "``pgr_makeConnected`` - Experimental" +msgid "pgr_trsp(Many to One)" +msgstr "pgr_trsp(Muchos a Uno)" -msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." -msgstr "``pgr_makeConnected`` — Conjunto de aristas que conectan el grafo." +msgid "pgr_trsp(Many to Many)" +msgstr "pgr_trsp(Muchos a Muchos)" -msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." -msgstr "Agrega el número mínimo de bordes necesarios para conectar el gráfico de entrada. El algoritmo primero identifica todos los componentes conectados en el gráfico, luego agrega bordes para conectar esos componentes en una ruta. Por ejemplo, si un gráfico contiene tres componentes conectados A, B y C, make_connected agregará dos bordes. Las dos aristas agregadas podrían consistir en una que conecta un vértice en A con un vértice en B y otra que conecta un vértice en B con un vértice en C." +msgid "pgr_trsp(Combinations)" +msgstr "pgr_trsp(Combinaciones)" -msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." -msgstr "Dará la lista mínima de los bordes que se necesitan en el grafo para conectarlo." +msgid "Deprecated signatures" +msgstr "Firmas obsoletas" -msgid "The algorithm does not considers geometric topology in the calculations." -msgstr "El algoritmo no considera la topología geométrica en los cálculos." +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgid "pgr_makeConnected(`Edges SQL`_)" -msgstr "pgr_makeConnected(`SQL de aristas`_)" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "Returns set of |result-component-make|" -msgstr "Regresa conjunto de |result-component-make|" +msgid "New prototypes" +msgstr "Nuevos prototipos" -msgid "List of edges that are needed to connect the graph." -msgstr "Lista de aristas que se necesitan para conectar el grafo." +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "`Boost: make connected `__" -msgstr "`Boost: conectar `__" +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" -msgid "``pgr_maxCardinalityMatch``" -msgstr "``pgr_maxCardinalityMatch``" +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgstr "" -msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." -msgstr "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad máxima en un grafo." +msgid "It does no guarantee the shortest path as it might contain restriction paths." +msgstr "" -msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." -msgstr "pgr_maxCardinalityMatch(text) regresa solamente la columna ``edge``." +msgid "The general algorithm is as follows:" +msgstr "" -msgid "Deprecated signature" +msgid "Execute a Dijkstra." msgstr "" -msgid "directed => ``false`` when used." -msgstr "Con directed => `` false`` cuando se usa." +msgid "If the solution passes thru a restriction then." +msgstr "" -msgid "Renamed from ``pgr_maximumCardinalityMatching``" -msgstr "Renombrado de ``pgr_maximumCardinalityMatching``" +msgid "Execute the **TRSP** algorithm with restrictions." +msgstr "" -msgid "A matching or independent edge set in a graph is a set of edges without common vertices." -msgstr "Un conjunto de aristas coincidente o independiente en un grafo es un conjunto de aristas sin vértices comunes." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, [``directed``])" -msgid "A maximum matching is a matching that contains the largest possible number of edges." -msgstr "Una coincidencia máxima es una coincidencia que contiene el mayor número posible de aristas." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destinos**, [``directed``])" -msgid "There may be many maximum matchings." -msgstr "Puede haber muchas coincidencias máximas." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destino**, [``directed``])" -msgid "Calculates one possible maximum cardinality matching in a graph." -msgstr "Calcula una posible coincidencia máxima de cardinalidad en un grafo." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destinos**, [``directed``])" -msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" -msgstr "Tiempo de ejecución: :math:`O( E*V * \\alpha(E,V))`" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, `SQL de combinaciones`_, [``directed``])" -msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." -msgstr ":math:`\\alpha(E,V)` es inverso a `Ackermann function`_." +msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." +msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo no dirigido." -msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" -msgstr "pgr_maxCardinalityMatch(`SQL de aristas`_)" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgstr "" -msgid "Using all edges." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "SQL query, which should return a set of rows with the following columns:" -msgstr "Una consulta SQL, que debe regresar un conjunto de filas con las siguientes columnas:" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgstr "" -msgid "A positive value represents the existence of the edge (``source``, ``target``)." -msgstr "Un valor positivo representa la existencia de la arista (``source``, ``target``)." +msgid "Using a combinations table on an undirected graph." +msgstr "Usando una tabla de combinaciones en un grafo no dirigido." -msgid "A positive value represents the existence of the edge (``target``, ``source``)" -msgstr "Un valor positivo representa la existencia de la arista (``target``, ``source``)" +msgid "`Deprecated documentation `_" +msgstr "`Documentación obsoleta `_" -msgid "Identifier of the edge in the original query." -msgstr "Identificador de la arista en la consulta original." +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" -msgid "`Boost: maximum_matching `__" -msgstr "`Boost: Coincidencia máxima `__" +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgstr "" -msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgid "https://en.wikipedia.org/wiki/Ackermann_function" -msgstr "https://en.wikipedia.org/wiki/Ackermann_function" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "" -msgid "``pgr_maxFlow``" -msgstr "``pgr_maxFlow``" +msgid "The paths represents the sections of the route." +msgstr "Las trayectorias representan los tramos de la ruta." -msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." -msgstr "``pgr_maxFlow`` — Calcula el flujo máximo en un gráfico dirigido desde los orígene(s) a los destino(s) mediante el algoritmo Push Relabel." +msgid "Execute a :doc:`pgr_dijkstraVia`." +msgstr "Ejecutar un :doc:`pgr_dijkstraVia`." -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(Combinaciones)" +msgid "For the set of sub paths of the solution that pass through a restriction then" +msgstr "" -msgid "Calculates the maximum flow from the sources to the targets." -msgstr "Calcula el flujo máximo de las fuentes a los objetivos." +msgid "Execute the **TRSP** algorithm with restrictions for the paths." +msgstr "" -msgid "When the maximum flow is **0** then there is no flow and **0** is returned." -msgstr "Cuando el flujo máximo es **0**, entonces no hay flujo y se devuelve **0**." +msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." +msgstr "" -msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." -msgstr "Use el algoritmo :doc:`pgr_pushRelabel ` ." +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_,**vértices**, [``directed``])" -msgid "Running time: :math:`O( V ^ 3)`" -msgstr "Tiempo de ejecución: :math:`O( V ^ 3)`" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo dirigido." -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destino**)" +msgid "Simulation of how algorithm works." +msgstr "Sumulación del functionamiento del algoritmo." -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destinos**)" +msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" +msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destino**)" +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destinos**)" +msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." +msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlow(`SQL de aristas`_, `SQL de combinaciones`_)" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "" -msgid "RETURNS ``BIGINT``" +msgid "Getting the same result as ``pgr_trspVia``:" msgstr "" -msgid "Maximum flow possible from the source(s) to the target(s)" -msgstr "Flujo máximo posible desde el/los orígen(es) hacia el/los destino(s)" +msgid "Example 8" +msgstr "Ejemplo 8" -msgid "`Boost: push relabel max flow `__" -msgstr "`Boost: Flujo máximo empujar reetiquetar `__" +msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." +msgstr "" -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." +msgstr "" -msgid "``pgr_maxFlowMinCost`` - Experimental" -msgstr "``pgr_maxFlowMinCost`` - Experimental" +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "" -msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" -msgstr "``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo maximo en un grafo" - -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "pgr_maxFlowMinCost(Combinaciones)" - -msgid "|Boost| Boost Graph Inside." -msgstr "|Boost| Boost Graph Adentro." - -msgid "**TODO** check which statement is true:" -msgstr "**Por hacer** comprobar qué declaración es verdadera:" - -msgid "The cost value of all input edges must be nonnegative." -msgstr "El valor de coste de todas las aristas de entrada debe ser no negativo." - -msgid "Process is done when the cost value of all input edges is nonnegative." -msgstr "El proceso se realiza cuando el valor de coste de todas las aristas de entrada no es negativo." - -msgid "Process is done on edges with nonnegative cost." -msgstr "El proceso se realiza en aristas con coste no negativo." - -msgid "Running time: :math:`O(U * (E + V * logV))`" -msgstr "Tiempo de ejecución: :math:`O(U * (E + V * log V))`" - -msgid "where :math:`U` is the value of the max flow." -msgstr "donde :math:`U` es el valor de flujo máximo." - -msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." -msgstr ":math:`U` es el límite superior de la cantidad de iteraciones. En muchos casos de la vida reales, la cantidad de iteraciones es mucho menor que :math:`U`." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." +msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destino**)" +msgid ":doc:`via-category`" +msgstr ":doc:`via-category`" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destinos**)" +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destino**)" +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." +msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destinos**)" +msgid "**Driving side** parameter is positional unnamed." +msgstr "El parámetro **Lado de Manejo** era opcional ahora es obligatorio posicional sin nombre." -msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, `SQL de combinaciones`_)" +msgid "Valid values depend on kind of graph" +msgstr "Valores válidos dependen del tipo de grafo" -msgid "Returns set of |result-flow-mincost|" -msgstr "Regresa el conjunto de |result-flow-mincost|" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" -msgstr "``pgr_maxFlowMinCost_Cost`` - Experimental" +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" -msgstr "``pgr_maxFlowMinCost_Cost`` — Calcula el costo mínimo para el máximo flujo en un grafo" +msgid "is a sequence of paths" +msgstr "" -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)" +msgid "Build the Graph with the new points." +msgstr "" -msgid "**The cost value of all input edges must be nonnegative.**" -msgstr "**El valor de coste de todas las aristas de entrada debe ser no negativo.**" +msgid "The points identifiers will be converted to negative values." +msgstr "" -msgid "When the maximum flow is 0 then there is no flow and **0** is returned." -msgstr "Cuando el flujo máximo es 0 entonces no hay flujo y se devuelve un **0** ." +msgid "The vertices identifiers will remain positive." +msgstr "" -msgid "Uses :doc:`pgr_maxFlowMinCost`." -msgstr "Usa :doc:`pgr_maxFlowMinCost`." +msgid "Execute a :doc:`pgr_withPointsVia`." +msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destino**)" +msgid "For the set of paths of the solution that pass through a restriction then" +msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destinos**)" +msgid "Execute the **TRSP** algorithm with restrictions for the path." +msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destino**)" +msgid "Do not use negative values on identifiers of the inner queries." +msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destinos**)" +#, fuzzy +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, `SQL de combinaciones`_)" +#, fuzzy +msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" +msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``" -msgid "RETURNS FLOAT" +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" -msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" -msgstr "Coste Mínimo Flujo Máximo posible desde el/los origen(es) hasta el/los objetivo(s)" - -msgid "``pgr_pickDeliver`` - Experimental" -msgstr "``pgr_pickDeliver`` - Experimental" - -msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" -msgstr "``pgr_pickDeliver`` - Problema de enrutamiento del vehículo de recogida y entrega" +msgid "When positive it is considered a vertex identifier" +msgstr "Cuando sea positivo se considera como un identificador de vértice" -msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." -msgstr "Problema: Distribuya y optimice los pares de recogida-entrega en una flota de vehículos." +msgid "When negative it is considered a point identifier" +msgstr "Cuando sea negativo se considera como un identificador de punto" -msgid "Optimization problem is NP-hard." -msgstr "El problema de optimización es NP-hard." +#, fuzzy +msgid "[**driving side**]" +msgstr "**Lado de manejo**" -msgid "pickup and Delivery with time windows." -msgstr "recogida y Entrega con ventanas de tiempo." +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" +msgstr "Valor en [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicando si el lado de manejo es:" -msgid "All vehicles are equal." -msgstr "Todos los vehículos son iguales." +msgid "For directed graph:" +msgstr "Para un grafo dirigido:" -msgid "Same Starting location." -msgstr "La misma ubicación de Inicio." +msgid "[``r``, ``R``] for right driving side" +msgstr "[``r``, ``R``] para el lado derecho de conducción" -msgid "Same Ending location which is the same as Starting location." -msgstr "La misma ubicación Final que es la misma que la ubicación de Inicio." +msgid "[``l``, ``L``] for left driving side" +msgstr "[``l``, ``L``] para lado izquierdo de conducción" -msgid "All vehicles travel at the same speed." -msgstr "Todos los vehículos viajan a la misma velocidad." +msgid "For undirected graph:" +msgstr "Para grafo no dirigido:" -msgid "A customer is for doing a pickup or doing a deliver." -msgstr "Un cliente es para hacer una recogida o hacer una entrega." +msgid "[``b``, ``B``] for both driving sides" +msgstr "[``b``, ``B``] para ambos lados de conducción" -msgid "has an open time." -msgstr "tiene un tiempo abierto." +msgid "Default values when parameter is missing:" +msgstr "" -msgid "has a closing time." -msgstr "tiene tiempo de cierre." +#, fuzzy +msgid "[``r``, ``R``] for directed graph" +msgstr "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)" -msgid "has a service time." -msgstr "tiene un tiempo de servicio." +#, fuzzy +msgid "[``l``, ``L``] for undirected graph" +msgstr "Solo para grafos no dirigidos" -msgid "has an (x, y) location." -msgstr "tiene una ubicación (x, y)." +msgid "With points optional parameters" +msgstr "Parámetros opcionales para Con puntos" -msgid "There is a customer where to deliver a pickup." -msgstr "Hay un cliente donde entregar una recogida." +msgid "``details``" +msgstr "``details``" -msgid "travel time between customers is distance / speed" -msgstr "tiempo de viaje entre los clientes es distancia / velocidad" +msgid "For showing points stops." +msgstr "" -msgid "pickup and delivery pair is done with the same vehicle." -msgstr "La recogida y entrega se realizan con el mismo vehículo." +msgid "When ``true`` the results will include the points that are in the path." +msgstr "Cuando ``true`` los resultados incluyen los puntos que están en el camino." -msgid "All trucks depart at time 0." -msgstr "Todos los camiones salen en el momento 0." +msgid "When ``false`` the results will not include the points that are in the path." +msgstr "Cuando ``false`` los resultados no incluyen los puntos que están en el camino." -msgid "the algorithm will raise an exception when" -msgstr "el algoritmo generará una excepción cuando" +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgstr "Cuando las columnas ``start_vid``, ``end_vid`` y``node`` tengan valores negativos, el identificador es para un Punto." -msgid "If there is a pickup-deliver pair than violates time window" -msgstr "Si hay un par de recogida-entrega que viola la ventana de tiempo" +msgid "Use ``pgr_findCloseEdges`` for points on the fly" +msgstr "" -msgid "The speed, max_cycles, ma_capacity have illegal values" -msgstr "La velocidad, max_cycles, max_capacity tienen valores ilegales" +msgid "Using :doc:`pgr_findCloseEdges`:" +msgstr "Usando :doc:`pgr_findCloseEdges`:" -msgid "Six different initial will be optimized - the best solution found will be result" -msgstr "Seoptimizarán seis iniciales diferentes - la mejor solución encontrada será el resultado" +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." +msgstr "" -msgid "Signature" -msgstr "Firma" +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgstr "Punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." -msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" -msgstr "pgr_pickDeliver(`SQL de ordenes`_, `SQL de vehículos`_, `SQL de matriz`_, [**opciones**])" +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgstr "Punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`." -msgid "**options:** ``[factor, max_cycles, initial_sol]``" -msgstr "**opcionales:** ``[factor, max_cycles, initial_sol]``" +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgstr "" -msgid "Returns set of |result-pickdrop|" -msgstr "Regresa el conjunto de |result-pickdrop|" +msgid "Usage variations" +msgstr "Variaciones de uso" -msgid "Solve the following problem" +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" -msgid "Given the vehicles:" -msgstr "Dados los vehículos:" - -msgid "and the orders:" +msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." msgstr "" -msgid "The parameters are:" -msgstr "Los parámetros son:" +msgid "The algorithm performs a :doc:`pgr_withPointsVia`" +msgstr "El algoritmo realiza una :doc:`pgr_withPointsVia`" -msgid "A `SELECT` statement that returns the following columns:" -msgstr "Una instrucción `SELECT` que devuelve las siguientes columnas:" +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgstr "" -msgid "id, demand" -msgstr "id, demand" +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgstr "" -msgid "p_node_id, p_open, p_close, [p_service,]" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" -msgid "d_node_id, d_open, d_close, [d_service,]" +msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "id, capacity" -msgstr "id, capacity" +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgstr "" -msgid "start_node_id, start_open, start_close [, start_service,]" +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "[end_node_id, end_open, end_close, end_service]" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Experimental" -msgstr "``pgr_pickDeliverEuclidean`` - Experimental" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" -msgstr "``pgr_pickDeliverEuclidean`` - Problema de Ruteo del Vehículo de Recogida y Entrega" +msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." +msgstr "" -msgid "Replaces ``pgr_gsoc_vrppdtw``" -msgstr "Reemplaza ``pgr_gsoc_vrppdtw``" +msgid "**Driving side** parameter is positional unnamed and compulsory." +msgstr "El parámetro **driving_side** era opcional ahora es obligatorio sin nombre." -msgid "Pickup and Delivery:" -msgstr "Recogida y Entrega:" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "capacitated" -msgstr "capacitado" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "with time windows." -msgstr "con ventanas de tiempo." +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "have (x, y) start and ending locations." -msgstr "tienen (x, y) ubicaciones de inicio y finalización." +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgid "have a start and ending service times." -msgstr "tener un inicio y un final de los tiempos de servicio." +msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgid "An order is for doing a pickup and a a deliver." -msgstr "Un pedido es para hacer una recogida y una entrega." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Considerar las rutas inválidas en `Restrictions SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto." -msgid "has (x, y) pickup and delivery locations." -msgstr "tiene (x, y) ubicaciones de recogida y entrega." +msgid "Vertices of the graph are:" +msgstr "Los vértices del grafo son:" -msgid "has opening and closing times for the pickup and delivery locations." -msgstr "tiene horarios de apertura y cierre para los lugares de recogida y entrega." +msgid "**positive** when it belongs to the `Edges SQL`_" +msgstr "" -msgid "has a pickup and deliver service times." -msgstr "tiene una recogida y entrega de tiempos de servicio." +msgid "**negative** when it belongs to the `Points SQL`_" +msgstr "**negative** cuando pertence al `SQL de puntos`_" -msgid "Six different optional different initial solutions" -msgstr "Seis diferentes soluciones iniciales opcionales" +msgid "The `agg_cost` in the non included values `(v, v)` is `0`" +msgstr "El `agg_cost` en los valores no incluidos `(v, v)` es `0`" -msgid "the best solution found will be result" -msgstr "la mejor solución encontrada será el resultado" +msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" +msgstr "El `agg_cost` en los valores no incluidos `(u, v)` es :math:`\\infty`" -msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" -msgstr "pgr_pickDeliverEuclidean(`SQL de órdenes`_, `SQL de vehículos`_, [**opciones**])" +#, fuzzy +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`." -msgid "p_x, p_y, p_open, p_close, [p_service,]" -msgstr "" +msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgstr "Tiempo de ejecución: :math:`O(|start\\_vids|\\times(V \\log V + E))`" -msgid "d_x, d_y, d_open, d_close, [d_service]" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" -msgid "start_x, start_y, start_open, start_close [, start_service, ]" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" -msgid "[ end_x, end_y, end_open, end_close, end_service ]" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" -msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" -msgid "There are 25 vehicles in the problem all with the same characteristics." -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" -msgid "The original orders" -msgstr "" +msgid "**options:** ``[directed, details]``" +msgstr "**opcionales:** ``[directed, details]``" -msgid "The data comes in different rows for the pickup and the delivery of the same order." -msgstr "" +# | msgid "" +# | "From point :math:`1` to vertex :math:`3` with details on a **left** " +# | "driving side configuration on a **directed** graph with **details**." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido. (con detalles)" -msgid "The original data needs to be converted to an appropriate table:" -msgstr "" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido" -msgid "The query" -msgstr "" +# | msgid "" +# | "From point :math:`1` to vertex :math:`3` with details on a **left** " +# | "driving side configuration on a **directed** graph with **details**." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido. (sin detalles)" -msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" -msgstr "" +# | msgid "From point :math:`1` to point :math:`3` and vertex :math:`5`." +#, fuzzy +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgstr "Desde el punto :math:`1` y vértice :math:`6` al punto :math:`3` y vértice :math:`1`." -msgid "The best solution found for **lc101** is a travel time: 828.94" -msgstr "" +msgid "Two combinations" +msgstr "Dos combinaciones" -msgid "This implementation's travel time: 854.54" -msgstr "" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con najando del lado derecho (con detalles)" -msgid "``pgr_prim``" -msgstr "``pgr_prim``" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." +msgstr "Usar :doc:`pgr_findCloseEdges` en el `SQL de puntos`_." -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." -msgstr "``pgr_prim`` — Mínimo bosque de expansión de un grafo, utilizando el algoritmo de Prim." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Wncontrar las rutas desde el vértice :math:`1` a las dos ubicaciones más cercanas en el grafo al punto`(2.9, 1.8)`." -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." -msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Prim." +#, fuzzy +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" -msgid "Prim's running time: :math:`O(E * log V)`" -msgstr "Tiempo de ejecución de Prim: :math:`O(E*log V)`" +msgid "Passes in front or visits with right side driving." +msgstr "Pasa enfrente o visita con lado derecho de manejo." -msgid "pgr_prim(`Edges SQL`_)" -msgstr "pgr_prim(`SQL de aristas`_)" +msgid "For point :math:`6` and vertex :math:`11`." +msgstr "Del punto :math:`6` al vértice :math:`11`." -msgid "Minimum spanning forest of a subgraph" -msgstr "Bosque de Expansión Mínimo de un subgrafo" +msgid "Passes in front or visits with left side driving." +msgstr "Pasa enfrente o visita con lado izquierdo de manejo." -msgid "`Boost: Prim's algorithm documentation `__" -msgstr "`Boost: algoritmo de Prim `__" +msgid "``pgr_turnRestrictedPath`` - Experimental" +msgstr "``pgr_turnRestrictedPath`` - Experimental" -msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_primBFS`` — Algoritmo de Prim para el árbol de expansión mínimo con orden de primera búsqueda de profundidad." +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgstr "``pgr_turnRestrictedPath`` Usando el algoritmo vértice -vértice de Yen para ruteo con restricciones" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." -msgstr "Visita y extrae la información de los nodos en el ordenamiento de la primera búsqueda de amplitud del árbol de expansión mínima creado mediante el algoritmo de Prim." +msgid "Output columns standardized to |nksp-result|" +msgstr "Columnas de salida estandarizados a |nksp-result|" -msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_primBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" +msgstr "" -msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_primBFS(`SQL de aristas`_, **Raíces**, [``max_depth``])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_turnRestrictedPath(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, **K**, [**opciones**])" -msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." -msgstr "``pgr_primDD`` — Nodos de captación mediante el algoritmo de Prim." +msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +msgstr "**opcionales:** ``[directed, heap_paths, stop_on_first, strict]``" -msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." -msgstr "Mediante el algoritmo de Prim, extrae los nodos que tienen costes agregados inferiores o iguales a una distancia desde un vértice raíz (o vértices) dentro del árbol de expansión mínimo calculado." +msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" +msgstr "Del vértice :math:`3` al vértice :math:`8` en un grafo dirigido" -msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "pgr_primDD(`SQL de aristas`_, **raíz**, **distancia**)" +msgid "Special optional parameters" +msgstr "" -msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "pgr_primDD(`SQL de aristas`_, **raices**, **distancia**)" +msgid "``stop_on_first``" +msgstr "``stop_on_first``" -msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "''pgr_primDFS'' — Algoritmo Prim para el Árbol de Expansión Mínima con orden de la Primera Búsqueda de Profundidad." +msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgstr "" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." -msgstr "Visita y extrae la información de los nodos en el orden de la Primera Búsqueda de Profundidad del Árbol de Expansión Mínima creado utilizando el algoritmo de Prim." +msgid "When ``false`` returns at most K paths" +msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_primDFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" +msgid "When ``true`` returns only paths that do not violate restrictions" +msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_primDFS(`SQL de aristas`_, **Raíces**, [``max_depth``])" +msgid "When ``false`` returns the paths found" +msgstr "" -msgid "``pgr_pushRelabel``" -msgstr "``pgr_pushRelabel``" +msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." +msgstr "" -msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." -msgstr "``pgr_pushRelabel`` — Calcula el flujo en los bordes del grafo que maximiza el flujo de los orígenes a los destinos mediante el Algoritmo Push Relabel." +msgid "No results because the only path available follows a restriction." +msgstr "" -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(Combinaciones)" +msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" +msgstr "Del vértice :math:`3` al vértice :math:`8` en un grafo no dirigido" -msgid "Renamed from ``pgr_maxFlowPushRelabel``" -msgstr "Renombrado de ``pgr_maxFlowPushRelabel``" +msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" +msgstr "Del vértice :math:`3` al vértice :math:`8` con más alternativas" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destino**)" +msgid "``pgr_version``" +msgstr "``pgr_version``" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destinos**)" +msgid "``pgr_version`` — Query for pgRouting version information." +msgstr "``pgr_version`` — consulta de información sobre la versión de pgRouting." -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destino**)" +msgid "Breaking change on result columns" +msgstr "Cambio estructural en las columnas de resultados" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destinos**)" +msgid "Support for old signature ends" +msgstr "Soporte termina para antigua firma" -msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_pushRelabel(`SQL de aristas`_, `SQL de combinaciones`_)" +msgid "Returns pgRouting version information." +msgstr "Devuelve la información de la versión de pgRouting." -msgid "``pgr_separateCrossing``" -msgstr "``pgr_separateCrossing``" +msgid "pgr_version()" +msgstr "pgr_version()" -msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." -msgstr "" +msgid "RETURNS ``TEXT``" +msgstr "DEVUELVE ``TEXT``" -msgid "Proposed function." -msgstr "Función propuesta." +msgid "pgRouting Version for this documentation" +msgstr "Versión de pgRouting para esta documentación" -#, fuzzy -msgid "This is an auxiliary function for separating crossing edges." -msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo." +msgid "``pgr_vrpOneDepot`` - Experimental" +msgstr "``pgr_vrpOneDepot`` - Experimental" -#, fuzzy -msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" +msgid "**No documentation available**" +msgstr "**No hay documentación disponible**" -#, fuzzy -msgid "RETURNS |result-separate|" -msgstr "REGRESA |result-version|" +msgid "**TBD**" +msgstr "**TBD**" -msgid "Get the segments of the crossing geometries" -msgstr "Obtener los segmentos de las geometrías que se cruzan" +msgid "TBD" +msgstr "Por Definirse" -msgid "``tolerance``" -msgstr "``tolerance``" +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgstr "``pgr_withPoints`` - Devuelve la ruta más corta de un grafo con vértices temporales adicionales." -#, fuzzy -msgid "0.01" -msgstr "0.010" +msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "Used in ST_Snap before ST_Split" -msgstr "" +msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -#, fuzzy -msgid "Get the code for further refinement." -msgstr "En cualquier lado del segmento." +msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." -msgstr "" +msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -msgid "``pgr_separateTouching``" -msgstr "``pgr_separateTouching``" +msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,text,boolean,character,boolean)" -msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" -msgstr "" +msgid "pgr_withPoints(Combinations)" +msgstr "pgr_withPoints(Combinaciones)" -msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." -msgstr "" +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto." #, fuzzy -msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" -msgid "``pgr_sequentialVertexColoring`` - Proposed" -msgstr "``pgr_sequentialVertexColoring`` - Propuesto" +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" -msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." -msgstr "``pgr_sequentialVertexColoring`` — Devuelve el color de vértice de un grafo no dirigido, utilizando un enfoque codicioso." +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" -msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." -msgstr "El algoritmo de Coloración de Vértices Secuenciales es un algoritmo de coloración de grafos en el que se asignan identificadores de color a los vértices de un grafo de forma secuencial, de modo que ninguna arista conecte dos vértices de colores idénticos." +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" -msgid "The implementation is applicable only for **undirected** graphs." -msgstr "La implementación solo es aplicable a los grafos **no dirigidos**." +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" -msgid "Provides the color to be assigned to all the vertices present in the graph." -msgstr "Proporciona el color que se asignará a todos los vértices presentes en el grafo." +#, fuzzy +msgid "**options:** ``[directed, details])``" +msgstr "**opcionales:** ``[directed, details]``" -msgid "Color identifiers values are in the Range :math:`[1, |V|]`" -msgstr "Los valores de los identificadores de color se encuentran en el rango :math:`[1, |V|]`" +# | msgid "" +# | "From point :math:`1` to vertex :math:`3` with details on a **left** " +# | "driving side configuration on a **directed** graph with **details**." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgstr "Desde el punto :math:`1` al vértice :math:`10` manjando del lado derecho en un grafo dirigido, (sin detalles)" -msgid "The algorithm tries to assign the least possible color to every vertex." -msgstr "El algoritmo intenta asignar el menor color posible a cada vértice." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgstr "Identificador del vértice inicial de la ruta. Valor negativo es para identificador de punto." -msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." -msgstr "El color de grafos eficientes es un problema NP-Hard, y por lo tanto, este algoritmo no siempre produce un coloración óptima. Sigue una estrategia expansiva recorriendo en iteración todos los vértices secuencialmente y asignando el color más pequeño posible que no sea utilizado por sus vecinos, a cada vértice." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgstr "Arreglo de identificadores de vértices iniciales. Valores negativos son para identificadores de puntos." -msgid "The returned rows are ordered in ascending order of the vertex value." -msgstr "Las filas devueltas se ordenan en orden ascendente del valor de vértice." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgstr "Identificador del vértice final de la ruta. Valor negativo es para identificador de punto." -msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" -msgstr "Tiempo de Ejecución de Coloración de Vértices Secuenciales: :math:`O(|V|*(d + k))`" +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +msgstr "Arreglo de identificadores de vértices finales. Valores negativos son para identificadores de puntos." -msgid ":math:`d` is the maximum degree of the vertices in the graph," -msgstr ":math:`d` es el grado máximo de los vértices en el grafo," +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" -msgid ":math:`k` is the number of colors used." -msgstr ":math:`k` es el número de colores utilizados." +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." +msgstr "``pgr_withPointsCost`` - Calcula el camino más corto y devuelve sólo el coste agregado del camino más corto encontrado, para la combinación de puntos dada." -msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" -msgstr "pgr_sequentialVertexColoring(`SQL de aristas`_)" +msgid "**Driving side** parameter is unnamed and compulsory." +msgstr "El parámetro **Driving side** es obligatorio sin nombre." -msgid "`Boost: Sequential Vertex Coloring `__" -msgstr "`Boost: Coloración Secuencial de Vértices `__" +msgid "Output columns standardized to |matrix-result|" +msgstr "Columnas de resultados estandarizados a |matrix-result|" -#, fuzzy -msgid "``pgr_sloanOrdering`` - Experimental" -msgstr "``pgr_edgeColoring`` - Experimental" +msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +msgstr "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -#, fuzzy -msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" -msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" +msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgstr "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." -msgstr "" +msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgstr "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -msgid "Finds a pseudoperipheral vertex pair to determine good starting points" -msgstr "" +msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgstr "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." -msgstr "" +msgid "pgr_withpointscost(text,text,text,boolean,character)" +msgstr "pgr_withpointscost(text,text,text,boolean,character)" -msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." -msgstr "" +msgid "pgr_withPointsCost(Combinations)" +msgstr "pgr_withPointsCost(Combinaciones)" -msgid "Typically produces better orderings than simple breadth-first approaches." -msgstr "" +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." +msgstr "Modificar el grafo para incluir los puntos definidos por points_sql. Utilizando el algoritmo de Dijkstra, devolver sólo el coste agregado del camino más corto encontrado." -msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." -msgstr "" +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgstr "Devuelve la suma de los costes de la ruta más corta para la combinación de pares de vértices en el grafo modificado." #, fuzzy -msgid "pgr_sloanOrdering(`Edges SQL`_)" -msgstr "pgr_edgeColoring(`SQL de aristas`_)" +msgid "The returned values are in the form of a set of |matrix-result|." +msgstr "Los valores devueltos tienen la forma de un conjunto de `(start_vid, end_vid, agg_cost)`." -msgid ":Example : Sloan ordering without specifying start vertex" -msgstr "" +msgid "**positive** when it belongs to the edges_sql" +msgstr "**positivo** cuando pertenece a edges_sql" -#, fuzzy -msgid "New sloan ordering order." -msgstr "Nuevo ordenamiento es en orden inverso." +msgid "**negative** when it belongs to the points_sql" +msgstr "**negativo** cuando pertenece a points_sql" -msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." -msgstr "" +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgstr "Si los valores devueltos se almacenan en una tabla, el índice único sería el par: `(start_vid, end_vid)`." + +msgid "For **undirected** graphs, the results are **symmetric**." +msgstr "Para los grafos **no dirigidos**, los resultados son **simétricos**." #, fuzzy -msgid "`Boost: Sloan Ordering `__" -msgstr "`Boost: Coloración de Segmentos `__" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" -msgid "``pgr_stoerWagner`` - Experimental" -msgstr "``pgr_stoerWagner`` - Experimental" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" -msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." -msgstr "``pgr_stoerWagner`` — El corte mínimo del grafo usando el algoritmo Stoer-Wagner." +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" -msgid "Version 3.0" -msgstr "Versión 3.0" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" -msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." -msgstr "En teoría de grafos, el algoritmo Stoer-Wagner es un algoritmo recursivo para resolver el problema de corte mínimo en gráficos ponderados no dirigidos con pesos no negativos. La idea esencial de este algoritmo es encoger el grafo mediante la fusión de los vértices más intensivos, hasta que el grafo sólo contiene dos conjuntos de vértices combinados. En cada fase, el algoritmo encuentra el corte s-t mínimo para dos vértices s y t elegidos a su voluntad. A continuación, el algoritmo encoge la arista entre s y t para buscar cortes no s-t. El corte mínimo encontrado en todas las fases será el corte ponderado mínimo del grafo." +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" -msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." -msgstr "Un corte es una partición de los vértices de un grafo en dos subconjuntos separados. Un corte mínimo es un corte para el que el tamaño o peso del corte no es mayor que el tamaño de cualquier otro corte. Para un grafo no ponderado, el corte mínimo sería simplemente el corte con menos aristas. Para un grafo ponderado, la suma del peso de todas las aristas en el corte determina si se trata de un corte mínimo." +#, fuzzy +msgid "**options:** ``[directed]``" +msgstr "**opcionales:** ``[directed, cap]``" -msgid "Sum of the weights of all edges between the two sets is mincut." -msgstr "La suma de los pesos de todas las aristas entre los dos conjuntos es mincut." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgstr "No hay identificador de **details**, a diferencia de los otros miembros de la familia de funciones withPoints." -msgid "A **mincut** is a cut having the least weight." -msgstr "Un **mincut** es un corte que tiene el menor peso." +# | msgid "" +# | "From point :math:`1` to vertex :math:`3` with details on a **left** " +# | "driving side configuration on a **directed** graph with **details**." +#, fuzzy +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido con detalles." -msgid "Values are returned when graph is connected." -msgstr "Los valores se devuelven cuando se conecta el grafo." +# | msgid "" +# | "From point :math:`1` to vertex :math:`3` with details on a **left** " +# | "driving side configuration on a **directed** graph with **details**." +#, fuzzy +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido, con detalles." -msgid "When there is no edge in graph then EMPTY SET is return." -msgstr "Cuando no hay arista en el grafo se devuelve EMPTY SET." +#, fuzzy +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con lado de manejo **derecho**." -msgid "When the graph is unconnected then EMPTY SET is return." -msgstr "Cuando el gráfico está desconectado, se devuelve un conjunto vacío o EMPTY SET." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Encontrar el costo de las rutas desde el vértice :math:`1` a las dos ubicaciones mpas cercanas en el grafo desde el punto `(2.9, 1.8)`." -msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." -msgstr "A veces un grafo tiene varios cortes mínimos, pero todos tienen el mismo peso. Esta función determina exactamente uno de los cortes mínimos, así como su peso." +msgid "Being close to the graph does not mean have a shorter route." +msgstr "Estar cercano al grafo no significa tener la ruta más corta." -msgid "Running time: :math:`O(V*E + V^2*log V)`." -msgstr "Tiempo de ejecución: :math:`O(V*E + V^2*log V)`." +msgid "Right side driving topology" +msgstr "Topología de manejo del lado derecho" -msgid "pgr_stoerWagner(`Edges SQL`_)" -msgstr "pgr_stoerWagner(`SQL de aristas`_)" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}`y vértices :math:`\\{10, 11\\}`" -msgid "Returns set of |result-mincut|" -msgstr "Regresa el conjunto de |result-mincut|" +msgid "Left side driving topology" +msgstr "Topología de manejo del lado izquierdo" -msgid "min cut of the main subgraph" -msgstr "corte mínimo de el subgrafo principal" +msgid "Does not matter driving side driving topology" +msgstr "No importa el lado de manejo" -msgid "Returns set of ``(seq, edge, cost, mincut)``" -msgstr "Devuelve conjunto de ``(seq, edge, cost, mincut)``" +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgstr "``pgr_withPointsCostMatrix`` - Calcula una matriz de costos usando :doc:`pgr_withPoints`." -msgid "Edges which divides the set of vertices into two." -msgstr "Aristas que dividen el conjunto de vértices en dos." +msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgid "Cost to traverse of edge." -msgstr "Costo para atravesar la arista." +#, fuzzy +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, [**opciones**])" -msgid "**mincut**" -msgstr "**mincut**" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgstr "Matriz de costos para puntos :math:`\\{1, 6\\}` y vértices :math:`\\{10, 11\\}` en un grafo **no dirigido**" -msgid "Min-cut weight of a undirected graph." -msgstr "Peso de corte mínimo de un grafo no dirigido." +msgid "Returning a **symmetrical** cost matrix" +msgstr "Devolver una matriz de costes **simétrica**" -msgid "Additional Example:" -msgstr "Ejemplo Adicional:" - -msgid "min cut of an edge" -msgstr "corte mínimo de una arista" - -msgid "Using :doc:`pgr_connectedComponents`" -msgstr "Usando :doc:`pgr_connectedComponents`" +msgid "Using the default ``side`` value on the **points_sql** query" +msgstr "Uso del valor predeterminado ``side`` en la consulta **SQL de puntos**" -msgid "`Boost: Stoer Wagner min cut `__" -msgstr "`Boost: Corte mínimo Stoer Wagner `__" +#, fuzzy +msgid "Using the default ``driving side`` value" +msgstr "Usando el valor predeterminado ``driving_side``" -msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" -msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Encontrar la matriz de costos de las rutas desde el vértice :math:`1` y las dos ubicaciones más cercanas en el grafo al punto `(2.9, 1.8)`." -msgid "``pgr_strongComponents``" -msgstr "``pgr_strongComponents``" +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." +msgstr "``pgr_withPointsDD`` - Devuelve la **distancia** de conducción desde un punto de partida." -msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." -msgstr "``pgr_strongComponents`` — Componentes fuertemente conectados de un grafo dirigido utilizando el algoritmo de Tarjan basado en DFS." +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." -msgstr "Un componente fuertemente conectado de un gráfico dirigido es un conjunto de vértices que son todos accesibles entre sí." +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Works for **directed** graphs." -msgstr "Funciona paragrafos **dirigidos**." +#, fuzzy +msgid "Output columns standardized to |result-spantree|" +msgstr "Las nuevas columnas de salida son |result-spantree|" -msgid "Components are described by vertices identifiers." -msgstr "Los componentes se describen mediante identificadores de vértices." +msgid "When ``details`` is ``false``:" +msgstr "Cuando ``details`` es ``false``:" -msgid "pgr_strongComponents(`Edges SQL`_)" -msgstr "pgr_strongComponents(`SQL de aristas`_)" +msgid "Points reached within the distance are not included." +msgstr "" -msgid "The strong components of the graph" -msgstr "Los componentes fuertes del grafo" +msgid "Deprecated signatures:" +msgstr "Firmas obsoletas:" -msgid "`Boost: Strong components `__" -msgstr "`Boost: Componentes fuertemente conectados `__" +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgstr "Modifica el grafo para incluir puntos y utilizando el algoritmo Dijkstra, extrae todos los nodos y puntos que tienen costes menores o iguales que el valor de ``**distance**`` desde el punto inicial. Las aristas extraídas conformarán el árbol de expansión correspondiente." -msgid "wikipedia: `Strongly connected component `__" -msgstr "Wikipedia: `Componentes fuertemente conectados `__" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones A**])" -msgid "``pgr_topologicalSort`` - Experimental" -msgstr "``pgr_topologicalSort`` - Experimental" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones B**])" -msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." -msgstr "``pgr_topologicalSort`` — Devuelve el orden lineal de los vértices para los grafos acíclicos dirigidos ponderados (DAG)." +msgid "**options A:** ``[directed, details]``" +msgstr "**opciones A:** ``[directed, details]``" -msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." -msgstr "El algoritmo de ordenación topológica crea un orden lineal de los vértices de tal manera que si la arista :math:`(u,v)` aparece en el grafo, entonces :math:`v` viene antes de :math:`u` en el orden." +msgid "**options B:** ``[directed, details, equicost]``" +msgstr "**opciones B:** ``[directed, details, equicost]``" -msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." -msgstr "El proceso solo es válido para grafos acíclicos dirigidos. de lo contrario lanzará advertencias." +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones**])" -msgid "For optimization purposes, if there are more than one answer, the function" -msgstr "Para fines de optimización, si hay más de una respuesta, la función" +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgstr "Topología de manejo por el lado derecho desde el punto :math:`1` con una distancia :math:`3.3`, detallada." -msgid "will return one of them." -msgstr "" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones**])" -msgid "The returned values are ordered in topological order:" -msgstr "Los valores devueltos se ordenan en orden topológico:" +msgid "**options:** ``[directed, details, equicost]``" +msgstr "**opcionales:** ``[directed, details, equicost]``" -msgid "pgr_topologicalSort(`Edges SQL`_)" -msgstr "pgr_topologicalSort(`SQL de aristas`_)" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgstr "Desde el punto :math:`1` y el vértice :math:`16` dentro de una distancia de :math:`3.3` con ``equicost`` en un grafo dirigido" -msgid "Topologically sorting the graph" -msgstr "" +msgid "Negative values represent a point" +msgstr "Valores negativos representan un punto" -msgid "Sequential value starting from :math:`1`" -msgstr "Valor secuencial a partir de :math:`1`" +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Encontrar la distancia de manejo de las dos ubicaciones más cercanas al grafo del punto `(2.8, 1.8)`." -msgid "Linear topological ordering of the vertices" -msgstr "" +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgstr "El punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." -msgid "Additional examples" -msgstr "" +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgstr "El punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`." -msgid "Topologically sorting the one way segments" -msgstr "" +msgid "Driving side does not matter" +msgstr "Lado de manejo no importa" -msgid "Graph is not a DAG" -msgstr "" +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgstr "Desde el punto :math:`1` dentro de una distancia de :math:`3.3`, sin importar el lado de manejo, detallada." -msgid "`Boost: topological sort `__" -msgstr "`Boost: Ordenamiento topológico `__" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" -msgid "``pgr_transitiveClosure`` - Experimental" -msgstr "``pgr_transitiveClosure`` - Experimental" +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_withPointsKSP`` - Encuentra las rutas más cortas de K usando el algoritmo de Yen." -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." -msgstr "" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "Transforms the input directed graph into the transitive closure of the graph." -msgstr "Transforma el grafo de entrada en grafo de cierre transitivo." +msgid "pgr_withPointsKSP(One to Many)" +msgstr "pgr_withPointsKSP(Uno a Muchos)" -msgid "Process is valid for directed graphs." -msgstr "" +msgid "pgr_withPointsKSP(Many to One)" +msgstr "pgr_withPointsKSP(Muchos a Uno)" -msgid "The transitive closure of an undirected graph produces a cluster graph" -msgstr "" +msgid "pgr_withPointsKSP(Many to Many)" +msgstr "pgr_withPointsKSP(Muchos a Muchos)" -msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" -msgstr "" +msgid "pgr_withPointsKSP(Combinations)" +msgstr "pgr_withPointsKSP(Combinaciones)" -msgid "The returned values are not ordered" -msgstr "Los valores devueltos no se ordenan" +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgstr "Modifica el grafo para incluir los puntos definidos en el `SQL de puntos`_ y utilizando el algoritmo Yen, encuentra las :math:`K` rutas más cortas." #, fuzzy -msgid "The returned graph is compressed" -msgstr "Cuando el grafo es conectado" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" -msgid "Running time: :math:`O(|V||E|)`" -msgstr "Tiempo de ejecución: :math:`O(|V||E|)`" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" -msgid "The pgr_transitiveClosure function has the following signature:" -msgstr "La función pgr_transitiveClosure tiene la siguiente firma:" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" -msgid "pgr_transitiveClosure(`Edges SQL`_)" -msgstr "pgr_transitiveClosure(`SQL de aristas`_)" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" -msgid "Returns set of |result-closure|" -msgstr "Regresa el conjunto de |result-closure|" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" -msgid "Rechability of a subgraph" -msgstr "" +msgid "**options:** ``[directed, heap_paths, details]``" +msgstr "**opciones:** ``[directed, heap_paths, details]``" -msgid "Identifier of the source of the edges" -msgstr "Identificador del nodo inicial de las aristas" +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`2` en un grafo dirigido con lado de manejo **izquierdo**." -msgid "``target_array``" -msgstr "``target_array``" +msgid "For a directed graph." +msgstr "Para un grafo dirigido." -msgid "Identifiers of the targets of the edges" -msgstr "Identificador del nodo final de las aristas" +msgid "No details are given about distance of other points of the query." +msgstr "No se proporcionan detalles sobre la distancia de otros puntos de la consulta." -msgid "Identifiers of the vertices that are reachable from vertex v." -msgstr "Identificadores de los vértices que son alcanzables desde el vértice v." +msgid "No heap paths are returned." +msgstr "No se devuelven rutas pre-calculadas." -msgid "`Boost: transitive closure `__" -msgstr "`Boost: Cierre transitivo `__" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" -msgstr "https://en.wikipedia.org/wiki/Transitive_closure" +# | msgid "" +# | "From point :math:`1` to vertex :math:`3` with details on a **left** " +# | "driving side configuration on a **directed** graph with **details**." +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgstr "Obtener una ruta desde el punto :math:`1` y del vértice :math:`6` al punto :math:`3` en un grafo **dirigido**, con lado de manejo a la **derecha** y con ``details`` puesto en ``true``" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +# | msgid "" +# | "From point :math:`1` to vertex :math:`3` with details on a **left** " +# | "driving side configuration on a **directed** graph with **details**." +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgstr "Obtener una ruta desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y al vértice :math:`1` en un grafo **dirigido** con lado de manejo **izquierda**, con ``heap_paths`` puesto en ``true``" -msgid "``pgr_trsp`` - routing vertices with restrictions." -msgstr "``pgr_trsp`` - Ruteo con restricciones." +msgid "Using a combinations table on an **directed** graph" +msgstr "Usando una tabla de combinaciones en un grafo **dirigido**" -msgid "pgr_trsp(One to One)" -msgstr "pgr_trsp(Uno a Uno)" +msgid "Number of required paths" +msgstr "Cantidad de rutas requeridas" -msgid "pgr_trsp(One to Many)" -msgstr "pgr_trsp(Uno a Muchos)" +msgid "withPointsKSP optional parameters" +msgstr "Parámetros opcionales para withPointsKSP" -msgid "pgr_trsp(Many to One)" -msgstr "pgr_trsp(Muchos a Uno)" +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgstr "Obtener :math:`2` caminos usando el lado izquierdo de manejo, desde el vértice :math:`1` a la ubicación mpas cercana en el grafo al punto `(2.9, 1.8)`." -msgid "pgr_trsp(Many to Many)" -msgstr "pgr_trsp(Muchos a Muchos)" +msgid "Left driving side" +msgstr "Lado de manejo izquierdo" -msgid "pgr_trsp(Combinations)" -msgstr "pgr_trsp(Combinaciones)" +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgstr "Obtener :math:`2` rutas, usando topología de manejo por la izquierda, desde el punto :math:`1` al punto :math:`3`, detallado." -msgid "Deprecated signatures" -msgstr "Firmas obsoletas" +msgid "Right driving side" +msgstr "Lado de manejo derecho" -msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgstr "Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas." -msgid "New prototypes" -msgstr "Nuevos prototipos" +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" -msgid "pgr_trspViaVertices" -msgstr "pgr_trspViaVertices" +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgstr "``pgr_withPointsVia`` - Ruta que recorre una lista de vértices y/o puntos." -msgid "pgr_trspViaEdges" -msgstr "pgr_trspViaEdges" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" -msgid "It does no guarantee the shortest path as it might contain restriction paths." -msgstr "" +#, fuzzy +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgstr "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, [**opciones**])" -msgid "The general algorithm is as follows:" -msgstr "" +#, fuzzy +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido." -msgid "Execute a Dijkstra." +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "If the solution passes thru a restriction then." +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions." -msgstr "" +msgid "Prim - Family of functions" +msgstr "Prim - Familia de funciones" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, [``directed``])" +msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." +msgstr "El algoritmo prim fue desarrollado en 1930 por el matemático checo Vojtěch Jarník. Es un algoritmo ambicioso que encuentra un árbol de expansión mínimo para un grafo ponderado no dirigido. Esto significa que encuentra un subconjunto de los bordes que forma un árbol que incluye cada vértice, donde se minimiza el peso total de todos los bordes del árbol. El algoritmo funciona creando este árbol un vértice a la vez, desde un vértice inicial arbitrario, paso a paso agregando la conexión más barata posible desde el árbol a otro vértice." -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destinos**, [``directed``])" +msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." +msgstr "Estos algoritmos encuentran el bosque de expansión mínimo en un grafo posiblemente desconectado; en cambio, la forma más básica del algoritmo de Prim sólo encuentra árboles de expansión mínimos en los grafos conectados. Sin embargo, al ejecutar el algoritmo de Prim por separado para cada componente conectado del grafo, se denomina bosque de expansión mínimo." -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destino**, [``directed``])" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgstr "De boost Graph: \"El algoritmo tal como se aplica en el Boost.Graph no produce resultados correctos en grafos con segmentos paralelos.\"" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destinos**, [``directed``])" +msgid "Boost: `Prim's algorithm `__" +msgstr "Boost: `Algoritmo de Prim `__" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, `SQL de combinaciones`_, [``directed``])" +msgid "Wikipedia: `Prim's algorithm `__" +msgstr "Wikipedia: `Algoritmo de Prim `__" -msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." -msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo no dirigido." +msgid "Proposed Functions" +msgstr "Funciones propuestas" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." -msgstr "" +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr ":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de líneas." -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "Reference" +msgstr "Referencia" + +msgid "Release Notes" +msgstr "Notas de versión" + +msgid "To see the full list of changes check the list of `Git commits `_ on Github." +msgstr "Para ver la lista completa de cambios, consulte la lista de `Git commits `_ en Github." + +msgid "Mayors" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgid "pgRouting 4" +msgstr "pgRouting 4" + +msgid "Minors 4.x" msgstr "" -msgid "Using a combinations table on an undirected graph." -msgstr "Usando una tabla de combinaciones en un grafo no dirigido." +#, fuzzy +msgid "pgRouting 4.1" +msgstr "pgRouting 4.0" -msgid "`Deprecated documentation `_" -msgstr "`Documentación obsoleta `_" +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" +#, fuzzy +msgid "pgRouting 4.0.1 Release Notes" +msgstr "Notas de la versión 3.0.1 de pgRouting" -msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." -msgstr "" +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 `__" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" +msgid "Bug Fixes" +msgstr "Corrección de errores" -msgid "The paths represents the sections of the route." -msgstr "Las trayectorias representan los tramos de la ruta." +#, fuzzy +msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" +msgstr "`#2905 `__: pgr_withPointsCostMatrix" -msgid "Execute a :doc:`pgr_dijkstraVia`." -msgstr "Ejecutar un :doc:`pgr_dijkstraVia`." +#, fuzzy +msgid "`#3034 `__: metrics driver should not be using new" +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid "For the set of sub paths of the solution that pass through a restriction then" -msgstr "" +#, fuzzy +msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" +msgstr "`#2786 `__: pgr_contraction" -msgid "Execute the **TRSP** algorithm with restrictions for the paths." -msgstr "" +#, fuzzy +msgid "`#3040 `__: Check and fix cppcoreguidelines-virtual-class-destructor" +msgstr "`#1002 `__: Problemas de contracción solucionados:" -msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." -msgstr "" +#, fuzzy +msgid "`#3039 `__: Check and fix cppcoreguidelines-special-member-functions" +msgstr "`#2605 `__ Estandarización de resultados de las funciones de árbol de expansión" -msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_,**vértices**, [``directed``])" +#, fuzzy +msgid "`#3038 `__: Check and fix cppcoreguidelines-prefer-member-initializer" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." -msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo dirigido." +#, fuzzy +msgid "`#3037 `__: Check and fix cppcoreguidelines-init-variables" +msgstr "`#2909 `__: pgr_edgeDisjointPaths" -msgid "Simulation of how algorithm works." -msgstr "Sumulación del functionamiento del algoritmo." +#, fuzzy +msgid "`#3035 `__: Pass by reference on existing drivers" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" -msgstr "" +#, fuzzy +msgid "Administration" +msgstr "Limitaciones" -msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +#, fuzzy +msgid "`#3031 `__: pgtap license to Creative commons and License texts standardization" +msgstr "`#2954 `__: pgr_kingOrdering" + +#, fuzzy +msgid "pgRouting 4.0.0 Release Notes" +msgstr "Notas de la Versión pgRouting 3.1.0" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 `__" + +msgid "Build" +msgstr "Construir" + +msgid "C++ standard is std17" msgstr "" -msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" -msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "The code is not yet modified to use std17:" msgstr "" -msgid "Getting the same result as ``pgr_trspVia``:" +msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." msgstr "" -msgid "Example 8" -msgstr "Ejemplo 8" +msgid "The user's documentation is built by default." +msgstr "La documentación del usuario se construye por defecto." -msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." -msgstr "" +msgid "The doxygen documentation is built by default." +msgstr "La documentación doxygen se construye por defecto." -msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." -msgstr "" +msgid "For developers:" +msgstr "Para desarrolladores:" -msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." msgstr "" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." +msgid "Tidy checks are done on CI." msgstr "" -msgid ":doc:`via-category`" -msgstr ":doc:`via-category`" +msgid "Documentation build" +msgstr "Construcción de la documentación" -msgid "``pgr_trspVia_withPoints``" -msgstr "``pgr_trspVia_withPoints``" +msgid "The doxygen documentation is built by default" +msgstr "La documentación doxygen se construye por defecto" -msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." -msgstr "" +msgid "The HTML documentation is built by default" +msgstr "La documentación HTML se crea por defecto" -msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" +msgstr "Los idiomas traducidos (en, es, sv, zh_Hans) para documentación HTML se construyen por defecto" -msgid "is a sequence of paths" +msgid "`WITH-DOC` is not used anymore" msgstr "" -msgid "Build the Graph with the new points." +msgid "User Documentation is not built when" +msgstr "La documentación de usuario no se crea cuando" + +msgid "Sphinx is not found" msgstr "" -msgid "The points identifiers will be converted to negative values." +msgid "When all Sphinx formats are OFF" msgstr "" -msgid "The vertices identifiers will remain positive." +msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" msgstr "" -msgid "Execute a :doc:`pgr_withPointsVia`." +msgid "When all languages are OFF" msgstr "" -msgid "For the set of paths of the solution that pass through a restriction then" +msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions for the path." +msgid "Documentation output location: ``build/doc/_build/``" msgstr "" -msgid "Do not use negative values on identifiers of the inner queries." +msgid "For example: for HTML output is on `build/doc/_build/html` directory" msgstr "" -#, fuzzy -msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" -msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" +msgid "Developers' Documentation is not built when" +msgstr "La documentación de los desarrolladores no se construye cuando" -#, fuzzy -msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``" +msgid "Doxygen is not found" +msgstr "" -msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." +msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" -msgid "When positive it is considered a vertex identifier" -msgstr "Cuando sea positivo se considera como un identificador de vértice" +msgid "Summary of changes by function" +msgstr "" -msgid "When negative it is considered a point identifier" -msgstr "Cuando sea negativo se considera como un identificador de punto" +msgid "pgr_aStar" +msgstr "pgr_aStar" -#, fuzzy -msgid "[**driving side**]" -msgstr "**Lado de manejo**" +msgid "pgr_aStarCost" +msgstr "pgr_aStarCost" -msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" -msgstr "Valor en [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicando si el lado de manejo es:" +msgid "pgr_bandwidth" +msgstr "pgr_bandwidth" -msgid "For directed graph:" -msgstr "Para un grafo dirigido:" +msgid "pgr_bdAstar" +msgstr "pgr_bdAstar" -msgid "[``r``, ``R``] for right driving side" -msgstr "[``r``, ``R``] para el lado derecho de conducción" +msgid "pgr_bdAstarCost" +msgstr "pgr_bdAstarCost" -msgid "[``l``, ``L``] for left driving side" -msgstr "[``l``, ``L``] para lado izquierdo de conducción" +msgid "pgr_bdDijkstra" +msgstr "pgr_bdDijkstra" -msgid "For undirected graph:" -msgstr "Para grafo no dirigido:" +msgid "pgr_bdDijkstraCost" +msgstr "pgr_bdDijkstraCost" -msgid "[``b``, ``B``] for both driving sides" -msgstr "[``b``, ``B``] para ambos lados de conducción" +msgid "pgr_bellmanFord" +msgstr "pgr_bellmanFord" -msgid "Default values when parameter is missing:" -msgstr "" +msgid "pgr_binaryBreadthFirstSearch" +msgstr "pgr_binaryBreadthFirstSearch" -#, fuzzy -msgid "[``r``, ``R``] for directed graph" -msgstr "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)" +msgid "pgr_bipartite" +msgstr "pgr_bipartite" -#, fuzzy -msgid "[``l``, ``L``] for undirected graph" -msgstr "Solo para grafos no dirigidos" +msgid "pgr_boykovKolmogorov" +msgstr "pgr_boykovKolmogorov" -msgid "With points optional parameters" -msgstr "Parámetros opcionales para Con puntos" +msgid "pgr_breadthFirstSearch" +msgstr "pgr_breadthFirstSearch" -msgid "``details``" -msgstr "``details``" - -msgid "For showing points stops." +msgid ":" msgstr "" -msgid "When ``true`` the results will include the points that are in the path." -msgstr "Cuando ``true`` los resultados incluyen los puntos que están en el camino." +msgid "pgr_contraction" +msgstr "pgr_contraction" -msgid "When ``false`` the results will not include the points that are in the path." -msgstr "Cuando ``false`` los resultados no incluyen los puntos que están en el camino." +msgid "pgr_dagShortestPath" +msgstr "pgr_dagShortestPath" -msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." -msgstr "Cuando las columnas ``start_vid``, ``end_vid`` y``node`` tengan valores negativos, el identificador es para un Punto." +msgid "pgr_depthFirstSearch" +msgstr "pgr_depthFirstSearch" -msgid "Use ``pgr_findCloseEdges`` for points on the fly" -msgstr "" +msgid "pgr_dijkstra" +msgstr "pgr_dijkstra" -msgid "Using :doc:`pgr_findCloseEdges`:" -msgstr "Usando :doc:`pgr_findCloseEdges`:" +msgid "pgr_dijkstraCost" +msgstr "pgr_dijkstraCost" -msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." -msgstr "" +msgid "pgr_dijkstraNear" +msgstr "pgr_dijkstraNear" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." -msgstr "Punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." +msgid "pgr_dijkstraNearCost" +msgstr "pgr_dijkstraNearCost" -msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." -msgstr "Punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`." +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" -msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." -msgstr "" +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" -msgid "Usage variations" -msgstr "Variaciones de uso" +msgid "pgr_edgeDisjointPaths" +msgstr "pgr_edgeDisjointPaths" -msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." -msgstr "" +msgid "pgr_edmondsKarp" +msgstr "pgr_edmondsKarp" -msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." -msgstr "" +msgid "pgr_edwardMoore" +msgstr "pgr_edwardMoore" -msgid "The algorithm performs a :doc:`pgr_withPointsVia`" -msgstr "El algoritmo realiza una :doc:`pgr_withPointsVia`" +msgid "pgr_kingOrdering" +msgstr "pgr_kingOrdering" -msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." -msgstr "" +msgid "pgr_KSP" +msgstr "pgr_KSP" -msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." -msgstr "" +msgid "pgr_maxCardinalityMatch" +msgstr "pgr_maxCardinalityMatch" -msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" +msgid "pgr_maxFlow" +msgstr "pgr_maxFlow" -msgid "Getting the same result as ``pgr_trspVia_withPoints``:" -msgstr "" +msgid "pgr_pushRelabel" +msgstr "pgr_pushRelabel" -msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." -msgstr "" +msgid "pgr_sequentialVertexColoring" +msgstr "pgr_sequentialVertexColoring" -msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "" +msgid "pgr_sloanOrdering" +msgstr "pgr_sloanOrdering" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." -msgstr "" +msgid "pgr_topologicalSort" +msgstr "pgr_topologicalSort" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +msgid "pgr_transitiveClosure" +msgstr "pgr_transitiveClosure" -msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." -msgstr "" +msgid "pgr_trsp" +msgstr "pgr_trsp" -msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." -msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Considerar las rutas inválidas en `Restrictions SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto." +msgid "pgr_trspVia" +msgstr "pgr_trspVia" -msgid "Vertices of the graph are:" -msgstr "Los vértices del grafo son:" +msgid "pgr_trspVia_withPoints" +msgstr "pgr_trspVia_withPoints" -msgid "**positive** when it belongs to the `Edges SQL`_" -msgstr "" +msgid "pgr_trsp_withPoints" +msgstr "pgr_trsp_withPoints" -msgid "**negative** when it belongs to the `Points SQL`_" -msgstr "**negative** cuando pertence al `SQL de puntos`_" +msgid "pgr_TSP" +msgstr "pgr_TSP" -msgid "The `agg_cost` in the non included values `(v, v)` is `0`" -msgstr "El `agg_cost` en los valores no incluidos `(v, v)` es `0`" +msgid "pgr_TSPeuclidean" +msgstr "pgr_TSPeuclidean" -msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" -msgstr "El `agg_cost` en los valores no incluidos `(u, v)` es :math:`\\infty`" +msgid "pgr_turnRestrictedPath" +msgstr "pgr_turnRestrictedPath" -#, fuzzy -msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." -msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`." +msgid "pgr_withPoints" +msgstr "pgr_withPoints" -msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" -msgstr "Tiempo de ejecución: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" -msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" +msgid "Functions promoted to official" +msgstr "Funciones promovidas a oficial" -msgid "**options:** ``[directed, details]``" -msgstr "**opcionales:** ``[directed, details]``" +msgid "`#2701 `__: pgr_trsp" +msgstr "`#2701 `__: pgr_trsp" -# | msgid "" -# | "From point :math:`1` to vertex :math:`3` with details on a **left** " -# | "driving side configuration on a **directed** graph with **details**." -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" -msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido. (con detalles)" +msgid "`#2701 `__: pgr_trspVia" +msgstr "`#2701 `__: pgr_trspVia" -msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" -msgstr "Desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido" +msgid "`#2701 `__: pgr_trspVia_withPoints" +msgstr "`#2701 `__: pgr_trspVia_withPoints" -# | msgid "" -# | "From point :math:`1` to vertex :math:`3` with details on a **left** " -# | "driving side configuration on a **directed** graph with **details**." -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" -msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido. (sin detalles)" +msgid "`#2701 `__: pgr_trsp_withPoints" +msgstr "`#2701 `__: pgr_trsp_withPoints" -# | msgid "From point :math:`1` to point :math:`3` and vertex :math:`5`." -#, fuzzy -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." -msgstr "Desde el punto :math:`1` y vértice :math:`6` al punto :math:`3` y vértice :math:`1`." +msgid "`#2700 `__: pgr_withPoints" +msgstr "`#2700 `__: pgr_withPoints" -msgid "Two combinations" -msgstr "Dos combinaciones" +msgid "`#2700 `__: pgr_withPointsCost" +msgstr "`#2700 `__: pgr_withPointsCost" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" -msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con najando del lado derecho (con detalles)" +msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgstr "`#2700 `__: pgr_withPointsCostMatrix" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." -msgstr "Usar :doc:`pgr_findCloseEdges` en el `SQL de puntos`_." +msgid "`#2700 `__: pgr_withPointsDD" +msgstr "`#2700 `__: pgr_withPointsDD" -msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Wncontrar las rutas desde el vértice :math:`1` a las dos ubicaciones más cercanas en el grafo al punto`(2.9, 1.8)`." +msgid "`#2700 `__: pgr_withPointsKSP" +msgstr "`#2700 `__: pgr_withPointsKSP" -#, fuzzy -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" -msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" +msgid "`#2700 `__: pgr_withPointsVia" +msgstr "`#2700 `__: pgr_withPointsVia" -msgid "Passes in front or visits with right side driving." -msgstr "Pasa enfrente o visita con lado derecho de manejo." +msgid "`#2983 `__: pgr_dijkstraNear" +msgstr "`#2983 `__: pgr_dijkstraNear" -msgid "For point :math:`6` and vertex :math:`11`." -msgstr "Del punto :math:`6` al vértice :math:`11`." +msgid "`#2983 `__: pgr_dijkstraNearCost" +msgstr "`#2983 `__: pgr_dijkstraNearCost" -msgid "Passes in front or visits with left side driving." -msgstr "Pasa enfrente o visita con lado izquierdo de manejo." +msgid "`#2983 `__: pgr_dijkstraVia" +msgstr "`#2983 `__: pgr_dijkstraVia" -msgid "``pgr_turnRestrictedPath`` - Experimental" -msgstr "``pgr_turnRestrictedPath`` - Experimental" +msgid "Signatures promoted to official" +msgstr "Firmas promovidas a oficial" -msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" -msgstr "``pgr_turnRestrictedPath`` Usando el algoritmo vértice -vértice de Yen para ruteo con restricciones" +msgid "`#2718 `__: pgr_aStar(Combinations)" +msgstr "`#2718 `__: pgr_aStar(Combinaciones)" -msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" -msgstr "" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgstr "`#2718 `__: pgr_aStarCost(Combinaciones)" -msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "pgr_turnRestrictedPath(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, **K**, [**opciones**])" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgstr "`#2718 `__: pgr_bdAstar(Combinaciones)" -msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" -msgstr "**opcionales:** ``[directed, heap_paths, stop_on_first, strict]``" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgstr "`#2718 `__: pgr_bdAstarCost(Combinaciones)" -msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" -msgstr "Del vértice :math:`3` al vértice :math:`8` en un grafo dirigido" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" +msgstr "`#2718 `__: pgr_bdDijkstra(Combinaciones)" -msgid "Special optional parameters" -msgstr "" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgstr "`#2718 `__: pgr_bdDijkstraCost(Combinaciones)" -msgid "``stop_on_first``" -msgstr "``stop_on_first``" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgstr "`#2718 `__: pgr_dijkstra(Combinaciones)" -msgid "When ``true`` stops on first path found that dos not violate restrictions" -msgstr "" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgstr "`#2718 `__: pgr_dijkstraCost(Combinaciones)" -msgid "When ``false`` returns at most K paths" -msgstr "" +msgid "`#2718 `__: pgr_KSP(All signatures)" +msgstr "`#2718 `__: pgr_KSP(Todas las firmas)" -msgid "When ``true`` returns only paths that do not violate restrictions" -msgstr "" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" +msgstr "`#2718 `__: pgr_boykovKolmogorov(Combinaciones)" -msgid "When ``false`` returns the paths found" -msgstr "" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgstr "`#2718 `__: pgr_edmondsKarp(Combinaciones)" -msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." -msgstr "" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" +msgstr "`#2718 `__: pgr_maxFlow(Combinaciones)" -msgid "No results because the only path available follows a restriction." +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" +msgstr "`#2718 `__: pgr_pushRelabel(Combinaciones)" + +msgid "New experimental functions." +msgstr "Nuevas funciones experimentales." + +msgid "Metrics" +msgstr "Métricas" + +msgid "`#2951 `__: pgr_bandwidth" +msgstr "`#2951 `__: pgr_bandwidth" + +msgid "Ordering" +msgstr "Ordenamiento" + +msgid "`#2954 `__: pgr_kingOrdering" +msgstr "`#2954 `__: pgr_kingOrdering" + +msgid "`#2955 `__: pgr_sloanOrdering" +msgstr "`#2955 `__: pgr_sloanOrdering" + +msgid "SQL signatures and output standardization" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" -msgstr "Del vértice :math:`3` al vértice :math:`8` en un grafo no dirigido" +msgid "`#2904 `__: Standardize output columns of functions with different output" +msgstr "`#2904 `__: Estandarizar columnas de resultados de funciones con diferente salida" -msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" -msgstr "Del vértice :math:`3` al vértice :math:`8` con más alternativas" +msgid "columns within overloads" +msgstr "columnas dentro de las sobrecargas" -msgid "``pgr_version``" -msgstr "``pgr_version``" +msgid "Standardized to |short-generic-result|" +msgstr "Estandardizar de las columnas de resultados a |short-generic-result|" -msgid "``pgr_version`` — Query for pgRouting version information." -msgstr "``pgr_version`` — consulta de información sobre la versión de pgRouting." +msgid "`#2905 `__: pgr_withPoints" +msgstr "`#2905 `__: pgr_withPoints" -msgid "Breaking change on result columns" -msgstr "Cambio estructural en las columnas de resultados" +msgid "`#2906 `__: pgr_bdDijkstra" +msgstr "`#2906 `__: pgr_bdDijkstra" -msgid "Support for old signature ends" -msgstr "Soporte termina para antigua firma" +msgid "`#2907 `__: pgr_bellmanFord" +msgstr "`#2907 `__: pgr_bellmanFord" -msgid "Returns pgRouting version information." -msgstr "Devuelve la información de la versión de pgRouting." +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgstr "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgid "pgr_version()" -msgstr "pgr_version()" +msgid "`#2910 `__: pgr_edwardMoore" +msgstr "`#2910 `__: pgr_edwardMoore" -msgid "RETURNS ``TEXT``" -msgstr "DEVUELVE ``TEXT``" +msgid "`#2913 `__: pgr_dagShortestPath" +msgstr "`#2913 `__: pgr_dagShortestPath" -msgid "pgRouting Version for this documentation" -msgstr "Versión de pgRouting para esta documentación" +msgid "Standardized to |matrix-result|" +msgstr "Estandardizar de las columnas de resultados a |matrix-result|" -msgid "``pgr_vrpOneDepot`` - Experimental" -msgstr "``pgr_vrpOneDepot`` - Experimental" +msgid "`#2905 `__: pgr_withPointsCost" +msgstr "`#2905 `__: pgr_withPointsCost" -msgid "**No documentation available**" -msgstr "**No hay documentación disponible**" +msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgstr "`#2905 `__: pgr_withPointsCostMatrix" -msgid "**TBD**" -msgstr "**TBD**" +msgid "Standardized to |generic-result|" +msgstr "Estandardizar de las columnas de resultados a |generic-result|" -msgid "TBD" -msgstr "Por Definirse" +msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgstr "`#2909 `__: pgr_edgeDisjointPaths" -msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." -msgstr "``pgr_withPoints`` - Devuelve la ruta más corta de un grafo con vértices temporales adicionales." +msgid "`#2909 `__: pgr_turnRestrictedPath" +msgstr "`#2909 `__: pgr_turnRestrictedPath" -msgid "pgr_withPoints(Combinations)" -msgstr "pgr_withPoints(Combinaciones)" +msgid "Standardized to |result_edge_color|" +msgstr "Estandardizar de las columnas de resultados a |result_edge_color|" -msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." -msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto." +msgid "`#2924 `__: pgr_edgeColoring" +msgstr "`#2924 `__: pgr_edgeColoring" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "Standardized to |result_node_color|" +msgstr "Estandardizar de las columnas de resultados a |result_node_color|" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2924 `__: pgr_bipartite" +msgstr "`#2924 `__: pgr_bipartite" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgstr "`#2927 `__: pgr_sequentialVertexColoring" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "Standardized to |result-spantree|" +msgstr "Estandardizar de las columnas de resultados a |result-spantree|" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2931 `__: pgr_breadthFirstSearch" +msgstr "`#2931 `__: pgr_breadthFirstSearch" -#, fuzzy -msgid "**options:** ``[directed, details])``" -msgstr "**opcionales:** ``[directed, details]``" +msgid "`#2931 `__: pgr_depthFirstSearch" +msgstr "`#2931 `__: pgr_depthFirstSearch" -# | msgid "" -# | "From point :math:`1` to vertex :math:`3` with details on a **left** " -# | "driving side configuration on a **directed** graph with **details**." -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" -msgstr "Desde el punto :math:`1` al vértice :math:`10` manjando del lado derecho en un grafo dirigido, (sin detalles)" +msgid "Standardized to |result_node_order|" +msgstr "Estandardizar de las columnas de resultados a |result_node_order|" -msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." -msgstr "Identificador del vértice inicial de la ruta. Valor negativo es para identificador de punto." +msgid "`#2934 `__: pgr_topologicalSort" +msgstr "`#2934 `__: pgr_topologicalSort" -msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." -msgstr "Arreglo de identificadores de vértices iniciales. Valores negativos son para identificadores de puntos." +msgid "Standardized to |result-closure|" +msgstr "Estandardizar de las columnas de resultados a |result-closure|" -msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." -msgstr "Identificador del vértice final de la ruta. Valor negativo es para identificador de punto." +msgid "`#2934 `__: pgr_transitiveClosure" +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." -msgstr "Arreglo de identificadores de vértices finales. Valores negativos son para identificadores de puntos." +msgid "Removal of SQL deprecated signatures" +msgstr "Eliminación de funciones SQL obsoletas" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" +msgid "`#2798 `__: pgr_contraction" +msgstr "`#2798 `__: pgr_contraction" -msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." -msgstr "``pgr_withPointsCost`` - Calcula el camino más corto y devuelve sólo el coste agregado del camino más corto encontrado, para la combinación de puntos dada." +msgid "`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" -msgid "pgr_withPointsCost(Combinations)" -msgstr "pgr_withPointsCost(Combinaciones)" +msgid "`#2683 `__: pgr_trspVia" +msgstr "`#2683 `__: pgr_trspVia" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." -msgstr "Modificar el grafo para incluir los puntos definidos por points_sql. Utilizando el algoritmo de Dijkstra, devolver sólo el coste agregado del camino más corto encontrado." +msgid "`#2888 `__: pgr_findCloseEdges" +msgstr "`#2888 `__: pgr_findCloseEdges" -msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." -msgstr "Devuelve la suma de los costes de la ruta más corta para la combinación de pares de vértices en el grafo modificado." +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -#, fuzzy -msgid "The returned values are in the form of a set of |matrix-result|." -msgstr "Los valores devueltos tienen la forma de un conjunto de `(start_vid, end_vid, agg_cost)`." +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgid "**positive** when it belongs to the edges_sql" -msgstr "**positivo** cuando pertenece a edges_sql" +msgid "`#2890 `__: pgr_withPointsDD" +msgstr "`#2890 `__: pgr_withPointsDD" -msgid "**negative** when it belongs to the points_sql" -msgstr "**negativo** cuando pertenece a points_sql" +msgid "`#2895 `__: pgr_withPointsKSP" +msgstr "`#2895 `__: pgr_withPointsKSP" -msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." -msgstr "Si los valores devueltos se almacenan en una tabla, el índice único sería el par: `(start_vid, end_vid)`." +msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgstr "`#2899 `__: pgr_maxCardinalityMatch" -msgid "For **undirected** graphs, the results are **symmetric**." -msgstr "Para los grafos **no dirigidos**, los resultados son **simétricos**." +msgid "`#2901 `__: pgr_TSP" +msgstr "`#2901 `__: pgr_TSP" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2901 `__: pgr_TSPeuclidean" +msgstr "`#2901 `__: pgr_TSPeuclidean" + +msgid "Removal of SQL deprecated functions" +msgstr "Eliminación de funciones obsoletas" + +msgid "`#2681 `__: pgr_trspViaedges" +msgstr "`#2681 `__: pgr_trspViaedges" + +msgid "`#2682 `__: pgr_trspViaVertices" +msgstr "`#2682 `__: pgr_trspViaVertices" + +msgid "`#2748 `__: pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" + +msgid "`#2751 `__: pgr_createTopology" +msgstr "`#2751 `__: pgr_createTopology" + +msgid "`#2752 `__: pgr_analyzeGraph" +msgstr "`#2752 `__: pgr_analyzeGraph" + +msgid "`#2755 `__: pgr_analyzeOneWay" +msgstr "`#2755 `__: pgr_analyzeOneWay" + +msgid "`#2827 `__: pgr_createVerticesTable" +msgstr "`#2827 `__: pgr_createVerticesTable" + +msgid "`#2886 `__: pgr_nodeNetwork" +msgstr "`#2886 `__: pgr_nodeNetwork" + +msgid "Removal of SQL deprecated internal functions" +msgstr "Eliminación de funciones internas SQL obsoletas" + +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgstr "`#2748 `__ _pgr_alphaShape(text,double precision)" + +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgstr "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" + +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" + +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" + +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgstr "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" + +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgstr "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" + +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" + +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" + +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" + +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" + +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" + +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" + +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" + +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgstr "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" + +msgid "`#2861 `__ _pgr_endPoint(geometry)" +msgstr "`#2861 `__ _pgr_endPoint(geometry)" + +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" + +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" + +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" +msgstr "`#2861 `__ _pgr_getcolumntype(text,text,integer,text)" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgstr "`#2861 `__ __pgr_getTableName(text,integer,text)" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" -#, fuzzy -msgid "**options:** ``[directed]``" -msgstr "**opcionales:** ``[directed, cap]``" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgstr "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." -msgstr "No hay identificador de **details**, a diferencia de los otros miembros de la familia de funciones withPoints." +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" -# | msgid "" -# | "From point :math:`1` to vertex :math:`3` with details on a **left** " -# | "driving side configuration on a **directed** graph with **details**." -#, fuzzy -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." -msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido con detalles." +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -# | msgid "" -# | "From point :math:`1` to vertex :math:`3` with details on a **left** " -# | "driving side configuration on a **directed** graph with **details**." -#, fuzzy -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." -msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido, con detalles." +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" -#, fuzzy -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." -msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con lado de manejo **derecho**." +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" -msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Encontrar el costo de las rutas desde el vértice :math:`1` a las dos ubicaciones mpas cercanas en el grafo desde el punto `(2.9, 1.8)`." +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgid "Being close to the graph does not mean have a shorter route." -msgstr "Estar cercano al grafo no significa tener la ruta más corta." +msgid "`#2861 `__ _pgr_msg(integer,text,text)" +msgstr "`#2861 `__ _pgr_msg(integer,text,text)" -msgid "Right side driving topology" -msgstr "Topología de manejo del lado derecho" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" +msgstr "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" -msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "Desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}`y vértices :math:`\\{10, 11\\}`" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" +msgstr "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" -msgid "Left side driving topology" -msgstr "Topología de manejo del lado izquierdo" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" -msgid "Does not matter driving side driving topology" -msgstr "No importa el lado de manejo" +msgid "`#2861 `__ _pgr_quote_ident(text)" +msgstr "`#2861 `__ _pgr_quote_ident(text)" -msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." -msgstr "``pgr_withPointsCostMatrix`` - Calcula una matriz de costos usando :doc:`pgr_withPoints`." +msgid "`#2861 `__ _pgr_startPoint(geometry)" +msgstr "`#2861 `__ _pgr_startPoint(geometry)" -#, fuzzy -msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, [**opciones**])" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" -msgstr "Matriz de costos para puntos :math:`\\{1, 6\\}` y vértices :math:`\\{10, 11\\}` en un grafo **no dirigido**" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgid "Returning a **symmetrical** cost matrix" -msgstr "Devolver una matriz de costes **simétrica**" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgid "Using the default ``side`` value on the **points_sql** query" -msgstr "Uso del valor predeterminado ``side`` en la consulta **SQL de puntos**" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" -#, fuzzy -msgid "Using the default ``driving side`` value" -msgstr "Usando el valor predeterminado ``driving_side``" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Encontrar la matriz de costos de las rutas desde el vértice :math:`1` y las dos ubicaciones más cercanas en el grafo al punto `(2.9, 1.8)`." +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgstr "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." -msgstr "``pgr_withPointsDD`` - Devuelve la **distancia** de conducción desde un punto de partida." +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -#, fuzzy -msgid "Output columns standardized to |result-spantree|" -msgstr "Las nuevas columnas de salida son |result-spantree|" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "When ``details`` is ``false``:" -msgstr "Cuando ``details`` es ``false``:" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgid "Points reached within the distance are not included." -msgstr "" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "Deprecated signatures:" -msgstr "Firmas obsoletas:" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." -msgstr "Modifica el grafo para incluir puntos y utilizando el algoritmo Dijkstra, extrae todos los nodos y puntos que tienen costes menores o iguales que el valor de ``**distance**`` desde el punto inicial. Las aristas extraídas conformarán el árbol de expansión correspondiente." +msgid "`#2861 `__ _pgr_versionLess(text,text)" +msgstr "`#2861 `__ _pgr_versionLess(text,text)" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" -msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones A**])" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" -msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones B**])" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" -msgid "**options A:** ``[directed, details]``" -msgstr "**opciones A:** ``[directed, details]``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "**options B:** ``[directed, details, equicost]``" -msgstr "**opciones B:** ``[directed, details, equicost]``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" -msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones**])" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgstr "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." -msgstr "Topología de manejo por el lado derecho desde el punto :math:`1` con una distancia :math:`3.3`, detallada." +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" -msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones**])" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" -msgid "**options:** ``[directed, details, equicost]``" -msgstr "**opcionales:** ``[directed, details, equicost]``" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" -msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" -msgstr "Desde el punto :math:`1` y el vértice :math:`16` dentro de una distancia de :math:`3.3` con ``equicost`` en un grafo dirigido" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgstr "`#2683 `__ _v4trsp(text,text,text,boolean)" -msgid "Negative values represent a point" -msgstr "Valores negativos representan un punto" +msgid "Summary of functions and signatures no longer on pgrouting" +msgstr "Resumen de funciones y firmas que ya no están en pgrouting" -msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Encontrar la distancia de manejo de las dos ubicaciones más cercanas al grafo del punto `(2.8, 1.8)`." +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgstr "`#2748 `__ pgr_alphashape(geometry,double precision)" -msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." -msgstr "El punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgstr "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." -msgstr "El punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`." +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgstr "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" -msgid "Driving side does not matter" -msgstr "Lado de manejo no importa" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." -msgstr "Desde el punto :math:`1` dentro de una distancia de :math:`3.3`, sin importar el lado de manejo, detallada." +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgstr "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgstr "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" -msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "``pgr_withPointsKSP`` - Encuentra las rutas más cortas de K usando el algoritmo de Yen." +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgid "pgr_withPointsKSP(One to Many)" -msgstr "pgr_withPointsKSP(Uno a Muchos)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgid "pgr_withPointsKSP(Many to One)" -msgstr "pgr_withPointsKSP(Muchos a Uno)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgid "pgr_withPointsKSP(Many to Many)" -msgstr "pgr_withPointsKSP(Muchos a Muchos)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgstr "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgid "pgr_withPointsKSP(Combinations)" -msgstr "pgr_withPointsKSP(Combinaciones)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." -msgstr "Modifica el grafo para incluir los puntos definidos en el `SQL de puntos`_ y utilizando el algoritmo Yen, encuentra las :math:`K` rutas más cortas." +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "**options:** ``[directed, heap_paths, details]``" -msgstr "**opciones:** ``[directed, heap_paths, details]``" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." -msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`2` en un grafo dirigido con lado de manejo **izquierdo**." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgid "For a directed graph." -msgstr "Para un grafo dirigido." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgid "No details are given about distance of other points of the query." -msgstr "No se proporcionan detalles sobre la distancia de otros puntos de la consulta." +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "No heap paths are returned." -msgstr "No se devuelven rutas pre-calculadas." +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" -msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -# | msgid "" -# | "From point :math:`1` to vertex :math:`3` with details on a **left** " -# | "driving side configuration on a **directed** graph with **details**." -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" -msgstr "Obtener una ruta desde el punto :math:`1` y del vértice :math:`6` al punto :math:`3` en un grafo **dirigido**, con lado de manejo a la **derecha** y con ``details`` puesto en ``true``" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -# | msgid "" -# | "From point :math:`1` to vertex :math:`3` with details on a **left** " -# | "driving side configuration on a **directed** graph with **details**." -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" -msgstr "Obtener una ruta desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y al vértice :math:`1` en un grafo **dirigido** con lado de manejo **izquierda**, con ``heap_paths`` puesto en ``true``" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgid "Using a combinations table on an **directed** graph" -msgstr "Usando una tabla de combinaciones en un grafo **dirigido**" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgid "Number of required paths" -msgstr "Cantidad de rutas requeridas" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgid "withPointsKSP optional parameters" -msgstr "Parámetros opcionales para withPointsKSP" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" -msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." -msgstr "Obtener :math:`2` caminos usando el lado izquierdo de manejo, desde el vértice :math:`1` a la ubicación mpas cercana en el grafo al punto `(2.9, 1.8)`." +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Left driving side" -msgstr "Lado de manejo izquierdo" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" -msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." -msgstr "Obtener :math:`2` rutas, usando topología de manejo por la izquierda, desde el punto :math:`1` al punto :math:`3`, detallado." +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "Right driving side" -msgstr "Lado de manejo derecho" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." -msgstr "Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas." +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." -msgstr "``pgr_withPointsVia`` - Ruta que recorre una lista de vértices y/o puntos." +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" -msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." -msgstr "" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" -#, fuzzy -msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" -msgstr "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, [**opciones**])" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -#, fuzzy -msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." -msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido." +msgid "Removal of unused C/C++ code" +msgstr "Eliminación de código C/C++ no utilizado" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" +msgid "Refactor the Script to build the update PostgreSQL file." msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "One process & driver for:" msgstr "" -msgid "Prim - Family of functions" -msgstr "Prim - Familia de funciones" +msgid "allpairs: johnson and Floyd-Warshall" +msgstr "" -msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." -msgstr "El algoritmo prim fue desarrollado en 1930 por el matemático checo Vojtěch Jarník. Es un algoritmo ambicioso que encuentra un árbol de expansión mínimo para un grafo ponderado no dirigido. Esto significa que encuentra un subconjunto de los bordes que forma un árbol que incluye cada vértice, donde se minimiza el peso total de todos los bordes del árbol. El algoritmo funciona creando este árbol un vértice a la vez, desde un vértice inicial arbitrario, paso a paso agregando la conexión más barata posible desde el árbol a otro vértice." +msgid "Shortest path: Dijkstra and withPoints using Dijkstra" +msgstr "" -msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." -msgstr "Estos algoritmos encuentran el bosque de expansión mínimo en un grafo posiblemente desconectado; en cambio, la forma más básica del algoritmo de Prim sólo encuentra árboles de expansión mínimos en los grafos conectados. Sin embargo, al ejecutar el algoritmo de Prim por separado para cada componente conectado del grafo, se denomina bosque de expansión mínimo." +msgid "Deprecation of internal C/C++ functions" +msgstr "Obsolescencia de funciones internas C/C++" -msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" -msgstr "De boost Graph: \"El algoritmo tal como se aplica en el Boost.Graph no produce resultados correctos en grafos con segmentos paralelos.\"" +msgid "Deprecated functions are substituted by new function." +msgstr "" -msgid "Boost: `Prim's algorithm `__" -msgstr "Boost: `Algoritmo de Prim `__" +msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" +msgstr "_pgr_drivingDistance => _pgr_drivingDistancev4" -msgid "Wikipedia: `Prim's algorithm `__" -msgstr "Wikipedia: `Algoritmo de Prim `__" +msgid "_pgr_withPointsDD => _pgr_withPointsddv4" +msgstr "_pgr_withPointsDD => _pgr_withPointsddv4" -msgid "Proposed Functions" -msgstr "Funciones propuestas" +msgid "_pgr_kruskal => _pgr_kruskalv4" +msgstr "" -msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr ":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de líneas." +msgid "_pgr_prim => _pgr_primv4" +msgstr "" -msgid "Reference" -msgstr "Referencia" +msgid "_pgr_dijkstra => _pgr_dijkstra_v4" +msgstr "_pgr_dijkstra => _pgr_dijkstra_v4" -msgid "Release Notes" -msgstr "Notas de versión" +msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" +msgstr "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" -msgid "To see the full list of changes check the list of `Git commits `_ on Github." -msgstr "Para ver la lista completa de cambios, consulte la lista de `Git commits `_ en Github." +msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgstr "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" -msgid "Mayors" -msgstr "" +msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" +msgstr "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" -msgid "pgRouting 4" -msgstr "pgRouting 4" +msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" +msgstr "_pgr_withPointsVia => _pgr_withPointsvia_v4" -msgid "Minors 4.x" -msgstr "" +msgid "Internal C/C++ functions in legacy" +msgstr "Funciones C/C++ internas en legado" -#, fuzzy -msgid "pgRouting 4.1" -msgstr "pgRouting 4.0" +msgid "`#2683 `__ _trsp" +msgstr "`#2683 `__ _trsp" -#, fuzzy -msgid "pgRouting 4.1.0 Release Notes" -msgstr "Notas de la Versión pgRouting 3.1.0" +msgid "`#2683 `__ _v4trsp" +msgstr "`#2683 `__ _v4trsp" -#, fuzzy -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" -msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 `__" +msgid "`#2748 `__ _pgr_alphaShape" +msgstr "`#2748 `__ _pgr_alphaShape" -msgid "No changes yet" -msgstr "" +msgid "`#2913 `__ _pgr_dagShortestPath" +msgstr "`#2913 `__ _pgr_dagShortestPath" msgid "pgRouting 3" msgstr "pgRouting 3" @@ -14780,9 +14860,6 @@ msgstr "Contracción:" msgid "Removed unnecessary column seq" msgstr "Se ha eliminado la innecesaria columna seq" -msgid "Bug Fixes" -msgstr "Corrección de errores" - msgid "pgr_maxFlowMinCost" msgstr "pgr_maxFlowMinCost" @@ -16403,3 +16480,232 @@ msgstr "pgr_withPointsDD es pgr_drivingDistance **con puntos**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" + +#~ msgid "pgRouting 4.0.0-alpha1 Release Notes" +#~ msgstr "Notas de la versión de pgRouting 4.0.0-alpha1" + +#~ msgid "Individuals in this release v4.0.0 (in alphabetical order)" +#~ msgstr "Personas en esta versión v4.0.0 (por orden alfabético)" + +#~ msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" +#~ msgstr "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" + +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" + +#~ msgid "See also" +#~ msgstr "Ver también" + +#~ msgid "``pgr_bellmanFord - Experimental``" +#~ msgstr "``pgr_bellmanFord`` - Experimental" + +#~ msgid "``pgr_dijkstraNear`` - Proposed" +#~ msgstr "``pgr_dijkstraNear`` - Propuesto" + +#~ msgid "``pgr_dijkstraNearCost`` - Proposed" +#~ msgstr "``pgr_dijkstraNearCost`` - Propuesto" + +#~ msgid "Additionally there are 2 categories under this family" +#~ msgstr "Adicionalmente, hay dos categorías en esta familia" + +#~ msgid "`#2913 `__: pgr_DAGshortestPath" +#~ msgstr "`#2913 `__: pgr_DAGshortestPath" + +#~ msgid "_pgr_withpointsksp => _pgr_withpointsksp_v4" +#~ msgstr "_pgr_withpointsksp => _pgr_withpointsksp_v4" + +#, fuzzy +#~ msgid "Validity of **driving side** parameter" +#~ msgstr "Lado de manejo derecho" + +#~ msgid "**driving side** parameter is unnamed compulsory, and valid values differ for directed and undirected graphs." +#~ msgstr "El parámetro **lado de manjeo** es obligatorio sin nombre, y los valores válidos difieren para grafos dirigidos y no dirigidos." + +#~ msgid "Does not have a default value." +#~ msgstr "No tiene un valor de facto." + +#~ msgid "Using an invalid value throws an ``ERROR``." +#~ msgstr "El uso de un valor inválido lanza un ``ERROR``." + +#~ msgid "And ``driving side`` parameter changed from named optional to unnamed compulsory **driving side** and its validity differ for directed and undirected graphs." +#~ msgstr "Y el parámetro \"driving side\" ha cambiado de opcional con nombre a obligatorio sin nombre **driving side** y su validez difiere para grafos dirigidos y no dirigidos." + +#, fuzzy +#~ msgid "if OFF the Spaish documentation will no be built" +#~ msgstr "Información sobre cuándo se construyó esta documentación" + +#~ msgid "Regina Obe, Vicky Vergara" +#~ msgstr "Regina Obe, Vicky Vergara" + +#, fuzzy +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" + +#, fuzzy +#~ msgid "..rubric:: Version 3.0.0" +#~ msgstr "Versión 3.0.0" + +#~ msgid "``pgr_dijkstraVia`` - Proposed" +#~ msgstr "``pgr_dijkstraVia`` - Propuesto" + +#~ msgid "|boost| graph inside." +#~ msgstr "|boost| graph adentro." + +#, fuzzy +#~ msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" + +#~ msgid "**driving side**" +#~ msgstr "**Lado de manejo**" + +#~ msgid "[``r``, ``R``] for right driving side (for directed graph only)" +#~ msgstr "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)" + +#~ msgid "[``l``, ``L``] for left driving side (for directed graph only)" +#~ msgstr "[``l``, ``L``] para manejo por lad izquierdo (solo gráfos dirigidos)" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destino**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salidas**, **destino**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salidas**, **destinos**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de combinaciones`_, `SQL de puntos`_, [**opciones**])" + +#~ msgid "**options:** ``[directed, driving_side, details]``" +#~ msgstr "**opcionales:** ``[directed, driving_side, details]``" + +#, fuzzy +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, [**opciones**])" + +#~ msgid "Using the default ``driving_side`` value" +#~ msgstr "Usando el valor predeterminado ``driving_side``" + +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones A**])" + +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones B**])" + +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones**])" + +#~ msgid "``r``, ``R`` for right driving side," +#~ msgstr "``r``, ``R`` para el manejo del lado derecho," + +#~ msgid "``l``, ``L`` for left driving side." +#~ msgstr "``l``, ``L`` para lado de manejo izquierdo." + +#~ msgid "``b``, ``B`` for both." +#~ msgstr "``b``, ``B`` para ambos." + +#~ msgid "Valid values differ for directed and undirected graphs:" +#~ msgstr "Valores válidos son differentes para grafos dirigidos y no dirigidos:" + +#~ msgid "In undirected graphs: [``b``, ``B``]." +#~ msgstr "En grafos no dirigidos: [``b``, ``B``]." + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, [**opciones**])" + +#, fuzzy +#~ msgid "Regina Obe, Saloni kumari, Vicky Vergara" +#~ msgstr "Regina Obe, Vicky Vergara" + +#, fuzzy +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" + +#, fuzzy +#~ msgid "New experimental function" +#~ msgstr "Nueva función experimental." + +#, fuzzy +#~ msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graphs acyclic graph." +#~ msgstr ":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no dirigido." + +#, fuzzy +#~ msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara" +#~ msgstr "Regina Obe, Vicky Vergara" + +#, fuzzy +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" + +#~ msgid "New **experimental** function" +#~ msgstr "Nueva función **experimental**" + +#, fuzzy +#~ msgid "|Boost| Boost Graph inside" +#~ msgstr "|Boost| Adentro: Boost Graph" diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index 7e10448c76..2f109f20d6 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -20,7 +20,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-12-10 19:55+0000\n" +"POT-Creation-Date: 2026-03-04 00:25+0000\n" "PO-Revision-Date: 2025-09-22 16:27+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Japanese \n" @@ -3565,10242 +3565,10306 @@ msgstr "" msgid ":doc:`release_notes`" msgstr "" -msgid "pgRouting 4.0" +msgid "pgRouting 4.1.0 Release Notes" msgstr "" -msgid "pgRouting 4.0.0-alpha1 Release Notes" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgid "Code enhancements" msgstr "" -msgid "Build" +msgid "`#3049 `__: Use enumeration on drivers and process." msgstr "" -msgid "C++ standard is std17" +msgid "`#3054 `__: Change error message when edges_sql is empty" msgstr "" -msgid "Using this standard, all supported toolchains across our CI matrix will work." +msgid "`#3055 `__: bdDijkstra: use the shortest_path process and driver" msgstr "" -msgid "The code is not yet modified to use std17:" +msgid "`#3056 `__: edwardMoore: use the shortest_path process and driver" msgstr "" -msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." +msgid "`#3060 `__: dagShortestPath: use the shortest_path process and driver" msgstr "" -msgid "The user's documentation is built by default." +msgid "`#3064 `__: Astar: create and use a process and driver for Astar" msgstr "" -msgid "The doxygen documentation is built by default." +msgid "`#3075 `__: Spanning tree: create and use a process and driver" msgstr "" -msgid "For developers:" +msgid "`#3086 `__: MaxFlow: create and use a process and driver" msgstr "" -msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." +msgid "`#3089 `__: edgeDisjoint and bellmanFord use shortestPath driver and process" msgstr "" -msgid "Tidy checks are done on CI." +msgid "All releases" msgstr "" -#, fuzzy -msgid "Documentation build" -msgstr "ドキュメントには改良が必要な場合があります。" +msgid "Kruskal - Family of functions" +msgstr "" -msgid "The doxygen documentation is built by default" +msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." msgstr "" -msgid "The HTML documentation is built by default" +msgid "**The main Characteristics are:**" msgstr "" -msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" +msgid "The total weight of all the edges in the tree or forest is minimized." msgstr "" -msgid "`WITH-DOC` is not used anymore" +msgid "Kruskal's running time: :math:`O(E * log E)`" msgstr "" #, fuzzy -msgid "User Documentation is not built when" -msgstr "ドキュメントには改良が必要な場合があります。" +msgid "Metrics - Family of functions" +msgstr "ダイクストラ関連機能" -msgid "Sphinx is not found" +msgid "Migration guide" msgstr "" -msgid "When all Sphinx formats are OFF" +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." msgstr "" -msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" +msgid "Results can be different because of the changes." msgstr "" -msgid "When all languages are OFF" +msgid "All deprecated functions will be removed on next major version 4.0.0" msgstr "" -msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" -msgstr "" +#, fuzzy +msgid "Migration to standardized columns" +msgstr "ダイクストラ関連機能" -msgid "Documentation output location: ``build/doc/_build/``" +msgid "There has been an effort to standardize function output columns names and types." msgstr "" -msgid "For example: for HTML output is on `build/doc/_build/html` directory" -msgstr "" +msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgid "Developers' Documentation is not built when" +msgid "|matrix-result|" msgstr "" -msgid "Doxygen is not found" -msgstr "" +msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" +msgid "|short-generic-result|" msgstr "" -msgid "Summary of changes by function" +msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" + +msgid "|result-spantree|" msgstr "" -msgid "pgr_aStar" -msgstr "pgr_aStar" +#, fuzzy +msgid "Function" +msgstr "序章" -msgid "Combinations signature promoted to official." +#, fuzzy +msgid ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +msgid "`Migration of single path functions`_" +msgstr "ダイクストラ関連機能" + +#, fuzzy +msgid ":doc:`pgr_aStar`" +msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +msgid ":doc:`pgr_bdAstar`" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid ":doc:`pgr_drivingDistance`" msgstr "" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +#, fuzzy +msgid "`Migration of spanning tree functions`_" +msgstr "ダイクストラ関連機能" -msgid "pgr_bandwidth" -msgstr "pgr_bandwidth" +#, fuzzy +msgid ":doc:`pgr_withPointsDD`" +msgstr "pgr_TSP" #, fuzzy -msgid "New experimental function." -msgstr "新しい **公式** 機能" +msgid ":doc:`pgr_bdDijkstra`" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdAstar" -msgstr "pgr_bdAstar" +#, fuzzy +msgid ":doc:`pgr_binaryBreadthFirstSearch`" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" +#, fuzzy +msgid ":doc:`pgr_bipartite`" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdDijkstra" -msgstr "pgr_bdDijkstra" +#, fuzzy +msgid "`Migration of output column name change`_" +msgstr "ダイクストラ関連機能" -msgid "Output columns standardized to |short-generic-result|" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_breadthFirstSearch`" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdDijkstraCost" -msgstr "pgr_bdDijkstraCost" +#, fuzzy +msgid ":doc:`pgr_depthFirstSearch`" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bellmanFord" -msgstr "pgr_bellmanFord" +#, fuzzy +msgid ":doc:`pgr_edgeColoring`" +msgstr "pgr_TSP" -msgid "pgr_binaryBreadthFirstSearch" -msgstr "pgr_binaryBreadthFirstSearch" +#, fuzzy +msgid "`Migration of multiple paths functions`_" +msgstr "ダイクストラ関連機能" -msgid "pgr_bipartite" -msgstr "pgr_bipartite" +msgid ":doc:`pgr_sequentialVertexColoring`" +msgstr "" -msgid "Output columns standardized to |result_node_color|" +#, fuzzy +msgid ":doc:`pgr_topologicalSort`" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid ":doc:`pgr_withPoints`" msgstr "" -msgid "pgr_boykovKolmogorov" -msgstr "pgr_boykovKolmogorov" +#, fuzzy +msgid "`Migration of cost functions`_" +msgstr "ダイクストラ関連機能" -msgid "pgr_breadthFirstSearch" -msgstr "pgr_breadthFirstSearch" +#, fuzzy +msgid "Migration of cost functions" +msgstr "ダイクストラ関連機能" -msgid ":" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" msgstr "" -msgid "Standardizing output columns to |result-spantree|" +msgid "The following functions need to be migrated when they are being used in an application." msgstr "" -msgid "pgr_contraction" -msgstr "pgr_contraction" +#, fuzzy +msgid "Version" +msgstr "バージョン 3.0.0" -msgid "Breaking change, signatures no longer available:" +msgid "From" msgstr "" -msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" + +msgid "v < 4.0" msgstr "" -msgid "pgr_dagShortestPath" -msgstr "pgr_dagShortestPath" +msgid "|matrix-pid|" +msgstr "" -msgid "pgr_depthFirstSearch" -msgstr "pgr_depthFirstSearch" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" -msgid "pgr_dijkstra" -msgstr "pgr_dijkstra" +msgid "**to** |matrix-result|" +msgstr "" -msgid "pgr_dijkstraCost" -msgstr "pgr_dijkstraCost" +#, fuzzy +msgid "Migration of |matrix-pid|" +msgstr "ダイクストラ関連機能" -msgid "pgr_dijkstraNear" -msgstr "pgr_dijkstraNear" +msgid "Signatures to be migrated:" +msgstr "" -msgid "Function promoted to official." +msgid "One to One" msgstr "" -msgid "pgr_dijkstraNearCost" -msgstr "pgr_dijkstraNearCost" +msgid "One to Many" +msgstr "" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" +msgid "Many to One" +msgstr "" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +msgid "Many to Many" +msgstr "" -msgid "Output columns standardized to |result_edge_color|" +msgid "Combinations" msgstr "" -msgid "pgr_edgeDisjointPaths" -msgstr "pgr_edgeDisjointPaths" +msgid "Breaking change" +msgstr "" -msgid "Output columns standardized to |generic-result|" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" msgstr "" -msgid "pgr_edmondsKarp" -msgstr "pgr_edmondsKarp" +msgid "New output columns are |matrix-result|" +msgstr "" -msgid "pgr_edwardMoore" -msgstr "pgr_edwardMoore" +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgstr "" -msgid "Version 3.2.0" +msgid "Examples" +msgstr "例" + +msgid "Examples for One to One for cost functions" msgstr "" #, fuzzy -msgid "New experimental signature:" -msgstr "新しい **公式** 機能" +msgid "Using ``pgr_withPointsCost``" +msgstr "ダイクストラ関連機能" -msgid "pgr_edwardMoore(Combinations)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "Version 3.0.0" -msgstr "バージョン 3.0.0" +msgid "from" +msgstr "" -msgid "pgr_kingOrdering" -msgstr "pgr_kingOrdering" +msgid "to" +msgstr "" -msgid "pgr_KSP" -msgstr "pgr_KSP" +msgid "Examples for One to Many for cost functions" +msgstr "" -msgid "All signatures promoted to official." +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid "Examples for Many to One for cost functions" +msgstr "" -msgid "pgr_maxCardinalityMatch(text,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_maxFlow" -msgstr "pgr_maxFlow" - -msgid "pgr_pushRelabel" -msgstr "pgr_pushRelabel" - -msgid "pgr_sequentialVertexColoring" -msgstr "pgr_sequentialVertexColoring" - -msgid "pgr_sloanOrdering" -msgstr "pgr_sloanOrdering" +msgid "Examples for Many to Many for cost functions" +msgstr "" -msgid "pgr_topologicalSort" -msgstr "pgr_topologicalSort" +msgid "Migrating `this v3.8 `__ example." +msgstr "" #, fuzzy -msgid "Standardize output to |result_node_order|" +msgid "Examples for Combinations for cost functions" msgstr "ダイクストラ関連機能" -msgid "pgr_transitiveClosure" -msgstr "pgr_transitiveClosure" +msgid "Migrating `this v3.8 `__ example." +msgstr "" #, fuzzy -msgid "Standardized output to |result-closure|" +msgid "Migration of multiple paths functions" msgstr "ダイクストラ関連機能" -msgid "pgr_trsp" -msgstr "pgr_trsp" - -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "" -msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" + +msgid "v < 3.6" msgstr "" -msgid "pgr_trspVia" -msgstr "pgr_trspVia" +msgid ":ref:`from_ksp_result`" +msgstr ":ref:`from_ksp_result`" -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgstr "" +msgid "``pgr_edgeDisjointPaths``" +msgstr "``pgr_edgeDisjointPaths``" -msgid "pgr_trspVia_withPoints" -msgstr "" +msgid ":ref:`from_result_disjoint`" +msgstr ":ref:`from_result_disjoint`" -msgid "**Driving side** parameter is positional unnamed." -msgstr "" +#, fuzzy +msgid "Migration of |ksp-result|" +msgstr "ダイクストラ関連機能" -msgid "Valid values depend on kind of graph" -msgstr "" +#, fuzzy +msgid "|nksp-result|" +msgstr "ダイクストラ関連機能" -msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Before updating pgRouting, enumerate the |ksp-result|" msgstr "" -msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "pgr_trsp_withPoints" +msgid "Using `this `__ example." msgstr "" -msgid "**Driving side** parameter is positional unnamed and compulsory." -msgstr "" +#, fuzzy +msgid "Migration of |result-disjoint|" +msgstr "ダイクストラ関連機能" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Before updating pgRouting, enumerate the |result-disjoint|" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Skip when applicable, ``start_vid``" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Skip when applicable, ``end_vid``" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_TSP" -msgstr "pgr_TSP" - -msgid "Results change depending on input order" +msgid "Before updating pgRouting enumerate the columns: |ksp-result|" msgstr "" #, fuzzy -msgid "Only for undirected graphs" -msgstr "導かれないグラフ" +msgid "Migration of single path functions" +msgstr "ダイクストラ関連機能" -msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "" -msgid "pgr_TSPeuclidean" -msgstr "pgr_TSPeuclidean" +msgid "``pgr_dijkstra``" +msgstr "``pgr_dijkstra``" -msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgid "v < 3.5" msgstr "" -msgid "pgr_turnRestrictedPath" -msgstr "pgr_turnRestrictedPath" - -msgid "Output columns standardized to |nksp-result|" +msgid "|old-generic-result|" msgstr "" -msgid "pgr_withPoints" -msgstr "pgr_withPoints" - -msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" +msgid "``pgr_aStar``" +msgstr "``pgr_aStar``" -msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" -msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" +msgid "``pgr_bellmanFord``" +msgstr "``pgr_bellmanFord``" -msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" +msgid "``pgr_dagShortestPath``" +msgstr "``pgr_dagShortestPath``" -msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "|result-1-1|" +msgstr "ダイクストラ関連機能" -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" +msgid "``pgr_edwardMoore``" +msgstr "``pgr_edwardMoore``" -msgid "**Driving side** parameter is unnamed and compulsory." -msgstr "" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" -msgid "Output columns standardized to |matrix-result|" +msgid "|old-pid-result|" msgstr "" -msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -msgstr "" +#, fuzzy +msgid "Migration of |old-generic-result|" +msgstr "ダイクストラ関連機能" -msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" -msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgid "Migration of |old-pid-result|" msgstr "" -msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgid "To get the old version column names, depending on the signature:" msgstr "" -msgid "pgr_withpointscost(text,text,text,boolean,character)" -msgstr "" +#, fuzzy +msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" +msgstr "start_vid から end_vid まで行くのにかかるコスト" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" +#, fuzzy +msgid "Rename the columns:" +msgstr "結果として返却されるカラム" -msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +msgid "``start_vid`` to ``start_pid``" msgstr "" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - -msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "``end_vid`` to ``end_pid``" msgstr "" -msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" +#, fuzzy +msgid "Migration of |result-1-1|" +msgstr "ダイクストラ関連機能" -msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "To get the old version column names:" msgstr "" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" +#, fuzzy +msgid "Filter out the columns: ``start_vid`` and ``end_vid``" +msgstr "start_vid から end_vid まで行くのにかかるコスト" -msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Examples with One to One with one route result" msgstr "" -msgid "Functions promoted to official" -msgstr "" +#, fuzzy +msgid "Using ``pgr_aStar``" +msgstr "pgr_TSP" -msgid "`#2701 `__: pgr_trsp" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2701 `__: pgr_trspVia" +msgid "Before updating pgRouting enumerate the columns: |result-1-1|" msgstr "" -msgid "`#2701 `__: pgr_trspVia_withPoints" -msgstr "" +#, fuzzy +msgid "Using ``pgr_bdDijkstra``" +msgstr "ダイクストラ関連機能" -msgid "`#2701 `__: pgr_trsp_withPoints" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2700 `__: pgr_withPoints" -msgstr "" +#, fuzzy +msgid "Using ``pgr_DAGshortestPath``" +msgstr "ダイクストラ関連機能" -msgid "`#2700 `__: pgr_withPointsCost" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgid "This applies to all signatures of ``pgr_DAGshortestPath``" msgstr "" -msgid "`#2700 `__: pgr_withPointsDD" +msgid "Examples for One to Many with one route result" msgstr "" -msgid "`#2700 `__: pgr_withPointsKSP" -msgstr "" +#, fuzzy +msgid "Using ``pgr_bdAstar``" +msgstr "ダイクストラ関連機能" -msgid "`#2700 `__: pgr_withPointsVia" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2983 `__: pgr_dijkstraNear" +msgid "Before updating pgRouting enumerate the columns: |result-1-m|" msgstr "" -msgid "`#2983 `__: pgr_dijkstraNearCost" -msgstr "" +#, fuzzy +msgid "Using ``pgr_withPoints``" +msgstr "pgr_TSP" -msgid "`#2983 `__: pgr_dijkstraVia" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "Signatures promoted to official" +msgid "|pid-1-m|" msgstr "" -msgid "`#2718 `__: pgr_aStar(Combinations)" -msgstr "" +#, fuzzy +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." +msgstr "start_vid から end_vid まで行くのにかかるコスト" -msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgid "Examples for Many to One with one route result" msgstr "" -msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgid "Before updating pgRouting enumerate the columns: |result-m-1|" msgstr "" -msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" -msgstr "" +#, fuzzy +msgid "Using ``pgr_dijkstra``" +msgstr "ダイクストラ関連機能" -msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgid "Migrating `this v3.4 `__ example." msgstr "" -msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgid "Examples for Many to Many with one route result" msgstr "" -msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2718 `__: pgr_KSP(All signatures)" +msgid "|pid-m-m|" msgstr "" -msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" +msgid "Examples for combinations with one route result" msgstr "" -msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgid "Migrating `this v3.8 `this `__ example." msgstr "" -msgid "`#2718 `__: pgr_maxFlow(Combinations)" +#, fuzzy +msgid "Migration of spanning tree functions" +msgstr "ダイクストラ関連機能" + +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" -msgid "`#2718 `__: pgr_pushRelabel(Combinations)" -msgstr "" +msgid "``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" -#, fuzzy -msgid "New experimental functions." -msgstr "新しい **公式** 機能" +msgid ":ref:`from_result_dij_dd`" +msgstr ":ref:`from_result_dij_dd`" -msgid "Metrics" -msgstr "" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" -msgid "`#2951 `__: pgr_bandwidth" -msgstr "" +msgid ":ref:`from_result_generic_no_seq`" +msgstr ":ref:`from_result_generic_no_seq`" -msgid "Ordering" -msgstr "" +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" -msgid "`#2954 `__: pgr_kingOrdering" +msgid "v < 3.7" msgstr "" -msgid "`#2955 `__: pgr_sloanOrdering" -msgstr "" +msgid ":ref:`from_result_bfs`" +msgstr ":ref:`from_result_bfs`" -msgid "SQL signatures and output standardization" -msgstr "" +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" -msgid "`#2904 `__: Standardize output columns of functions with different output" -msgstr "" +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" -msgid "columns within overloads" -msgstr "" +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" -#, fuzzy -msgid "Standardized to |short-generic-result|" -msgstr "ダイクストラ関連機能" +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" -msgid "`#2905 `__: pgr_withPoints" -msgstr "" +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" -msgid "`#2906 `__: pgr_bdDijkstra" -msgstr "" +msgid "``pgr_breadthFisrtSearch``" +msgstr "``pgr_breadthFisrtSearch``" -msgid "`#2907 `__: pgr_bellmanFord" +msgid "v < 4.0.0" msgstr "" -msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgstr "" +msgid "``pgr_depthFisrtSearch``" +msgstr "``pgr_depthFisrtSearch``" -msgid "`#2910 `__: pgr_edwardMoore" +msgid "to |result-spantree|" msgstr "" -msgid "`#2913 `__: pgr_dagShortestPath" -msgstr "" +#, fuzzy +msgid "Migration from |result-bfs|." +msgstr "ダイクストラ関連機能" -msgid "Standardized to |matrix-result|" +msgid "Single vertex" msgstr "" -msgid "`#2905 `__: pgr_withPointsCost" +msgid "Multiple vertices" msgstr "" -msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|" msgstr "" #, fuzzy -msgid "Standardized to |generic-result|" -msgstr "ダイクストラ関連機能" +msgid "Single vertex example using ``pgr_kruskalDD``" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgid "Migrating `this v3.6 `__ example." msgstr "" -msgid "`#2909 `__: pgr_turnRestrictedPath" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|." msgstr "" -msgid "Standardized to |result_edge_color|" -msgstr "" +#, fuzzy +msgid "Multiple vertices example using ``pgr_kruskalDFS``" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "`#2924 `__: pgr_edgeColoring" +msgid "Migrating `this v3.6 `__ example." msgstr "" -msgid "Standardized to |result_node_color|" -msgstr "" +#, fuzzy +msgid "Migration from |result-dij-dd|" +msgstr "ダイクストラ関連機能" -msgid "`#2924 `__: pgr_bipartite" +msgid "Migration depends on the signature." msgstr "" -msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgid "For single vertex:" msgstr "" -msgid "Standardized to |result-spantree|" +msgid "Before updating pgRouting, enumerate |result-1-1| columns" msgstr "" -msgid "`#2931 `__: pgr_breadthFirstSearch" +msgid "For multiple vertices:" msgstr "" -msgid "`#2931 `__: pgr_depthFirstSearch" +msgid "Changes must be done after updating pgRouting." msgstr "" -#, fuzzy -msgid "Standardized to |result_node_order|" -msgstr "ダイクストラ関連機能" - -msgid "`#2934 `__: pgr_topologicalSort" +msgid "To get the old version column names |result-dij-dd-m|:" msgstr "" #, fuzzy -msgid "Standardized to |result-closure|" -msgstr "ダイクストラ関連機能" +msgid "filter out the column ``pred`` and ``depth`` and" +msgstr "start_vid から end_vid まで行くのにかかるコスト" -msgid "`#2934 `__: pgr_transitiveClosure" +msgid "rename ``start_vid`` to ``from_v``." msgstr "" -msgid "Removal of SQL deprecated signatures" +msgid "Single vertex example using ``pgr_drivingDistance``" msgstr "" -msgid "`#2798 `__: pgr_contraction" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2683 `__: pgr_trsp" +msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "`#2683 `__: pgr_trspVia" +msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr "" -msgid "`#2888 `__: pgr_findCloseEdges" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" -msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "" +#, fuzzy +msgid "Migration of |result-generic-no-seq|" +msgstr "ダイクストラ関連機能" -msgid "`#2890 `__: pgr_withPointsDD" +msgid "After updating pgRouting:" msgstr "" -msgid "`#2895 `__: pgr_withPointsKSP" +msgid "Enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." msgstr "" -msgid "`#2901 `__: pgr_TSP" +msgid "Enumerate |result-m-1-no-seq| columns" msgstr "" -msgid "`#2901 `__: pgr_TSPeuclidean" +msgid "Default value of **driving side** parameter" msgstr "" -msgid "Removal of SQL deprecated functions" +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "" -msgid "`#2681 `__: pgr_trspViaedges" +msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" msgstr "" -msgid "`#2682 `__: pgr_trspViaVertices" +msgid "Default value = 'r';" msgstr "" -msgid "`#2748 `__: pgr_alphaShape" +msgid "In undirected graph: valid values are [``b``, ``B``]" msgstr "" -msgid "`#2751 `__: pgr_createTopology" +msgid "Default value = 'b';" msgstr "" -msgid "`#2752 `__: pgr_analyzeGraph" -msgstr "" +#, fuzzy +msgid "Single vertex example using ``pgr_withPointsDD``" +msgstr "pgr_TSP" -msgid "`#2755 `__: pgr_analyzeOneWay" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2827 `__: pgr_createVerticesTable" -msgstr "" +#, fuzzy +msgid "Multiple vertices example using ``pgr_withPointsDD``" +msgstr "pgr_TSP" -msgid "`#2886 `__: pgr_nodeNetwork" +msgid "Migrating `this v3.5 `__ example." msgstr "" #, fuzzy -msgid "Removal of SQL deprecated internal functions" -msgstr "新しい **公式** 機能" +msgid "Migration of output column name change" +msgstr "ダイクストラ関連機能" -msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" -msgstr "" +#, fuzzy +msgid "The standardized result columns:" +msgstr "結果として返却されるカラム" -msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgid "|result_edge_color|" msgstr "" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgid "|result_node_color|" msgstr "" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "|result_node_order|" +msgstr "ダイクストラ関連機能" -msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "Changes on column names must be done after updating pgRouting." msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgstr "" +msgid "``pgr_edgeColoring``" +msgstr "``pgr_edgeColoring``" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" -msgstr "" +msgid ":ref:`from_old_edge_color`" +msgstr ":ref:`from_old_edge_color`" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgstr "" +msgid "``pgr_bipartite``" +msgstr "``pgr_bipartite``" -msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" -msgstr "" +msgid ":ref:`from_old_node_color`" +msgstr ":ref:`from_old_node_color`" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgstr "" +msgid "``pgr_sequentialVertexColoring``" +msgstr "``pgr_sequentialVertexColoring``" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgstr "" +msgid "``pgr_topologicalSort``" +msgstr "``pgr_topologicalSort``" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgstr "" +msgid ":ref:`from_toposort`" +msgstr ":ref:`from_toposort`" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgstr "" +msgid "``pgr_transitiveClosure``" +msgstr "``pgr_transitiveClosure``" -msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" -msgstr "" +msgid ":ref:`from_old_closure`" +msgstr ":ref:`from_old_closure`" -msgid "`#2861 `__ _pgr_endPoint(geometry)" -msgstr "" +#, fuzzy +msgid "Migration from |result-old-closure|" +msgstr "ダイクストラ関連機能" -msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "Migration to: |result-old-closure|" +msgstr "ダイクストラ関連機能" -msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgid "After update:" msgstr "" -msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "Remove column ``seq``" +msgstr "結果として返却されるカラム" -msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" msgstr "" -msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" -msgstr "" +#, fuzzy +msgid "Migration from |result-toposort|" +msgstr "ダイクストラ関連機能" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "Migration to: |result_node_order|" +msgstr "ダイクストラ関連機能" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "Rename ``sorted_v`` to ``node``" msgstr "" -msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgstr "" +#, fuzzy +msgid "Migration from |old-edge-color|" +msgstr "ダイクストラ関連機能" -msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgstr "" - -msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -msgstr "" - -msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" -msgstr "" - -msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" -msgstr "" - -msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgstr "" - -msgid "`#2861 `__ _pgr_msg(integer,text,text)" -msgstr "" - -msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" -msgstr "" - -msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" -msgstr "" - -msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" -msgstr "" - -msgid "`#2861 `__ _pgr_quote_ident(text)" -msgstr "" - -msgid "`#2861 `__ _pgr_startPoint(geometry)" -msgstr "" - -msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "" - -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "" - -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "" - -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "" - -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "" - -msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgstr "" - -msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "" - -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" - -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "" - -msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "" - -msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "" - -msgid "`#2861 `__ _pgr_versionLess(text,text)" -msgstr "" - -msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "" - -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" -msgstr "" - -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "" - -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgstr "" - -msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgstr "" - -msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "" - -msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" -msgstr "" - -msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" -msgstr "" - -msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" -msgstr "" - -msgid "Summary of functions and signatures no longer on pgrouting" -msgstr "" - -msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" -msgstr "" - -msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgstr "" - -msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" -msgstr "" - -msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "" - -msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" -msgstr "" - -msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" -msgstr "" - -msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "" - -msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "" - -msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgstr "" - -msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgstr "" - -msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "" - -msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "" - -msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "" - -msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "" - -msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "" - -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" - -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" - -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" - -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" - -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "" - -msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "" - -msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "" - -msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -msgstr "" - -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -msgstr "" - -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgstr "" - -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgstr "" - -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgstr "" - -msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" -msgstr "" - -msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "" +#, fuzzy +msgid "Migration to: |result_edge_color|" +msgstr "ダイクストラ関連機能" -msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." msgstr "" -msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration from |old-node-color|" +msgstr "ダイクストラ関連機能" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration to: |result_node_color|" +msgstr "ダイクストラ関連機能" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration of deleted functions" +msgstr "ダイクストラ関連機能" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "Functions no longer on pgRouting" msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration of ``pgr_alphaShape``" +msgstr "ダイクストラ関連機能" -msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Deprecated" msgstr "" -msgid "Code enhancements" +msgid "`v3.8.0 `__" msgstr "" -msgid "Removal of unused C/C++ code" +msgid "Removed" msgstr "" -msgid "Refactor the Script to build the update PostgreSQL file." +msgid "`v4.0.0 `__" msgstr "" -msgid "One process & driver for:" +msgid "**Before Deprecation:** The following was calculated:" msgstr "" -msgid "allpairs: johnson and Floyd-Warshall" +msgid "An alphaShape was calculated" msgstr "" -msgid "Shortest path: Dijkstra and withPoints using Dijkstra" -msgstr "" +#, fuzzy +msgid "**After Deprecation:**" +msgstr "もっと詳しく知る" -msgid "Deprecation of internal C/C++ functions" +msgid "PostGIS has two ways of generating alphaShape." msgstr "" -msgid "Deprecated functions are substituted by new function." +msgid "If you have SFCGAL, which you can install using" msgstr "" -msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" -msgid "_pgr_withPointsDD => _pgr_withPointsddv4" +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" msgstr "" -msgid "_pgr_kruskal => _pgr_kruskalv4" +msgid "Other PostGIS options are" msgstr "" -msgid "_pgr_prim => _pgr_primv4" +msgid "`ST_ConvexHull `__" msgstr "" -msgid "_pgr_dijkstra => _pgr_dijkstra_v4" +msgid "`ST_ConcaveHull `__" msgstr "" -msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" -msgstr "" +#, fuzzy +msgid "Migration of ``pgr_nodeNetwork``" +msgstr "ダイクストラ関連機能" -msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" -msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" -msgstr "" +#, fuzzy +msgid "**Migration**" +msgstr "もっと詳しく知る" -msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" +msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" msgstr "" -msgid "Internal C/C++ functions in legacy" -msgstr "" +#, fuzzy +msgid "Migration of ``pgr_createTopology``" +msgstr "ダイクストラ関連機能" -msgid "`#2683 `__ _trsp" +msgid "A table with `_vertices_pgr` was created." msgstr "" -msgid "`#2683 `__ _v4trsp" +msgid "**After Deprecation:** The user is responsible to create the complete topology." msgstr "" -msgid "`#2748 `__ _pgr_alphaShape" +msgid "Build a routing topology" msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath" +msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." msgstr "" -msgid "All releases" +msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." msgstr "" -msgid "Kruskal - Family of functions" +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." msgstr "" -msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." msgstr "" -msgid "**The main Characteristics are:**" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" msgstr "" -msgid "The total weight of all the edges in the tree or forest is minimized." +msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." msgstr "" -msgid "Kruskal's running time: :math:`O(E * log E)`" +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." msgstr "" #, fuzzy -msgid "Metrics - Family of functions" +msgid "Migration of ``pgr_createVerticesTable``" msgstr "ダイクストラ関連機能" -msgid "Migration guide" -msgstr "" - -msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." -msgstr "" - -msgid "Results can be different because of the changes." +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." msgstr "" -msgid "All deprecated functions will be removed on next major version 4.0.0" +msgid "Migration of ``pgr_analyzeOneWay``" msgstr "" -#, fuzzy -msgid "Migration to standardized columns" -msgstr "ダイクストラ関連機能" - -msgid "There has been an effort to standardize function output columns names and types." +msgid "Number of potential problems in directionality" msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" - -msgid "|matrix-result|" +msgid "WHERE" msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" - -msgid "|short-generic-result|" +msgid "Directionality problems were calculated based on codes." msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" - -msgid "|result-spantree|" +msgid "Dead ends." msgstr "" -#, fuzzy -msgid "Function" -msgstr "序章" - -#, fuzzy -msgid ":doc:`pgr_dijkstra`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid "`Migration of single path functions`_" -msgstr "ダイクストラ関連機能" - -#, fuzzy -msgid ":doc:`pgr_aStar`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid ":doc:`pgr_bdAstar`" -msgstr ":doc:`pgr_kruskalBFS`" - -msgid ":doc:`pgr_drivingDistance`" +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" msgstr "" -#, fuzzy -msgid "`Migration of spanning tree functions`_" -msgstr "ダイクストラ関連機能" - -#, fuzzy -msgid ":doc:`pgr_withPointsDD`" -msgstr "pgr_TSP" - -#, fuzzy -msgid ":doc:`pgr_bdDijkstra`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid ":doc:`pgr_binaryBreadthFirstSearch`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid ":doc:`pgr_bipartite`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid "`Migration of output column name change`_" -msgstr "ダイクストラ関連機能" - -#, fuzzy -msgid ":doc:`pgr_breadthFirstSearch`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid ":doc:`pgr_depthFirstSearch`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid ":doc:`pgr_edgeColoring`" -msgstr "pgr_TSP" - -#, fuzzy -msgid "`Migration of multiple paths functions`_" -msgstr "ダイクストラ関連機能" - -msgid ":doc:`pgr_sequentialVertexColoring`" +msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." msgstr "" -#, fuzzy -msgid ":doc:`pgr_topologicalSort`" -msgstr ":doc:`pgr_kruskalBFS`" - -msgid ":doc:`pgr_withPoints`" +msgid "In this example :doc:`pgr_extractVertices` has already been applied." msgstr "" -#, fuzzy -msgid "`Migration of cost functions`_" -msgstr "ダイクストラ関連機能" - -#, fuzzy -msgid "Migration of cost functions" -msgstr "ダイクストラ関連機能" - -msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgid "Bridges." msgstr "" -msgid "The following functions need to be migrated when they are being used in an application." +msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." msgstr "" -#, fuzzy -msgid "Version" -msgstr "バージョン 3.0.0" - -msgid "From" +msgid "To determine if the bridges are or not one way." msgstr "" -msgid "``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" - -msgid "v < 4.0" +msgid "Migration of ``pgr_analyzeGraph``" msgstr "" -msgid "|matrix-pid|" +msgid "Number of isolated segments." msgstr "" -msgid "``pgr_withPointsCostMatrix``" -msgstr "``pgr_withPointsCostMatrix``" - -msgid "**to** |matrix-result|" +msgid "Number of dead ends." msgstr "" -#, fuzzy -msgid "Migration of |matrix-pid|" -msgstr "ダイクストラ関連機能" - -msgid "Signatures to be migrated:" +msgid "Number of potential gaps found near dead ends." msgstr "" -msgid "One to One" +msgid "Number of intersections. (between 2 edges)" msgstr "" -msgid "One to Many" +msgid "Graph component" msgstr "" -msgid "Many to One" +msgid "A connected subgraph that is not part of any larger connected subgraph." msgstr "" -msgid "Many to Many" +msgid "Isolated segment" msgstr "" -msgid "Combinations" +msgid "A graph component with only one segment." msgstr "" -msgid "Breaking change" +msgid "Dead ends" msgstr "" -msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgid "A vertex that participates in only one edge." msgstr "" -msgid "New output columns are |matrix-result|" +msgid "gaps" msgstr "" -msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgid "Space between two geometries." msgstr "" -msgid "Examples" -msgstr "例" +#, fuzzy +msgid "Intersection" +msgstr "序章" -msgid "Examples for One to One for cost functions" +msgid "Is a topological relationship between two geometries." msgstr "" #, fuzzy -msgid "Using ``pgr_withPointsCost``" -msgstr "ダイクストラ関連機能" +msgid "Migration." +msgstr "もっと詳しく知る" -msgid "Migrating `this v3.8 `__ example." +#, fuzzy +msgid "Components." +msgstr "コンテンツ" + +msgid "Instead of counting only isolated segments, determine all the components of the graph." msgstr "" -msgid "from" +msgid "Depending of the final application requirements use:" msgstr "" -msgid "to" +msgid ":doc:`pgr_connectedComponents`" msgstr "" -msgid "Examples for One to Many for cost functions" +#, fuzzy +msgid ":doc:`pgr_strongComponents`" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid ":doc:`pgr_biconnectedComponents`" msgstr "" -msgid "Migrating `this v3.8 `__ example." +#, fuzzy +msgid "For example:" +msgstr "例" + +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." msgstr "" -msgid "Examples for Many to One for cost functions" +msgid "Potential gaps near dead ends." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" -msgid "Examples for Many to Many for cost functions" +msgid "Topological relationships." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -#, fuzzy -msgid "Examples for Combinations for cost functions" -msgstr "ダイクストラ関連機能" +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "" #, fuzzy -msgid "Migration of multiple paths functions" -msgstr "ダイクストラ関連機能" +msgid "Signature:" +msgstr "機能" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" +msgid "`v3.4.0 `__" msgstr "" -msgid "``pgr_KSP``" -msgstr "``pgr_KSP``" - -msgid "v < 3.6" +msgid ":doc:`pgr_trsp`" msgstr "" -msgid ":ref:`from_ksp_result`" -msgstr ":ref:`from_ksp_result`" - -msgid "``pgr_edgeDisjointPaths``" -msgstr "``pgr_edgeDisjointPaths``" - -msgid ":ref:`from_result_disjoint`" -msgstr ":ref:`from_result_disjoint`" - #, fuzzy -msgid "Migration of |ksp-result|" +msgid "`Migration of restrictions`_" msgstr "ダイクストラ関連機能" -#, fuzzy -msgid "|nksp-result|" -msgstr "ダイクストラ関連機能" +msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgstr "" -msgid "Before updating pgRouting, enumerate the |ksp-result|" +msgid "Use :doc:`pgr_dijkstra` instead." msgstr "" -msgid "One to One example using ``pgr_KSP``" +msgid "To get the original column names:" msgstr "" -msgid "Using `this `__ example." +msgid "``id1`` is the node" msgstr "" -#, fuzzy -msgid "Migration of |result-disjoint|" -msgstr "ダイクストラ関連機能" +msgid "``id2`` is the edge" +msgstr "" -msgid "Before updating pgRouting, enumerate the |result-disjoint|" +msgid "Use ``pgr_trsp`` when there are restrictions." msgstr "" -msgid "Skip when applicable, ``start_vid``" +msgid "Use :doc:`pgr_trsp` (One to One) instead." msgstr "" -msgid "Skip when applicable, ``end_vid``" +msgid "Migration of ``pgr_trsp`` (Edges)" msgstr "" -msgid "One to One example using ``pgr_edgeDisjointPaths``" +msgid ":doc:`pgr_trsp_withPoints`" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Migration of ``pgr_trspViaVertices``" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |ksp-result|" +msgid ":doc:`pgr_dijkstraVia`" msgstr "" -#, fuzzy -msgid "Migration of single path functions" -msgstr "ダイクストラ関連機能" +msgid ":doc:`pgr_trspVia`" +msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" msgstr "" -msgid "``pgr_dijkstra``" -msgstr "``pgr_dijkstra``" +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "" -msgid "v < 3.5" +msgid "``id1`` is the path identifier" msgstr "" -msgid "|old-generic-result|" +msgid "``id2`` is the node" msgstr "" -msgid "``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "``id3`` is the edge" +msgstr "" -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr "" -msgid "``pgr_bellmanFord``" -msgstr "``pgr_bellmanFord``" +msgid "Use :doc:`pgr_trspVia` instead." +msgstr "" -msgid "``pgr_dagShortestPath``" -msgstr "``pgr_dagShortestPath``" +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "" -#, fuzzy -msgid "|result-1-1|" -msgstr "ダイクストラ関連機能" +msgid ":doc:`pgr_withPointsVia`" +msgstr "" -msgid "``pgr_edwardMoore``" -msgstr "``pgr_edwardMoore``" +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr "" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgstr "" -msgid "|old-pid-result|" +msgid "Use :doc:`pgr_withPointsVia` instead." msgstr "" -#, fuzzy -msgid "Migration of |old-generic-result|" -msgstr "ダイクストラ関連機能" +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr "" -msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" +msgid "Use :doc:`pgr_trspVia_withPoints` instead." msgstr "" -msgid "Migration of |old-pid-result|" +msgid "Not yet classified migrations" msgstr "" -msgid "To get the old version column names, depending on the signature:" +msgid "Migration of ``pgr_withPointsKSP``" msgstr "" -#, fuzzy -msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" -msgstr "start_vid から end_vid まで行くのにかかるコスト" +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "" -#, fuzzy -msgid "Rename the columns:" -msgstr "結果として返却されるカラム" +msgid "|ksp-result|" +msgstr "" -msgid "``start_vid`` to ``start_pid``" +msgid "|generic-result|" msgstr "" -msgid "``end_vid`` to ``end_pid``" +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." msgstr "" -msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" +msgid "``pgr_withPointsKSP`` (`One to One`)" msgstr "" #, fuzzy -msgid "Migration of |result-1-1|" -msgstr "ダイクストラ関連機能" +msgid "Before Migration" +msgstr "もっと詳しく知る" -msgid "To get the old version column names:" +msgid "Output columns were |old-pid-result|" msgstr "" -#, fuzzy -msgid "Filter out the columns: ``start_vid`` and ``end_vid``" -msgstr "start_vid から end_vid まで行くのにかかるコスト" +msgid "the columns ``start_vid`` and ``end_vid`` do not exist." +msgstr "" -msgid "Examples with One to One with one route result" +msgid "Migration" msgstr "" -#, fuzzy -msgid "Using ``pgr_aStar``" -msgstr "pgr_TSP" +msgid "Be aware of the existence of the additional result Columns." +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "New output columns are |generic-result|" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-1-1|" +msgid "Using `this `__ example." msgstr "" -#, fuzzy -msgid "Using ``pgr_bdDijkstra``" -msgstr "ダイクストラ関連機能" +msgid "``start_vid`` contains the **start vid** parameter value." +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "``end_vid`` contains the **end vid** parameter value." msgstr "" -#, fuzzy -msgid "Using ``pgr_DAGshortestPath``" -msgstr "ダイクストラ関連機能" +msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "" -msgid "This applies to all signatures of ``pgr_DAGshortestPath``" +msgid "Use :doc:`pgr_withPoints` (One to One) instead." msgstr "" -msgid "Examples for One to Many with one route result" +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." msgstr "" -#, fuzzy -msgid "Using ``pgr_bdAstar``" -msgstr "ダイクストラ関連機能" +msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-1-m|" +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." msgstr "" -#, fuzzy -msgid "Using ``pgr_withPoints``" -msgstr "pgr_TSP" +msgid "Starting from `v3.4.0 `__" +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Signature to be migrated:" msgstr "" -msgid "|pid-1-m|" +msgid "Migration is needed, because:" +msgstr "" + +msgid "Use ``cost`` and ``reverse_cost`` on the inner query" +msgstr "" + +msgid "Results are ordered" +msgstr "" + +msgid "Works for undirected graphs." msgstr "" -#, fuzzy -msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." -msgstr "start_vid から end_vid まで行くのにかかるコスト" - -msgid "Examples for Many to One with one route result" +msgid "New signature" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-m-1|" +msgid "The optional flag ``directed`` is removed." msgstr "" #, fuzzy -msgid "Using ``pgr_dijkstra``" -msgstr "ダイクストラ関連機能" +msgid "Before migration" +msgstr "もっと詳しく知る" -msgid "Migrating `this v3.4 `__ example." +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." msgstr "" -msgid "Examples for Many to Many with one route result" +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "The flag ``directed`` is ignored." msgstr "" -msgid "|pid-m-m|" +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." msgstr "" -msgid "Examples for combinations with one route result" +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." msgstr "" -msgid "Migrating `this v3.8 `this `__ example." +msgid "Do not use the flag ``directed``." msgstr "" -#, fuzzy -msgid "Migration of spanning tree functions" -msgstr "ダイクストラ関連機能" - -msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" +msgid "In the query returns only ``edge`` column." msgstr "" -msgid "``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" - -msgid ":ref:`from_result_dij_dd`" -msgstr ":ref:`from_result_dij_dd`" - -msgid "``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" - -msgid ":ref:`from_result_generic_no_seq`" -msgstr ":ref:`from_result_generic_no_seq`" +msgid "Migration of restrictions" +msgstr "" -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "The structure of the restrictions have changed:" +msgstr "" -msgid "v < 3.7" +msgid "Old restrictions structure" msgstr "" -msgid ":ref:`from_result_bfs`" -msgstr ":ref:`from_result_bfs`" +msgid "On the deprecated signatures:" +msgstr "" -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" +msgid "Column ``rid`` is ignored" +msgstr "" -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid "``via_path``" +msgstr "``via_path``" -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" +msgid "Must be in reverse order." +msgstr "" -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" +msgid "Is of type ``TEXT``." +msgstr "" -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" +msgid "When more than one via edge must be separated with ``,``." +msgstr "" -msgid "``pgr_breadthFisrtSearch``" -msgstr "``pgr_breadthFisrtSearch``" +msgid "``target_id``" +msgstr "``target_id``" -msgid "v < 4.0.0" +msgid "Is the last edge of the forbidden path." msgstr "" -msgid "``pgr_depthFisrtSearch``" -msgstr "``pgr_depthFisrtSearch``" - -msgid "to |result-spantree|" +msgid "Is of type ``INTEGER``." msgstr "" -#, fuzzy -msgid "Migration from |result-bfs|." -msgstr "ダイクストラ関連機能" +msgid "``to_cost``" +msgstr "``to_cost``" -msgid "Single vertex" +msgid "Is of type ``FLOAT``." msgstr "" -msgid "Multiple vertices" +msgid "Creation of the old restrictions table" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|" +msgid "Old restrictions fill up" msgstr "" -#, fuzzy -msgid "Single vertex example using ``pgr_kruskalDD``" -msgstr ":doc:`pgr_kruskalBFS`" +msgid "Old restrictions contents" +msgstr "" -msgid "Migrating `this v3.6 `__ example." +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|." +msgid ":math:`3\\rightarrow5`" msgstr "" -#, fuzzy -msgid "Multiple vertices example using ``pgr_kruskalDFS``" -msgstr ":doc:`pgr_kruskalBFS`" +msgid "is on column ``via_path`` in reverse order" +msgstr "" -msgid "Migrating `this v3.6 `__ example." +msgid "is of type ``TEXT``" msgstr "" -#, fuzzy -msgid "Migration from |result-dij-dd|" -msgstr "ダイクストラ関連機能" +msgid ":math:`9`" +msgstr ":math:`9`" -msgid "Migration depends on the signature." +msgid "is on column ``target_id``" msgstr "" -msgid "For single vertex:" +msgid "is of type ``INTEGER``" msgstr "" -msgid "Before updating pgRouting, enumerate |result-1-1| columns" +msgid "New restrictions structure" msgstr "" -msgid "For multiple vertices:" +msgid "Column ``id`` is ignored" msgstr "" -msgid "Changes must be done after updating pgRouting." +msgid "Column ``path``" msgstr "" -msgid "To get the old version column names |result-dij-dd-m|:" +msgid "Is of type ``ARRAY[ANY-INTEGER]``." msgstr "" -#, fuzzy -msgid "filter out the column ``pred`` and ``depth`` and" -msgstr "start_vid から end_vid まで行くのにかかるコスト" - -msgid "rename ``start_vid`` to ``from_v``." +msgid "Contains all the edges involved on the restriction." msgstr "" -msgid "Single vertex example using ``pgr_drivingDistance``" +msgid "The array has the ordered edges of the restriction." msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Column ``cost``" msgstr "" -msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" +msgid "Is of type ``ANY-NUMERICAL``" msgstr "" -msgid "Multiple vertices example using ``pgr_drivingDistance``" +msgid "The creation of the restrictions table" msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Adding the restrictions" msgstr "" -msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid "Restrictions data" msgstr "" -#, fuzzy -msgid "Migration of |result-generic-no-seq|" -msgstr "ダイクストラ関連機能" +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgstr "" -msgid "After updating pgRouting:" +msgid "By inspection the path is clear." msgstr "" -msgid "Enumerate |result-1-1-no-seq| columns" +msgid "To transform the old restrictions table to the new restrictions structure," msgstr "" -msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgid "Create a new table with the new restrictions structure." msgstr "" -msgid "Enumerate |result-m-1-no-seq| columns" +msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" -msgid "Default value of **driving side** parameter" +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." msgstr "" -msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." +msgid "``_pgr_array_reverse``:" msgstr "" -msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" +msgid "Was created temporally for this migration" msgstr "" -msgid "Default value = 'r';" +msgid "Is not documented." msgstr "" -msgid "In undirected graph: valid values are [``b``, ``B``]" +msgid "Will be removed on the next mayor version 4.0.0" msgstr "" -msgid "Default value = 'b';" +msgid "The migrated table contents:" msgstr "" #, fuzzy -msgid "Single vertex example using ``pgr_withPointsDD``" -msgstr "pgr_TSP" - -msgid "Migrating `this v3.5 `__ example." -msgstr "" +msgid ":doc:`pgRouting-concepts`" +msgstr ":doc:`pgr_kruskalBFS`" #, fuzzy -msgid "Multiple vertices example using ``pgr_withPointsDD``" -msgstr "pgr_TSP" +msgid "Ordering - Family of functions" +msgstr "ダイクストラ関連機能" -msgid "Migrating `this v3.5 `__ example." +msgid "pgRouting Concepts" msgstr "" -#, fuzzy -msgid "Migration of output column name change" -msgstr "ダイクストラ関連機能" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgstr "" -#, fuzzy -msgid "The standardized result columns:" -msgstr "結果として返却されるカラム" +msgid "Graphs" +msgstr "" -msgid "|result_edge_color|" +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" msgstr "" -msgid "|result_node_color|" +msgid ":math:`V` is a set of vertices, also called nodes." msgstr "" -#, fuzzy -msgid "|result_node_order|" -msgstr "ダイクストラ関連機能" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgstr "" -msgid "Changes on column names must be done after updating pgRouting." +msgid "There are different kinds of graphs:" msgstr "" -msgid "``pgr_edgeColoring``" -msgstr "``pgr_edgeColoring``" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgstr "" -msgid ":ref:`from_old_edge_color`" -msgstr ":ref:`from_old_edge_color`" +msgid "Undirected simple graph" +msgstr "" -msgid "``pgr_bipartite``" -msgstr "``pgr_bipartite``" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgstr "" -msgid ":ref:`from_old_node_color`" -msgstr ":ref:`from_old_node_color`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgstr "" -msgid "``pgr_sequentialVertexColoring``" -msgstr "``pgr_sequentialVertexColoring``" +msgid "Directed simple graph" +msgstr "" -msgid "``pgr_topologicalSort``" -msgstr "``pgr_topologicalSort``" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr "" -msgid ":ref:`from_toposort`" -msgstr ":ref:`from_toposort`" +msgid "Graphs:" +msgstr "" -msgid "``pgr_transitiveClosure``" -msgstr "``pgr_transitiveClosure``" +msgid "Do not have geometries." +msgstr "" -msgid ":ref:`from_old_closure`" -msgstr ":ref:`from_old_closure`" +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgstr "" -#, fuzzy -msgid "Migration from |result-old-closure|" -msgstr "ダイクストラ関連機能" +msgid "In pgRouting there are several ways to represent a graph on the database:" +msgstr "" -#, fuzzy -msgid "Migration to: |result-old-closure|" -msgstr "ダイクストラ関連機能" +msgid "With ``cost``" +msgstr "" + +msgid "(``id``, ``source``, ``target``, ``cost``)" +msgstr "" -msgid "After update:" +msgid "With ``cost`` and ``reverse_cost``" msgstr "" -#, fuzzy -msgid "Remove column ``seq``" -msgstr "結果として返却されるカラム" +msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgstr "" -msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." msgstr "" -#, fuzzy -msgid "Migration from |result-toposort|" -msgstr "ダイクストラ関連機能" +msgid "Identifier of a vertex." +msgstr "" -#, fuzzy -msgid "Migration to: |result_node_order|" -msgstr "ダイクストラ関連機能" +msgid "Weight of the edge (``source``, ``target``):" +msgstr "" -msgid "Rename ``sorted_v`` to ``node``" +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "" -#, fuzzy -msgid "Migration from |old-edge-color|" -msgstr "ダイクストラ関連機能" +msgid "``cost`` must exist in the query." +msgstr "" -#, fuzzy -msgid "Migration to: |result_edge_color|" -msgstr "ダイクストラ関連機能" +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "" -msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." msgstr "" -#, fuzzy -msgid "Migration from |old-node-color|" -msgstr "ダイクストラ関連機能" +msgid "Graph with ``cost``" +msgstr "" -#, fuzzy -msgid "Migration to: |result_node_color|" -msgstr "ダイクストラ関連機能" +msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgstr "" -msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." +msgid "Graph data is obtained with a query" msgstr "" -#, fuzzy -msgid "Migration of deleted functions" -msgstr "ダイクストラ関連機能" +msgid "``SELECT id, source, target, cost FROM edges``" +msgstr "" -msgid "Functions no longer on pgRouting" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_alphaShape``" -msgstr "ダイクストラ関連機能" +msgid "Edges where ``cost`` is non negative are part of the graph." +msgstr "" -msgid "Deprecated" +msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" msgstr "" -msgid "`v3.8.0 `__" +msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" -msgid "Removed" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" -msgid "`v4.0.0 `__" +msgid "For the following data:" msgstr "" -msgid "**Before Deprecation:** The following was calculated:" +msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." msgstr "" -msgid "An alphaShape was calculated" +msgid "The data is representing the following graph:" msgstr "" -#, fuzzy -msgid "**After Deprecation:**" -msgstr "もっと詳しく知る" +msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "" -msgid "PostGIS has two ways of generating alphaShape." +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" msgstr "" -msgid "If you have SFCGAL, which you can install using" +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." msgstr "" -msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgid "Graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" msgstr "" -msgid "Other PostGIS options are" +msgid "The set of edges :math:`E`:" msgstr "" -msgid "`ST_ConvexHull `__" +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" msgstr "" -msgid "`ST_ConcaveHull `__" +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." msgstr "" -#, fuzzy -msgid "Migration of ``pgr_nodeNetwork``" -msgstr "ダイクストラ関連機能" +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "" -msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." +msgid "The set of vertices :math:`V`:" +msgstr "ノードのセット :math:`V`:" + +msgid "In a directed graph both edges have directionality" msgstr "" -#, fuzzy -msgid "**Migration**" -msgstr "もっと詳しく知る" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "" -msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_createTopology``" -msgstr "ダイクストラ関連機能" +msgid "Edges not part of the graph:" +msgstr "" -msgid "A table with `_vertices_pgr` was created." +msgid ":math:`2` (:math:`1 \\rightarrow 3`)" msgstr "" -msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgid ":math:`3` (:math:`3 \\rightarrow 2`)" msgstr "" -msgid "Build a routing topology" +msgid "In a directed graph both edges do not have directionality" msgstr "" -msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" -msgid "When the data comes with geometries and there is no routing topology, then this step is needed." +msgid "In terms of a directed graph is like having four edges:" msgstr "" -msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." +msgid ":math:`source_i \\leftrightarrow target_i`" msgstr "" -msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgid ":math:`target_i \\leftrightarrow source_i`" msgstr "" -msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." +msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" msgstr "" -msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_createVerticesTable``" -msgstr "ダイクストラ関連機能" +msgid "Graphs without geometries" +msgstr "" -msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." msgstr "" -msgid "Migration of ``pgr_analyzeOneWay``" +msgid "Wiki example" msgstr "" -msgid "Number of potential problems in directionality" +msgid "Solve the example problem taken from `wikipedia `__):" msgstr "" -msgid "WHERE" +msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." msgstr "" -msgid "Directionality problems were calculated based on codes." +msgid "Is an undirected graph." msgstr "" -msgid "Dead ends." +msgid "Although visually looks like to have geometries, the drawing is not to scale." msgstr "" -msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgid "No geometries associated to the vertices or edges" msgstr "" -msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." +msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" msgstr "" -msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgid "Has 9 edges:" msgstr "" -msgid "Bridges." +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" msgstr "" -msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." +msgid "The graph can be represented in many ways for example:" msgstr "" -msgid "To determine if the bridges are or not one way." +msgid "Prepare the database" +msgstr "データベースの準備" + +msgid "Create a database for the example, access the database and install pgRouting: ::" msgstr "" -msgid "Migration of ``pgr_analyzeGraph``" +msgid "Create a table" msgstr "" -msgid "Number of isolated segments." +msgid "The basic elements needed to perform basic routing on an undirected graph are:" msgstr "" -msgid "Number of dead ends." +msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" msgstr "" -msgid "Number of potential gaps found near dead ends." +msgid "Using this table design for this example:" msgstr "" -msgid "Number of intersections. (between 2 edges)" +msgid "Insert the data" msgstr "" -msgid "Graph component" +msgid "Find the shortest path" msgstr "" -msgid "A connected subgraph that is not part of any larger connected subgraph." +msgid "To solve this example :doc:`pgr_dijkstra` is used:" msgstr "" -msgid "Isolated segment" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" msgstr "" -msgid "A graph component with only one segment." +msgid "Vertex information" msgstr "" -msgid "Dead ends" +msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" msgstr "" -msgid "A vertex that participates in only one edge." +msgid "Graphs with geometries" msgstr "" -msgid "gaps" +msgid "Create a routing Database" msgstr "" -msgid "Space between two geometries." +msgid "The first step is to create a database and load pgRouting in the database." msgstr "" -#, fuzzy -msgid "Intersection" -msgstr "序章" +msgid "Typically create a database for each project." +msgstr "" -msgid "Is a topological relationship between two geometries." +msgid "Once having the database to work in, load your data and build the routing application in that database." msgstr "" -#, fuzzy -msgid "Migration." -msgstr "もっと詳しく知る" +msgid "Load Data" +msgstr "" -#, fuzzy -msgid "Components." -msgstr "コンテンツ" +msgid "There are several ways to load your data into pgRouting." +msgstr "" -msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgid "Manually creating a database." msgstr "" -msgid "Depending of the final application requirements use:" +msgid "`Graphs without geometries`_" msgstr "" -msgid ":doc:`pgr_connectedComponents`" +msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr "" -#, fuzzy -msgid ":doc:`pgr_strongComponents`" -msgstr ":doc:`pgr_kruskalBFS`" +msgid "Using `osm2pgrouting `__" +msgstr "" -msgid ":doc:`pgr_biconnectedComponents`" +msgid "There are various open source tools that can help, like:" msgstr "" -#, fuzzy -msgid "For example:" -msgstr "例" +msgid "shp2pgsql" +msgstr "" -msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgid "postgresql shapefile loader" msgstr "" -msgid "Potential gaps near dead ends." +msgid "ogr2ogr" msgstr "" -msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "vector data conversion utility" msgstr "" -msgid "Topological relationships." +msgid "osm2pgsql" msgstr "" -msgid "Instead of counting intersections, determine topological relationships between geometries." +msgid "load OSM data into postgresql" msgstr "" -msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." msgstr "" -msgid "Migration of ``pgr_trsp`` (Vertices)" +msgid "Breakup a segments on each segment-segment intersection" msgstr "" -#, fuzzy -msgid "Signature:" -msgstr "機能" +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgstr "" -msgid "`v3.4.0 `__" +msgid "Connect a disconnected graph." msgstr "" -msgid ":doc:`pgr_trsp`" +msgid "Create the complete graph topology" msgstr "" -#, fuzzy -msgid "`Migration of restrictions`_" -msgstr "ダイクストラ関連機能" +msgid "Create one or more graphs based on the application to be developed." +msgstr "" -msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgid "Create a contracted graph for the high speed roads" +msgstr "" + +msgid "Create graphs per state/country" msgstr "" -msgid "Use :doc:`pgr_dijkstra` instead." +msgid "In few words:" msgstr "" -msgid "To get the original column names:" +msgid "Prepare the graph" msgstr "" -msgid "``id1`` is the node" +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." msgstr "" -msgid "``id2`` is the edge" +msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." msgstr "" -msgid "Use ``pgr_trsp`` when there are restrictions." +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." msgstr "" -msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgid "The use of indexes on the database design in general:" msgstr "" -msgid "Migration of ``pgr_trsp`` (Edges)" +msgid "Have the geometries indexed." msgstr "" -msgid ":doc:`pgr_trsp_withPoints`" +msgid "Have the identifiers columns indexed." msgstr "" -msgid "Migration of ``pgr_trspViaVertices``" +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." msgstr "" -msgid ":doc:`pgr_dijkstraVia`" +msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." msgstr "" -msgid ":doc:`pgr_trspVia`" +msgid "Adjust costs" msgstr "" -msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." msgstr "" -msgid "Use :doc:`pgr_dijkstraVia` instead." +msgid "Update costs to length of geometry" msgstr "" -msgid "``id1`` is the path identifier" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" msgstr "" -msgid "``id2`` is the node" +msgid ":math:`1` when the edge exists in the graph" msgstr "" -msgid "``id3`` is the edge" +msgid ":math:`-1` when the edge does not exist in the graph" msgstr "" -msgid "Use ``pgr_trspVia`` when there are restrictions" +msgid "Using that information updating to the length of the geometries:" msgstr "" -msgid "Use :doc:`pgr_trspVia` instead." +msgid "Which gives the following results:" msgstr "" -msgid "Migration of ``pgr_trspViaEdges``" +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." msgstr "" -msgid ":doc:`pgr_withPointsVia`" +msgid "Returning to the original data:" msgstr "" -msgid ":doc:`pgr_trspVia_withPoints`" +msgid "Update costs based on codes" msgstr "" -msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgid "Other datasets, can have a column with values like" msgstr "" -msgid "Use :doc:`pgr_withPointsVia` instead." +msgid "``FT`` vehicle flow on the direction of the geometry" msgstr "" -msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgid "``TF`` vehicle flow opposite of the direction of the geometry" msgstr "" -msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgid "``B`` vehicle flow on both directions" msgstr "" -msgid "Not yet classified migrations" +msgid "Preparing a code column for the example:" msgstr "" -msgid "Migration of ``pgr_withPointsKSP``" +msgid "Adjusting the costs based on the codes:" msgstr "" -msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgid "Check the Routing Topology" msgstr "" -msgid "|ksp-result|" +msgid "There are lots of possible problems in a graph." msgstr "" -msgid "|generic-result|" +msgid "The data used may not have been designed with routing in mind." msgstr "" -msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgid "A graph has some very specific requirements." msgstr "" -msgid "``pgr_withPointsKSP`` (`One to One`)" +msgid "The graph is disconnected." msgstr "" -#, fuzzy -msgid "Before Migration" -msgstr "もっと詳しく知る" - -msgid "Output columns were |old-pid-result|" +msgid "There are unwanted intersections." msgstr "" -msgid "the columns ``start_vid`` and ``end_vid`` do not exist." +msgid "The graph is too large and needs to be contracted." msgstr "" -msgid "Migration" +msgid "A sub graph is needed for the application." msgstr "" -msgid "Be aware of the existence of the additional result Columns." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." msgstr "" -msgid "New output columns are |generic-result|" +msgid "Crossing edges" msgstr "" -msgid "Using `this `__ example." +msgid "To get the crossing edges:" msgstr "" -msgid "``start_vid`` contains the **start vid** parameter value." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." msgstr "" -msgid "``end_vid`` contains the **end vid** parameter value." +msgid "It might be incorrect, for example:" msgstr "" -msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "" -msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." msgstr "" -msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgid "When it is incorrect, it needs fixing:" msgstr "" -msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgid "For vehicles and pedestrians" msgstr "" -msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." msgstr "" -msgid "Migration of ``pgr_maxCardinalityMatch``" +msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" msgstr "" -msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgid "For very specific applications" msgstr "" -msgid "Starting from `v3.4.0 `__" +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." msgstr "" -msgid "Signature to be migrated:" +msgid "The data needs a local fix for the specific application." msgstr "" -msgid "Migration is needed, because:" +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" -msgid "Use ``cost`` and ``reverse_cost`` on the inner query" +msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." msgstr "" -msgid "Results are ordered" +#, fuzzy +msgid "Fixing an intersection" +msgstr "序章" + +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "" -msgid "Works for undirected graphs." +msgid "An example use without results" msgstr "" -msgid "New signature" +msgid "Routing from :math:`1` to :math:`18` gives no solution." msgstr "" -msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." +msgid "Analyze the network for intersections." msgstr "" -msgid "The optional flag ``directed`` is removed." +msgid "The analysis tell us that the network has an intersection." msgstr "" #, fuzzy -msgid "Before migration" -msgstr "もっと詳しく知る" +msgid "Prepare tables" +msgstr "データベースの準備" -msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgid "Additional columns to control the origin of the segments." msgstr "" -msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgid "Adding new segments." msgstr "" -msgid "The flag ``directed`` is ignored." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "" -msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgid "Update other values" msgstr "" -msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." msgstr "" -msgid "Do not use the flag ``directed``." +msgid "Update the topology" msgstr "" -msgid "In the query returns only ``edge`` column." +msgid "Insert the new vertices if any." msgstr "" -msgid "Migration of restrictions" +msgid "Update source and target information on the edges table." msgstr "" -msgid "The structure of the restrictions have changed:" +msgid "The example has results" msgstr "" -msgid "Old restrictions structure" +msgid "Routing from :math:`1` to :math:`18` gives a solution." msgstr "" -msgid "On the deprecated signatures:" +msgid "Touching edges" msgstr "" -msgid "Column ``rid`` is ignored" +msgid "Visually the edges seem to be connected, but internally they are not." msgstr "" -msgid "``via_path``" -msgstr "``via_path``" - -msgid "Must be in reverse order." +msgid "The validity of the information is application dependent." msgstr "" -msgid "Is of type ``TEXT``." +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" -msgid "When more than one via edge must be separated with ``,``." +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" -msgid "``target_id``" -msgstr "``target_id``" - -msgid "Is the last edge of the forbidden path." +msgid "Fixing a gap" msgstr "" -msgid "Is of type ``INTEGER``." +msgid "Routing from :math:`1` to :math:`2` gives no solution." msgstr "" -msgid "``to_cost``" -msgstr "``to_cost``" - -msgid "Is of type ``FLOAT``." +msgid "Analyze the network for gaps." msgstr "" -msgid "Creation of the old restrictions table" +msgid "The analysis tell us that the network has a gap." msgstr "" -msgid "Old restrictions fill up" +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" -msgid "Old restrictions contents" +msgid "Routing from :math:`1` to :math:`2` gives a solution." msgstr "" -msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgid "Connecting components" msgstr "" -msgid ":math:`3\\rightarrow5`" +msgid "To get the graph connectivity:" msgstr "" -msgid "is on column ``via_path`` in reverse order" +msgid "There are three basic ways to connect components:" msgstr "" -msgid "is of type ``TEXT``" +msgid "From the vertex to the starting point of the edge" msgstr "" -msgid ":math:`9`" -msgstr ":math:`9`" - -msgid "is on column ``target_id``" +msgid "From the vertex to the ending point of the edge" msgstr "" -msgid "is of type ``INTEGER``" +msgid "From the vertex to the closest vertex on the edge" msgstr "" -msgid "New restrictions structure" +msgid "This solution requires the edge to be split." msgstr "" -msgid "Column ``id`` is ignored" +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." msgstr "" -msgid "Column ``path``" +msgid "Get the connectivity" msgstr "" -msgid "Is of type ``ARRAY[ANY-INTEGER]``." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "" -msgid "Contains all the edges involved on the restriction." +msgid "Insert new edges" msgstr "" -msgid "The array has the ordered edges of the restriction." +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." msgstr "" -msgid "Column ``cost``" +msgid "Create the vertices table" msgstr "" -msgid "Is of type ``ANY-NUMERICAL``" +msgid "Using :doc:`pgr_extractVertices` create the table." msgstr "" -msgid "The creation of the restrictions table" +msgid "Contraction of a graph" msgstr "" -msgid "Adding the restrictions" +msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "" -msgid "Restrictions data" +msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." msgstr "" -msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." msgstr "" -msgid "By inspection the path is clear." +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" msgstr "" -msgid "To transform the old restrictions table to the new restrictions structure," +msgid "To get the dead ends:" msgstr "" -msgid "Create a new table with the new restrictions structure." +msgid "A dead end happens when" msgstr "" -msgid "In this migration guide ``new_restrictions`` is been used." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" -msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +#, fuzzy +msgid "The vertex is on the limit of the imported graph." +msgstr "導かれないグラフ。" + +msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "" -msgid "``_pgr_array_reverse``:" +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." msgstr "" -msgid "Was created temporally for this migration" +msgid "Is node :math:`4` a dead end or not?" msgstr "" -msgid "Is not documented." +msgid "The answer to that question will depend on the application." msgstr "" -msgid "Will be removed on the next mayor version 4.0.0" +msgid "Is there such a small curb:" msgstr "" -msgid "The migrated table contents:" +msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" -#, fuzzy -msgid ":doc:`pgRouting-concepts`" -msgstr ":doc:`pgr_kruskalBFS`" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgstr "" -#, fuzzy -msgid "Ordering - Family of functions" -msgstr "ダイクストラ関連機能" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgstr "" -msgid "pgRouting Concepts" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" msgstr "" -msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgid "Depending on the answer, modification of the data might be needed." msgstr "" -msgid "Graphs" +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." msgstr "" -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" +msgid "Linear edges" msgstr "" -msgid ":math:`V` is a set of vertices, also called nodes." +msgid "To get the linear edges:" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." msgstr "" -msgid "There are different kinds of graphs:" +msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgid "Function's structure" msgstr "" -msgid "Undirected simple graph" +msgid "Once the graph preparation work has been done above, it is time to use a" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgid "The general form of a pgRouting function call is:" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgid "\\ \\" msgstr "" -msgid "Directed simple graph" +msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." msgstr "" -msgid "Graphs:" +msgid "**parameters**: Additional compulsory parameters needed by the function." msgstr "" -msgid "Do not have geometries." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." msgstr "" -msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." msgstr "" -msgid "In pgRouting there are several ways to represent a graph on the database:" +msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" -msgid "With ``cost``" -msgstr "" +#, fuzzy +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "p" -msgid "(``id``, ``source``, ``target``, ``cost``)" +msgid "`Edges SQL`_:" msgstr "" -msgid "With ``cost`` and ``reverse_cost``" +msgid "Is the first parameter." msgstr "" -msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgid "It is compulsory." msgstr "" -msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgid "It is an inner query." msgstr "" -msgid "Identifier of a vertex." +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" msgstr "" -msgid "Weight of the edge (``source``, ``target``):" +msgid "**start vid**:" msgstr "" -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "Is the second parameter." msgstr "" -msgid "``cost`` must exist in the query." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." msgstr "" -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "Is the third parameter." msgstr "" -msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" msgstr "" -msgid "Graph with ``cost``" +msgid "Is the fourth parameter." msgstr "" -msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgid "It is optional." msgstr "" -msgid "Graph data is obtained with a query" +msgid "It has a name." msgstr "" -msgid "``SELECT id, source, target, cost FROM edges``" +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." msgstr "" -msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgid "Function's overloads" msgstr "" -msgid "Edges where ``cost`` is non negative are part of the graph." +msgid "A function might have different overloads. The most common are called:" msgstr "" -msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgid "`One to One`_" msgstr "" -msgid "All vertices in ``source`` and ``target`` are part of the graph." +msgid "`One to Many`_" msgstr "" -msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "`Many to One`_" msgstr "" -msgid "For the following data:" +msgid "`Many to Many`_" msgstr "" -msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." +msgid "`Combinations`_" msgstr "" -msgid "The data is representing the following graph:" +msgid "Depending on the overload the parameters types change." msgstr "" -msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "**One**: **ANY-INTEGER**" msgstr "" -msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" +msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." msgstr "" -msgid "Graph with ``cost`` and ``reverse_cost``" +msgid "When routing from:" msgstr "" -msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgid "From **one** starting vertex" msgstr "" -msgid "The set of edges :math:`E`:" +msgid "to **one** ending vertex" msgstr "" -msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid "to **many** ending vertices" msgstr "" -msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgid "From **many** starting vertices" msgstr "" -msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgid "From **many** different starting vertices" msgstr "" -msgid "The set of vertices :math:`V`:" -msgstr "ノードのセット :math:`V`:" +msgid "to **many** different ending vertices" +msgstr "" -msgid "In a directed graph both edges have directionality" +msgid "Every tuple specifies a pair of a start vertex and an end vertex" msgstr "" -msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "Users can define the combinations as desired." msgstr "" -msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgid "Needs a `Combinations SQL`_" msgstr "" -msgid "Edges not part of the graph:" +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." msgstr "" -msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgid "Edges SQL for" msgstr "" -msgid ":math:`3` (:math:`3 \\rightarrow 2`)" +msgid "Some uncategorised functions" msgstr "" -msgid "In a directed graph both edges do not have directionality" +msgid "General without ``id``" msgstr "" -msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "General with (X,Y)" msgstr "" -msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." msgstr "" -msgid "In terms of a directed graph is like having four edges:" +msgid "Weight of the edge (``target``, ``source``)," msgstr "" -msgid ":math:`source_i \\leftrightarrow target_i`" +msgid "``x1``" +msgstr "``x1``" + +msgid "X coordinate of ``source`` vertex." msgstr "" -msgid ":math:`target_i \\leftrightarrow source_i`" +msgid "``y1``" +msgstr "``y1``" + +msgid "Y coordinate of ``source`` vertex." msgstr "" -msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgid "``x2``" +msgstr "``x2``" + +msgid "X coordinate of ``target`` vertex." msgstr "" -msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgid "``y2``" +msgstr "``y2``" + +msgid "Y coordinate of ``target`` vertex." msgstr "" -msgid "Graphs without geometries" +msgid "Flow" msgstr "" -msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgid "Edges SQL for :doc:`flow-family`" msgstr "" -msgid "Wiki example" +msgid "Edges SQL for the following functions of :doc:`flow-family`" msgstr "" -msgid "Solve the example problem taken from `wikipedia `__):" +msgid "Used in combination signatures" msgstr "" -msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." +msgid "Points SQL for" msgstr "" -msgid "Is an undirected graph." +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." msgstr "" -msgid "Although visually looks like to have geometries, the drawing is not to scale." +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." msgstr "" -msgid "No geometries associated to the vertices or edges" +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." msgstr "" -msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" +msgid "Parameters for the Via functions" msgstr "" -msgid "Has 9 edges:" +msgid "SQL query as described." msgstr "" -msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgid "When ``true`` Graph is considered `Directed`" msgstr "" -msgid "The graph can be represented in many ways for example:" +msgid "When ``false`` the graph is considered as Undirected." msgstr "" -msgid "Prepare the database" -msgstr "データベースの準備" +msgid "``strict``" +msgstr "``strict``" -msgid "Create a database for the example, access the database and install pgRouting: ::" -msgstr "" +msgid "``false``" +msgstr "``false``" -msgid "Create a table" +msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" msgstr "" -msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgid "When ``false`` ignores missing paths returning all paths found" msgstr "" -msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgstr "" +msgid "``U_turn_on_edge``" +msgstr "``U_turn_on_edge``" -msgid "Using this table design for this example:" +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." msgstr "" -msgid "Insert the data" +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." msgstr "" -msgid "Find the shortest path" +msgid "For the TRSP functions" msgstr "" -msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgid "Array of identifiers of destination vertices." msgstr "" -msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "There are several kinds of columns returned are depending of the function." msgstr "" -msgid "Vertex information" +#, fuzzy +msgid "Result columns for single path functions" +msgstr "結果として返却されるカラム" + +msgid "Used in functions that return one path solution per departure and destination." msgstr "" -msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" +msgid ":doc:`pgr_dijkstraNear`" msgstr "" -msgid "Graphs with geometries" +msgid "Returns |short-generic-result|" msgstr "" -msgid "Create a routing Database" +msgid "``path_seq``" +msgstr "``path_seq``" + +msgid "Relative position in the path. Has value **1** for the beginning of a path." msgstr "" -msgid "The first step is to create a database and load pgRouting in the database." +msgid "Identifier of the starting vertex of the current path." msgstr "" -msgid "Typically create a database for each project." +msgid "Identifier of the ending vertex of the current path." msgstr "" -msgid "Once having the database to work in, load your data and build the routing application in that database." +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "Load Data" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." msgstr "" -msgid "There are several ways to load your data into pgRouting." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." msgstr "" -msgid "Manually creating a database." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." msgstr "" -msgid "`Graphs without geometries`_" +#, fuzzy +msgid "Result columns for multiple paths functions" +msgstr "結果として返却されるカラム" + +msgid "Used in functions that return many paths solutions per departure and destination." msgstr "" -msgid ":doc:`sampledata`: a small graph used in the documentation examples" +#, fuzzy +msgid ":doc:`pgr_KSP`" +msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +msgid ":doc:`pgr_withPointsKSP`" +msgstr "pgr_TSP" + +msgid "Returns set of |generic-result|" msgstr "" -msgid "Using `osm2pgrouting `__" +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Path identifier." msgstr "" -msgid "There are various open source tools that can help, like:" +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "shp2pgsql" +msgid "Result columns for cost functions" msgstr "" -msgid "postgresql shapefile loader" +msgid "Used by:" msgstr "" -msgid "ogr2ogr" +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." msgstr "" -msgid "vector data conversion utility" +msgid "Result columns for flow functions" msgstr "" -msgid "osm2pgsql" +msgid "Result columns for spanning tree functions" msgstr "" -msgid "load OSM data into postgresql" +msgid "Used in functions that return a tree solution per departure." msgstr "" -msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +#, fuzzy +msgid "Result columns for simple spanning tree functions" +msgstr "結果として返却されるカラム" + +#, fuzzy +msgid "Returns set of ``(edge, cost)``" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +msgid "Cost to traverse the edge." msgstr "" -msgid "Breakup a segments on each segment-segment intersection" +msgid "Performance Tips" msgstr "" -msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgid "For the Routing functions" msgstr "" -msgid "Connect a disconnected graph." +msgid "To get faster results bound the queries to an area of interest of routing." msgstr "" -msgid "Create the complete graph topology" +msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." msgstr "" -msgid "Create one or more graphs based on the application to be developed." +msgid "Given this area:" msgstr "" -msgid "Create a contracted graph for the high speed roads" +msgid "Calculate a route:" msgstr "" -msgid "Create graphs per state/country" +msgid "How to contribute" msgstr "" -msgid "In few words:" +msgid "Wiki" msgstr "" -msgid "Prepare the graph" +msgid "Edit an existing `pgRouting Wiki `__ page." msgstr "" -msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgid "Or create a new Wiki page" msgstr "" -msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." +msgid "Create a page on the `pgRouting Wiki `__" msgstr "" -msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgid "Give the title an appropriate name" msgstr "" -msgid "The use of indexes on the database design in general:" +msgid "`Example `__" msgstr "" -msgid "Have the geometries indexed." +msgid "Adding Functionality to pgRouting" msgstr "" -msgid "Have the identifiers columns indexed." +msgid "Consult the `developer's documentation `__" msgstr "" -msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." -msgstr "" +msgid "Installation" +msgstr "インストール" -msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." +msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" msgstr "" -msgid "Adjust costs" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" msgstr "" -msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgid "Short Version" msgstr "" -msgid "Update costs to length of geometry" +msgid "Extracting the tar ball" msgstr "" -msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgid "To compile assuming you have all the dependencies in your search path:" msgstr "" -msgid ":math:`1` when the edge exists in the graph" +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." msgstr "" -msgid ":math:`-1` when the edge does not exist in the graph" +msgid "Get the sources" msgstr "" -msgid "Using that information updating to the length of the geometries:" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" -msgid "Which gives the following results:" +msgid "To download this release:" msgstr "" -msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." msgstr "" -msgid "Returning to the original data:" +msgid "git" msgstr "" -msgid "Update costs based on codes" +msgid "To download the repository" msgstr "" -msgid "Other datasets, can have a column with values like" +msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." msgstr "" -msgid "``FT`` vehicle flow on the direction of the geometry" +msgid "Enabling and upgrading in the database" msgstr "" -msgid "``TF`` vehicle flow opposite of the direction of the geometry" +msgid "Enabling the database" msgstr "" -msgid "``B`` vehicle flow on both directions" +msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." msgstr "" -msgid "Preparing a code column for the example:" +msgid "Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" -msgid "Adjusting the costs based on the codes:" +msgid "Upgrading the database" msgstr "" -msgid "Check the Routing Topology" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" msgstr "" -msgid "There are lots of possible problems in a graph." +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" msgstr "" -msgid "The data used may not have been designed with routing in mind." +msgid "Dependencies" msgstr "" -msgid "A graph has some very specific requirements." +msgid "Compilation Dependencies" msgstr "" -msgid "The graph is disconnected." +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "" -msgid "There are unwanted intersections." +msgid "C and C++0x compilers" msgstr "" -msgid "The graph is too large and needs to be contracted." +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" msgstr "" -msgid "A sub graph is needed for the application." +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" -msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgid "Postgresql version >= 13" msgstr "" -msgid "Crossing edges" +msgid "The Boost Graph Library (BGL) >= 1.56.0" msgstr "" -msgid "To get the crossing edges:" +msgid "CMake >= 3.12" msgstr "" -msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgid "For user's documentation" msgstr "" -msgid "It might be incorrect, for example:" +msgid "Sphinx >= 4.0" msgstr "" -msgid "When it is actually an intersection of roads, where vehicles can make turns." +msgid "For developer's documentation" msgstr "" -msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgid "Doxygen >= 1.7" msgstr "" -msgid "When it is incorrect, it needs fixing:" +msgid "For testing" msgstr "" -msgid "For vehicles and pedestrians" +msgid "pgtap" msgstr "" -msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." +msgid "pg_prove" msgstr "" -msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgid "For using:" msgstr "" -msgid "For very specific applications" -msgstr "" +#, fuzzy +msgid "PostGIS version >= 3.0.0" +msgstr "バージョン 3.0.0" -msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgid "Example: Installing dependencies on linux" msgstr "" -msgid "The data needs a local fix for the specific application." +msgid "Installing the compilation dependencies" msgstr "" -msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgid "Build dependencies" msgstr "" -msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgid "Optional dependencies" msgstr "" #, fuzzy -msgid "Fixing an intersection" -msgstr "序章" +msgid "For documentation" +msgstr "ドキュメントには改良が必要な場合があります。" -msgid "In this example the original edge table will be used to store the additional geometries." +msgid "Configuring" msgstr "" -msgid "An example use without results" +msgid "pgRouting uses the `cmake` system to do the configuration." msgstr "" -msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgid "Configurable variables" msgstr "" -msgid "Analyze the network for intersections." +msgid "To see the variables that can be configured" msgstr "" -msgid "The analysis tell us that the network has an intersection." +msgid "The build directory is different from the source directory" msgstr "" -#, fuzzy -msgid "Prepare tables" -msgstr "データベースの準備" - -msgid "Additional columns to control the origin of the segments." +msgid "Configuring The Documentation" msgstr "" -msgid "Adding new segments." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" msgstr "" -msgid "Update other values" +msgid "Variable" msgstr "" -msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgid "Comment" msgstr "" -msgid "Update the topology" +msgid "BUILD_HTML" msgstr "" -msgid "Insert the new vertices if any." +msgid "BOOL=ON" msgstr "" -msgid "Update source and target information on the edges table." +msgid "If ON, turn on/off building HTML for user's documentation" msgstr "" -msgid "The example has results" +msgid "BUILD_DOXY" msgstr "" -msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgid "If ON, turn on/off building HTML for developer's documentation" msgstr "" -msgid "Touching edges" +msgid "BUILD_LATEX" msgstr "" -msgid "Visually the edges seem to be connected, but internally they are not." +msgid "BOOL=OFF" msgstr "" -msgid "The validity of the information is application dependent." +msgid "If ON, turn on/off building PDF" msgstr "" -msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgid "BUILD_MAN" msgstr "" -msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgid "If ON, turn on/off building MAN pages" msgstr "" -msgid "Fixing a gap" +msgid "DOC_USE_BOOTSTRAP" msgstr "" -msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" msgstr "" -msgid "Analyze the network for gaps." +msgid "EN" msgstr "" -msgid "The analysis tell us that the network has a gap." +msgid "if OFF the English documentation will no be built" msgstr "" -msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." +msgid "ES" msgstr "" -msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgid "if OFF the Spanish documentation will no be built" msgstr "" -msgid "Connecting components" +msgid "SV" msgstr "" -msgid "To get the graph connectivity:" +msgid "if OFF the Swedish documentation will no be built" msgstr "" -msgid "There are three basic ways to connect components:" +msgid "ZH_HANS" msgstr "" -msgid "From the vertex to the starting point of the edge" +msgid "if OFF the Chinese simplified documentation will no be built" msgstr "" -msgid "From the vertex to the ending point of the edge" +msgid "Building" msgstr "" -msgid "From the vertex to the closest vertex on the edge" +msgid "Using ``make`` to build the code and the documentation" msgstr "" -msgid "This solution requires the edge to be split." +msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "" -msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." msgstr "" -msgid "Get the connectivity" +msgid "Linux" msgstr "" -msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." +msgid "The following instructions start from ``path/to/pgrouting``" msgstr "" -msgid "Insert new edges" +msgid "Testing" msgstr "" -msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgid "Currently there is no :code:`make test` and testing is done as follows" msgstr "" -msgid "Create the vertices table" +msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." msgstr "" -msgid "Using :doc:`pgr_extractVertices` create the table." +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" -msgid "Contraction of a graph" +msgid "Licensing" +msgstr "ライセンス" + +msgid "The following licenses can be found in pgRouting:" +msgstr "次のライセンスがpgRouting に適用されます。" + +msgid "**License**" msgstr "" -msgid "The graph can be reduced in size using :doc:`contraction-family`" +msgid "GNU General Public License v2.0 or later" msgstr "" -msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." msgstr "" -msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." +msgid "Boost Software License - Version 1.0" msgstr "" -msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." msgstr "" -msgid "To get the dead ends:" +msgid "MIT-X License" msgstr "" -msgid "A dead end happens when" +msgid "Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" -msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." msgstr "" +msgid "In general license information should be included in the header of each source file." +msgstr "一般に、ライセンス情報は、各ソースファイルのヘッダーに含める必要があります。" + +msgid "Contributors" +msgstr "貢献者" + +msgid "This Release Contributors" +msgstr "このリリースに対する貢献者" + #, fuzzy -msgid "The vertex is on the limit of the imported graph." -msgstr "導かれないグラフ。" +msgid "Individuals in this release |release| (in alphabetical order)" +msgstr "個人(アルファベット順)" -msgid "If a larger graph is imported then the vertex might not be a dead end" +msgid "Mohit Rawat, Regina Obe, Vicky Vergara" msgstr "" -msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." msgstr "" -msgid "Is node :math:`4` a dead end or not?" -msgstr "" +#, fuzzy +msgid "Translators (in alphabetical order)" +msgstr "コーポレートスポンサー(アルファベット順)" -msgid "The answer to that question will depend on the application." +msgid "Chinese:" msgstr "" -msgid "Is there such a small curb:" +msgid "Dapeng Wang" msgstr "" -msgid "That does not allow a vehicle to use that visual intersection?" +msgid "Spanish:" msgstr "" -msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgid "Vicky Vergara" msgstr "" -msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgid "Swedish:" msgstr "" -msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgid "Daniel Nylander" msgstr "" -msgid "Depending on the answer, modification of the data might be needed." +msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" -msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." -msgstr "" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "これらは、デベロッパーが開発に要する時間、ホスティング、また pgRoutingプロジェクトへ直接資金を支援してくださっているスポンサー企業です。" -msgid "Linear edges" +msgid "`OSGeo `__" msgstr "" -msgid "To get the linear edges:" +msgid "`OSGeo UK `__" msgstr "" -msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgid "`Google Summer of Code `__" msgstr "" -msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." +msgid "`HighGo Software `__" msgstr "" -msgid "Function's structure" +msgid "`Paragon Corporation `__" msgstr "" -msgid "Once the graph preparation work has been done above, it is time to use a" -msgstr "" +msgid "Contributors Past & Present:" +msgstr "これまでの貢献者と現在の貢献者:" -msgid "The general form of a pgRouting function call is:" -msgstr "" +msgid "Individuals (in alphabetical order)" +msgstr "個人(アルファベット順)" -msgid "\\ \\" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgstr "" -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgstr "" +msgid "Corporate Sponsors (in alphabetical order)" +msgstr "コーポレートスポンサー(アルファベット順)" -msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." +msgid "Camptocamp" msgstr "" -msgid "**parameters**: Additional compulsory parameters needed by the function." +msgid "CSIS (University of Tokyo)" msgstr "" -msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgid "Georepublic" msgstr "" -msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgid "Google Summer of Code" msgstr "" -msgid "For example, for this :doc:`pgr_dijkstra` signature:" +msgid "HighGo Software" msgstr "" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "p" - -msgid "`Edges SQL`_:" +msgid "iMaptools" msgstr "" -msgid "Is the first parameter." +msgid "Leopark" msgstr "" -msgid "It is compulsory." +msgid "Orkney" msgstr "" -msgid "It is an inner query." +msgid "OSGeo" msgstr "" -msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgid "OSGeo UK" msgstr "" -msgid "**start vid**:" +msgid "Paragon Corporation" msgstr "" -msgid "Is the second parameter." +msgid "Versaterm Inc." msgstr "" -msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." -msgstr "" +msgid "More Information" +msgstr "もっと詳しく知る" -msgid "Is the third parameter." -msgstr "" +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "最新のソフトウェア、ドキュメント、ニュースは、pgRoutingのウェブサイト https://pgrouting.orgで入手できます。" -msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." msgstr "" -msgid "Is the fourth parameter." +msgid "PostGIS extension at the PostGIS project web site https://postgis.net." msgstr "" -msgid "It is optional." +msgid "Boost C++ source libraries at https://www.boost.org." msgstr "" -msgid "It has a name." +msgid ":doc:`migration`" msgstr "" -msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" -msgid "Function's overloads" -msgstr "" +msgid "Availability" +msgstr "使用可能なバージョン" -msgid "A function might have different overloads. The most common are called:" -msgstr "" +#, fuzzy +msgid "Version 4.0.0" +msgstr "バージョン 2.0.0" -msgid "`One to One`_" +msgid "All signatures promoted to official." msgstr "" -msgid "`One to Many`_" -msgstr "" +#, fuzzy +msgid "Version 3.6.0" +msgstr "バージョン 3.0.0" -msgid "`Many to One`_" +msgid "Standardizing output columns to |nksp-result|" msgstr "" -msgid "`Many to Many`_" +msgid "pgr_ksp(One to One)" msgstr "" -msgid "`Combinations`_" +msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "Depending on the overload the parameters types change." +msgid "New proposed signatures:" msgstr "" -msgid "**One**: **ANY-INTEGER**" +msgid "pgr_ksp(One to Many)" msgstr "" -msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgid "pgr_ksp(Many to One)" msgstr "" -msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgid "pgr_ksp(Many to Many)" msgstr "" -msgid "When routing from:" +msgid "pgr_ksp(Combinations)" msgstr "" -msgid "From **one** starting vertex" +msgid "Version 2.1.0" msgstr "" -msgid "to **one** ending vertex" -msgstr "" +msgid "Signature change" +msgstr "変更機能" -msgid "to **many** ending vertices" +msgid "Old signature no longer supported" msgstr "" -msgid "From **many** starting vertices" -msgstr "" +msgid "Version 2.0.0" +msgstr "バージョン 2.0.0" -msgid "From **many** different starting vertices" -msgstr "" +#, fuzzy +msgid "Official function." +msgstr "**公式** 機能" -msgid "to **many** different ending vertices" +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." msgstr "" -msgid "Every tuple specifies a pair of a start vertex and an end vertex" +msgid "|Boost| Boost Graph Inside" msgstr "" -msgid "Users can define the combinations as desired." +msgid "Boost Graph inside" msgstr "" -msgid "Needs a `Combinations SQL`_" -msgstr "" +msgid "Signatures" +msgstr "機能" -msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." -msgstr "" +msgid "Summary" +msgstr "概要" -msgid "Edges SQL for" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "Some uncategorised functions" -msgstr "" +#, fuzzy +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "p" -msgid "General without ``id``" -msgstr "" +#, fuzzy +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "p" -msgid "General with (X,Y)" +#, fuzzy +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "p" + +#, fuzzy +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgstr "pg" + +msgid "**options:** ``[directed, heap_paths]``" msgstr "" -msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgid "Returns set of |nksp-result|" msgstr "" -msgid "Weight of the edge (``target``, ``source``)," +msgid "OR EMPTY SET" msgstr "" -msgid "``x1``" -msgstr "``x1``" +msgid "Example" +msgstr "例" -msgid "X coordinate of ``source`` vertex." +msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "" -msgid "``y1``" -msgstr "``y1``" - -msgid "Y coordinate of ``source`` vertex." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "``x2``" -msgstr "``x2``" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgstr "" -msgid "X coordinate of ``target`` vertex." +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "``y2``" -msgstr "``y2``" +#, fuzzy +msgid "Using a combinations table on an directed graph" +msgstr "導かれないグラフ。" -msgid "Y coordinate of ``target`` vertex." +msgid "The combinations table:" msgstr "" -msgid "Flow" +msgid "The query:" msgstr "" -msgid "Edges SQL for :doc:`flow-family`" -msgstr "" +msgid "Identifier of the destination vertex." +msgstr "開始ノードの識別子。" -msgid "Edges SQL for the following functions of :doc:`flow-family`" +msgid "**K**" msgstr "" -msgid "Used in combination signatures" +msgid "Number of required paths." msgstr "" -msgid "Points SQL for" +msgid "KSP Optional parameters" msgstr "" -msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgid "``heap_paths``" +msgstr "``heap_paths``" + +msgid "When ``false`` Returns at most K paths." msgstr "" -msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" -msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" -msgid "Parameters for the Via functions" +msgid "Additional Examples" +msgstr "追加の具体例" + +msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" msgstr "" -msgid "SQL query as described." +msgid "Also get the paths in the heap." msgstr "" -msgid "When ``true`` Graph is considered `Directed`" +#, fuzzy +msgid "Get 2 paths using combinations table on an undirected graph" +msgstr "導かれないグラフ。" + +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." msgstr "" -msgid "When ``false`` the graph is considered as Undirected." +msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgstr "" -msgid "``strict``" -msgstr "``strict``" +msgid "``pgr_TSP``" +msgstr "``pgr_TSP``" -msgid "``false``" -msgstr "``false``" +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgstr "" -msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" +msgid "Availability:" msgstr "" -msgid "When ``false`` ignores missing paths returning all paths found" +msgid "Results change depending on input order" msgstr "" -msgid "``U_turn_on_edge``" -msgstr "``U_turn_on_edge``" +#, fuzzy +msgid "Only for undirected graphs" +msgstr "導かれないグラフ" -msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgid "Breaking change, signatures no longer available:" +msgstr "" + +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgid "Version 3.2.1" msgstr "" -msgid "For the TRSP functions" +msgid "Metric Algorithm from `Boost library `__" msgstr "" -msgid "Array of identifiers of destination vertices." +msgid "Simulated Annealing Algorithm no longer supported" msgstr "" -msgid "There are several kinds of columns returned are depending of the function." +msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" msgstr "" -#, fuzzy -msgid "Result columns for single path functions" -msgstr "結果として返却されるカラム" +msgid "Version 2.3.0" +msgstr "バージョン 2.3.0" -msgid "Used in functions that return one path solution per departure and destination." +msgid "Results change depending on input order of the `Matrix SQL`_" msgstr "" -msgid ":doc:`pgr_dijkstraNear`" +msgid "Negative costs are ignored." msgstr "" -msgid "Returns |short-generic-result|" +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." msgstr "" -msgid "``path_seq``" -msgstr "``path_seq``" - -msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgid "With ``directed => false``" msgstr "" -msgid "Identifier of the starting vertex of the current path." +msgid "Will generate a graph that:" msgstr "" -msgid "Identifier of the ending vertex of the current path." +msgid "is undirected" msgstr "" -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." +msgid "is fully connected (As long as the graph has one component)" msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgid "all traveling costs on edges obey the triangle inequality." msgstr "" -msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" -msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "" -#, fuzzy -msgid "Result columns for multiple paths functions" -msgstr "結果として返却されるカラム" - -msgid "Used in functions that return many paths solutions per departure and destination." +msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" -#, fuzzy -msgid ":doc:`pgr_KSP`" -msgstr ":doc:`pgr_kruskalBFS`" - -#, fuzzy -msgid ":doc:`pgr_withPointsKSP`" -msgstr "pgr_TSP" - -msgid "Returns set of |generic-result|" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." msgstr "" -msgid "``path_id``" -msgstr "``path_id``" - -msgid "Path identifier." +msgid "With ``directed => true``" msgstr "" -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "" -msgid "Result columns for cost functions" +msgid "is directed" msgstr "" -msgid "Used by:" +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." msgstr "" -msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgid "As an undirected graph is required, the directed graph is transformed as follows:" msgstr "" -msgid "Result columns for flow functions" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" msgstr "" -msgid "Result columns for spanning tree functions" +msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" msgstr "" -msgid "Used in functions that return a tree solution per departure." +msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" msgstr "" -#, fuzzy -msgid "Result columns for simple spanning tree functions" -msgstr "結果として返却されるカラム" - -#, fuzzy -msgid "Returns set of ``(edge, cost)``" -msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgstr "" -msgid "Cost to traverse the edge." +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" -msgid "Performance Tips" +msgid "Missing values will be calculated with dijkstra algorithm." msgstr "" -msgid "For the Routing functions" +msgid "When the graph has more than one component:" msgstr "" -msgid "To get faster results bound the queries to an area of interest of routing." +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." msgstr "" -msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "Given this area:" +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." msgstr "" -msgid "Calculate a route:" +msgid "One cycle attempt to remove crossing edges is done to the TSP results." msgstr "" -msgid "How to contribute" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" msgstr "" -msgid "Wiki" +msgid "Returns set of |tsp-result|" msgstr "" -msgid "Edit an existing `pgRouting Wiki `__ page." +msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" -msgid "Or create a new Wiki page" +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." msgstr "" -msgid "Create a page on the `pgRouting Wiki `__" +msgid "`Matrix SQL`_ as described below" msgstr "" -msgid "Give the title an appropriate name" +msgid "``ANY-INTEGER``" msgstr "" -msgid "`Example `__" +msgid "``ANY-NUMERICAL``" msgstr "" -msgid "Adding Functionality to pgRouting" +msgid "Cost for going from start_vid to end_vid" +msgstr "start_vid から end_vid まで行くのにかかるコスト" + +msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +msgid "Row sequence." +msgstr "行番号。" + +msgid "**node**" +msgstr "**node**" + +msgid "Identifier of the node/coordinate/point." +msgstr "ノード/座標/ポイントの識別子。" + +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgstr "現在の ``ノード`` から次の ``ノード`` まで移動する際の経路にかかるコスト。" + +msgid "``0`` for the last row in the tour sequence." msgstr "" -msgid "Consult the `developer's documentation `__" +msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." +msgstr "``seq = 1`` の ``ノード`` から現在のノードまでの総コスト。" + +msgid "``0`` for the first row in the tour sequence." msgstr "" -msgid "Installation" -msgstr "インストール" +msgid "Start from vertex :math:`1`" +msgstr "" -msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" +msgid "**Line 6** ``start_vid => 1``" msgstr "" -msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgid "Using points of interest to generate an asymmetric matrix." msgstr "" -msgid "Short Version" +msgid "To generate an asymmetric matrix:" msgstr "" -msgid "Extracting the tar ball" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" msgstr "" -msgid "To compile assuming you have all the dependencies in your search path:" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" -msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" msgstr "" -msgid "Get the sources" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" msgstr "" -msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgid "Triangle inequality might not be satisfied." msgstr "" -msgid "To download this release:" +msgid "``start_id != 0 AND end_id != 0``" msgstr "" -msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgid "Connected incomplete data" msgstr "" -msgid "git" +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." msgstr "" -msgid "To download the repository" +msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." msgstr "" -msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." +msgid "``pgr_TSPeuclidean``" +msgstr "``pgr_TSPeuclidean``" + +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "" -msgid "Enabling and upgrading in the database" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Enabling the database" +msgid "Using `Boost: metric TSP approx `__" msgstr "" -msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." +msgid "Version 3.0.0" +msgstr "バージョン 3.0.0" + +msgid "Name change from pgr_eucledianTSP" +msgstr "名称が pgr_eucledianTSP から変わりました" + +#, fuzzy +msgid "New official function." +msgstr "新しい **公式** 機能" + +msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." msgstr "" -msgid "Upgrading the database" +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "" -msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "" -msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" msgstr "" -msgid "Dependencies" +msgid "With default values" msgstr "" -msgid "Compilation Dependencies" +msgid "`Coordinates SQL`_" msgstr "" -msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgid "`Coordinates SQL`_ as described below" msgstr "" -msgid "C and C++0x compilers" +msgid "Coordinates SQL" msgstr "" -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgid "``x``" +msgstr "``x``" + +msgid "X value of the coordinate." +msgstr "座標のX値。" + +msgid "``y``" +msgstr "``y``" + +msgid "Y value of the coordinate." +msgstr "座標のY値。" + +msgid "Test 29 cities of Western Sahara" msgstr "" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" msgstr "" -msgid "Postgresql version >= 13" +msgid "Creating a table for the data and storing the data" msgstr "" -msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgid "Adding a geometry (for visual purposes)" msgstr "" -msgid "CMake >= 3.12" +msgid "Total tour cost" msgstr "" -msgid "For user's documentation" +msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" msgstr "" -msgid "Sphinx >= 4.0" +msgid "Getting a geometry of the tour" msgstr "" -msgid "For developer's documentation" +msgid "Visual results" msgstr "" -msgid "Doxygen >= 1.7" +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid "For testing" +msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" -msgid "pgtap" +msgid "Combinations signature promoted to official." msgstr "" -msgid "pg_prove" +msgid "Standardizing output columns to |short-generic-result|" msgstr "" -msgid "For using:" +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -#, fuzzy -msgid "PostGIS version >= 3.0.0" -msgstr "バージョン 3.0.0" +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "" -msgid "Example: Installing dependencies on linux" +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" -msgid "Installing the compilation dependencies" +msgid "Version 3.2.0" msgstr "" -msgid "Build dependencies" +msgid "New proposed signature:" msgstr "" -msgid "Optional dependencies" +msgid "pgr_aStar(Combinations)" msgstr "" -#, fuzzy -msgid "For documentation" -msgstr "ドキュメントには改良が必要な場合があります。" +msgid "Function promoted to official." +msgstr "" -msgid "Configuring" +msgid "Version 2.4.0" msgstr "" -msgid "pgRouting uses the `cmake` system to do the configuration." +msgid "pgr_aStar(One to Many)" msgstr "" -msgid "Configurable variables" +msgid "pgr_aStar(Many to One)" msgstr "" -msgid "To see the variables that can be configured" +msgid "pgr_aStar(Many to Many)" msgstr "" -msgid "The build directory is different from the source directory" +msgid "Signature change on pgr_aStar(One to One)" msgstr "" -msgid "Configuring The Documentation" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" msgstr "" -msgid "User and developers documentation are not build if prerequisites are not found." +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "Variable" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Comment" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "BUILD_HTML" +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "BOOL=ON" +msgid "**options:** ``[directed, heuristic, factor, epsilon]``" msgstr "" -msgid "If ON, turn on/off building HTML for user's documentation" +msgid "Returns set of |short-generic-result|" msgstr "" -msgid "BUILD_DOXY" +msgid "Optional parameters are `named parameters` and have a default value." msgstr "" -msgid "If ON, turn on/off building HTML for developer's documentation" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" msgstr "" -msgid "BUILD_LATEX" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" msgstr "" -msgid "BOOL=OFF" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" msgstr "" -msgid "If ON, turn on/off building PDF" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" msgstr "" -msgid "BUILD_MAN" +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "" -msgid "If ON, turn on/off building MAN pages" +msgid "Example 1" msgstr "" -msgid "DOC_USE_BOOTSTRAP" +msgid "Demonstration of repeated values are ignored, and result is sorted." msgstr "" -msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" +msgid "Example 2" msgstr "" -msgid "EN" +msgid "Making **start vids** the same as **end vids**." msgstr "" -msgid "if OFF the English documentation will no be built" +msgid "Example 3" msgstr "" -msgid "ES" +msgid "Manually assigned vertex combinations." msgstr "" -msgid "if OFF the Spanish documentation will no be built" -msgstr "" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" -msgid "SV" +#, fuzzy +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" + +msgid "pgr_aStarCost(Combinations)" msgstr "" -msgid "if OFF the Swedish documentation will no be built" +#, fuzzy +msgid "New proposed function." +msgstr "新しい **公式** 機能" + +#, fuzzy +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" + +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" msgstr "" -msgid "ZH_HANS" +msgid "For undirected graphs, the results are symmetric." msgstr "" -msgid "if OFF the Chinese simplified documentation will no be built" +msgid "The returned values are ordered in ascending order:" msgstr "" -msgid "Building" +msgid "`start_vid` ascending" msgstr "" -msgid "Using ``make`` to build the code and the documentation" +msgid "`end_vid` ascending" msgstr "" -msgid "The following instructions start from ``path/to/pgrouting/build``" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "Linux" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "The following instructions start from ``path/to/pgrouting``" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "Testing" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Currently there is no :code:`make test` and testing is done as follows" +msgid "Returns set of |matrix-result|" msgstr "" -msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" msgstr "" -msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgid "``pgr_aStarCostMatrix``" +msgstr "``pgr_aStarCostMatrix``" + +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" -msgid "Licensing" -msgstr "ライセンス" +msgid "Using internally the :doc:`pgr_aStar` algorithm" +msgstr "" -msgid "The following licenses can be found in pgRouting:" -msgstr "次のライセンスがpgRouting に適用されます。" +msgid "Returns a cost matrix." +msgstr "" -msgid "**License**" +msgid "No ordering is performed" msgstr "" -msgid "GNU General Public License v2.0 or later" +msgid "let `v` and `u` are nodes on the graph:" msgstr "" -msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgid "when there is no path from `v` to `u`:" msgstr "" -msgid "Boost Software License - Version 1.0" +msgid "cost from `v` to `u` is :math:`\\inf`" msgstr "" -msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgid "when :math:`v = u` then" msgstr "" -msgid "MIT-X License" +msgid "cost from `v` to `u` is :math:`0`" msgstr "" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgid "When the graph is **undirected** the cost matrix is symmetric" msgstr "" -msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "In general license information should be included in the header of each source file." -msgstr "一般に、ライセンス情報は、各ソースファイルのヘッダーに含める必要があります。" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgstr "" -msgid "Contributors" -msgstr "貢献者" +msgid "Use with :doc:`pgr_TSP`" +msgstr "" -msgid "This Release Contributors" -msgstr "このリリースに対する貢献者" +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" -#, fuzzy -msgid "Individuals in this release v4.0.0 (in alphabetical order)" -msgstr "個人(アルファベット順)" +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgstr "" -msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" +msgid "Result columns change: ``seq`` is removed" msgstr "" -msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgid "Version 2.5.0" msgstr "" #, fuzzy -msgid "Translators (in alphabetical order)" -msgstr "コーポレートスポンサー(アルファベット順)" +msgid "New experimental function." +msgstr "新しい **公式** 機能" -msgid "Chinese:" +msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." msgstr "" -msgid "Dapeng Wang" +msgid "Works for **undirected** graphs." msgstr "" -msgid "Spanish:" +msgid "``node`` ascending" msgstr "" -msgid "Vicky Vergara" +msgid "Running time: :math:`O(V + E)`" msgstr "" -msgid "Swedish:" +msgid "pgr_articulationPoints(`Edges SQL`_)" msgstr "" -msgid "Daniel Nylander" +msgid "Returns set of |result-node|" msgstr "" -msgid "Corporate Sponsors in this release (in alphabetical order)" +msgid "The articulation points of the graph" msgstr "" -msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" -msgstr "これらは、デベロッパーが開発に要する時間、ホスティング、また pgRoutingプロジェクトへ直接資金を支援してくださっているスポンサー企業です。" - -msgid "`OSGeo `__" +msgid "Nodes in red are the articulation points." msgstr "" -msgid "`OSGeo UK `__" +msgid "Identifier of the vertex." msgstr "" -msgid "`Google Summer of Code `__" +msgid "`Boost: Biconnected components & articulation points `__" msgstr "" -msgid "`HighGo Software `__" +msgid "wikipedia: `Biconnected component `__" msgstr "" -msgid "`Paragon Corporation `__" +#, fuzzy +msgid "``pgr_bandwidth`` - Experimental" +msgstr "p" + +msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "Contributors Past & Present:" -msgstr "これまでの貢献者と現在の貢献者:" +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgstr "" -msgid "Individuals (in alphabetical order)" -msgstr "個人(アルファベット順)" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" +msgstr "" -msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "The bandwidth is the maximum of all these distances" msgstr "" -msgid "Corporate Sponsors (in alphabetical order)" -msgstr "コーポレートスポンサー(アルファベット順)" +#, fuzzy +msgid "The implementation is for undirected graphs" +msgstr "実装は**undirected**グラフのみです。" -msgid "Camptocamp" +msgid "Run time is 0.160789 seconds" msgstr "" -msgid "CSIS (University of Tokyo)" +msgid "pgr_bandwidth(`Edges SQL`_)" msgstr "" -msgid "Georepublic" -msgstr "" +#, fuzzy +msgid "Returns ``BIGINT``" +msgstr "``BIGINT``" -msgid "Google Summer of Code" +#, fuzzy +msgid "For an undirected graph with edges." +msgstr "導かれないグラフ" + +msgid "Returns a bigint ``(pgr_bandwidth)``" msgstr "" -msgid "HighGo Software" +msgid "``pgr_bandwidth``" +msgstr "``pgr_bandwidth``" + +msgid "gives the bandwidth of the graph." msgstr "" -msgid "iMaptools" +msgid "Undirected graph with edges before optimization." msgstr "" -msgid "Leopark" +msgid "Undirected graph with edges after optimization." msgstr "" -msgid "Orkney" +msgid "`Boost: bandwidth `_" msgstr "" -msgid "OSGeo" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" + +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "OSGeo UK" +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "Paragon Corporation" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "Versaterm Inc." +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "More Information" -msgstr "もっと詳しく知る" +msgid "pgr_bdAstar(Combinations)" +msgstr "" -msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." -msgstr "最新のソフトウェア、ドキュメント、ニュースは、pgRoutingのウェブサイト https://pgrouting.orgで入手できます。" +msgid "pgr_bdAstar(One to Many)" +msgstr "" -msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgid "pgr_bdAstar(Many to One)" msgstr "" -msgid "PostGIS extension at the PostGIS project web site https://postgis.net." +msgid "pgr_bdAstar(Many to Many)" msgstr "" -msgid "Boost C++ source libraries at https://www.boost.org." +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" -msgid ":doc:`migration`" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "" -msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "Availability" -msgstr "使用可能なバージョン" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "" -#, fuzzy -msgid "Version 4.0.0" -msgstr "バージョン 2.0.0" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "p" -#, fuzzy -msgid "Version 3.6.0" -msgstr "バージョン 3.0.0" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" -msgid "Standardizing output columns to |nksp-result|" +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "pgr_ksp(One to One)" +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" + +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" -msgid "Added ``start_vid`` and ``end_vid`` result columns." +msgid "pgr_bdAstarCost(Combinations)" msgstr "" -msgid "New proposed signatures:" +#, fuzzy +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" + +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "pgr_ksp(One to Many)" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "pgr_ksp(Many to One)" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "pgr_ksp(Many to Many)" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "pgr_ksp(Combinations)" +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Version 2.1.0" +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" + +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." msgstr "" -msgid "Signature change" -msgstr "変更機能" +msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." +msgstr "" -msgid "Old signature no longer supported" +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "Version 2.0.0" -msgstr "バージョン 2.0.0" +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgstr "" -#, fuzzy -msgid "Official function." -msgstr "**公式** 機能" +msgid "Output columns standardized to |short-generic-result|" +msgstr "" -msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgid "pgr_bdDijkstra(Combinations)" msgstr "" -msgid "|Boost| Boost Graph Inside" +msgid "pgr_bdDijkstra(One to Many)" msgstr "" -msgid "Boost Graph inside" +msgid "pgr_bdDijkstra(Many to One)" msgstr "" -msgid "Signatures" -msgstr "機能" +msgid "pgr_bdDijkstra(Many to Many)" +msgstr "" -msgid "Summary" -msgstr "概要" +msgid "Signature change on pgr_bdDijkstra(One to One)" +msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -#, fuzzy -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgstr "p" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" -#, fuzzy -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "p" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "" -#, fuzzy -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgstr "p" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" -#, fuzzy -msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgstr "pg" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "" -msgid "**options:** ``[directed, heap_paths]``" +msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "" -msgid "Returns set of |nksp-result|" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" msgstr "" -msgid "OR EMPTY SET" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" -msgid "Example" -msgstr "例" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgstr "" -msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." +msgid "Using a combinations table on an **undirected** graph" msgstr "" -msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" + +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" -msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" #, fuzzy -msgid "Using a combinations table on an directed graph" -msgstr "導かれないグラフ。" +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -msgid "The combinations table:" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -msgid "The query:" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Identifier of the destination vertex." -msgstr "開始ノードの識別子。" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "" -msgid "**K**" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Number of required paths." +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" msgstr "" -msgid "KSP Optional parameters" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "``heap_paths``" -msgstr "``heap_paths``" +msgid "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "When ``false`` Returns at most K paths." +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." msgstr "" -msgid "When ``true`` all the calculated paths while processing are returned." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" -msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "Additional Examples" -msgstr "追加の具体例" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgstr "" -msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" +msgid "Use with :doc:`pgr_TSP`." msgstr "" -msgid "Also get the paths in the heap." +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" +msgstr "p" + +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" #, fuzzy -msgid "Get 2 paths using combinations table on an undirected graph" -msgstr "導かれないグラフ。" +msgid "New experimental signature:" +msgstr "新しい **公式** 機能" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgid "pgr_bellmanFord(Combinations)" msgstr "" -msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "``pgr_TSP``" -msgstr "``pgr_TSP``" +msgid "Process is valid for edges with both positive and negative edge weights." +msgstr "" -msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." msgstr "" -msgid "Availability:" +msgid "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." msgstr "" -msgid "Version 3.2.1" +msgid "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." msgstr "" -msgid "Metric Algorithm from `Boost library `__" +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." msgstr "" -msgid "Simulated Annealing Algorithm no longer supported" +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." msgstr "" -msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" -msgid "Version 2.3.0" -msgstr "バージョン 2.3.0" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "" -msgid "Results change depending on input order of the `Matrix SQL`_" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Negative costs are ignored." +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "With ``directed => false``" +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Will generate a graph that:" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "" -msgid "is undirected" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" msgstr "" -msgid "is fully connected (As long as the graph has one component)" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "" -msgid "all traveling costs on edges obey the triangle inequality." +#, fuzzy +msgid "Using a combinations table on an undirected graph" +msgstr "導かれないグラフ。" + +msgid "`Boost: Bellman Ford `__" msgstr "" -msgid "When ``start_vid = 0 OR end_vid = 0``" +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" -msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +#, fuzzy +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "p" + +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "" -msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +#, fuzzy +msgid "Version 3.7.0" +msgstr "バージョン 3.0.0" + +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." msgstr "" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." msgstr "" -msgid "With ``directed => true``" +msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." msgstr "" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +#, fuzzy +msgid "This implementation work for both directed and undirected graphs." +msgstr "導かれないグラフ。" + +msgid "Running time: :math:`\\Theta(VE)`" msgstr "" -msgid "is directed" +msgid "Running space: :math:`\\Theta(VE)`" msgstr "" -msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgid "Throws when there are no edges in the graph" msgstr "" -msgid "As an undirected graph is required, the directed graph is transformed as follows:" +#, fuzzy +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgstr "p" + +#, fuzzy +msgid "Returns set of ``(vid, centrality)``" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgid "Explanation" msgstr "" -msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" +msgid "The betweenness centrality are between parenthesis." msgstr "" -msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" +msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "" -msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." msgstr "" -msgid "When the data does not come from an undirected graph or its not fully connected:" +msgid "Removing vertex :math:`6` will create three graph components." msgstr "" -msgid "Missing values will be calculated with dijkstra algorithm." +msgid "Removing vertex :math:`10` will create two graph components." msgstr "" -msgid "When the graph has more than one component:" +msgid "``vid``" +msgstr "``vid``" + +msgid "``centrality``" +msgstr "``centrality``" + +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgid "`Boost: betweenness centrality `_" msgstr "" -msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" + +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." msgstr "" -msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +#, fuzzy +msgid "Result columns change:" +msgstr "結果として返却されるカラム" + +msgid "``n_seq`` is removed" msgstr "" -msgid "One cycle attempt to remove crossing edges is done to the TSP results." +msgid "``seq`` changed type to ``BIGINT``" msgstr "" -msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgid "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." msgstr "" -msgid "Returns set of |tsp-result|" +msgid "Components are described by edges." msgstr "" -msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgid "``component`` ascending." msgstr "" -msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgid "``edge`` ascending." msgstr "" -msgid "`Matrix SQL`_ as described below" +msgid "pgr_biconnectedComponents(`Edges SQL`_)" msgstr "" -msgid "``ANY-INTEGER``" +msgid "Returns set of |result-component-E|" msgstr "" -msgid "``ANY-NUMERICAL``" +msgid "The biconnected components of the graph" msgstr "" -msgid "Cost for going from start_vid to end_vid" -msgstr "start_vid から end_vid まで行くのにかかるコスト" - -msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" -msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" - -msgid "Row sequence." -msgstr "行番号。" - -msgid "**node**" -msgstr "**node**" - -msgid "Identifier of the node/coordinate/point." -msgstr "ノード/座標/ポイントの識別子。" - -msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." -msgstr "現在の ``ノード`` から次の ``ノード`` まで移動する際の経路にかかるコスト。" +msgid "``component``" +msgstr "``component``" -msgid "``0`` for the last row in the tour sequence." +msgid "Component identifier." msgstr "" -msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." -msgstr "``seq = 1`` の ``ノード`` から現在のノードまでの総コスト。" - -msgid "``0`` for the first row in the tour sequence." +msgid "Has the value of the minimum edge identifier in the component." msgstr "" -msgid "Start from vertex :math:`1`" +msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "**Line 6** ``start_vid => 1``" +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" -msgid "Using points of interest to generate an asymmetric matrix." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "" -msgid "To generate an asymmetric matrix:" +msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." msgstr "" -msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" -msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." msgstr "" -msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." msgstr "" -msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" msgstr "" -msgid "Triangle inequality might not be satisfied." +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "" -msgid "``start_id != 0 AND end_id != 0``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Connected incomplete data" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "``pgr_TSPeuclidean``" -msgstr "``pgr_TSPeuclidean``" - -msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Using `Boost: metric TSP approx `__" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" msgstr "" -msgid "Name change from pgr_eucledianTSP" -msgstr "名称が pgr_eucledianTSP から変わりました" - -#, fuzzy -msgid "New official function." -msgstr "新しい **公式** 機能" - -msgid "Results change depending on input order of the `Coordinates SQL`_" +msgid "`Boost: Breadth First Search `__" msgstr "" -msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -msgid "The coordinates are quite similar for the same identifier, for example ::" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -msgid "The coordinates are quite different for the same identifier, for example ::" +msgid "``pgr_bipartite`` - Experimental" msgstr "" -msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "" -msgid "With default values" +msgid "Output columns standardized to |result_node_color|" msgstr "" -msgid "`Coordinates SQL`_" +msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." msgstr "" -msgid "`Coordinates SQL`_ as described below" +msgid "The algorithm works in undirected graph only." msgstr "" -msgid "Coordinates SQL" +msgid "The returned values are not ordered." msgstr "" -msgid "``x``" -msgstr "``x``" - -msgid "X value of the coordinate." -msgstr "座標のX値。" - -msgid "``y``" -msgstr "``y``" - -msgid "Y value of the coordinate." -msgstr "座標のY値。" - -msgid "Test 29 cities of Western Sahara" +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." msgstr "" -msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgid "If graph is not bipartite then algorithm returns empty set." msgstr "" -msgid "Creating a table for the data and storing the data" +msgid "pgr_bipartite(`Edges SQL`_)" msgstr "" -msgid "Adding a geometry (for visual purposes)" +msgid "When the graph is bipartite" msgstr "" -msgid "Total tour cost" +msgid "Additional Example" msgstr "" -msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" +msgid "The odd length cyclic graph can not be bipartite." msgstr "" -msgid "Getting a geometry of the tour" +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." msgstr "" -msgid "Visual results" +msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgid "`Boost: is_bipartite `__" msgstr "" -msgid "``pgr_aStar`` — Shortest path using the A* algorithm." +msgid "`Wikipedia: bipartite graph `__" msgstr "" -msgid "Standardizing output columns to |short-generic-result|" -msgstr "" +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" -msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." msgstr "" -msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgid "pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "New proposed signature:" +msgid "Function promoted to proposed." msgstr "" -msgid "pgr_aStar(Combinations)" +msgid "Running time: Polynomial" msgstr "" -msgid "Version 2.4.0" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "pgr_aStar(One to Many)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "pgr_aStar(Many to One)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "pgr_aStar(Many to Many)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Signature change on pgr_aStar(One to One)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgid "Returns set of |result-flow|" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "From vertex :math:`11` to vertex :math:`12`" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "**options:** ``[directed, heuristic, factor, epsilon]``" +msgid "`Boost: Boykov Kolmogorov max flow `__" msgstr "" -msgid "Returns set of |short-generic-result|" +msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" -msgid "Optional parameters are `named parameters` and have a default value." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "" -msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" -msgstr "" +#, fuzzy +msgid "Version 4.0.0:" +msgstr "バージョン 2.0.0" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgid "Standardizing output columns to |result-spantree|" msgstr "" -msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "" -msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgid "The implementation will work on any type of graph." msgstr "" -msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." msgstr "" -msgid "Example 1" +msgid "Running time: :math:`O(E + V)`" msgstr "" -msgid "Demonstration of repeated values are ignored, and result is sorted." +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" msgstr "" -msgid "Example 2" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgstr "" -msgid "Making **start vids** the same as **end vids**." +msgid "**options:** ``[max_depth, directed]``" msgstr "" -msgid "Example 3" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" msgstr "" -msgid "Manually assigned vertex combinations." +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" -msgid "``pgr_aStarCost``" -msgstr "``pgr_aStarCost``" - -#, fuzzy -msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" - -msgid "pgr_aStarCost(Combinations)" +msgid "DFS optional parameters" msgstr "" -#, fuzzy -msgid "New proposed function." -msgstr "新しい **公式** 機能" - -#, fuzzy -msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." -msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" - -msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." msgstr "" -msgid "For undirected graphs, the results are symmetric." +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." msgstr "" -msgid "The returned values are ordered in ascending order:" +msgid "The resulting traversal is different." msgstr "" -msgid "`start_vid` ascending" +msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." msgstr "" -msgid "`end_vid` ascending" +msgid "|ascending| |descending|" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "ascending" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "descending" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "`Wikipedia: Breadth First Search algorithm `__" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." msgstr "" -msgid "Returns set of |matrix-result|" +msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgid "``edge`` ascending" msgstr "" -msgid "``pgr_aStarCostMatrix``" -msgstr "``pgr_aStarCostMatrix``" - -msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgid "Running time: :math:`O(E * (V + E))`" msgstr "" -msgid "Using internally the :doc:`pgr_aStar` algorithm" +msgid "pgr_bridges(`Edges SQL`_)" msgstr "" -msgid "Returns a cost matrix." +msgid "Returns set of |result-edge|" msgstr "" -msgid "No ordering is performed" +msgid "The bridges of the graph" msgstr "" -msgid "let `v` and `u` are nodes on the graph:" +msgid "Identifier of the edge that is a bridge." msgstr "" -msgid "when there is no path from `v` to `u`:" +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "cost from `v` to `u` is :math:`\\inf`" +msgid "`Boost: Connected components `__" msgstr "" -msgid "when :math:`v = u` then" +msgid "``pgr_chinesePostman`` - Experimental" msgstr "" -msgid "cost from `v` to `u` is :math:`0`" +msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." msgstr "" -msgid "When the graph is **undirected** the cost matrix is symmetric" +msgid "Returns ``EMPTY SET`` on a disconnected graph" msgstr "" -msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "pgr_chinesePostman(`Edges SQL`_)" msgstr "" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgid "Returns set of |result-1-1-no-seq|" msgstr "" -msgid "Use with :doc:`pgr_TSP`" +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "" -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "Sequential value starting from ``1``" +msgstr "" -msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." msgstr "" -msgid "Result columns change: ``seq`` is removed" +msgid "Aggregate cost from ``start_v`` to ``node``." msgstr "" -msgid "Version 2.5.0" +msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" -msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." +msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." msgstr "" -msgid "Works for **undirected** graphs." +msgid "Return value when the graph if disconnected" msgstr "" -msgid "``node`` ascending" +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" msgstr "" -msgid "Running time: :math:`O(V + E)`" +msgid "RETURNS ``FLOAT``" msgstr "" -msgid "pgr_articulationPoints(`Edges SQL`_)" +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" + +msgid "Minimum costs of a circuit path." msgstr "" -msgid "Returns set of |result-node|" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" + +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." msgstr "" -msgid "The articulation points of the graph" +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." msgstr "" -msgid "Nodes in red are the articulation points." +msgid "Components are described by vertices" msgstr "" -msgid "Identifier of the vertex." +msgid "``component`` ascending" msgstr "" -msgid "`Boost: Biconnected components & articulation points `__" +msgid "pgr_connectedComponents(`Edges SQL`_)" msgstr "" -msgid "wikipedia: `Biconnected component `__" +msgid "Returns set of |result-component-V|" msgstr "" -#, fuzzy -msgid "``pgr_bandwidth`` - Experimental" -msgstr "p" +msgid "The connected components of the graph" +msgstr "" -msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" +msgid "Has the value of the minimum node identifier in the component." msgstr "" -msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Identifier of the vertex that belongs to the ``component``." msgstr "" -msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" +msgid "Connecting disconnected components" msgstr "" -msgid "The bandwidth is the maximum of all these distances" +msgid "wikipedia: `Connected component `__" msgstr "" -#, fuzzy -msgid "The implementation is for undirected graphs" -msgstr "実装は**undirected**グラフのみです。" +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" -msgid "Run time is 0.160789 seconds" +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "pgr_bandwidth(`Edges SQL`_)" +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" #, fuzzy -msgid "Returns ``BIGINT``" -msgstr "``BIGINT``" +msgid "Version 3.8.0" +msgstr "バージョン 3.0.0" #, fuzzy -msgid "For an undirected graph with edges." -msgstr "導かれないグラフ" +msgid "New signature:" +msgstr "機能" -msgid "Returns a bigint ``(pgr_bandwidth)``" +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." msgstr "" -msgid "``pgr_bandwidth``" -msgstr "``pgr_bandwidth``" +#, fuzzy +msgid "New name and order of optional parameters." +msgstr "オプションとなるパラメータ" -msgid "gives the bandwidth of the graph." +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "Undirected graph with edges before optimization." +msgid "Name change from ``pgr_contractGraph``" msgstr "" -msgid "Undirected graph with edges after optimization." +msgid "Bug fixes" msgstr "" -msgid "`Boost: bandwidth `_" +msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." msgstr "" -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +#, fuzzy +msgid "Does not return the full contracted graph." +msgstr "次のクエリを実行します。" -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgid "Only changes on the graph are returned." msgstr "" -msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "The returned values include:" msgstr "" -msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgid "The new edges generated by linear contraction." msgstr "" -msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgid "The modified vertices generated by dead end contraction." msgstr "" -msgid "pgr_bdAstar(Combinations)" +msgid "The returned values are ordered as follows:" msgstr "" -msgid "pgr_bdAstar(One to Many)" +msgid "column ``id`` ascending when its a modified vertex." msgstr "" -msgid "pgr_bdAstar(Many to One)" +msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "" -msgid "pgr_bdAstar(Many to Many)" +msgid "Currently there are two types of contraction methods included in this function:" msgstr "" -msgid "Signature change on pgr_bdAstar(One to One)" +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." msgstr "" -msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +#, fuzzy +msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgstr "pg" + +msgid "**options:** ``[directed, methods, cycles, forbidden]``" msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Returns set of |result-contract|" msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "p" +#, fuzzy +msgid "Dead end and linear contraction in that order on an undirected graph." +msgstr "導かれないグラフ。" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Contraction optional parameters" msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "" +msgid "``methods``" +msgstr "``methods``" -msgid "``pgr_bdAstarCost``" -msgstr "``pgr_bdAstarCost``" +#, fuzzy +msgid "``INTEGER[]``" +msgstr "``INTEGER``" -msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgid "``ARRAY[1,2]``" msgstr "" -msgid "pgr_bdAstarCost(Combinations)" +msgid "Ordered contraction operations." msgstr "" -#, fuzzy -msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." -msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" - -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "1 = Dead end contraction" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "2 = Linear contraction" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "``cycles``" +msgstr "``cycles``" + +msgid ":math:`1`" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Number of times the contraction methods will be performed." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "``forbidden``" +msgstr "``forbidden``" + +msgid "``BIGINT[]``" msgstr "" -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +#, fuzzy +msgid "``ARRAY[]::BIGINT[]``" +msgstr "``BIGINT``" -msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." +msgid "Identifiers of vertices forbidden for contraction." msgstr "" -msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." +msgid "The function returns a single row. The columns of the row are:" msgstr "" -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "``type``" +msgstr "``type``" + +msgid "Type of the row." msgstr "" -msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgid "``v`` when the row is a vertex." msgstr "" -msgid "pgr_bdDijkstra(Combinations)" +msgid "Column ``id`` has a positive value." msgstr "" -msgid "pgr_bdDijkstra(One to Many)" +msgid "``e`` when the row is an edge." msgstr "" -msgid "pgr_bdDijkstra(Many to One)" +msgid "Column ``id`` has a negative value." msgstr "" -msgid "pgr_bdDijkstra(Many to Many)" +msgid "All numbers on this column are ``DISTINCT``" msgstr "" -msgid "Signature change on pgr_bdDijkstra(One to One)" +msgid "When ``type`` = **'v'**." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Identifier of the modified vertex." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "When ``type`` = **'e'**." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Decreasing sequence starting from **-1**." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" + +msgid "Array of contracted vertex identifiers." msgstr "" -msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" -msgid "Using a combinations table on an **undirected** graph" +msgid "Only dead end contraction" msgstr "" -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid "Only linear contraction" msgstr "" -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +msgid "The cycle" +msgstr "" -msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." msgstr "" -msgid "pgr_bdDijkstraCost(Combinations)" +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." msgstr "" -#, fuzzy -msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." -msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" +msgid "Contracting sample data" +msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "In this section, building and using a contracted graph will be shown by example." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "The :doc:`sampledata` for an undirected graph is used" msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgid "a dead end operation first followed by a linear operation." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Construction of the graph in the database" msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgid "The original graph:" msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." msgstr "" -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgstr "" -msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgid "After doing the dead end contraction operation:" msgstr "" -msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgid "After doing the linear contraction operation to the graph above:" msgstr "" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "The process to create the contraction graph on the database:" msgstr "" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgid "Add additional columns" msgstr "" -msgid "Use with :doc:`pgr_TSP`." +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "" #, fuzzy -msgid "``pgr_bellmanFord`` - Experimental" -msgstr "p" +msgid "Column." +msgstr "カラム" -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgid "The vertices set belonging to the vertex/edge" msgstr "" -msgid "pgr_bellmanFord(Combinations)" -msgstr "" +msgid "``is_contracted``" +msgstr "``is_contracted``" -msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." +msgid "On the vertex table" msgstr "" -msgid "Process is valid for edges with both positive and negative edge weights." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" -msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." msgstr "" -msgid "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." -msgstr "" +msgid "``is_new``" +msgstr "``is_new``" -msgid "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." +msgid "On the edge table" msgstr "" -msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." msgstr "" -msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +msgid "Store contraction information" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Store the contraction results in a table." msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Update the edges and vertices tables" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Insert the new edges generated by pgr_contraction." msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "The contracted graph" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "Vertices that belong to the contracted graph." msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" +msgid "Edges that belong to the contracted graph." msgstr "" -#, fuzzy -msgid "Using a combinations table on an undirected graph" -msgstr "導かれないグラフ。" - -msgid "`Boost: Bellman Ford `__" +msgid "Visually:" msgstr "" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "Using the contracted graph" msgstr "" -#, fuzzy -msgid "``pgr_betweennessCentrality`` - Experimental" -msgstr "p" - -msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" msgstr "" -#, fuzzy -msgid "Version 3.7.0" -msgstr "バージョン 3.0.0" - -msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" msgstr "" -msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." +msgid "Case 1: Both source and target belong to the contracted graph." msgstr "" -msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." +msgid "Case 2: Source and/or target belong to an edge subgraph." msgstr "" -#, fuzzy -msgid "This implementation work for both directed and undirected graphs." -msgstr "導かれないグラフ。" - -msgid "Running time: :math:`\\Theta(VE)`" +msgid "Case 3: Source and/or target belong to a vertex." msgstr "" -msgid "Running space: :math:`\\Theta(VE)`" +msgid "The final application should consider all of those cases." msgstr "" -msgid "Throws when there are no edges in the graph" +msgid "Create a view (or table) of the contracted graph:" msgstr "" -#, fuzzy -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgstr "p" - -#, fuzzy -msgid "Returns set of ``(vid, centrality)``" -msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" - -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgid "Create the function that will use the contracted graph." msgstr "" -msgid "Explanation" +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "" -msgid "The betweenness centrality are between parenthesis." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" -msgid "The leaf vertices have betweenness centrality :math:`0`." +msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr "" -msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "Removing vertex :math:`6` will create three graph components." +msgid "A node is considered a dead end node when:" msgstr "" -msgid "Removing vertex :math:`10` will create two graph components." +msgid "On undirected graphs:" msgstr "" -msgid "``vid``" -msgstr "``vid``" +msgid "The number of adjacent vertices is 1." +msgstr "" -msgid "``centrality``" -msgstr "``centrality``" +msgid "On directed graphs:" +msgstr "" -msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgid "When there is only one adjacent vertex or" msgstr "" -msgid "`Boost: betweenness centrality `_" +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "" -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgstr "" -msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +msgid "**options:** ``[directed, forbidden]``" msgstr "" #, fuzzy -msgid "Result columns change:" -msgstr "結果として返却されるカラム" +msgid "Dead end contraction on an undirected graph." +msgstr "導かれないグラフ。" -msgid "``n_seq`` is removed" +msgid "The green nodes are dead end nodes." msgstr "" -msgid "``seq`` changed type to ``BIGINT``" +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." msgstr "" -msgid "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." +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" msgstr "" -msgid "Components are described by edges." +msgid "**Empty**" msgstr "" -msgid "``component`` ascending." +msgid "Value = ``e`` indicating the row is an edge." msgstr "" -msgid "``edge`` ascending." +msgid "A pseudo `id` of the edge." msgstr "" -msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgid "Identifier of the source vertex of the current edge." msgstr "" -msgid "Returns set of |result-component-E|" +msgid "Identifier of the target vertex of the current edge." msgstr "" -msgid "The biconnected components of the graph" +msgid "Weight of the current edge." msgstr "" -msgid "``component``" -msgstr "``component``" - -msgid "Component identifier." +msgid "Dead end vertex on undirected graph" msgstr "" -msgid "Has the value of the minimum edge identifier in the component." +msgid "They have only one adjacent node." msgstr "" -msgid "Identifier of the edge that belongs to the ``component``." +msgid "Dead end vertex on directed graph" msgstr "" -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgid "The green nodes are dead end nodes" msgstr "" -msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" -msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." +msgid "Node" msgstr "" -msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgid "Adjacent nodes" msgstr "" -msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +msgid "Dead end" msgstr "" -msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." +msgid "Reason" msgstr "" -msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" -msgstr "" +#, fuzzy +msgid ":math:`6`" +msgstr ":math:`9`" -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" -msgstr "" +#, fuzzy +msgid ":math:`\\{1\\}`" +msgstr ":math:`9`" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" +#, fuzzy +msgid "Yes" +msgstr "はい" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Has only one adjacent node." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" +#, fuzzy +msgid ":math:`7`" +msgstr ":math:`9`" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" +#, fuzzy +msgid ":math:`\\{2\\}`" +msgstr ":math:`9`" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" +#, fuzzy +msgid ":math:`8`" +msgstr ":math:`9`" -msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" -msgstr "" +#, fuzzy +msgid ":math:`\\{2, 3\\}`" +msgstr ":math:`9`" -msgid "`Boost: Breadth First Search `__" +msgid "Has more than one adjacent node and all edges are incoming." msgstr "" -msgid "https://cp-algorithms.com/graph/01_bfs.html" -msgstr "" +#, fuzzy +msgid ":math:`\\{4\\}`" +msgstr ":math:`9`" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +#, fuzzy +msgid ":math:`10`" +msgstr ":math:`9`" + +#, fuzzy +msgid ":math:`\\{4, 5\\}`" +msgstr ":math:`9`" + +msgid "No" msgstr "" -msgid "``pgr_bipartite`` - Experimental" +msgid "Has more than one adjacent node and all edges are outgoing." msgstr "" -msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +#, fuzzy +msgid ":math:`1,2,3,4,5`" +msgstr ":math:`9`" + +msgid "Many adjacent nodes." msgstr "" -msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "" -msgid "The algorithm works in undirected graph only." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." msgstr "" -msgid "The returned values are not ordered." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "" -msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgid "Step by step dead end contraction" msgstr "" -msgid "If graph is not bipartite then algorithm returns empty set." +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -msgid "pgr_bipartite(`Edges SQL`_)" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" msgstr "" -msgid "When the graph is bipartite" +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." msgstr "" -msgid "Additional Example" +#, fuzzy +msgid "Creating the contracted graph" +msgstr "次のクエリを実行します。" + +msgid "Steps for the creation of the contracted graph" msgstr "" -msgid "The odd length cyclic graph can not be bipartite." +#, fuzzy +msgid "Add additional columns." +msgstr "追加の具体例" + +msgid "Save results into a table." msgstr "" -msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgid "The contracted vertices are not part of the contracted graph." msgstr "" -msgid "Edges in blue represent odd length cycle subgraph." +msgid "Using when departure and destination are in the contracted graph" msgstr "" -msgid "`Boost: is_bipartite `__" +msgid "Using when departure/destination is not in the contracted graph" msgstr "" -msgid "`Wikipedia: bipartite graph `__" +msgid "Using when departure and destination are not in the contracted graph" msgstr "" -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +#, fuzzy +msgid "``pgr_contractionHierarchies`` - Experimental" +msgstr "p" -msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." msgstr "" -msgid "pgr_boykovKolmogorov(Combinations)" +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." msgstr "" -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." msgstr "" -msgid "Function promoted to proposed." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." msgstr "" -msgid "Running time: Polynomial" +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgid "The process is done on graphs having only edges with positive costs." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" msgstr "" -msgid "Returns set of |result-flow|" +msgid "added shortcut edges, with negative identifiers;" msgstr "" -msgid "From vertex :math:`11` to vertex :math:`12`" +msgid "contracted nodes with an order." msgstr "" -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" +#, fuzzy +msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" +msgstr "p" + +msgid "Returns set of |result-contraction-hierarchies|" msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +#, fuzzy +msgid "Contraction hierarchies optional parameters" +msgstr "オプションとなるパラメータ" + +msgid "True if the graph is directed, False otherwise." msgstr "" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "" -msgid "`Boost: Boykov Kolmogorov max flow `__" +msgid "Type of the ``id``." msgstr "" -msgid "``pgr_breadthFirstSearch`` - Experimental" +msgid "Column ``id`` has a positive value" msgstr "" -msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgid "Column ``id`` has a negative value" msgstr "" +msgid "``metric``" +msgstr "``metric``" + +msgid "``vertex_order``" +msgstr "``vertex_order``" + #, fuzzy -msgid "Version 4.0.0:" -msgstr "バージョン 2.0.0" +msgid "On an undirected graph" +msgstr "導かれないグラフ" -msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "" -msgid "The implementation will work on any type of graph." +msgid "building contraction hierarchies on the whole graph" msgstr "" -msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." msgstr "" -msgid "Running time: :math:`O(E + V)`" +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." msgstr "" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "" +#, fuzzy +msgid "We obtain the contracted graph above:" +msgstr "次のクエリを実行します。" -msgid "**options:** ``[max_depth, directed]``" +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." msgstr "" -msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgid "On an undirected graph with forbidden vertices" msgstr "" -msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgid "building contraction with a set of forbidden vertices" msgstr "" -msgid "DFS optional parameters" +msgid "Contraction process steps details" msgstr "" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." +msgid "Shortcut building process" msgstr "" -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." msgstr "" -msgid "The resulting traversal is different." +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." msgstr "" -msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." msgstr "" -msgid "|ascending| |descending|" +msgid "Initialize the queue with a first vertices order" msgstr "" -msgid "ascending" +msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" msgstr "" -msgid "descending" -msgstr "" +#, fuzzy +msgid ":math:`v`" +msgstr ":math:`9`" -msgid "`Wikipedia: Breadth First Search algorithm `__" -msgstr "" +#, fuzzy +msgid ":math:`\\{p, r, u\\}`" +msgstr ":math:`9`" -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" +#, fuzzy +msgid ":math:`p`" +msgstr ":math:`9`" -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +#, fuzzy +msgid ":math:`\\{u, v\\}`" +msgstr ":math:`9`" + +#, fuzzy +msgid ":math:`u`" +msgstr ":math:`9`" + +#, fuzzy +msgid ":math:`\\{p, v, w\\}`" +msgstr ":math:`9`" + +#, fuzzy +msgid ":math:`r`" +msgstr ":math:`9`" + +#, fuzzy +msgid ":math:`\\{v, w\\}`" +msgstr ":math:`9`" + +#, fuzzy +msgid ":math:`w`" +msgstr ":math:`9`" + +#, fuzzy +msgid ":math:`\\{r, u\\}`" +msgstr ":math:`9`" + +msgid "Adjacent edges are removed." msgstr "" -msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." msgstr "" -msgid "``edge`` ascending" +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." msgstr "" -msgid "Running time: :math:`O(E * (V + E))`" +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." msgstr "" -msgid "pgr_bridges(`Edges SQL`_)" +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "" -msgid "Returns set of |result-edge|" +msgid "Build the final vertex order" msgstr "" -msgid "The bridges of the graph" +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." msgstr "" -msgid "Identifier of the edge that is a bridge." +msgid "Add shortcuts to the initial graph" msgstr "" -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." msgstr "" -msgid "`Boost: Connected components `__" +#, fuzzy +msgid "Use the contraction" +msgstr "序章" + +#, fuzzy +msgid "Build the contraction" +msgstr "序章" + +msgid "Add shortcuts and hierarchy in the existing tables" msgstr "" -msgid "``pgr_chinesePostman`` - Experimental" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "" -msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgid "Update and insert the results in the two tables." msgstr "" -msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgid "Use a Dijkstra shortest path algorithm on it" msgstr "" -msgid "pgr_chinesePostman(`Edges SQL`_)" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" msgstr "" -msgid "Returns set of |result-1-1-no-seq|" +msgid "``pgr_contractionLinear`` - Proposed" msgstr "" -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "Sequential value starting from ``1``" +#, fuzzy +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgstr "p" + +#, fuzzy +msgid "Linear contraction on an undirected graph." +msgstr "導かれないグラフ。" + +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgid "All edges adjacent will not be part of the contracted graph." msgstr "" -msgid "Aggregate cost from ``start_v`` to ``node``." +msgid "The red lines will be new edges of the contracted graph." msgstr "" -msgid "``pgr_chinesePostmanCost`` - Experimental" +msgid "**contraction Order**" msgstr "" -msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." msgstr "" -msgid "Return value when the graph if disconnected" +msgid "A node connects two (or more) `linear` edges when" msgstr "" -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgid "The number of adjacent vertices is 2." msgstr "" -msgid "RETURNS ``FLOAT``" +msgid "In case of a directed graph, a node is considered a `linear` node when" msgstr "" -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" +msgid "Linearity is symmetrical." +msgstr "" -msgid "Minimum costs of a circuit path." +msgid "Linearity is not symmetrical" msgstr "" -msgid "``pgr_connectedComponents``" -msgstr "``pgr_connectedComponents``" +msgid "Graph where linearity is not symmetrical." +msgstr "" -msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "" -msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "" -msgid "Components are described by vertices" +msgid "The three edges can be replaced by one undirected edge" msgstr "" -msgid "``component`` ascending" +#, fuzzy +msgid "Edge :math:`1 - 3`." +msgstr "エッジのセット :math:`5`:" + +msgid "With cost: :math:`4`." msgstr "" -msgid "pgr_connectedComponents(`Edges SQL`_)" +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." msgstr "" -msgid "Returns set of |result-component-V|" +msgid "Linearity is symmetrical" msgstr "" -msgid "The connected components of the graph" +msgid "Graph where linearity is symmetrical." msgstr "" -msgid "Has the value of the minimum node identifier in the component." +msgid "The four edges can be replaced by two directed edges." msgstr "" -msgid "Identifier of the vertex that belongs to the ``component``." +#, fuzzy +msgid "Edge :math:`3 - 1`." +msgstr "エッジのセット :math:`5`:" + +msgid "With cost: :math:`6`." msgstr "" -msgid "Connecting disconnected components" +msgid "The four edges can be replaced by one undirected edge." msgstr "" -msgid "wikipedia: `Connected component `__" +msgid "Step by step linear contraction" msgstr "" -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgstr "" -msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "Contracting vertex :math:`3`," msgstr "" -#, fuzzy -msgid "Version 3.8.0" -msgstr "バージョン 3.0.0" +msgid "The vertex :math:`3` is removed from the graph" +msgstr "" -#, fuzzy -msgid "New signature:" -msgstr "機能" +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "" -msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" #, fuzzy -msgid "New name and order of optional parameters." -msgstr "オプションとなるパラメータ" +msgid "Contracting vertex :math:`2`:" +msgstr "エッジのセット :math:`5`:" -msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "The vertex :math:`2` is removed from the graph" msgstr "" -msgid "Name change from ``pgr_contractGraph``" +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." msgstr "" -msgid "Bug fixes" +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "" -msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." msgstr "" #, fuzzy -msgid "Does not return the full contracted graph." +msgid "Create the contracted graph." msgstr "次のクエリを実行します。" -msgid "Only changes on the graph are returned." +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "The returned values include:" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" -msgid "The new edges generated by linear contraction." +msgid "Version 3.4.0" msgstr "" -msgid "The modified vertices generated by dead end contraction." +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." msgstr "" -msgid "The returned values are ordered as follows:" +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." msgstr "" -msgid "column ``id`` ascending when its a modified vertex." +msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "column ``id`` with negative numbers descending when its a new edge." +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" -msgid "Currently there are two types of contraction methods included in this function:" +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" msgstr "" -msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgid "where :math:`|V|` is the number of vertices," msgstr "" -msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgid ":math:`m` is the maximum degree of the vertices in the graph." msgstr "" -#, fuzzy -msgid "pgr_contraction(`Edges SQL`_, [**options**])" -msgstr "pg" - -msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" msgstr "" -msgid "Returns set of |result-contract|" +msgid "Returns set of |result_node_order|" msgstr "" -#, fuzzy -msgid "Dead end and linear contraction in that order on an undirected graph." -msgstr "導かれないグラフ。" - -msgid "Contraction optional parameters" +msgid "Graph ordering of pgRouting :doc:`sampledata`" msgstr "" -msgid "``methods``" -msgstr "``methods``" +#, fuzzy +msgid "Returns set of ``(seq, node)``" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" #, fuzzy -msgid "``INTEGER[]``" -msgstr "``INTEGER``" +msgid "Sequence of the order starting from 1." +msgstr "開始ノードの識別子。" -msgid "``ARRAY[1,2]``" +msgid "New ordering in reverse order." msgstr "" -msgid "Ordered contraction operations." +msgid "`Boost: Cuthill-McKee Ordering `__" msgstr "" -msgid "1 = Dead end contraction" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" -msgid "2 = Linear contraction" +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" -msgid "``cycles``" -msgstr "``cycles``" - -msgid ":math:`1`" +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." msgstr "" -msgid "Number of times the contraction methods will be performed." +msgid "pgr_dagShortestPath(Combinations)" msgstr "" -msgid "``forbidden``" -msgstr "``forbidden``" - -msgid "``BIGINT[]``" +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." msgstr "" -#, fuzzy -msgid "``ARRAY[]::BIGINT[]``" -msgstr "``BIGINT``" - -msgid "Identifiers of vertices forbidden for contraction." +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." msgstr "" -msgid "The function returns a single row. The columns of the row are:" +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." msgstr "" -msgid "``type``" -msgstr "``type``" - -msgid "Type of the row." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "``v`` when the row is a vertex." +msgid "The `agg_cost` the non included values `(v, v)` is `0`" msgstr "" -msgid "Column ``id`` has a positive value." +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "``e`` when the row is an edge." +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" msgstr "" -msgid "Column ``id`` has a negative value." -msgstr "" +#, fuzzy +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "p" -msgid "All numbers on this column are ``DISTINCT``" -msgstr "" +#, fuzzy +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "p" -msgid "When ``type`` = **'v'**." +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "Identifier of the modified vertex." +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "When ``type`` = **'e'**." +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "Decreasing sequence starting from **-1**." +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" msgstr "" -msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" msgstr "" -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" - -msgid "Array of contracted vertex identifiers." +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "" -msgid "When ``type`` = **'v'**: :math:`-1`" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "" -msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." -msgstr "" +#, fuzzy +msgid "Return columns" +msgstr "結果として返却されるカラム" -msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgid "Making **start_vids** the same as **end_vids**" msgstr "" -msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgid "`Boost: DAG shortest paths `__" msgstr "" -msgid "Only dead end contraction" +msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" -msgid "Only linear contraction" -msgstr "" +msgid "``pgr_degree``" +msgstr "``pgr_degree``" -msgid "The cycle" +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." msgstr "" -msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgid "Error messages adjustment." msgstr "" -msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgid "New signature with only Edges SQL." msgstr "" -msgid "Contracting sample data" +msgid "Calculates the degree of the vertices of an undirected graph" msgstr "" -msgid "In this section, building and using a contracted graph will be shown by example." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." msgstr "" -msgid "The :doc:`sampledata` for an undirected graph is used" +msgid "A loop contributes 2 to a vertex's degree." msgstr "" -msgid "a dead end operation first followed by a linear operation." +msgid "A vertex with degree 0 is called an isolated vertex." msgstr "" -msgid "Construction of the graph in the database" +msgid "Isolated vertex is not part of the result" msgstr "" -msgid "The original graph:" +msgid "Vertex not participating on the subgraph is considered and isolated vertex." msgstr "" -msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." msgstr "" -msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgid "The code can be used as base code for the particular application requirements." msgstr "" -msgid "After doing the dead end contraction operation:" +msgid "No ordering is performed." msgstr "" -msgid "After doing the linear contraction operation to the graph above:" +#, fuzzy +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgstr "p" + +msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" msgstr "" -msgid "The process to create the contraction graph on the database:" +msgid "RETURNS SETOF |result-degree|" msgstr "" -msgid "Add additional columns" +msgid "Edges" msgstr "" -msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" +#, fuzzy +msgid "example" +msgstr "例" + +msgid "Get the degree of the vertices defined on the edges table" msgstr "" #, fuzzy -msgid "Column." -msgstr "カラム" +msgid "Edges and Vertices" +msgstr "索引とテーブル" -msgid "The vertices set belonging to the vertex/edge" +msgid "Extracting the vertex information" msgstr "" -msgid "``is_contracted``" -msgstr "``is_contracted``" +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgstr "" -msgid "On the vertex table" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" -msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgid "Calculate the degree of the nodes:" msgstr "" -msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgid "`Vertex SQL`_" msgstr "" -msgid "``is_new``" -msgstr "``is_new``" +msgid "`Vertex SQL`_ as described below" +msgstr "" -msgid "On the edge table" +msgid "``dryrun``" +msgstr "``dryrun``" + +msgid "When true do not process and get in a NOTICE the resulting query." msgstr "" -msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgid "For the `Edges and Vertices`_ signature:" msgstr "" -msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgid "For the `Edges`_ signature:" msgstr "" -msgid "Store contraction information" +msgid "Vertex SQL" msgstr "" -msgid "Store the contraction results in a table." +msgid "``in_edges``" +msgstr "``in_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." msgstr "" -msgid "Update the edges and vertices tables" +msgid "When missing, ``out_edges`` must exist." msgstr "" -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "``out_edges``" +msgstr "``out_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." msgstr "" -msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgid "When missing, ``in_edges`` must exist." msgstr "" -msgid "Insert the new edges generated by pgr_contraction." +msgid "Vertex identifier" msgstr "" -msgid "The contracted graph" +msgid "``degree``" +msgstr "``degree``" + +msgid "Number of edges that are incident to the vertex ``id``" msgstr "" -msgid "Vertices that belong to the contracted graph." +msgid "Degree of a loop" msgstr "" -msgid "Edges that belong to the contracted graph." +msgid "Using the `Edges`_ signature." msgstr "" -msgid "Visually:" +msgid "Using the `Edges and Vertices`_ signature." msgstr "" -msgid "Using the contracted graph" +msgid "Degree of a sub graph" msgstr "" -msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgid "For the following is a subgraph of the :doc:`sampledata`:" msgstr "" -msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" msgstr "" -msgid "Case 1: Both source and target belong to the contracted graph." +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" msgstr "" -msgid "Case 2: Source and/or target belong to an edge subgraph." +msgid "The vertices not participating on the edge are considered isolated" msgstr "" -msgid "Case 3: Source and/or target belong to a vertex." +msgid "their degree is 0 in the subgraph and" msgstr "" -msgid "The final application should consider all of those cases." +msgid "their degree is not shown in the output." msgstr "" -msgid "Create a view (or table) of the contracted graph:" +msgid "Using a vertex table" msgstr "" -msgid "Create the function that will use the contracted graph." +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." msgstr "" -msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgid "Extract the vertex information and save into a table:" msgstr "" -msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "Dry run execution" msgstr "" -msgid "``pgr_contractionDeadEnd`` - Proposed" +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." msgstr "" -msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "The results can be used as base code to make a refinement based on the backend development needs." msgstr "" -msgid "A node is considered a dead end node when:" +msgid "Finding dead ends" msgstr "" -msgid "On undirected graphs:" +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." msgstr "" -msgid "The number of adjacent vertices is 1." +msgid "The degree of a dead end is 1." msgstr "" -msgid "On directed graphs:" +msgid "Finding linear vertices" msgstr "" -msgid "When there is only one adjacent vertex or" +msgid "The degree of a linear vertex is 2." msgstr "" -msgid "When all edges are incoming regardless of the number of adjacent vertices." +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "" -msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgid ":doc:`pgr_extractVertices`" msgstr "" -msgid "**options:** ``[directed, forbidden]``" +msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "" -#, fuzzy -msgid "Dead end contraction on an undirected graph." -msgstr "導かれないグラフ。" +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "" -msgid "The green nodes are dead end nodes." +msgid "Version 3.3.0" msgstr "" -msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." msgstr "" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgid "The implementation works for both **directed** and **undirected** graphs." msgstr "" -msgid "**Empty**" +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." msgstr "" -msgid "Value = ``e`` indicating the row is an edge." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." msgstr "" -msgid "A pseudo `id` of the edge." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." msgstr "" -msgid "Identifier of the source vertex of the current edge." +msgid "It does not produce the shortest path from a root vertex to a target vertex." msgstr "" -msgid "Identifier of the target vertex of the current edge." +msgid "The aggregate cost of traversal is not guaranteed to be minimal." msgstr "" -msgid "Weight of the current edge." +msgid "The returned values are ordered in ascending order of `start_vid`." msgstr "" -msgid "Dead end vertex on undirected graph" +msgid "Depth First Search Running time: :math:`O(E + V)`" msgstr "" -msgid "They have only one adjacent node." +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" msgstr "" -msgid "Dead end vertex on directed graph" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgstr "" -msgid "The green nodes are dead end nodes" +msgid "**options:** ``[directed, max_depth]``" msgstr "" -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" -msgid "Node" +msgid "`Boost: Depth First Search `__" msgstr "" -msgid "Adjacent nodes" +msgid "`Boost: Undirected DFS `__" msgstr "" -msgid "Dead end" +msgid "`Wikipedia: Depth First Search algorithm `__" msgstr "" -msgid "Reason" +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" #, fuzzy -msgid ":math:`6`" -msgstr ":math:`9`" +msgid "Version 3.5.0" +msgstr "バージョン 3.0.0" -#, fuzzy -msgid ":math:`\\{1\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "" -#, fuzzy -msgid "Yes" -msgstr "はい" +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgstr "" -msgid "Has only one adjacent node." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" -#, fuzzy -msgid ":math:`7`" -msgstr ":math:`9`" +msgid "Version 3.1.0" +msgstr "" -#, fuzzy -msgid ":math:`\\{2\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstra(Combinations)" +msgstr "" -#, fuzzy -msgid ":math:`8`" -msgstr ":math:`9`" +msgid "Version 2.2.0" +msgstr "" -#, fuzzy -msgid ":math:`\\{2, 3\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstra(One to Many)" +msgstr "" -msgid "Has more than one adjacent node and all edges are incoming." +msgid "pgr_dijkstra(Many to One)" +msgstr "" + +msgid "pgr_dijkstra(Many to Many)" +msgstr "" + +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" #, fuzzy -msgid ":math:`\\{4\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "p" #, fuzzy -msgid ":math:`10`" -msgstr ":math:`9`" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "p" #, fuzzy -msgid ":math:`\\{4, 5\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "p" -msgid "No" +msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Has more than one adjacent node and all edges are outgoing." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -#, fuzzy -msgid ":math:`1,2,3,4,5`" -msgstr ":math:`9`" - -msgid "Many adjacent nodes." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" -msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." +msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" -msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgid "Directed graph with cost and reverse cost columns" msgstr "" -msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." +msgid "1) Path from :math:`6` to :math:`10`" msgstr "" -msgid "Step by step dead end contraction" +msgid "2) Path from :math:`6` to :math:`7`" msgstr "" -msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgid "3) Path from :math:`12` to :math:`10`" msgstr "" -msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgid "4) Path from :math:`12` to :math:`7`" msgstr "" -msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" msgstr "" -#, fuzzy -msgid "Creating the contracted graph" -msgstr "次のクエリを実行します。" - -msgid "Steps for the creation of the contracted graph" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" msgstr "" -#, fuzzy -msgid "Add additional columns." -msgstr "追加の具体例" - -msgid "Save results into a table." +msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" msgstr "" -msgid "The contracted vertices are not part of the contracted graph." +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" msgstr "" -msgid "Using when departure and destination are in the contracted graph" +msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" msgstr "" -msgid "Using when departure/destination is not in the contracted graph" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgstr "" -msgid "Using when departure and destination are not in the contracted graph" +msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" -#, fuzzy -msgid "``pgr_contractionHierarchies`` - Experimental" -msgstr "p" - -msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" -msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" -msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgid "Undirected graph with cost and reverse cost columns" msgstr "" -msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgid "9) Path from :math:`6` to :math:`10`" msgstr "" -msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgid "10) Path from :math:`6` to :math:`7`" msgstr "" -msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgid "11) Path from :math:`12` to :math:`10`" msgstr "" -msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgid "12) Path from :math:`12` to :math:`7`" msgstr "" -msgid "The process is done on graphs having only edges with positive costs." +msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" msgstr "" -msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" msgstr "" -msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" msgstr "" -msgid "added shortcut edges, with negative identifiers;" +msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" msgstr "" -msgid "contracted nodes with an order." +msgid "For **directed** graphs only with ``cost`` column" msgstr "" -msgid "The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "Directed graph only with cost column" msgstr "" -#, fuzzy -msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" -msgstr "p" - -msgid "Returns set of |result-contraction-hierarchies|" +msgid "17) Path from :math:`6` to :math:`10`" msgstr "" -#, fuzzy -msgid "Contraction hierarchies optional parameters" -msgstr "オプションとなるパラメータ" +msgid "18) Path from :math:`6` to :math:`7`" +msgstr "" -msgid "True if the graph is directed, False otherwise." +msgid "19) Path from :math:`12` to :math:`10`" msgstr "" -msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" +msgid "20) Path from :math:`12` to :math:`7`" msgstr "" -msgid "Type of the ``id``." +msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" msgstr "" -msgid "Column ``id`` has a positive value" +msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" msgstr "" -msgid "Column ``id`` has a negative value" +msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" msgstr "" -msgid "``metric``" -msgstr "``metric``" +msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" +msgstr "" -msgid "``vertex_order``" -msgstr "``vertex_order``" +msgid "For **undirected** graphs only with ``cost`` column" +msgstr "" -#, fuzzy -msgid "On an undirected graph" -msgstr "導かれないグラフ" +msgid "Undirected graph only with cost column" +msgstr "" -msgid "The following query shows the original data involved in the contraction operation on an undirected graph." +msgid "25) Path from :math:`6` to :math:`10`" msgstr "" -msgid "building contraction hierarchies on the whole graph" +msgid "26) Path from :math:`6` to :math:`7`" msgstr "" -msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgid "27) Path from :math:`12` to :math:`10`" msgstr "" -msgid "After computing the contraction hierarchies, an order is now given to the vertices," +msgid "28) Path from :math:`12` to :math:`7`" msgstr "" -msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" msgstr "" -#, fuzzy -msgid "We obtain the contracted graph above:" -msgstr "次のクエリを実行します。" +msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" +msgstr "" -msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." +msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" msgstr "" -msgid "On an undirected graph with forbidden vertices" +msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" msgstr "" -msgid "building contraction with a set of forbidden vertices" +msgid "Equvalences between signatures" msgstr "" -msgid "Contraction process steps details" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" -msgid "Shortcut building process" +msgid "33) Using `One to One`_" msgstr "" -msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgid "34) Using `One to Many`_" msgstr "" -msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgid "35) Using `Many to One`_" msgstr "" -msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgid "36) Using `Many to Many`_" msgstr "" -msgid "Initialize the queue with a first vertices order" +msgid "37) Using `Combinations`_" msgstr "" -msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" +msgid "`Boost: Dijkstra shortest paths `__" msgstr "" -#, fuzzy -msgid ":math:`v`" -msgstr ":math:`9`" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgstr "" -#, fuzzy -msgid ":math:`\\{p, r, u\\}`" -msgstr ":math:`9`" +msgid "``pgr_dijkstraCost``" +msgstr "``pgr_dijkstraCost``" #, fuzzy -msgid ":math:`p`" -msgstr ":math:`9`" +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -#, fuzzy -msgid ":math:`\\{u, v\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstraCost(Combinations)" +msgstr "" #, fuzzy -msgid ":math:`u`" -msgstr ":math:`9`" +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" #, fuzzy -msgid ":math:`\\{p, v, w\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "p" -#, fuzzy -msgid ":math:`r`" -msgstr ":math:`9`" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" #, fuzzy -msgid ":math:`\\{v, w\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "p" -#, fuzzy -msgid ":math:`w`" -msgstr ":math:`9`" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" -#, fuzzy -msgid ":math:`\\{r, u\\}`" -msgstr ":math:`9`" +msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "" -msgid "Adjacent edges are removed." +msgid "``pgr_dijkstraCostMatrix``" +msgstr "``pgr_dijkstraCostMatrix``" + +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." msgstr "" -msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgid "Using Dijkstra algorithm, calculate and return a cost matrix." msgstr "" -msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgid "``pgr_dijkstraNear``" +msgstr "``pgr_dijkstraNear``" + +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "A hierarchy will now be constructed by contracting again the vertices in this order." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." msgstr "" -msgid "Build the final vertex order" +msgid "Uses Dijkstra algorithm." msgstr "" -msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgid "Works for **directed** and **undirected** graphs." msgstr "" -msgid "Add shortcuts to the initial graph" +msgid "When there are more than one path to the same vertex with same cost:" msgstr "" -msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgid "The algorithm will return just one path" msgstr "" -#, fuzzy -msgid "Use the contraction" -msgstr "序章" +msgid "Optionally allows to find more than one path." +msgstr "" -#, fuzzy -msgid "Build the contraction" -msgstr "序章" +msgid "When more than one path is to be returned:" +msgstr "" -msgid "Add shortcuts and hierarchy in the existing tables" +msgid "Results are sorted in increasing order of:" msgstr "" -msgid "Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "aggregate cost" msgstr "" -msgid "Update and insert the results in the two tables." +msgid "Within the same value of aggregate costs:" msgstr "" -msgid "Use a Dijkstra shortest path algorithm on it" +msgid "results are sorted by (source, target)" msgstr "" -msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" msgstr "" -msgid "``pgr_contractionLinear`` - Proposed" +msgid "One to Many; :math:`drt`" msgstr "" -msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "Many to One: :math:`drt`" msgstr "" -#, fuzzy -msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" -msgstr "p" +msgid "Many to Many: :math:`drt * |Starting vids|`" +msgstr "" -#, fuzzy -msgid "Linear contraction on an undirected graph." -msgstr "導かれないグラフ。" +msgid "Combinations: :math:`drt * |Starting vids|`" +msgstr "" -msgid "The green nodes are linear nodes and will not be part of the contracted graph." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "All edges adjacent will not be part of the contracted graph." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "The red lines will be new edges of the contracted graph." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "**contraction Order**" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgid "**options A:** ``[directed, cap]``" msgstr "" -msgid "A node connects two (or more) `linear` edges when" +msgid "**options B:** ``[directed, cap, global]``" msgstr "" -msgid "The number of adjacent vertices is 2." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "In case of a directed graph, a node is considered a `linear` node when" +msgid "**options:** ``[directed, cap]``" msgstr "" -msgid "Linearity is symmetrical." +msgid "Departing on car from vertex :math:`6` find the nearest subway station." msgstr "" -msgid "Linearity is not symmetrical" +msgid "Using a **directed** graph for car routing." msgstr "" -msgid "Graph where linearity is not symmetrical." +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" -msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." +msgid "The defaults used:" msgstr "" -msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." +msgid "`directed => true`" msgstr "" -msgid "The three edges can be replaced by one undirected edge" +msgid "`cap => 1`" msgstr "" -#, fuzzy -msgid "Edge :math:`1 - 3`." -msgstr "エッジのセット :math:`5`:" +msgid "The result shows that station at vertex :math:`11` is the nearest." +msgstr "" -msgid "With cost: :math:`4`." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" msgstr "" -msgid "Linearity is symmetrical" +msgid "On line `4`: using the positional parameter: `directed` set to ``true``" msgstr "" -msgid "Graph where linearity is symmetrical." +msgid "In line `5`: using named parameter `cap => 2`" msgstr "" -msgid "The four edges can be replaced by two directed edges." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." msgstr "" -#, fuzzy -msgid "Edge :math:`3 - 1`." -msgstr "エッジのセット :math:`5`:" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" -msgid "With cost: :math:`6`." +msgid "**options:** ``[directed, cap, global]``" msgstr "" -msgid "The four edges can be replaced by one undirected edge." +msgid "Find the best pedestrian connection between two lines of buses" msgstr "" -msgid "Step by step linear contraction" +msgid "Using an **undirected** graph for pedestrian routing" msgstr "" -msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgid "The first subway line stations are at :math:`\\{15, 16\\}`" msgstr "" -msgid "Contracting vertex :math:`3`," +msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" -msgid "The vertex :math:`3` is removed from the graph" +msgid "On line `4`: using the named parameter: `directed => false`" msgstr "" -msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgid "`global => true`" msgstr "" -msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." msgstr "" -#, fuzzy -msgid "Contracting vertex :math:`2`:" -msgstr "エッジのセット :math:`5`:" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgstr "" -msgid "The vertex :math:`2` is removed from the graph" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgid "Find the best car connection between all the stations of two subway lines" msgstr "" -msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" -msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." +msgid "The second subway line stations are at :math:`\\{15, 16\\}`" msgstr "" -#, fuzzy -msgid "Create the contracted graph." -msgstr "次のクエリを実行します。" +msgid "The combinations contents:" +msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" msgstr "" -msgid "Version 3.4.0" +msgid "On line `8`: using the named parameter is `global => false`" msgstr "" -msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgid "From the results:" msgstr "" -msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" msgstr "" -msgid "The implementation is for **undirected** graphs." +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" msgstr "" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" msgstr "" -msgid "where :math:`|V|` is the number of vertices," +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" -msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgid "Dijkstra optional parameters" msgstr "" -msgid "Returns set of |result_node_order|" +msgid "Near optional parameters" msgstr "" -msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgid "``cap``" +msgstr "``cap``" + +msgid "Find at most ``cap`` number of nearest shortest paths" msgstr "" -#, fuzzy -msgid "Returns set of ``(seq, node)``" -msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" +msgid "``global``" +msgstr "``global``" -#, fuzzy -msgid "Sequence of the order starting from 1." -msgstr "開始ノードの識別子。" +msgid "When ``true``: only ``cap`` limit results will be returned" +msgstr "" -msgid "New ordering in reverse order." +msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "`Boost: Cuthill-McKee Ordering `__" +msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgid "``pgr_dijkstraNearCost``" +msgstr "``pgr_dijkstraNearCost``" + +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "``pgr_dagShortestPath`` - Experimental" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "pgr_dagShortestPath(Combinations)" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "" -#, fuzzy -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "p" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgstr "" -#, fuzzy -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "p" +msgid "``pgr_dijkstraVia``" +msgstr "``pgr_dijkstraVia``" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgid "Route" msgstr "" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgid "is a sequence of paths." msgstr "" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgid "Path" msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgid "is a section of the route." msgstr "" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgid "One Via" msgstr "" -#, fuzzy -msgid "Return columns" -msgstr "結果として返却されるカラム" - -msgid "Making **start_vids** the same as **end_vids**" +msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" msgstr "" -msgid "`Boost: DAG shortest paths `__" +msgid "**options:** ``[directed, strict, U_turn_on_edge]``" msgstr "" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Returns set of |via-result|" msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" - -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." msgstr "" -msgid "Error messages adjustment." +msgid "Via optional parameters" msgstr "" -msgid "New signature with only Edges SQL." +msgid "When ``true`` departing from a visited vertex will not try to avoid" msgstr "" -msgid "Calculates the degree of the vertices of an undirected graph" +msgid "Identifier of a path. Has value **1** for the first path." msgstr "" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." msgstr "" -msgid "A loop contributes 2 to a vertex's degree." +msgid "-1 for the last node of the path." msgstr "" -msgid "A vertex with degree 0 is called an isolated vertex." +msgid "-2 for the last node of the route." msgstr "" -msgid "Isolated vertex is not part of the result" -msgstr "" +msgid "``route_agg_cost``" +msgstr "``route_agg_cost``" -msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." msgstr "" -msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." msgstr "" -msgid "The code can be used as base code for the particular application requirements." +msgid "The main query" msgstr "" -msgid "No ordering is performed." +msgid "Aggregate cost of the third path." msgstr "" -#, fuzzy -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" -msgstr "p" - -msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgid "Route's aggregate cost of the route at the end of the third path." msgstr "" -msgid "RETURNS SETOF |result-degree|" +msgid "Nodes visited in the route." msgstr "" -msgid "Edges" +msgid "The aggregate costs of the route when the visited vertices are reached." msgstr "" -#, fuzzy -msgid "example" -msgstr "例" +msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgstr "" -msgid "Get the degree of the vertices defined on the edges table" +msgid ":doc:`via-category`." msgstr "" -#, fuzzy -msgid "Edges and Vertices" -msgstr "索引とテーブル" +msgid ":doc:`dijkstra-family`." +msgstr "" -msgid "Extracting the vertex information" +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgid "pgr_drivingDistance(Single vertex)" msgstr "" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "" -msgid "Calculate the degree of the nodes:" +msgid "pgr_drivingDistance(Multiple vertices)" msgstr "" -msgid "`Vertex SQL`_" +msgid "Result column name change: ``from_v`` to ``start_vid``." msgstr "" -msgid "`Vertex SQL`_ as described below" +msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "``dryrun``" -msgstr "``dryrun``" +#, fuzzy +msgid "Signature change:" +msgstr "変更機能" -msgid "When true do not process and get in a NOTICE the resulting query." +msgid "pgr_drivingDistance(single vertex)" msgstr "" -msgid "For the `Edges and Vertices`_ signature:" +msgid "New official signature:" msgstr "" -msgid "For the `Edges`_ signature:" +msgid "pgr_drivingDistance(multiple vertices)" msgstr "" -msgid "Vertex SQL" +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." msgstr "" -msgid "``in_edges``" -msgstr "``in_edges``" +#, fuzzy +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgstr "p" -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" -msgid "When missing, ``out_edges`` must exist." +msgid "**options:** [directed, equicost]" msgstr "" -msgid "``out_edges``" -msgstr "``out_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgid "Single Vertex" msgstr "" -msgid "When missing, ``in_edges`` must exist." +msgid "From vertex :math:`11` for a distance of :math:`3.0`" msgstr "" -msgid "Vertex identifier" +msgid "Multiple Vertices" msgstr "" -msgid "``degree``" -msgstr "``degree``" - -msgid "Number of edges that are incident to the vertex ``id``" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" msgstr "" -msgid "Degree of a loop" +msgid "Driving distance optional parameters" msgstr "" -msgid "Using the `Edges`_ signature." -msgstr "" +msgid "``equicost``" +msgstr "``equicost``" -msgid "Using the `Edges and Vertices`_ signature." +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." msgstr "" -msgid "Degree of a sub graph" +msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" -msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgid "end-before" msgstr "" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" -msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" -msgid "The vertices not participating on the edge are considered isolated" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -msgid "their degree is 0 in the subgraph and" +msgid "Output columns standardized to |result_edge_color|" msgstr "" -msgid "their degree is not shown in the output." +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." msgstr "" -msgid "Using a vertex table" +msgid "The implementation is for **undirected** and **loop-free** graphs" msgstr "" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgid "loop free" msgstr "" -msgid "Extract the vertex information and save into a table:" +msgid "no self-loops and no parallel edges." msgstr "" -msgid "Dry run execution" +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." msgstr "" -msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." msgstr "" -msgid "Finding dead ends" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" msgstr "" -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgid "The algorithm tries to assign the least possible color to every edge." msgstr "" -msgid "The degree of a dead end is 1." +msgid "Does not always produce optimal coloring." msgstr "" -msgid "Finding linear vertices" +msgid "The returned rows are ordered in ascending order of the edge identifier." msgstr "" -msgid "The degree of a linear vertex is 2." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" msgstr "" -msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" msgstr "" -msgid ":doc:`pgr_extractVertices`" +msgid "where :math:`|E|` is the number of edges in the graph," msgstr "" -msgid "``pgr_depthFirstSearch`` - Proposed" +msgid ":math:`|V|` is the number of vertices in the graph." msgstr "" -msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgid "pgr_edgeColoring(`Edges SQL`_)" msgstr "" -msgid "Version 3.3.0" +msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgid "`Boost: Edge Coloring `__" msgstr "" -msgid "The implementation works for both **directed** and **undirected** graphs." +msgid "`Wikipedia: Graph coloring `__" msgstr "" -msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgid "Output columns standardized to |generic-result|" msgstr "" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" -msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." msgstr "" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgid "The main characterics are:" msgstr "" -msgid "The returned values are ordered in ascending order of `start_vid`." +msgid "Calculates the edge disjoint paths between any two groups of vertices." msgstr "" -msgid "Depth First Search Running time: :math:`O(E + V)`" +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "The graph can be directed or undirected." msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "" -msgid "**options:** ``[directed, max_depth]``" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "`Boost: Depth First Search `__" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "`Boost: Undirected DFS `__" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "`Wikipedia: Depth First Search algorithm `__" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." msgstr "" -#, fuzzy -msgid "Version 3.5.0" -msgstr "バージョン 3.0.0" - -msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "Manually assigned vertex combinations on an undirected graph." msgstr "" -msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgid "``pgr_edmondsKarp``" +msgstr "``pgr_edmondsKarp``" + +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" -msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgid "pgr_edmondsKarp(Combinations)" msgstr "" -msgid "Version 3.1.0" +msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "" -msgid "pgr_dijkstra(Combinations)" +msgid "Running time: :math:`O( V * E ^ 2)`" msgstr "" -msgid "Version 2.2.0" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "pgr_dijkstra(One to Many)" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "pgr_dijkstra(Many to One)" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "pgr_dijkstra(Many to Many)" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Signature change on pgr_dijkstra(One to One)" +msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "p" +msgid "`Boost: Edmonds Karp max flow `__" +msgstr "" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "p" +msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgstr "" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "p" +msgid "``pgr_edwardMoore`` - Experimental" +msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "pgr_edwardMoore(Combinations)" msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network." +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." msgstr "" -msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." msgstr "" -msgid "Directed graph with cost and reverse cost columns" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" msgstr "" -msgid "1) Path from :math:`6` to :math:`10`" +msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" -msgid "2) Path from :math:`6` to :math:`7`" +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." msgstr "" -msgid "3) Path from :math:`12` to :math:`10`" +msgid "Running time:" msgstr "" -msgid "4) Path from :math:`12` to :math:`7`" +msgid "Worst case: :math:`O(| V | * | E |)`" msgstr "" -msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" +msgid "Average case: :math:`O( | E | )`" msgstr "" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" +msgid "Using a combinations table on an **undirected** graph." msgstr "" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" -msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" +msgid "``pgr_extractVertices``" +msgstr "``pgr_extractVertices``" + +msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" -msgid "Undirected graph with cost and reverse cost columns" +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." msgstr "" -msgid "9) Path from :math:`6` to :math:`10`" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" msgstr "" -msgid "10) Path from :math:`6` to :math:`7`" +msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" msgstr "" -msgid "11) Path from :math:`12` to :math:`10`" +msgid "RETURNS SETOF |result-extract|" msgstr "" -msgid "12) Path from :math:`12` to :math:`7`" +msgid "When line geometry is known" msgstr "" -msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" +msgid "(Optional) identifier of the edge." msgstr "" -msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" +msgid "``geom``" +msgstr "``geom``" + +msgid "``LINESTRING``" +msgstr "``LINESTRING``" + +msgid "Geometry of the edge." msgstr "" -msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." msgstr "" -msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" +msgid "Ignored columns:" msgstr "" -msgid "For **directed** graphs only with ``cost`` column" +msgid "``startpoint``" +msgstr "``startpoint``" + +msgid "``endpoint``" +msgstr "``endpoint``" + +msgid "When vertex geometry is known" msgstr "" -msgid "Directed graph only with cost column" +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." msgstr "" -msgid "17) Path from :math:`6` to :math:`10`" +msgid "``POINT``" +msgstr "``POINT``" + +msgid "POINT geometry of the starting vertex." msgstr "" -msgid "18) Path from :math:`6` to :math:`7`" +msgid "POINT geometry of the ending vertex." msgstr "" -msgid "19) Path from :math:`12` to :math:`10`" +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" -msgid "20) Path from :math:`12` to :math:`7`" +msgid "When identifiers of vertices are known" msgstr "" -msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." msgstr "" -msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" +msgid "``NULL`` When the ``id`` is not part of the inner query" msgstr "" -msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" +msgid "X value of the point geometry" msgstr "" -msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" +msgid "``NULL`` When no geometry is provided" msgstr "" -msgid "For **undirected** graphs only with ``cost`` column" +msgid "Geometry of the point" msgstr "" -msgid "Undirected graph only with cost column" +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "" -msgid "25) Path from :math:`6` to :math:`10`" +msgid "Create a routing topology" msgstr "" -msgid "26) Path from :math:`6` to :math:`7`" +msgid "Make sure the database does not have the ``vertices_table``" msgstr "" -msgid "27) Path from :math:`12` to :math:`10`" +msgid "Clean up the columns of the routing topology to be created" msgstr "" -msgid "28) Path from :math:`12` to :math:`7`" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" -msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" +msgid "For big edge tables that are been prepared," msgstr "" -msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" +msgid "Create it as ``UNLOGGED`` and" msgstr "" -msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" +msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" msgstr "" -msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" +msgid "Inspect the vertices table" msgstr "" -msgid "Equvalences between signatures" +msgid "Create the routing topology on the edge table" msgstr "" -msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "Updating the ``source`` information" msgstr "" -msgid "33) Using `One to One`_" +msgid "Updating the ``target`` information" msgstr "" -msgid "34) Using `One to Many`_" +msgid "Inspect the routing topology" msgstr "" -msgid "35) Using `Many to One`_" +msgid "**Generated topology**" msgstr "" -msgid "36) Using `Many to Many`_" +msgid "``pgr_findCloseEdges``" +msgstr "``pgr_findCloseEdges``" + +msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "37) Using `Combinations`_" +msgid "``partial`` option is removed." msgstr "" -msgid "`Boost: Dijkstra shortest paths `__" +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." msgstr "" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "" -msgid "``pgr_dijkstraCost``" -msgstr "``pgr_dijkstraCost``" +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgstr "" -#, fuzzy -msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." -msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" +msgid "``EMPTY SET`` is returned on dryrun executions" +msgstr "" -msgid "pgr_dijkstraCost(Combinations)" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -#, fuzzy -msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." -msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgstr "" -#, fuzzy -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "p" +msgid "**options:** ``[cap, dryrun]``" +msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Returns set of |result-find|" msgstr "" -#, fuzzy -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "p" +msgid "One point" +msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Get two close edges to points of interest with :math:`pid = 5`" msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "``cap => 2``" msgstr "" -msgid "``pgr_dijkstraCostMatrix``" -msgstr "``pgr_dijkstraCostMatrix``" +msgid "Many points" +msgstr "" -msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgid "For each points of interests, find the closest edge." msgstr "" -msgid "Using Dijkstra algorithm, calculate and return a cost matrix." +msgid "**point**" msgstr "" -msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "The point geometry" msgstr "" -msgid "``pgr_dijkstraNear``" -msgstr "``pgr_dijkstraNear``" +msgid "**points**" +msgstr "" -msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgid "``POINT[]``" msgstr "" -msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgid "An array of point geometries" msgstr "" -msgid "Uses Dijkstra algorithm." +msgid "**tolerance**" msgstr "" -msgid "Works for **directed** and **undirected** graphs." +msgid "Max distance between geometries" msgstr "" -msgid "When there are more than one path to the same vertex with same cost:" +msgid "Limit output rows" msgstr "" -msgid "The algorithm will return just one path" +msgid "When ``false`` calculations are performed." msgstr "" -msgid "Optionally allows to find more than one path." +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." msgstr "" -msgid "When more than one path is to be returned:" +msgid "``geometry``" +msgstr "``geometry``" + +msgid "The ``LINESTRING`` geometry of the edge." msgstr "" -msgid "Results are sorted in increasing order of:" +msgid "When :math:`cap = 1`, it is the closest edge." msgstr "" -msgid "aggregate cost" +#, fuzzy +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgstr ":math:`path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を示しています。" + +msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "" -msgid "Within the same value of aggregate costs:" +msgid "At the right ``r`` of the segment." msgstr "" -msgid "results are sorted by (source, target)" +msgid "When the point is on the line it is considered to be on the right." msgstr "" -msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" +msgid "At the left ``l`` of the segment." msgstr "" -msgid "One to Many; :math:`drt`" +msgid "``distance``" +msgstr "``distance``" + +msgid "Distance from the point to the edge." msgstr "" -msgid "Many to One: :math:`drt`" +msgid "Original ``POINT`` geometry." msgstr "" -msgid "Many to Many: :math:`drt * |Starting vids|`" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" msgstr "" -msgid "Combinations: :math:`drt * |Starting vids|`" +msgid "One point in an edge" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "The green node is the original point." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "``geom`` has the value of the original point." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "The point is located at the left of the edge." msgstr "" -msgid "**options A:** ``[directed, cap]``" +msgid "One point dry run execution" msgstr "" -msgid "**options B:** ``[directed, cap, global]``" +msgid "Using the query from the previous example:" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Returns ``EMPTY SET``." msgstr "" -msgid "**options:** ``[directed, cap]``" +msgid "``dryrun => true``" msgstr "" -msgid "Departing on car from vertex :math:`6` find the nearest subway station." +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "" -msgid "Using a **directed** graph for car routing." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "" -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "Many points in an edge" msgstr "" -msgid "The defaults used:" +msgid "The green nodes are the **original points**" msgstr "" -msgid "`directed => true`" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" msgstr "" -msgid "`cap => 1`" +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." msgstr "" -msgid "The result shows that station at vertex :math:`11` is the nearest." +msgid "Many points dry run execution" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "Do not process query" msgstr "" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" -msgid "On line `4`: using the positional parameter: `directed` set to ``true``" +msgid "Find at most two routes to a given point" msgstr "" -msgid "In line `5`: using named parameter `cap => 2`" +msgid "Using :doc:`pgr_withPoints`" msgstr "" -msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgid "A point of interest table" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Handling points outside the graph." msgstr "" -msgid "**options:** ``[directed, cap, global]``" +msgid "Points of interest" msgstr "" -msgid "Find the best pedestrian connection between two lines of buses" +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." msgstr "" -msgid "Using an **undirected** graph for pedestrian routing" +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." msgstr "" -msgid "The first subway line stations are at :math:`\\{15, 16\\}`" +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." msgstr "" -msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgid "A unique identifier." msgstr "" -msgid "On line `4`: using the named parameter: `directed => false`" +#, fuzzy +msgid "Identifier of the nearest segment." +msgstr "開始ノードの識別子。" + +msgid "Is it on the left, right or both sides of the segment ``edge_id``." msgstr "" -msgid "`global => true`" +msgid "Where in the segment is the point located." msgstr "" -msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgid "The geometry of the points." msgstr "" -msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." msgstr "" -msgid "Find the best car connection between all the stations of two subway lines" +msgid "``newPoint``" +msgstr "``newPoint``" + +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." msgstr "" -msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgid "Points of interest fill up" msgstr "" -msgid "The second subway line stations are at :math:`\\{15, 16\\}`" +msgid "Inserting the points of interest." msgstr "" -msgid "The combinations contents:" +msgid "Filling the rest of the table." msgstr "" -msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "" -msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgid "The points of interest:" msgstr "" -msgid "On line `8`: using the named parameter is `global => false`" +msgid "``pgr_floydWarshall``" +msgstr "``pgr_floydWarshall``" + +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" -msgid "From the results:" +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," msgstr "" -msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "" -msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgid "Boost `Floyd-Warshall `_" msgstr "" -msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgid "``pgr_full_version``" +msgstr "``pgr_full_version``" + +msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "Get complete details of pgRouting version information" msgstr "" -msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgid "pgr_full_version()" msgstr "" -msgid "Dijkstra optional parameters" +msgid "RETURNS |result-version|" msgstr "" -msgid "Near optional parameters" +msgid "Information about when this documentation was built" msgstr "" -msgid "``cap``" -msgstr "``cap``" +msgid "``version``" +msgstr "``version``" -msgid "Find at most ``cap`` number of nearest shortest paths" +msgid "pgRouting version" msgstr "" -msgid "``global``" -msgstr "``global``" +msgid "``build_type``" +msgstr "``build_type``" -msgid "When ``true``: only ``cap`` limit results will be returned" +msgid "The Build type" msgstr "" -msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" -msgstr "" +msgid "``compile_date``" +msgstr "``compile_date``" -msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "Compilation date" msgstr "" -msgid "``pgr_dijkstraNearCost``" -msgstr "``pgr_dijkstraNearCost``" +msgid "``library``" +msgstr "``library``" -msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +msgid "Library name and version" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "" +msgid "``system``" +msgstr "``system``" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "Operative system" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "" +msgid "``postgreSQL``" +msgstr "``postgreSQL``" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "pgsql used" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" +msgid "``compiler``" +msgstr "``compiler``" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "Compiler and version" msgstr "" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" -msgstr "" +msgid "``boost``" +msgstr "``boost``" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Boost version" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "``hash``" +msgstr "``hash``" + +msgid "Git hash of pgRouting build" msgstr "" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" -msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr "" -msgid "``pgr_dijkstraVia``" -msgstr "``pgr_dijkstraVia``" +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgstr "" -msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." msgstr "" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgid "The algorithm implementation works only for directed graph" msgstr "" -msgid "Route" +msgid "It is a variation of Johnson's algorithm for circuit enumeration." msgstr "" -msgid "is a sequence of paths." +msgid "The algorithm outputs the distinct circuits present in the graph." msgstr "" -msgid "Path" +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "" -msgid "is a section of the route." +msgid ":math:`|c|` is the number of circuits in the graph." msgstr "" -msgid "One Via" +msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "" -msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgid "Circuits present in the pgRouting :doc:`sampledata`" msgstr "" -msgid "**options:** ``[directed, strict, U_turn_on_edge]``" +msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "Returns set of |via-result|" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" -msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +#, fuzzy +msgid "Identifier of the starting vertex of the circuit." +msgstr "開始ノードの識別子。" + +#, fuzzy +msgid "Identifier of the ending vertex of the circuit." +msgstr "終了ノードの識別子。" + +msgid "Identifier of the node in the path from a vid to next vid." msgstr "" -msgid "Via optional parameters" +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" -msgid "When ``true`` departing from a visited vertex will not try to avoid" +msgid "``pgr_isPlanar`` - Experimental" msgstr "" -msgid "Identifier of a path. Has value **1** for the first path." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." msgstr "" -msgid "-1 for the last node of the path." +msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "-2 for the last node of the route." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "" -msgid "``route_agg_cost``" -msgstr "``route_agg_cost``" +msgid "Applicable only for **undirected** graphs." +msgstr "" -msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgid "The algorithm does not considers traversal costs in the calculations." msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgid "Running time: :math:`O(|V|)`" msgstr "" -msgid "The main query" +msgid "pgr_isPlanar(`Edges SQL`)" msgstr "" -msgid "Aggregate cost of the third path." +msgid "RETURNS ``BOOLEAN``" msgstr "" -msgid "Route's aggregate cost of the route at the end of the third path." +msgid "Returns a boolean ``(pgr_isplanar)``" msgstr "" -msgid "Nodes visited in the route." +msgid "``pgr_isplanar``" +msgstr "``pgr_isplanar``" + +msgid "`true` when the graph is planar." msgstr "" -msgid "The aggregate costs of the route when the visited vertices are reached." +msgid "`false` when the graph is not planar." msgstr "" -msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." msgstr "" -msgid ":doc:`via-category`." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." msgstr "" -msgid ":doc:`dijkstra-family`." +msgid "`Boost: Boyer Myrvold `__" msgstr "" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "``pgr_johnson``" +msgstr "``pgr_johnson``" + +#, fuzzy +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" + +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" -msgid "pgr_drivingDistance(Single vertex)" +msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" -msgid "Added ``depth`` and ``start_vid`` result columns." +msgid "Boost `Johnson `_" msgstr "" -msgid "pgr_drivingDistance(Multiple vertices)" +#, fuzzy +msgid "``pgr_kingOrdering`` - Experimental" +msgstr "p" + +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." msgstr "" -msgid "Result column name change: ``from_v`` to ``start_vid``." +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "Added ``depth`` and ``pred`` result columns." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" #, fuzzy -msgid "Signature change:" -msgstr "変更機能" +msgid "The implementation targets undirected graphs." +msgstr "実装は**undirected**グラフのみです。" -msgid "pgr_drivingDistance(single vertex)" +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" -msgid "New official signature:" +msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" msgstr "" -msgid "pgr_drivingDistance(multiple vertices)" +msgid "where :math:`|E|` is the number of edges," msgstr "" -msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgid ":math:`m` is the maximum degree among all vertices." msgstr "" #, fuzzy -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "p" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "`Boost: King Ordering `__" msgstr "" -msgid "**options:** [directed, equicost]" -msgstr "" +msgid "``pgr_kruskal``" +msgstr "``pgr_kruskal``" -msgid "Single Vertex" +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" -msgid "From vertex :math:`11` for a distance of :math:`3.0`" +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." msgstr "" -msgid "Multiple Vertices" +msgid "EMPTY SET is returned when there are no edges in the graph." msgstr "" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgid "pgr_kruskal(`Edges SQL`_)" msgstr "" -msgid "Driving distance optional parameters" +msgid "Returns set of |result-mst|" msgstr "" -msgid "``equicost``" -msgstr "``equicost``" +msgid "Minimum spanning forest" +msgstr "" -msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." msgstr "" -msgid "When ``false`` which resembles several calls using the single vertex signature." +msgid "Added ``pred`` result columns." msgstr "" -msgid "end-before" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgid "Returned tree nodes from a root vertex are on Breath First Search order" msgstr "" -msgid "``pgr_edgeColoring`` - Experimental" +msgid "Breath First Search Running time: :math:`O(E + V)`" msgstr "" -msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "The implementation is for **undirected** and **loop-free** graphs" +msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" -msgid "loop free" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" msgstr "" -msgid "no self-loops and no parallel edges." +msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" -msgid "Provides the color to be assigned to all the edges present in the graph." +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." msgstr "" -msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +msgid "Returned tree nodes from a root vertex are on Depth First Search order." msgstr "" -msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgid "Depth First Search running time: :math:`O(E + V)`" msgstr "" -msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "" -msgid "The algorithm tries to assign the least possible color to every edge." +msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "Does not always produce optimal coloring." +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" msgstr "" -msgid "The returned rows are ordered in ascending order of the edge identifier." +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" msgstr "" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" -msgid "where :math:`|E|` is the number of edges in the graph," +msgid "Returned tree nodes from a root vertex are on Depth First Search order" msgstr "" -msgid ":math:`|V|` is the number of vertices in the graph." +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "pgr_edgeColoring(`Edges SQL`_)" +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "Graph coloring of pgRouting :doc:`sampledata`" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" -msgid "`Boost: Edge Coloring `__" +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "" -msgid "`Wikipedia: Graph coloring `__" +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." msgstr "" -msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgid "The algorithm works in directed graph only." msgstr "" -msgid "pgr_edgeDisjointPaths(Combinations)" +msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "" -msgid "The main characterics are:" +msgid "Running time: :math:`O((V+E)log(V+E))`" msgstr "" -msgid "Calculates the edge disjoint paths between any two groups of vertices." +msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" msgstr "" -msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgid "Returns set of |result-idom|" msgstr "" -msgid "The graph can be directed or undirected." +msgid "The dominator tree with root vertex :math:`5`" msgstr "" -msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." +msgid "SQL query as described above." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "**root vertex**" msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Returns set of ``(seq, vertex_id, idom)``" msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "``vertex_id``" +msgstr "``vertex_id``" + +msgid "Identifier of vertex ." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "``idom``" +msgstr "``idom``" + +msgid "Immediate dominator of vertex." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Dominator tree of another component." msgstr "" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgid "`Boost: Lengauer-Tarjan dominator `__" msgstr "" -msgid "Manually assigned vertex combinations on an undirected graph." +msgid "`Wikipedia: dominator tree `__" msgstr "" -msgid "``pgr_edmondsKarp``" -msgstr "``pgr_edmondsKarp``" +msgid "``pgr_lineGraph`` - Proposed" +msgstr "" -msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "" -msgid "pgr_edmondsKarp(Combinations)" +#, fuzzy +msgid "Works for directed and undirected graphs." +msgstr "導かれないグラフ。" + +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" -msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" +msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "" -msgid "Running time: :math:`O( V * E ^ 2)`" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgid "When the graph is directed the result is directed." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgid "When the graph is undirected the result is undirected." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgid "The ``reverse_cost`` is always :math:`-1`." msgstr "" -msgid "`Boost: Edmonds Karp max flow `__" +msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" msgstr "" -msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgid "Returns set of |result-lineg|" msgstr "" -msgid "``pgr_edwardMoore`` - Experimental" +msgid "For an undirected graph with edges :math:'{2,4,5,8}'" msgstr "" -msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgid "Gives a local identifier for the edge" msgstr "" -msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgid "When `negative`: the source is the reverse edge in the original graph." msgstr "" -msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgid "When `negative`: the target is the reverse edge in the original graph." msgstr "" -msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgid "Weight of the edge (``source``, ``target``)." msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." msgstr "" -msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgid "Weight of the edge (``target``, ``source``)." msgstr "" -msgid "Running time:" +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." msgstr "" -msgid "Worst case: :math:`O(| V | * | E |)`" +#, fuzzy +msgid "Given the following directed graph" +msgstr "次のクエリを実行します。" + +msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" msgstr "" -msgid "Average case: :math:`O( | E | )`" +msgid "Representation as directed with shared edge identifiers" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "hundreds" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "the source vertex" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "tens" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "always 0, acts as a separator" msgstr "" -msgid "Using a combinations table on an **undirected** graph." +msgid "units" msgstr "" -msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgid "the target vertex" msgstr "" -msgid "``pgr_extractVertices``" -msgstr "``pgr_extractVertices``" +msgid "In this image," +msgstr "" -msgid "``pgr_extractVertices`` — Extracts the vertices information" +msgid "Single or double head arrows represent one edge (row) on the edges table." msgstr "" -msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "" -msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." msgstr "" -msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." msgstr "" -msgid "RETURNS SETOF |result-extract|" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." msgstr "" -msgid "When line geometry is known" +#, fuzzy +msgid "The graph can be created as follows:" +msgstr "グラフは次のように定義されます:" + +msgid "Line Graph of a directed graph represented with shared edges" msgstr "" -msgid "(Optional) identifier of the edge." +#, fuzzy +msgid "The result is a directed graph." +msgstr "導かれないグラフ。" + +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "" -msgid "``geom``" -msgstr "``geom``" +msgid "For all the other values of ``seq`` represent one edge." +msgstr "" -msgid "``LINESTRING``" -msgstr "``LINESTRING``" +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgstr "" -msgid "Geometry of the edge." +msgid "When positive: the edge exists." msgstr "" -msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgid "When negative: the edge does not exist." msgstr "" -msgid "Ignored columns:" +msgid "Representation as directed with unique edge identifiers" msgstr "" -msgid "``startpoint``" -msgstr "``startpoint``" +msgid "Single head arrows represent one edge (row) on the edges table." +msgstr "" -msgid "``endpoint``" -msgstr "``endpoint``" +msgid "There are no double head arrows" +msgstr "" -msgid "When vertex geometry is known" +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." msgstr "" -msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." msgstr "" -msgid "``POINT``" -msgstr "``POINT``" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgstr "" -msgid "POINT geometry of the starting vertex." +msgid "Line Graph of a directed graph represented with unique edges" msgstr "" -msgid "POINT geometry of the ending vertex." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "" -msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "" -msgid "When identifiers of vertices are known" +#, fuzzy +msgid "wikipedia: `Line Graph `__" +msgstr "`Wikipedia: 巡回セールスマン問題 `__" + +msgid "mathworld: `Line Graph `__" msgstr "" -msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" -msgid "``NULL`` When the ``id`` is not part of the inner query" +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." msgstr "" -msgid "X value of the point geometry" +msgid "Version 2.6.0" msgstr "" -msgid "``NULL`` When no geometry is provided" +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." msgstr "" -msgid "Geometry of the point" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" msgstr "" -msgid "Create a routing topology" +msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "" -msgid "Make sure the database does not have the ``vertices_table``" +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." msgstr "" -msgid "Clean up the columns of the routing topology to be created" +msgid "This function is for **directed** graphs." msgstr "" -msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgid "Results are undefined when a negative vertex id is used in the input graph." msgstr "" -msgid "For big edge tables that are been prepared," +msgid "Results are undefined when a duplicated edge id is used in the input graph." msgstr "" -msgid "Create it as ``UNLOGGED`` and" +msgid "Running time: TBD" msgstr "" -msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" +msgid "pgr_lineGraphFull(`Edges SQL`_)" msgstr "" -msgid "Inspect the vertices table" +msgid "Returns set of |result-linegf|" msgstr "" -msgid "Create the routing topology on the edge table" +msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" -msgid "Updating the ``source`` information" +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "" -msgid "Updating the ``target`` information" +msgid "The data" msgstr "" -msgid "Inspect the routing topology" +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." msgstr "" -msgid "**Generated topology**" +msgid "|first|" msgstr "" -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" - -msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." +msgid "first" msgstr "" -msgid "``partial`` option is removed." +msgid "The transformation" msgstr "" -msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgid "|second|" msgstr "" -msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgid "second" msgstr "" -msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." msgstr "" -msgid "``EMPTY SET`` is returned on dryrun executions" +msgid "Creating table that identifies transformed vertices" msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" msgstr "" -msgid "**options:** ``[cap, dryrun]``" +msgid "Store edge results" msgstr "" -msgid "Returns set of |result-find|" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "" -msgid "One point" +msgid "Create the mapping table" msgstr "" -msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgid "From the original graph's vertex information" msgstr "" -msgid "``cap => 2``" +msgid "Add the new vertices" msgstr "" -msgid "Many points" +msgid "Filling the mapping table" msgstr "" -msgid "For each points of interests, find the closest edge." +msgid "The positive vertex identifiers are the original identifiers" msgstr "" -msgid "**point**" +msgid "Inspecting the vertices map" msgstr "" -msgid "The point geometry" +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "" -msgid "**points**" +msgid "Updating values from self loops" msgstr "" -msgid "``POINT[]``" +msgid "Inspecting the vertices table" msgstr "" -msgid "An array of point geometries" +msgid "Updating from inner self loops" msgstr "" -msgid "**tolerance**" +msgid "Adding a soft restriction" msgstr "" -msgid "Max distance between geometries" +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" -msgid "Limit output rows" +#, fuzzy +msgid "Identifying the restriction" +msgstr "開始ノードの識別子。" + +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "When ``false`` calculations are performed." +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" -msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgid "Adding a value to the restriction" msgstr "" -msgid "``geometry``" -msgstr "``geometry``" +msgid "Updating the cost to the edge:" +msgstr "" -msgid "The ``LINESTRING`` geometry of the edge." +msgid "Routing from :math:`6` to :math:`3`" msgstr "" -msgid "When :math:`cap = 1`, it is the closest edge." +msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." msgstr "" -#, fuzzy -msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." -msgstr ":math:`path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を示しています。" +msgid "Simplifying leaf vertices" +msgstr "" -msgid "Value in ``[r, l]`` indicating if the point is:" +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "" -msgid "At the right ``r`` of the segment." +msgid "Using the vertex map give the leaf verices their original value." msgstr "" -msgid "When the point is on the line it is considered to be on the right." +msgid "On the source column" msgstr "" -msgid "At the left ``l`` of the segment." +msgid "On the target column" msgstr "" -msgid "``distance``" -msgstr "``distance``" +msgid "Removing self loops on leaf nodes" +msgstr "" -msgid "Distance from the point to the edge." +msgid "The self loops of the leaf nodes are" msgstr "" -msgid "Original ``POINT`` geometry." +msgid "Which can be removed" msgstr "" -msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "" -msgid "One point in an edge" +msgid "Complete routing graph" msgstr "" -msgid "The green node is the original point." +msgid "Add edges from the original graph" msgstr "" -msgid "``geom`` has the value of the original point." +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "" -msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgid "Some administrative tasks to get new identifiers for the edges" msgstr "" -msgid "The point is located at the left of the edge." +msgid "Add the newly calculated edges" msgstr "" -msgid "One point dry run execution" +msgid "Using the routing graph" msgstr "" -msgid "Using the query from the previous example:" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "" -msgid "Returns ``EMPTY SET``." +msgid "Routing from :math:`5` to :math:`1`" msgstr "" -msgid "``dryrun => true``" +msgid "https://en.wikipedia.org/wiki/Line_graph" msgstr "" -msgid "Generates a PostgreSQL ``NOTICE`` with the code used." +msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "" -msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." +msgid "``pgr_makeConnected`` - Experimental" msgstr "" -msgid "Many points in an edge" +msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" -msgid "The green nodes are the **original points**" +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." msgstr "" -msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." msgstr "" -msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "" -msgid "Many points dry run execution" +msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "" -msgid "Do not process query" +msgid "Returns set of |result-component-make|" msgstr "" -msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "Find at most two routes to a given point" +msgid "`Boost: make connected `__" msgstr "" -msgid "Using :doc:`pgr_withPoints`" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" + +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "" -msgid "A point of interest table" +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "Handling points outside the graph." +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." msgstr "" -msgid "Points of interest" +msgid "Deprecated signature" msgstr "" -msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgid "directed => ``false`` when used." msgstr "" -msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." +msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "" -msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." msgstr "" -msgid "A unique identifier." +msgid "A maximum matching is a matching that contains the largest possible number of edges." msgstr "" -#, fuzzy -msgid "Identifier of the nearest segment." -msgstr "開始ノードの識別子。" +msgid "There may be many maximum matchings." +msgstr "" -msgid "Is it on the left, right or both sides of the segment ``edge_id``." +msgid "Calculates one possible maximum cardinality matching in a graph." msgstr "" -msgid "Where in the segment is the point located." +msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" msgstr "" -msgid "The geometry of the points." +msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." msgstr "" -msgid "The distance between ``geom`` and the segment ``edge_id``." +msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" msgstr "" -msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." +msgid "Using all edges." msgstr "" -msgid "``newPoint``" -msgstr "``newPoint``" +msgid "SQL query, which should return a set of rows with the following columns:" +msgstr "" -msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." msgstr "" -msgid "Points of interest fill up" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" msgstr "" -msgid "Inserting the points of interest." +msgid "Identifier of the edge in the original query." msgstr "" -msgid "Filling the rest of the table." +msgid "`Boost: maximum_matching `__" msgstr "" -msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." +msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "" -msgid "The points of interest:" +msgid "https://en.wikipedia.org/wiki/Ackermann_function" msgstr "" -msgid "``pgr_floydWarshall``" -msgstr "``pgr_floydWarshall``" +msgid "``pgr_maxFlow``" +msgstr "``pgr_maxFlow``" -msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" -msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgid "pgr_maxFlow(Combinations)" msgstr "" -msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" -msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" -msgid "Boost `Floyd-Warshall `_" +msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." msgstr "" -msgid "``pgr_full_version``" -msgstr "``pgr_full_version``" - -msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgid "Running time: :math:`O( V ^ 3)`" msgstr "" -msgid "Get complete details of pgRouting version information" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "pgr_full_version()" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "RETURNS |result-version|" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "Information about when this documentation was built" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "``version``" -msgstr "``version``" - -msgid "pgRouting version" +msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "``build_type``" -msgstr "``build_type``" +msgid "RETURNS ``BIGINT``" +msgstr "" -msgid "The Build type" +msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "``compile_date``" -msgstr "``compile_date``" +msgid "`Boost: push relabel max flow `__" +msgstr "" -msgid "Compilation date" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" -msgid "``library``" -msgstr "``library``" +msgid "``pgr_maxFlowMinCost`` - Experimental" +msgstr "" -msgid "Library name and version" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "" -msgid "``system``" -msgstr "``system``" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "" -msgid "Operative system" +msgid "|Boost| Boost Graph Inside." msgstr "" -msgid "``postgreSQL``" -msgstr "``postgreSQL``" +msgid "**TODO** check which statement is true:" +msgstr "" -msgid "pgsql used" +msgid "The cost value of all input edges must be nonnegative." msgstr "" -msgid "``compiler``" -msgstr "``compiler``" +msgid "Process is done when the cost value of all input edges is nonnegative." +msgstr "" -msgid "Compiler and version" +msgid "Process is done on edges with nonnegative cost." msgstr "" -msgid "``boost``" -msgstr "``boost``" +msgid "Running time: :math:`O(U * (E + V * logV))`" +msgstr "" -msgid "Boost version" +msgid "where :math:`U` is the value of the max flow." msgstr "" -msgid "``hash``" -msgstr "``hash``" +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr "" -msgid "Git hash of pgRouting build" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "``pgr_hawickCircuits`` - Experimental" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "The algorithm implementation works only for directed graph" +msgid "Returns set of |result-flow-mincost|" msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" -msgid "The algorithm outputs the distinct circuits present in the graph." +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "" -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" -msgid ":math:`|c|` is the number of circuits in the graph." +msgid "**The cost value of all input edges must be nonnegative.**" msgstr "" -msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgid "When the maximum flow is 0 then there is no flow and **0** is returned." msgstr "" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +msgid "Uses :doc:`pgr_maxFlowMinCost`." msgstr "" -msgid "Id of the circuit starting from ``1``" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -#, fuzzy -msgid "Identifier of the starting vertex of the circuit." -msgstr "開始ノードの識別子。" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "" -#, fuzzy -msgid "Identifier of the ending vertex of the circuit." -msgstr "終了ノードの識別子。" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "" -msgid "Identifier of the node in the path from a vid to next vid." +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "RETURNS FLOAT" msgstr "" -msgid "``pgr_isPlanar`` - Experimental" +msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgid "``pgr_pickDeliver`` - Experimental" msgstr "" -msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "This implementation use the Boyer-Myrvold Planarity Testing." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." msgstr "" -msgid "It will return a boolean value depending upon the planarity of the graph." +msgid "Optimization problem is NP-hard." msgstr "" -msgid "Applicable only for **undirected** graphs." +msgid "pickup and Delivery with time windows." msgstr "" -msgid "The algorithm does not considers traversal costs in the calculations." +msgid "All vehicles are equal." msgstr "" -msgid "Running time: :math:`O(|V|)`" +msgid "Same Starting location." msgstr "" -msgid "pgr_isPlanar(`Edges SQL`)" +msgid "Same Ending location which is the same as Starting location." msgstr "" -msgid "RETURNS ``BOOLEAN``" +msgid "All vehicles travel at the same speed." msgstr "" -msgid "Returns a boolean ``(pgr_isplanar)``" +msgid "A customer is for doing a pickup or doing a deliver." msgstr "" -msgid "``pgr_isplanar``" -msgstr "``pgr_isplanar``" +msgid "has an open time." +msgstr "" -msgid "`true` when the graph is planar." +msgid "has a closing time." msgstr "" -msgid "`false` when the graph is not planar." +msgid "has a service time." msgstr "" -msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgid "has an (x, y) location." msgstr "" -msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgid "There is a customer where to deliver a pickup." msgstr "" -msgid "`Boost: Boyer Myrvold `__" +msgid "travel time between customers is distance / speed" msgstr "" -msgid "``pgr_johnson``" -msgstr "``pgr_johnson``" +msgid "pickup and delivery pair is done with the same vehicle." +msgstr "" -#, fuzzy -msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." -msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" +msgid "All trucks depart at time 0." +msgstr "" -msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgid "the algorithm will raise an exception when" msgstr "" -msgid "pgr johnson(`Edges SQL`_, [``directed``])" +msgid "If there is a pickup-deliver pair than violates time window" msgstr "" -msgid "Boost `Johnson `_" +msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "" -#, fuzzy -msgid "``pgr_kingOrdering`` - Experimental" -msgstr "p" +msgid "Six different initial will be optimized - the best solution found will be result" +msgstr "" -msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgid "Signature" msgstr "" -msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" -msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." +msgid "**options:** ``[factor, max_cycles, initial_sol]``" msgstr "" -#, fuzzy -msgid "The implementation targets undirected graphs." -msgstr "実装は**undirected**グラフのみです。" +msgid "Returns set of |result-pickdrop|" +msgstr "" -msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." +msgid "Solve the following problem" msgstr "" -msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" +msgid "Given the vehicles:" msgstr "" -msgid "where :math:`|E|` is the number of edges," +msgid "and the orders:" msgstr "" -msgid ":math:`m` is the maximum degree among all vertices." +msgid "The parameters are:" msgstr "" -#, fuzzy -msgid "pgr_kingOrdering(`Edges SQL`_)" -msgstr "p" +msgid "A `SELECT` statement that returns the following columns:" +msgstr "" -msgid "`Boost: King Ordering `__" +msgid "id, demand" msgstr "" -msgid "``pgr_kruskal``" -msgstr "``pgr_kruskal``" +msgid "p_node_id, p_open, p_close, [p_service,]" +msgstr "" -msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgid "d_node_id, d_open, d_close, [d_service,]" msgstr "" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgid "id, capacity" msgstr "" -msgid "EMPTY SET is returned when there are no edges in the graph." +msgid "start_node_id, start_open, start_close [, start_service,]" msgstr "" -msgid "pgr_kruskal(`Edges SQL`_)" +msgid "[end_node_id, end_open, end_close, end_service]" msgstr "" -msgid "Returns set of |result-mst|" +msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "Minimum spanning forest" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgid "Replaces ``pgr_gsoc_vrppdtw``" msgstr "" -msgid "Added ``pred`` result columns." +msgid "Pickup and Delivery:" msgstr "" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "capacitated" msgstr "" -msgid "Returned tree nodes from a root vertex are on Breath First Search order" +msgid "with time windows." msgstr "" -msgid "Breath First Search Running time: :math:`O(E + V)`" +msgid "have (x, y) start and ending locations." msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "have a start and ending service times." msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "An order is for doing a pickup and a a deliver." msgstr "" -msgid "The Minimum Spanning Tree having as root vertex :math:`6`" +msgid "has (x, y) pickup and delivery locations." msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgid "has opening and closing times for the pickup and delivery locations." msgstr "" -msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." +msgid "has a pickup and deliver service times." msgstr "" -msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgid "Six different optional different initial solutions" msgstr "" -msgid "Returned tree nodes from a root vertex are on Depth First Search order." +msgid "the best solution found will be result" msgstr "" -msgid "Depth First Search running time: :math:`O(E + V)`" +msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" +msgid "p_x, p_y, p_open, p_close, [p_service,]" msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "d_x, d_y, d_open, d_close, [d_service]" msgstr "" -msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgid "start_x, start_y, start_open, start_close [, start_service, ]" msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" -msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgstr "" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "There are 25 vehicles in the problem all with the same characteristics." msgstr "" -msgid "Returned tree nodes from a root vertex are on Depth First Search order" +msgid "The original orders" msgstr "" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "The original data needs to be converted to an appropriate table:" msgstr "" -msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgid "The query" msgstr "" -msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgstr "" -msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgid "The best solution found for **lc101** is a travel time: 828.94" msgstr "" -msgid "The algorithm works in directed graph only." +msgid "This implementation's travel time: 854.54" msgstr "" -msgid "The algorithm returns *idom* of each vertex." +msgid "``pgr_prim``" +msgstr "``pgr_prim``" + +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" -msgid "If the *root vertex* not present in the graph then it returns empty set." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." msgstr "" -msgid "Running time: :math:`O((V+E)log(V+E))`" +msgid "Prim's running time: :math:`O(E * log V)`" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" +msgid "pgr_prim(`Edges SQL`_)" msgstr "" -msgid "Returns set of |result-idom|" +msgid "Minimum spanning forest of a subgraph" msgstr "" -msgid "The dominator tree with root vertex :math:`5`" +msgid "`Boost: Prim's algorithm documentation `__" msgstr "" -msgid "SQL query as described above." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "**root vertex**" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" -msgid "Returns set of ``(seq, vertex_id, idom)``" +msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "``vertex_id``" -msgstr "``vertex_id``" +msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "" -msgid "Identifier of vertex ." +msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" -msgid "``idom``" -msgstr "``idom``" +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgstr "" -msgid "Immediate dominator of vertex." +msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "" -msgid "Dominator tree of another component." +msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "`Boost: Lengauer-Tarjan dominator `__" +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "`Wikipedia: dominator tree `__" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" -msgid "``pgr_lineGraph`` - Proposed" +msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -#, fuzzy -msgid "Works for directed and undirected graphs." -msgstr "導かれないグラフ。" +msgid "``pgr_pushRelabel``" +msgstr "``pgr_pushRelabel``" -msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" -msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." +msgid "pgr_pushRelabel(Combinations)" msgstr "" -msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "" -msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "When the graph is directed the result is directed." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "When the graph is undirected the result is undirected." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "The ``reverse_cost`` is always :math:`-1`." +msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" -msgstr "" +msgid "``pgr_separateCrossing``" +msgstr "``pgr_separateCrossing``" -msgid "Returns set of |result-lineg|" +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "" -msgid "For an undirected graph with edges :math:'{2,4,5,8}'" -msgstr "" +#, fuzzy +msgid "Proposed function." +msgstr "新しい **公式** 機能" -msgid "Gives a local identifier for the edge" +msgid "This is an auxiliary function for separating crossing edges." msgstr "" -msgid "When `negative`: the source is the reverse edge in the original graph." +#, fuzzy +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "p" + +msgid "RETURNS |result-separate|" msgstr "" -msgid "When `negative`: the target is the reverse edge in the original graph." +msgid "Get the segments of the crossing geometries" msgstr "" -msgid "Weight of the edge (``source``, ``target``)." +msgid "``tolerance``" +msgstr "``tolerance``" + +msgid "0.01" msgstr "" -msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." +msgid "Used in ST_Snap before ST_Split" msgstr "" -msgid "Weight of the edge (``target``, ``source``)." +msgid "Get the code for further refinement." msgstr "" -msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" -#, fuzzy -msgid "Given the following directed graph" -msgstr "次のクエリを実行します。" +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" -msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" msgstr "" -msgid "Representation as directed with shared edge identifiers" +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." msgstr "" -msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" -msgstr "" +#, fuzzy +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "p" -msgid "hundreds" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" -msgid "the source vertex" +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "" -msgid "tens" +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." msgstr "" -msgid "always 0, acts as a separator" +msgid "The implementation is applicable only for **undirected** graphs." msgstr "" -msgid "units" +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "" -msgid "the target vertex" +msgid "Color identifiers values are in the Range :math:`[1, |V|]`" msgstr "" -msgid "In this image," +msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "" -msgid "Single or double head arrows represent one edge (row) on the edges table." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." msgstr "" -msgid "The numbers in the yellow shadow are the edge identifiers." +msgid "The returned rows are ordered in ascending order of the vertex value." msgstr "" -msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" msgstr "" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgid ":math:`d` is the maximum degree of the vertices in the graph," msgstr "" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgid ":math:`k` is the number of colors used." msgstr "" -#, fuzzy -msgid "The graph can be created as follows:" -msgstr "グラフは次のように定義されます:" +msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgstr "" -msgid "Line Graph of a directed graph represented with shared edges" +msgid "`Boost: Sequential Vertex Coloring `__" msgstr "" #, fuzzy -msgid "The result is a directed graph." -msgstr "導かれないグラフ。" +msgid "``pgr_sloanOrdering`` - Experimental" +msgstr "p" -msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" msgstr "" -msgid "For all the other values of ``seq`` represent one edge." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" -msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "When positive: the edge exists." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "When negative: the edge does not exist." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "Representation as directed with unique edge identifiers" +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "Single head arrows represent one edge (row) on the edges table." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" -msgid "There are no double head arrows" -msgstr "" +#, fuzzy +msgid "pgr_sloanOrdering(`Edges SQL`_)" +msgstr "p" -msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgid ":Example : Sloan ordering without specifying start vertex" msgstr "" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgid "New sloan ordering order." msgstr "" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" -msgid "Line Graph of a directed graph represented with unique edges" +msgid "`Boost: Sloan Ordering `__" msgstr "" -msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgid "``pgr_stoerWagner`` - Experimental" msgstr "" -msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "" #, fuzzy -msgid "wikipedia: `Line Graph `__" -msgstr "`Wikipedia: 巡回セールスマン問題 `__" +msgid "Version 3.0" +msgstr "バージョン 3.0.0" -msgid "mathworld: `Line Graph `__" +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." msgstr "" -msgid "``pgr_lineGraphFull`` - Experimental" +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." msgstr "" -msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgid "Sum of the weights of all edges between the two sets is mincut." msgstr "" -msgid "Version 2.6.0" +msgid "A **mincut** is a cut having the least weight." msgstr "" -msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgid "Values are returned when graph is connected." msgstr "" -msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgid "When there is no edge in graph then EMPTY SET is return." msgstr "" -msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" -msgid "Forbid the routing between two edges by removing the connecting edge" +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." msgstr "" -msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgid "Running time: :math:`O(V*E + V^2*log V)`." msgstr "" -msgid "This function is for **directed** graphs." +msgid "pgr_stoerWagner(`Edges SQL`_)" msgstr "" -msgid "Results are undefined when a negative vertex id is used in the input graph." +msgid "Returns set of |result-mincut|" msgstr "" -msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgid "min cut of the main subgraph" msgstr "" -msgid "Running time: TBD" +msgid "Returns set of ``(seq, edge, cost, mincut)``" msgstr "" -msgid "pgr_lineGraphFull(`Edges SQL`_)" +msgid "Edges which divides the set of vertices into two." msgstr "" -msgid "Returns set of |result-linegf|" +msgid "Cost to traverse of edge." msgstr "" -msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" +msgid "**mincut**" msgstr "" -msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgid "Min-cut weight of a undirected graph." msgstr "" -msgid "The data" +msgid "Additional Example:" msgstr "" -msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgid "min cut of an edge" msgstr "" -msgid "|first|" +msgid "Using :doc:`pgr_connectedComponents`" msgstr "" -msgid "first" +msgid "`Boost: Stoer Wagner min cut `__" msgstr "" -msgid "The transformation" +msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" -msgid "|second|" +msgid "``pgr_strongComponents``" +msgstr "``pgr_strongComponents``" + +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." msgstr "" -msgid "second" +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." msgstr "" -msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgid "Works for **directed** graphs." msgstr "" -msgid "Creating table that identifies transformed vertices" +msgid "Components are described by vertices identifiers." msgstr "" -msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgid "pgr_strongComponents(`Edges SQL`_)" msgstr "" -msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgid "The strong components of the graph" msgstr "" -msgid "Store edge results" +msgid "`Boost: Strong components `__" msgstr "" -msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" +msgid "wikipedia: `Strongly connected component `__" msgstr "" -msgid "Create the mapping table" +msgid "``pgr_topologicalSort`` - Experimental" msgstr "" -msgid "From the original graph's vertex information" +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." msgstr "" -msgid "Add the new vertices" +#, fuzzy +msgid "Standardize output to |result_node_order|" +msgstr "ダイクストラ関連機能" + +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." msgstr "" -msgid "Filling the mapping table" +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "The positive vertex identifiers are the original identifiers" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "" -msgid "Inspecting the vertices map" +msgid "will return one of them." msgstr "" -msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgid "The returned values are ordered in topological order:" msgstr "" -msgid "Updating values from self loops" +msgid "pgr_topologicalSort(`Edges SQL`_)" msgstr "" -msgid "Inspecting the vertices table" +msgid "Topologically sorting the graph" msgstr "" -msgid "Updating from inner self loops" +msgid "Sequential value starting from :math:`1`" msgstr "" -msgid "Adding a soft restriction" +msgid "Linear topological ordering of the vertices" msgstr "" -msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." +msgid "Additional examples" msgstr "" -#, fuzzy -msgid "Identifying the restriction" -msgstr "開始ノードの識別子。" +msgid "Topologically sorting the one way segments" +msgstr "" -msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgid "Graph is not a DAG" msgstr "" -msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgid "`Boost: topological sort `__" msgstr "" -msgid "Adding a value to the restriction" +msgid "``pgr_transitiveClosure`` - Experimental" +msgstr "" + +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "Updating the cost to the edge:" +#, fuzzy +msgid "Standardized output to |result-closure|" +msgstr "ダイクストラ関連機能" + +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "" -msgid "Routing from :math:`6` to :math:`3`" +msgid "Process is valid for directed graphs." msgstr "" -msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." +msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "Simplifying leaf vertices" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" -msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgid "The returned values are not ordered" msgstr "" -msgid "Using the vertex map give the leaf verices their original value." +msgid "The returned graph is compressed" msgstr "" -msgid "On the source column" +msgid "Running time: :math:`O(|V||E|)`" msgstr "" -msgid "On the target column" +msgid "The pgr_transitiveClosure function has the following signature:" msgstr "" -msgid "Removing self loops on leaf nodes" +msgid "pgr_transitiveClosure(`Edges SQL`_)" msgstr "" -msgid "The self loops of the leaf nodes are" +msgid "Returns set of |result-closure|" msgstr "" -msgid "Which can be removed" +msgid "Rechability of a subgraph" msgstr "" -msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgid "Identifier of the source of the edges" msgstr "" -msgid "Complete routing graph" -msgstr "" +msgid "``target_array``" +msgstr "``target_array``" -msgid "Add edges from the original graph" +msgid "Identifiers of the targets of the edges" msgstr "" -msgid "Add all the edges that are not involved in the line graph process to the new table" +msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "Some administrative tasks to get new identifiers for the edges" +msgid "`Boost: transitive closure `__" msgstr "" -msgid "Add the newly calculated edges" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "Using the routing graph" -msgstr "" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" -msgid "When using this method for routing with soft restrictions there will be uturns" +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "Routing from :math:`5` to :math:`1`" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "https://en.wikipedia.org/wiki/Line_graph" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgid "pgr_trsp(One to One)" msgstr "" -msgid "``pgr_makeConnected`` - Experimental" +msgid "pgr_trsp(One to Many)" msgstr "" -msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." +msgid "pgr_trsp(Many to One)" msgstr "" -msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgid "pgr_trsp(Many to Many)" msgstr "" -msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgid "pgr_trsp(Combinations)" msgstr "" -msgid "The algorithm does not considers geometric topology in the calculations." +msgid "Deprecated signatures" msgstr "" -msgid "pgr_makeConnected(`Edges SQL`_)" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "Returns set of |result-component-make|" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "List of edges that are needed to connect the graph." +msgid "New prototypes" msgstr "" -msgid "`Boost: make connected `__" -msgstr "" +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "``pgr_maxCardinalityMatch``" -msgstr "``pgr_maxCardinalityMatch``" +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" -msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." msgstr "" -msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "" -msgid "Deprecated signature" +msgid "The general algorithm is as follows:" msgstr "" -msgid "directed => ``false`` when used." +msgid "Execute a Dijkstra." msgstr "" -msgid "Renamed from ``pgr_maximumCardinalityMatching``" +msgid "If the solution passes thru a restriction then." msgstr "" -msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgid "Execute the **TRSP** algorithm with restrictions." msgstr "" -msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "There may be many maximum matchings." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Calculates one possible maximum cardinality matching in a graph." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" +msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" -msgid "Using all edges." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -msgid "SQL query, which should return a set of rows with the following columns:" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "" -msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgid "Using a combinations table on an undirected graph." msgstr "" -msgid "Identifier of the edge in the original query." +msgid "`Deprecated documentation `_" msgstr "" -msgid "`Boost: maximum_matching `__" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" + +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "https://en.wikipedia.org/wiki/Ackermann_function" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" -msgid "``pgr_maxFlow``" -msgstr "``pgr_maxFlow``" +msgid "The paths represents the sections of the route." +msgstr "" -msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" -msgid "pgr_maxFlow(Combinations)" +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "" -msgid "Calculates the maximum flow from the sources to the targets." +msgid "Execute the **TRSP** algorithm with restrictions for the paths." msgstr "" -msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "" -msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" msgstr "" -msgid "Running time: :math:`O( V ^ 3)`" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Simulation of how algorithm works." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" -msgid "RETURNS ``BIGINT``" +msgid "Getting the same result as ``pgr_trspVia``:" msgstr "" -msgid "Maximum flow possible from the source(s) to the target(s)" +msgid "Example 8" msgstr "" -msgid "`Boost: push relabel max flow `__" +msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "``pgr_maxFlowMinCost`` - Experimental" +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" +msgid ":doc:`via-category`" msgstr "" -msgid "|Boost| Boost Graph Inside." +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" + +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "**TODO** check which statement is true:" +msgid "**Driving side** parameter is positional unnamed." msgstr "" -msgid "The cost value of all input edges must be nonnegative." +msgid "Valid values depend on kind of graph" msgstr "" -msgid "Process is done when the cost value of all input edges is nonnegative." +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "Process is done on edges with nonnegative cost." +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" -msgid "Running time: :math:`O(U * (E + V * logV))`" +msgid "is a sequence of paths" msgstr "" -msgid "where :math:`U` is the value of the max flow." +msgid "Build the Graph with the new points." msgstr "" -msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgid "The points identifiers will be converted to negative values." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgid "The vertices identifiers will remain positive." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Execute the **TRSP** algorithm with restrictions for the path." msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +msgid "Do not use negative values on identifiers of the inner queries." msgstr "" -msgid "Returns set of |result-flow-mincost|" +#, fuzzy +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" +msgstr "pg" + +msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgid "When positive it is considered a vertex identifier" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgid "When negative it is considered a point identifier" msgstr "" -msgid "**The cost value of all input edges must be nonnegative.**" +msgid "[**driving side**]" msgstr "" -msgid "When the maximum flow is 0 then there is no flow and **0** is returned." +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" msgstr "" -msgid "Uses :doc:`pgr_maxFlowMinCost`." +#, fuzzy +msgid "For directed graph:" +msgstr "導かれないグラフ" + +msgid "[``r``, ``R``] for right driving side" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +msgid "[``l``, ``L``] for left driving side" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +#, fuzzy +msgid "For undirected graph:" +msgstr "導かれないグラフ" + +msgid "[``b``, ``B``] for both driving sides" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Default values when parameter is missing:" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +#, fuzzy +msgid "[``r``, ``R``] for directed graph" +msgstr "導かれないグラフ" + +#, fuzzy +msgid "[``l``, ``L``] for undirected graph" +msgstr "導かれないグラフ" + +msgid "With points optional parameters" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgid "``details``" +msgstr "``details``" + +msgid "For showing points stops." msgstr "" -msgid "RETURNS FLOAT" +msgid "When ``true`` the results will include the points that are in the path." msgstr "" -msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" +msgid "When ``false`` the results will not include the points that are in the path." msgstr "" -msgid "``pgr_pickDeliver`` - Experimental" +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." msgstr "" -msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" +msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "" -msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "" -msgid "Optimization problem is NP-hard." +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "pickup and Delivery with time windows." +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" -msgid "All vehicles are equal." +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" -msgid "Same Starting location." +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." msgstr "" -msgid "Same Ending location which is the same as Starting location." +msgid "Usage variations" msgstr "" -msgid "All vehicles travel at the same speed." +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" -msgid "A customer is for doing a pickup or doing a deliver." +msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." msgstr "" -msgid "has an open time." +msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" -msgid "has a closing time." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." msgstr "" -msgid "has a service time." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" -msgid "has an (x, y) location." +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" -msgid "There is a customer where to deliver a pickup." +msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "travel time between customers is distance / speed" +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "pickup and delivery pair is done with the same vehicle." +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "All trucks depart at time 0." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "the algorithm will raise an exception when" -msgstr "" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" -msgid "If there is a pickup-deliver pair than violates time window" +msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "The speed, max_cycles, ma_capacity have illegal values" +msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "" -msgid "Six different initial will be optimized - the best solution found will be result" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "Signature" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "**options:** ``[factor, max_cycles, initial_sol]``" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "Returns set of |result-pickdrop|" +msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "Solve the following problem" +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "Given the vehicles:" +msgid "Vertices of the graph are:" msgstr "" -msgid "and the orders:" +msgid "**positive** when it belongs to the `Edges SQL`_" msgstr "" -msgid "The parameters are:" +msgid "**negative** when it belongs to the `Points SQL`_" msgstr "" -msgid "A `SELECT` statement that returns the following columns:" +msgid "The `agg_cost` in the non included values `(v, v)` is `0`" msgstr "" -msgid "id, demand" +msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "p_node_id, p_open, p_close, [p_service,]" +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." msgstr "" -msgid "d_node_id, d_open, d_close, [d_service,]" +msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "" -msgid "id, capacity" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgstr "pg" + +msgid "**options:** ``[directed, details]``" msgstr "" -msgid "start_node_id, start_open, start_close [, start_service,]" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" msgstr "" -msgid "[end_node_id, end_open, end_close, end_service]" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Experimental" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." msgstr "" -msgid "Replaces ``pgr_gsoc_vrppdtw``" +msgid "Two combinations" msgstr "" -msgid "Pickup and Delivery:" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" msgstr "" -msgid "capacitated" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" -msgid "with time windows." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "have (x, y) start and ending locations." +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" msgstr "" -msgid "have a start and ending service times." +msgid "Passes in front or visits with right side driving." msgstr "" -msgid "An order is for doing a pickup and a a deliver." +msgid "For point :math:`6` and vertex :math:`11`." msgstr "" -msgid "has (x, y) pickup and delivery locations." +msgid "Passes in front or visits with left side driving." msgstr "" -msgid "has opening and closing times for the pickup and delivery locations." +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" -msgid "has a pickup and deliver service times." +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" msgstr "" -msgid "Six different optional different initial solutions" +msgid "Output columns standardized to |nksp-result|" msgstr "" -msgid "the best solution found will be result" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" -msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "p_x, p_y, p_open, p_close, [p_service,]" +msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" msgstr "" -msgid "d_x, d_y, d_open, d_close, [d_service]" +msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" msgstr "" -msgid "start_x, start_y, start_open, start_close [, start_service, ]" +msgid "Special optional parameters" msgstr "" -msgid "[ end_x, end_y, end_open, end_close, end_service ]" +msgid "``stop_on_first``" +msgstr "``stop_on_first``" + +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "" -msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgid "When ``false`` returns at most K paths" msgstr "" -msgid "There are 25 vehicles in the problem all with the same characteristics." +msgid "When ``true`` returns only paths that do not violate restrictions" msgstr "" -msgid "The original orders" +msgid "When ``false`` returns the paths found" msgstr "" -msgid "The data comes in different rows for the pickup and the delivery of the same order." +msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." msgstr "" -msgid "The original data needs to be converted to an appropriate table:" +msgid "No results because the only path available follows a restriction." msgstr "" -msgid "The query" +msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" msgstr "" -msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" msgstr "" -msgid "The best solution found for **lc101** is a travel time: 828.94" +msgid "``pgr_version``" +msgstr "``pgr_version``" + +msgid "``pgr_version`` — Query for pgRouting version information." msgstr "" -msgid "This implementation's travel time: 854.54" +msgid "Breaking change on result columns" msgstr "" -msgid "``pgr_prim``" -msgstr "``pgr_prim``" +msgid "Support for old signature ends" +msgstr "" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "Returns pgRouting version information." msgstr "" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgid "pgr_version()" msgstr "" -msgid "Prim's running time: :math:`O(E * log V)`" +msgid "RETURNS ``TEXT``" msgstr "" -msgid "pgr_prim(`Edges SQL`_)" +msgid "pgRouting Version for this documentation" msgstr "" -msgid "Minimum spanning forest of a subgraph" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" -msgid "`Boost: Prim's algorithm documentation `__" +msgid "**No documentation available**" msgstr "" -msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "**TBD**" msgstr "" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgid "TBD" msgstr "" -msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." msgstr "" -msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." +msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "pgr_withPoints(Combinations)" msgstr "" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pg" + +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pg" + +msgid "**options:** ``[directed, details])``" msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" msgstr "" -msgid "``pgr_pushRelabel``" -msgstr "``pgr_pushRelabel``" +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgstr "" -msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." msgstr "" -msgid "pgr_pushRelabel(Combinations)" +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "Renamed from ``pgr_maxFlowPushRelabel``" +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +msgid "**Driving side** parameter is unnamed and compulsory." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Output columns standardized to |matrix-result|" msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "``pgr_separateCrossing``" -msgstr "``pgr_separateCrossing``" +msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgstr "" -msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." +msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" msgstr "" -#, fuzzy -msgid "Proposed function." -msgstr "新しい **公式** 機能" +msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgstr "" -msgid "This is an auxiliary function for separating crossing edges." +msgid "pgr_withpointscost(text,text,text,boolean,character)" msgstr "" -#, fuzzy -msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "p" +msgid "pgr_withPointsCost(Combinations)" +msgstr "" -msgid "RETURNS |result-separate|" +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." msgstr "" -msgid "Get the segments of the crossing geometries" +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." msgstr "" -msgid "``tolerance``" -msgstr "``tolerance``" +msgid "The returned values are in the form of a set of |matrix-result|." +msgstr "" -msgid "0.01" +msgid "**positive** when it belongs to the edges_sql" msgstr "" -msgid "Used in ST_Snap before ST_Split" +msgid "**negative** when it belongs to the points_sql" msgstr "" -msgid "Get the code for further refinement." +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." msgstr "" -msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgid "For **undirected** graphs, the results are **symmetric**." msgstr "" -msgid "``pgr_separateTouching``" -msgstr "``pgr_separateTouching``" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pg" -msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pg" -msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pg" #, fuzzy -msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "p" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pg" -msgid "``pgr_sequentialVertexColoring`` - Proposed" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pg" -msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgid "**options:** ``[directed]``" msgstr "" -msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." msgstr "" -msgid "The implementation is applicable only for **undirected** graphs." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." msgstr "" -msgid "Provides the color to be assigned to all the vertices present in the graph." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." msgstr "" -msgid "Color identifiers values are in the Range :math:`[1, |V|]`" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." msgstr "" -msgid "The algorithm tries to assign the least possible color to every vertex." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgid "Being close to the graph does not mean have a shorter route." msgstr "" -msgid "The returned rows are ordered in ascending order of the vertex value." +msgid "Right side driving topology" msgstr "" -msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid ":math:`d` is the maximum degree of the vertices in the graph," +msgid "Left side driving topology" msgstr "" -msgid ":math:`k` is the number of colors used." +msgid "Does not matter driving side driving topology" msgstr "" -msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." msgstr "" -msgid "`Boost: Sequential Vertex Coloring `__" +msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" msgstr "" #, fuzzy -msgid "``pgr_sloanOrdering`` - Experimental" -msgstr "p" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgstr "pg" -msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" msgstr "" -msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." +msgid "Returning a **symmetrical** cost matrix" msgstr "" -msgid "Finds a pseudoperipheral vertex pair to determine good starting points" +msgid "Using the default ``side`` value on the **points_sql** query" msgstr "" -msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." +msgid "Using the default ``driving side`` value" msgstr "" -msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Typically produces better orderings than simple breadth-first approaches." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "" -msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -#, fuzzy -msgid "pgr_sloanOrdering(`Edges SQL`_)" -msgstr "p" - -msgid ":Example : Sloan ordering without specifying start vertex" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "New sloan ordering order." +msgid "Output columns standardized to |result-spantree|" msgstr "" -msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." +msgid "When ``details`` is ``false``:" msgstr "" -msgid "`Boost: Sloan Ordering `__" +msgid "Points reached within the distance are not included." msgstr "" -msgid "``pgr_stoerWagner`` - Experimental" -msgstr "" +#, fuzzy +msgid "Deprecated signatures:" +msgstr "機能" -msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." msgstr "" #, fuzzy -msgid "Version 3.0" -msgstr "バージョン 3.0.0" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgstr "pg" -msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." -msgstr "" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgstr "pg" -msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgid "**options A:** ``[directed, details]``" msgstr "" -msgid "Sum of the weights of all edges between the two sets is mincut." +msgid "**options B:** ``[directed, details, equicost]``" msgstr "" -msgid "A **mincut** is a cut having the least weight." -msgstr "" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgstr "pg" -msgid "Values are returned when graph is connected." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." msgstr "" -msgid "When there is no edge in graph then EMPTY SET is return." -msgstr "" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgstr "pg" -msgid "When the graph is unconnected then EMPTY SET is return." +msgid "**options:** ``[directed, details, equicost]``" msgstr "" -msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" msgstr "" -msgid "Running time: :math:`O(V*E + V^2*log V)`." +msgid "Negative values represent a point" msgstr "" -msgid "pgr_stoerWagner(`Edges SQL`_)" +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Returns set of |result-mincut|" +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "min cut of the main subgraph" +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "Returns set of ``(seq, edge, cost, mincut)``" +msgid "Driving side does not matter" msgstr "" -msgid "Edges which divides the set of vertices into two." +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." msgstr "" -msgid "Cost to traverse of edge." -msgstr "" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" -msgid "**mincut**" +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" -msgid "Min-cut weight of a undirected graph." +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "Additional Example:" +msgid "pgr_withPointsKSP(One to Many)" msgstr "" -msgid "min cut of an edge" +msgid "pgr_withPointsKSP(Many to One)" msgstr "" -msgid "Using :doc:`pgr_connectedComponents`" +msgid "pgr_withPointsKSP(Many to Many)" msgstr "" -msgid "`Boost: Stoer Wagner min cut `__" +msgid "pgr_withPointsKSP(Combinations)" msgstr "" -msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" -msgid "``pgr_strongComponents``" -msgstr "``pgr_strongComponents``" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pg" -msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." -msgstr "" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pg" -msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." -msgstr "" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pg" -msgid "Works for **directed** graphs." -msgstr "" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pg" -msgid "Components are described by vertices identifiers." -msgstr "" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgstr "pg" -msgid "pgr_strongComponents(`Edges SQL`_)" +msgid "**options:** ``[directed, heap_paths, details]``" msgstr "" -msgid "The strong components of the graph" +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." msgstr "" -msgid "`Boost: Strong components `__" +msgid "For a directed graph." msgstr "" -msgid "wikipedia: `Strongly connected component `__" +msgid "No details are given about distance of other points of the query." msgstr "" -msgid "``pgr_topologicalSort`` - Experimental" +msgid "No heap paths are returned." msgstr "" -msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" msgstr "" -msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" msgstr "" -msgid "For optimization purposes, if there are more than one answer, the function" +msgid "Using a combinations table on an **directed** graph" msgstr "" -msgid "will return one of them." +msgid "Number of required paths" msgstr "" -msgid "The returned values are ordered in topological order:" -msgstr "" +#, fuzzy +msgid "withPointsKSP optional parameters" +msgstr "オプションとなるパラメータ" -msgid "pgr_topologicalSort(`Edges SQL`_)" +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Topologically sorting the graph" +msgid "Left driving side" msgstr "" -msgid "Sequential value starting from :math:`1`" +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." msgstr "" -msgid "Linear topological ordering of the vertices" +msgid "Right driving side" msgstr "" -msgid "Additional examples" +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." msgstr "" -msgid "Topologically sorting the one way segments" -msgstr "" +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" -msgid "Graph is not a DAG" +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." msgstr "" -msgid "`Boost: topological sort `__" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "``pgr_transitiveClosure`` - Experimental" +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +#, fuzzy +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgstr "pg" + +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." msgstr "" -msgid "Transforms the input directed graph into the transitive closure of the graph." +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "Process is valid for directed graphs." +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" -msgid "The transitive closure of an undirected graph produces a cluster graph" +msgid "Prim - Family of functions" msgstr "" -msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." msgstr "" -msgid "The returned values are not ordered" +msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." msgstr "" -msgid "The returned graph is compressed" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" msgstr "" -msgid "Running time: :math:`O(|V||E|)`" +msgid "Boost: `Prim's algorithm `__" msgstr "" -msgid "The pgr_transitiveClosure function has the following signature:" +msgid "Wikipedia: `Prim's algorithm `__" msgstr "" -msgid "pgr_transitiveClosure(`Edges SQL`_)" +msgid "Proposed Functions" msgstr "" -msgid "Returns set of |result-closure|" +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" -msgid "Rechability of a subgraph" +#, fuzzy +msgid "Reference" +msgstr "参照" + +msgid "Release Notes" msgstr "" -msgid "Identifier of the source of the edges" +msgid "To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" -msgid "``target_array``" -msgstr "``target_array``" +msgid "Mayors" +msgstr "" -msgid "Identifiers of the targets of the edges" +msgid "pgRouting 4" msgstr "" -msgid "Identifiers of the vertices that are reachable from vertex v." +msgid "Minors 4.x" msgstr "" -msgid "`Boost: transitive closure `__" +msgid "pgRouting 4.1" msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "pgRouting 4.0" msgstr "" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +msgid "pgRouting 4.0.1 Release Notes" +msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" msgstr "" -msgid "pgr_trsp(One to One)" +msgid "Bug Fixes" msgstr "" -msgid "pgr_trsp(One to Many)" +msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "" -msgid "pgr_trsp(Many to One)" +msgid "`#3034 `__: metrics driver should not be using new" msgstr "" -msgid "pgr_trsp(Many to Many)" +msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" msgstr "" -msgid "pgr_trsp(Combinations)" +msgid "`#3040 `__: Check and fix cppcoreguidelines-virtual-class-destructor" msgstr "" -msgid "Deprecated signatures" +msgid "`#3039 `__: Check and fix cppcoreguidelines-special-member-functions" msgstr "" -msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "`#3038 `__: Check and fix cppcoreguidelines-prefer-member-initializer" msgstr "" -msgid "New prototypes" +msgid "`#3037 `__: Check and fix cppcoreguidelines-init-variables" msgstr "" -msgid "pgr_trspViaVertices" -msgstr "pgr_trspViaVertices" +msgid "`#3035 `__: Pass by reference on existing drivers" +msgstr "" -msgid "pgr_trspViaEdges" -msgstr "pgr_trspViaEdges" +#, fuzzy +msgid "Administration" +msgstr "序章" -msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgid "`#3031 `__: pgtap license to Creative commons and License texts standardization" msgstr "" -msgid "It does no guarantee the shortest path as it might contain restriction paths." +msgid "pgRouting 4.0.0 Release Notes" msgstr "" -msgid "The general algorithm is as follows:" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" -msgid "Execute a Dijkstra." +msgid "Build" msgstr "" -msgid "If the solution passes thru a restriction then." +msgid "C++ standard is std17" msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The code is not yet modified to use std17:" msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "The user's documentation is built by default." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "The doxygen documentation is built by default." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgid "For developers:" msgstr "" -msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." +msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "Tidy checks are done on CI." msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +#, fuzzy +msgid "Documentation build" +msgstr "ドキュメントには改良が必要な場合があります。" + +msgid "The doxygen documentation is built by default" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgid "The HTML documentation is built by default" msgstr "" -msgid "Using a combinations table on an undirected graph." +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "" -msgid "`Deprecated documentation `_" +msgid "`WITH-DOC` is not used anymore" msgstr "" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" +#, fuzzy +msgid "User Documentation is not built when" +msgstr "ドキュメントには改良が必要な場合があります。" -msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgid "Sphinx is not found" msgstr "" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "When all Sphinx formats are OFF" msgstr "" -msgid "The paths represents the sections of the route." +msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" msgstr "" -msgid "Execute a :doc:`pgr_dijkstraVia`." +msgid "When all languages are OFF" msgstr "" -msgid "For the set of sub paths of the solution that pass through a restriction then" +msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions for the paths." +msgid "Documentation output location: ``build/doc/_build/``" msgstr "" -msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." +msgid "For example: for HTML output is on `build/doc/_build/html` directory" msgstr "" -msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgid "Developers' Documentation is not built when" msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgid "Doxygen is not found" msgstr "" -msgid "Simulation of how algorithm works." +msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" -msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" +msgid "Summary of changes by function" msgstr "" -msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." -msgstr "" +msgid "pgr_aStar" +msgstr "pgr_aStar" -msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." -msgstr "" +msgid "pgr_aStarCost" +msgstr "pgr_aStarCost" -msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" +msgid "pgr_bandwidth" +msgstr "pgr_bandwidth" -msgid "Getting the same result as ``pgr_trspVia``:" -msgstr "" +msgid "pgr_bdAstar" +msgstr "pgr_bdAstar" -msgid "Example 8" -msgstr "" +msgid "pgr_bdAstarCost" +msgstr "pgr_bdAstarCost" -msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." -msgstr "" +msgid "pgr_bdDijkstra" +msgstr "pgr_bdDijkstra" -msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." -msgstr "" +msgid "pgr_bdDijkstraCost" +msgstr "pgr_bdDijkstraCost" -msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "" +msgid "pgr_bellmanFord" +msgstr "pgr_bellmanFord" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." -msgstr "" +msgid "pgr_binaryBreadthFirstSearch" +msgstr "pgr_binaryBreadthFirstSearch" -msgid ":doc:`via-category`" -msgstr "" +msgid "pgr_bipartite" +msgstr "pgr_bipartite" -msgid "``pgr_trspVia_withPoints``" -msgstr "``pgr_trspVia_withPoints``" +msgid "pgr_boykovKolmogorov" +msgstr "pgr_boykovKolmogorov" -msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." -msgstr "" +msgid "pgr_breadthFirstSearch" +msgstr "pgr_breadthFirstSearch" -msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid ":" msgstr "" -msgid "is a sequence of paths" -msgstr "" +msgid "pgr_contraction" +msgstr "pgr_contraction" -msgid "Build the Graph with the new points." -msgstr "" +msgid "pgr_dagShortestPath" +msgstr "pgr_dagShortestPath" -msgid "The points identifiers will be converted to negative values." -msgstr "" +msgid "pgr_depthFirstSearch" +msgstr "pgr_depthFirstSearch" -msgid "The vertices identifiers will remain positive." -msgstr "" +msgid "pgr_dijkstra" +msgstr "pgr_dijkstra" -msgid "Execute a :doc:`pgr_withPointsVia`." -msgstr "" +msgid "pgr_dijkstraCost" +msgstr "pgr_dijkstraCost" -msgid "For the set of paths of the solution that pass through a restriction then" -msgstr "" +msgid "pgr_dijkstraNear" +msgstr "pgr_dijkstraNear" -msgid "Execute the **TRSP** algorithm with restrictions for the path." -msgstr "" +msgid "pgr_dijkstraNearCost" +msgstr "pgr_dijkstraNearCost" -msgid "Do not use negative values on identifiers of the inner queries." -msgstr "" +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" -#, fuzzy -msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" -msgstr "pg" +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" -msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgstr "" +msgid "pgr_edgeDisjointPaths" +msgstr "pgr_edgeDisjointPaths" -msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." -msgstr "" +msgid "pgr_edmondsKarp" +msgstr "pgr_edmondsKarp" -msgid "When positive it is considered a vertex identifier" -msgstr "" +msgid "pgr_edwardMoore" +msgstr "pgr_edwardMoore" -msgid "When negative it is considered a point identifier" -msgstr "" +msgid "pgr_kingOrdering" +msgstr "pgr_kingOrdering" -msgid "[**driving side**]" -msgstr "" +msgid "pgr_KSP" +msgstr "pgr_KSP" -msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" -msgstr "" +msgid "pgr_maxCardinalityMatch" +msgstr "pgr_maxCardinalityMatch" -#, fuzzy -msgid "For directed graph:" -msgstr "導かれないグラフ" +msgid "pgr_maxFlow" +msgstr "pgr_maxFlow" -msgid "[``r``, ``R``] for right driving side" -msgstr "" +msgid "pgr_pushRelabel" +msgstr "pgr_pushRelabel" -msgid "[``l``, ``L``] for left driving side" -msgstr "" +msgid "pgr_sequentialVertexColoring" +msgstr "pgr_sequentialVertexColoring" -#, fuzzy -msgid "For undirected graph:" -msgstr "導かれないグラフ" +msgid "pgr_sloanOrdering" +msgstr "pgr_sloanOrdering" -msgid "[``b``, ``B``] for both driving sides" +msgid "pgr_topologicalSort" +msgstr "pgr_topologicalSort" + +msgid "pgr_transitiveClosure" +msgstr "pgr_transitiveClosure" + +msgid "pgr_trsp" +msgstr "pgr_trsp" + +msgid "pgr_trspVia" +msgstr "pgr_trspVia" + +msgid "pgr_trspVia_withPoints" msgstr "" -msgid "Default values when parameter is missing:" +msgid "pgr_trsp_withPoints" msgstr "" -#, fuzzy -msgid "[``r``, ``R``] for directed graph" -msgstr "導かれないグラフ" +msgid "pgr_TSP" +msgstr "pgr_TSP" + +msgid "pgr_TSPeuclidean" +msgstr "pgr_TSPeuclidean" + +msgid "pgr_turnRestrictedPath" +msgstr "pgr_turnRestrictedPath" + +msgid "pgr_withPoints" +msgstr "pgr_withPoints" + +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" + +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" -#, fuzzy -msgid "[``l``, ``L``] for undirected graph" -msgstr "導かれないグラフ" +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" -msgid "With points optional parameters" +msgid "Functions promoted to official" msgstr "" -msgid "``details``" -msgstr "``details``" - -msgid "For showing points stops." +msgid "`#2701 `__: pgr_trsp" msgstr "" -msgid "When ``true`` the results will include the points that are in the path." +msgid "`#2701 `__: pgr_trspVia" msgstr "" -msgid "When ``false`` the results will not include the points that are in the path." +msgid "`#2701 `__: pgr_trspVia_withPoints" msgstr "" -msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgid "`#2701 `__: pgr_trsp_withPoints" msgstr "" -msgid "Use ``pgr_findCloseEdges`` for points on the fly" +msgid "`#2700 `__: pgr_withPoints" msgstr "" -msgid "Using :doc:`pgr_findCloseEdges`:" +msgid "`#2700 `__: pgr_withPointsCost" msgstr "" -msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." +msgid "`#2700 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "`#2700 `__: pgr_withPointsDD" msgstr "" -msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgid "`#2700 `__: pgr_withPointsKSP" msgstr "" -msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgid "`#2700 `__: pgr_withPointsVia" msgstr "" -msgid "Usage variations" +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "" -msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "" -msgid "The algorithm performs a :doc:`pgr_withPointsVia`" +msgid "Signatures promoted to official" msgstr "" -msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgid "`#2718 `__: pgr_aStar(Combinations)" msgstr "" -msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "`#2718 `__: pgr_aStarCost(Combinations)" msgstr "" -msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" msgstr "" -msgid "Getting the same result as ``pgr_trspVia_withPoints``:" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" msgstr "" -msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" msgstr "" -msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgid "`#2718 `__: pgr_dijkstra(Combinations)" msgstr "" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgstr "" -msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." +msgid "`#2718 `__: pgr_KSP(All signatures)" msgstr "" -msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "Vertices of the graph are:" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" msgstr "" -msgid "**positive** when it belongs to the `Edges SQL`_" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" msgstr "" -msgid "**negative** when it belongs to the `Points SQL`_" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" msgstr "" -msgid "The `agg_cost` in the non included values `(v, v)` is `0`" +#, fuzzy +msgid "New experimental functions." +msgstr "新しい **公式** 機能" + +msgid "Metrics" msgstr "" -msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" +msgid "`#2951 `__: pgr_bandwidth" msgstr "" -msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgid "Ordering" msgstr "" -msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgid "`#2954 `__: pgr_kingOrdering" msgstr "" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" -msgstr "pg" +msgid "`#2955 `__: pgr_sloanOrdering" +msgstr "" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" -msgstr "pg" +msgid "SQL signatures and output standardization" +msgstr "" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" -msgstr "pg" +msgid "`#2904 `__: Standardize output columns of functions with different output" +msgstr "" -#, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" -msgstr "pg" +msgid "columns within overloads" +msgstr "" #, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" -msgstr "pg" +msgid "Standardized to |short-generic-result|" +msgstr "ダイクストラ関連機能" -msgid "**options:** ``[directed, details]``" +msgid "`#2905 `__: pgr_withPoints" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgid "`#2906 `__: pgr_bdDijkstra" msgstr "" -msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgid "`#2907 `__: pgr_bellmanFord" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgid "`#2910 `__: pgr_edwardMoore" msgstr "" -msgid "Two combinations" +msgid "`#2913 `__: pgr_dagShortestPath" msgstr "" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgid "Standardized to |matrix-result|" msgstr "" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." +msgid "`#2905 `__: pgr_withPointsCost" msgstr "" -msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2905 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" -msgstr "" +#, fuzzy +msgid "Standardized to |generic-result|" +msgstr "ダイクストラ関連機能" -msgid "Passes in front or visits with right side driving." +msgid "`#2909 `__: pgr_edgeDisjointPaths" msgstr "" -msgid "For point :math:`6` and vertex :math:`11`." +msgid "`#2909 `__: pgr_turnRestrictedPath" msgstr "" -msgid "Passes in front or visits with left side driving." +msgid "Standardized to |result_edge_color|" msgstr "" -msgid "``pgr_turnRestrictedPath`` - Experimental" +msgid "`#2924 `__: pgr_edgeColoring" msgstr "" -msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgid "Standardized to |result_node_color|" msgstr "" -msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" +msgid "`#2924 `__: pgr_bipartite" msgstr "" -msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "`#2927 `__: pgr_sequentialVertexColoring" msgstr "" -msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +msgid "Standardized to |result-spantree|" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" +msgid "`#2931 `__: pgr_breadthFirstSearch" msgstr "" -msgid "Special optional parameters" +msgid "`#2931 `__: pgr_depthFirstSearch" msgstr "" -msgid "``stop_on_first``" -msgstr "``stop_on_first``" +#, fuzzy +msgid "Standardized to |result_node_order|" +msgstr "ダイクストラ関連機能" -msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgid "`#2934 `__: pgr_topologicalSort" msgstr "" -msgid "When ``false`` returns at most K paths" -msgstr "" +#, fuzzy +msgid "Standardized to |result-closure|" +msgstr "ダイクストラ関連機能" -msgid "When ``true`` returns only paths that do not violate restrictions" +msgid "`#2934 `__: pgr_transitiveClosure" msgstr "" -msgid "When ``false`` returns the paths found" +msgid "Removal of SQL deprecated signatures" msgstr "" -msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." +msgid "`#2798 `__: pgr_contraction" msgstr "" -msgid "No results because the only path available follows a restriction." +msgid "`#2683 `__: pgr_trsp" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" +msgid "`#2683 `__: pgr_trspVia" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" +msgid "`#2888 `__: pgr_findCloseEdges" msgstr "" -msgid "``pgr_version``" -msgstr "``pgr_version``" - -msgid "``pgr_version`` — Query for pgRouting version information." +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "Breaking change on result columns" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "Support for old signature ends" +msgid "`#2890 `__: pgr_withPointsDD" msgstr "" -msgid "Returns pgRouting version information." +msgid "`#2895 `__: pgr_withPointsKSP" msgstr "" -msgid "pgr_version()" +msgid "`#2899 `__: pgr_maxCardinalityMatch" msgstr "" -msgid "RETURNS ``TEXT``" +msgid "`#2901 `__: pgr_TSP" msgstr "" -msgid "pgRouting Version for this documentation" +msgid "`#2901 `__: pgr_TSPeuclidean" msgstr "" -msgid "``pgr_vrpOneDepot`` - Experimental" +msgid "Removal of SQL deprecated functions" msgstr "" -msgid "**No documentation available**" +msgid "`#2681 `__: pgr_trspViaedges" msgstr "" -msgid "**TBD**" +msgid "`#2682 `__: pgr_trspViaVertices" msgstr "" -msgid "TBD" +msgid "`#2748 `__: pgr_alphaShape" msgstr "" -msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgid "`#2751 `__: pgr_createTopology" msgstr "" -msgid "pgr_withPoints(Combinations)" +msgid "`#2752 `__: pgr_analyzeGraph" msgstr "" -msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgid "`#2755 `__: pgr_analyzeOneWay" msgstr "" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2827 `__: pgr_createVerticesTable" +msgstr "" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2886 `__: pgr_nodeNetwork" +msgstr "" #, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pg" +msgid "Removal of SQL deprecated internal functions" +msgstr "新しい **公式** 機能" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgstr "" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgstr "" -msgid "**options:** ``[directed, details])``" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" msgstr "" -msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" msgstr "" -msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" msgstr "" -msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" msgstr "" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" msgstr "" -msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "" -msgid "pgr_withPointsCost(Combinations)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" msgstr "" -msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" msgstr "" -msgid "The returned values are in the form of a set of |matrix-result|." +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "" -msgid "**positive** when it belongs to the edges_sql" +msgid "`#2861 `__ _pgr_endPoint(geometry)" msgstr "" -msgid "**negative** when it belongs to the points_sql" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" msgstr "" -msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" msgstr "" -msgid "For **undirected** graphs, the results are **symmetric**." +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" msgstr "" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pg" - -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgstr "" -msgid "**options:** ``[directed]``" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" msgstr "" -msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" msgstr "" -msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "Being close to the graph does not mean have a shorter route." +msgid "`#2861 `__ _pgr_msg(integer,text,text)" msgstr "" -msgid "Right side driving topology" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" msgstr "" -msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" msgstr "" -msgid "Left side driving topology" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "Does not matter driving side driving topology" +msgid "`#2861 `__ _pgr_quote_ident(text)" msgstr "" -msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgid "`#2861 `__ _pgr_startPoint(geometry)" msgstr "" -#, fuzzy -msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "" -msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "Returning a **symmetrical** cost matrix" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" msgstr "" -msgid "Using the default ``side`` value on the **points_sql** query" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" msgstr "" -msgid "Using the default ``driving side`` value" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" msgstr "" -msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" msgstr "" -msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "Output columns standardized to |result-spantree|" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "When ``details`` is ``false``:" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "Points reached within the distance are not included." +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -#, fuzzy -msgid "Deprecated signatures:" -msgstr "機能" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "" -msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgid "`#2861 `__ _pgr_versionLess(text,text)" msgstr "" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" -msgstr "pg" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" -msgstr "pg" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgstr "" -msgid "**options A:** ``[directed, details]``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "**options B:** ``[directed, details, equicost]``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" msgstr "" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" -msgstr "pg" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgstr "" -msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -#, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" -msgstr "pg" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" -msgid "**options:** ``[directed, details, equicost]``" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" msgstr "" -msgid "Negative values represent a point" +msgid "Summary of functions and signatures no longer on pgrouting" msgstr "" -msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" msgstr "" -msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" msgstr "" -msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" msgstr "" -msgid "Driving side does not matter" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" msgstr "" -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgstr "" -msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "pgr_withPointsKSP(One to Many)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "pgr_withPointsKSP(Many to One)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "pgr_withPointsKSP(Many to Many)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" msgstr "" -msgid "pgr_withPointsKSP(Combinations)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pg" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pg" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pg" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pg" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" -msgstr "pg" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "" -msgid "**options:** ``[directed, heap_paths, details]``" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "For a directed graph." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "No details are given about distance of other points of the query." +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "No heap paths are returned." +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "Using a combinations table on an **directed** graph" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" msgstr "" -msgid "Number of required paths" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" msgstr "" -#, fuzzy -msgid "withPointsKSP optional parameters" -msgstr "オプションとなるパラメータ" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgstr "" -msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "Left driving side" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "Right driving side" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "" -msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" msgstr "" -#, fuzzy -msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" -msgstr "pg" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "" -msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgid "Removal of unused C/C++ code" msgstr "" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" +msgid "Refactor the Script to build the update PostgreSQL file." msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "One process & driver for:" msgstr "" -msgid "Prim - Family of functions" +msgid "allpairs: johnson and Floyd-Warshall" msgstr "" -msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." +msgid "Shortest path: Dijkstra and withPoints using Dijkstra" msgstr "" -msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." +msgid "Deprecation of internal C/C++ functions" msgstr "" -msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgid "Deprecated functions are substituted by new function." msgstr "" -msgid "Boost: `Prim's algorithm `__" +msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" msgstr "" -msgid "Wikipedia: `Prim's algorithm `__" +msgid "_pgr_withPointsDD => _pgr_withPointsddv4" msgstr "" -msgid "Proposed Functions" +msgid "_pgr_kruskal => _pgr_kruskalv4" msgstr "" -msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid "_pgr_prim => _pgr_primv4" msgstr "" -#, fuzzy -msgid "Reference" -msgstr "参照" +msgid "_pgr_dijkstra => _pgr_dijkstra_v4" +msgstr "" -msgid "Release Notes" +msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" msgstr "" -msgid "To see the full list of changes check the list of `Git commits `_ on Github." +msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" msgstr "" -msgid "Mayors" +msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" msgstr "" -msgid "pgRouting 4" +msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" msgstr "" -msgid "Minors 4.x" +msgid "Internal C/C++ functions in legacy" msgstr "" -msgid "pgRouting 4.1" +msgid "`#2683 `__ _trsp" msgstr "" -msgid "pgRouting 4.1.0 Release Notes" +msgid "`#2683 `__ _v4trsp" msgstr "" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgid "`#2748 `__ _pgr_alphaShape" msgstr "" -msgid "No changes yet" +msgid "`#2913 `__ _pgr_dagShortestPath" msgstr "" msgid "pgRouting 3" @@ -14886,9 +14950,6 @@ msgstr "" msgid "Removed unnecessary column seq" msgstr "" -msgid "Bug Fixes" -msgstr "" - msgid "pgr_maxFlowMinCost" msgstr "pgr_maxFlowMinCost" diff --git a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po index 9455e864e4..3b0df8ab86 100644 --- a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-12-10 19:55+0000\n" +"POT-Creation-Date: 2026-03-04 00:25+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Hyung-Gyu Ryoo \n" "Language-Team: Korean \n" @@ -3539,10195 +3539,10259 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" -msgid "pgRouting 4.0" -msgstr "" - -msgid "pgRouting 4.0.0-alpha1 Release Notes" +msgid "pgRouting 4.1.0 Release Notes" msgstr "" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "" -msgid "Build" +msgid "Code enhancements" msgstr "" -msgid "C++ standard is std17" +msgid "`#3049 `__: Use enumeration on drivers and process." msgstr "" -msgid "Using this standard, all supported toolchains across our CI matrix will work." +msgid "`#3054 `__: Change error message when edges_sql is empty" msgstr "" -msgid "The code is not yet modified to use std17:" +msgid "`#3055 `__: bdDijkstra: use the shortest_path process and driver" msgstr "" -msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." +msgid "`#3056 `__: edwardMoore: use the shortest_path process and driver" msgstr "" -msgid "The user's documentation is built by default." +msgid "`#3060 `__: dagShortestPath: use the shortest_path process and driver" msgstr "" -msgid "The doxygen documentation is built by default." +msgid "`#3064 `__: Astar: create and use a process and driver for Astar" msgstr "" -msgid "For developers:" +msgid "`#3075 `__: Spanning tree: create and use a process and driver" msgstr "" -msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." +msgid "`#3086 `__: MaxFlow: create and use a process and driver" msgstr "" -msgid "Tidy checks are done on CI." +msgid "`#3089 `__: edgeDisjoint and bellmanFord use shortestPath driver and process" msgstr "" -msgid "Documentation build" +msgid "All releases" msgstr "" -msgid "The doxygen documentation is built by default" +msgid "Kruskal - Family of functions" msgstr "" -msgid "The HTML documentation is built by default" +msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." msgstr "" -msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" +msgid "**The main Characteristics are:**" msgstr "" -msgid "`WITH-DOC` is not used anymore" +msgid "The total weight of all the edges in the tree or forest is minimized." msgstr "" -msgid "User Documentation is not built when" +msgid "Kruskal's running time: :math:`O(E * log E)`" msgstr "" -msgid "Sphinx is not found" -msgstr "" +#, fuzzy +msgid "Metrics - Family of functions" +msgstr ":doc:`pgr_withPoints`" -msgid "When all Sphinx formats are OFF" +msgid "Migration guide" msgstr "" -msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." msgstr "" -msgid "When all languages are OFF" +msgid "Results can be different because of the changes." msgstr "" -msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" +msgid "All deprecated functions will be removed on next major version 4.0.0" msgstr "" -msgid "Documentation output location: ``build/doc/_build/``" -msgstr "" +#, fuzzy +msgid "Migration to standardized columns" +msgstr ":doc:`pgr_withPoints`" -msgid "For example: for HTML output is on `build/doc/_build/html` directory" +msgid "There has been an effort to standardize function output columns names and types." msgstr "" -msgid "Developers' Documentation is not built when" -msgstr "" +msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgid "Doxygen is not found" +msgid "|matrix-result|" msgstr "" -msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" -msgstr "" +msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgid "Summary of changes by function" +msgid "|short-generic-result|" msgstr "" -msgid "pgr_aStar" -msgstr "pgr_aStar" +msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgid "Combinations signature promoted to official." +msgid "|result-spantree|" msgstr "" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +#, fuzzy +msgid "Function" +msgstr "소개" -msgid "pgr_bandwidth" -msgstr "pgr_bandwidth" +#, fuzzy +msgid ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_dijkstraVia`" -msgid "New experimental function." -msgstr "" +#, fuzzy +msgid "`Migration of single path functions`_" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_bdAstar" -msgstr "pgr_bdAstar" +#, fuzzy +msgid ":doc:`pgr_aStar`" +msgstr ":doc:`pgr_aStarCost`" -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" +#, fuzzy +msgid ":doc:`pgr_bdAstar`" +msgstr ":doc:`pgr_bdAstarCost`" -msgid "pgr_bdDijkstra" -msgstr "pgr_bdDijkstra" +msgid ":doc:`pgr_drivingDistance`" +msgstr ":doc:`pgr_drivingDistance`" -msgid "Output columns standardized to |short-generic-result|" -msgstr "" +#, fuzzy +msgid "`Migration of spanning tree functions`_" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_bdDijkstraCost" -msgstr "pgr_bdDijkstraCost" +#, fuzzy +msgid ":doc:`pgr_withPointsDD`" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_bellmanFord" -msgstr "pgr_bellmanFord" +#, fuzzy +msgid ":doc:`pgr_bdDijkstra`" +msgstr ":doc:`pgr_dijkstraVia`" -msgid "pgr_binaryBreadthFirstSearch" -msgstr "pgr_binaryBreadthFirstSearch" +#, fuzzy +msgid ":doc:`pgr_binaryBreadthFirstSearch`" +msgstr ":doc:`pgr_dijkstraNear`" -msgid "pgr_bipartite" -msgstr "pgr_bipartite" +#, fuzzy +msgid ":doc:`pgr_bipartite`" +msgstr ":doc:`pgr_prim`" -msgid "Output columns standardized to |result_node_color|" -msgstr "" +#, fuzzy +msgid "`Migration of output column name change`_" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_boykovKolmogorov" -msgstr "pgr_boykovKolmogorov" +#, fuzzy +msgid ":doc:`pgr_breadthFirstSearch`" +msgstr ":doc:`pgr_dijkstraNear`" -msgid "pgr_breadthFirstSearch" -msgstr "pgr_breadthFirstSearch" +#, fuzzy +msgid ":doc:`pgr_depthFirstSearch`" +msgstr ":doc:`pgr_dijkstraNear`" -msgid ":" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_edgeColoring`" +msgstr ":doc:`pgr_version`" -msgid "Standardizing output columns to |result-spantree|" -msgstr "" +#, fuzzy +msgid "`Migration of multiple paths functions`_" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_contraction" -msgstr "pgr_contraction" +#, fuzzy +msgid ":doc:`pgr_sequentialVertexColoring`" +msgstr ":doc:`pgr_extractVertices`" -msgid "Breaking change, signatures no longer available:" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_topologicalSort`" +msgstr ":doc:`pgr_trspVia`" -msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "" +msgid ":doc:`pgr_withPoints`" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_dagShortestPath" -msgstr "pgr_dagShortestPath" +#, fuzzy +msgid "`Migration of cost functions`_" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_depthFirstSearch" -msgstr "pgr_depthFirstSearch" +#, fuzzy +msgid "Migration of cost functions" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_dijkstra" -msgstr "pgr_dijkstra" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgstr "" -msgid "pgr_dijkstraCost" -msgstr "pgr_dijkstraCost" +msgid "The following functions need to be migrated when they are being used in an application." +msgstr "" -msgid "pgr_dijkstraNear" -msgstr "pgr_dijkstraNear" +#, fuzzy +msgid "Version" +msgstr "짧은 버전" -msgid "Function promoted to official." +msgid "From" msgstr "" -msgid "pgr_dijkstraNearCost" -msgstr "pgr_dijkstraNearCost" - -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +msgid "v < 4.0" +msgstr "" -msgid "Output columns standardized to |result_edge_color|" +msgid "|matrix-pid|" msgstr "" -msgid "pgr_edgeDisjointPaths" -msgstr "pgr_edgeDisjointPaths" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" -msgid "Output columns standardized to |generic-result|" +msgid "**to** |matrix-result|" msgstr "" -msgid "pgr_edmondsKarp" -msgstr "pgr_edmondsKarp" - -msgid "pgr_edwardMoore" -msgstr "pgr_edwardMoore" +#, fuzzy +msgid "Migration of |matrix-pid|" +msgstr ":doc:`pgr_withPoints`" -msgid "Version 3.2.0" +msgid "Signatures to be migrated:" msgstr "" -msgid "New experimental signature:" +msgid "One to One" msgstr "" -msgid "pgr_edwardMoore(Combinations)" +msgid "One to Many" msgstr "" -msgid "Version 3.0.0" +msgid "Many to One" msgstr "" -msgid "pgr_kingOrdering" -msgstr "pgr_kingOrdering" - -msgid "pgr_KSP" -msgstr "pgr_KSP" - -msgid "All signatures promoted to official." +msgid "Many to Many" msgstr "" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" - -msgid "pgr_maxCardinalityMatch(text,boolean)" +msgid "Combinations" msgstr "" -msgid "pgr_maxFlow" -msgstr "pgr_maxFlow" - -msgid "pgr_pushRelabel" -msgstr "pgr_pushRelabel" - -msgid "pgr_sequentialVertexColoring" -msgstr "pgr_sequentialVertexColoring" - -msgid "pgr_sloanOrdering" -msgstr "pgr_sloanOrdering" - -msgid "pgr_topologicalSort" -msgstr "pgr_topologicalSort" - -#, fuzzy -msgid "Standardize output to |result_node_order|" -msgstr ":doc:`pgr_createVerticesTable`" - -msgid "pgr_transitiveClosure" -msgstr "pgr_transitiveClosure" - -#, fuzzy -msgid "Standardized output to |result-closure|" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "Breaking change" +msgstr "" -msgid "pgr_trsp" -msgstr "pgr_trsp" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgstr "" -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "New output columns are |matrix-result|" msgstr "" -msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." msgstr "" -msgid "pgr_trspVia" -msgstr "pgr_trspVia" +msgid "Examples" +msgstr "" -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgid "Examples for One to One for cost functions" msgstr "" #, fuzzy -msgid "pgr_trspVia_withPoints" -msgstr ":doc:`pgr_trspVia_withPoints`" - -msgid "**Driving side** parameter is positional unnamed." -msgstr "" +msgid "Using ``pgr_withPointsCost``" +msgstr ":doc:`pgr_withPointsCost`" -msgid "Valid values depend on kind of graph" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "from" msgstr "" -msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "to" msgstr "" -#, fuzzy -msgid "pgr_trsp_withPoints" -msgstr ":doc:`pgr_trspVia_withPoints`" - -msgid "**Driving side** parameter is positional unnamed and compulsory." +msgid "Examples for One to Many for cost functions" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Examples for Many to One for cost functions" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "Examples for Many to Many for cost functions" msgstr "" -msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_TSP" -msgstr "pgr_TSP" +#, fuzzy +msgid "Examples for Combinations for cost functions" +msgstr ":doc:`pgr_withPoints`" -msgid "Results change depending on input order" +msgid "Migrating `this v3.8 `__ example." msgstr "" #, fuzzy -msgid "Only for undirected graphs" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "Migration of multiple paths functions" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "" -msgid "pgr_TSPeuclidean" -msgstr "pgr_TSPeuclidean" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" -msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgid "v < 3.6" msgstr "" -msgid "pgr_turnRestrictedPath" -msgstr "pgr_turnRestrictedPath" +msgid ":ref:`from_ksp_result`" +msgstr ":ref:`from_ksp_result`" -msgid "Output columns standardized to |nksp-result|" -msgstr "" +msgid "``pgr_edgeDisjointPaths``" +msgstr "``pgr_edgeDisjointPaths``" -msgid "pgr_withPoints" -msgstr "pgr_withPoints" +msgid ":ref:`from_result_disjoint`" +msgstr ":ref:`from_result_disjoint`" -msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration of |ksp-result|" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "|nksp-result|" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Before updating pgRouting, enumerate the |ksp-result|" msgstr "" -msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" +msgid "Using `this `__ example." msgstr "" -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" - -msgid "**Driving side** parameter is unnamed and compulsory." -msgstr "" +#, fuzzy +msgid "Migration of |result-disjoint|" +msgstr ":doc:`pgr_withPoints`" -msgid "Output columns standardized to |matrix-result|" +msgid "Before updating pgRouting, enumerate the |result-disjoint|" msgstr "" -msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +msgid "Skip when applicable, ``start_vid``" msgstr "" -msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgid "Skip when applicable, ``end_vid``" msgstr "" -msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -msgstr "" +#, fuzzy +msgid "One to One example using ``pgr_edgeDisjointPaths``" +msgstr ":doc:`pgr_edgeDisjointPaths`" -msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "pgr_withpointscost(text,text,text,boolean,character)" +msgid "Before updating pgRouting enumerate the columns: |ksp-result|" msgstr "" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" +#, fuzzy +msgid "Migration of single path functions" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - -msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "" +msgid "``pgr_dijkstra``" +msgstr "``pgr_dijkstra``" -msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "v < 3.5" msgstr "" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" - -msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "|old-generic-result|" msgstr "" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" +msgid "``pgr_aStar``" +msgstr "``pgr_aStar``" -msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "" +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" -msgid "Functions promoted to official" -msgstr "" +msgid "``pgr_bellmanFord``" +msgstr "``pgr_bellmanFord``" -msgid "`#2701 `__: pgr_trsp" -msgstr "" +msgid "``pgr_dagShortestPath``" +msgstr "``pgr_dagShortestPath``" -msgid "`#2701 `__: pgr_trspVia" -msgstr "" +#, fuzzy +msgid "|result-1-1|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2701 `__: pgr_trspVia_withPoints" -msgstr "" +msgid "``pgr_edwardMoore``" +msgstr "``pgr_edwardMoore``" -msgid "`#2701 `__: pgr_trsp_withPoints" -msgstr "" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" -msgid "`#2700 `__: pgr_withPoints" +msgid "|old-pid-result|" msgstr "" -msgid "`#2700 `__: pgr_withPointsCost" -msgstr "" +#, fuzzy +msgid "Migration of |old-generic-result|" +msgstr ":doc:`pgr_createVerticesTable`" -msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" -msgid "`#2700 `__: pgr_withPointsDD" +msgid "Migration of |old-pid-result|" msgstr "" -msgid "`#2700 `__: pgr_withPointsKSP" +msgid "To get the old version column names, depending on the signature:" msgstr "" -msgid "`#2700 `__: pgr_withPointsVia" +msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" msgstr "" -msgid "`#2983 `__: pgr_dijkstraNear" -msgstr "" +#, fuzzy +msgid "Rename the columns:" +msgstr "결과 컬럼" -msgid "`#2983 `__: pgr_dijkstraNearCost" +msgid "``start_vid`` to ``start_pid``" msgstr "" -msgid "`#2983 `__: pgr_dijkstraVia" +msgid "``end_vid`` to ``end_pid``" msgstr "" -msgid "Signatures promoted to official" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" -msgid "`#2718 `__: pgr_aStar(Combinations)" -msgstr "" +#, fuzzy +msgid "Migration of |result-1-1|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgid "To get the old version column names:" msgstr "" -msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgid "Filter out the columns: ``start_vid`` and ``end_vid``" msgstr "" -msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgid "Examples with One to One with one route result" msgstr "" -msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" -msgstr "" +#, fuzzy +msgid "Using ``pgr_aStar``" +msgstr ":doc:`pgr_aStarCost`" -msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgid "Before updating pgRouting enumerate the columns: |result-1-1|" msgstr "" -msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" -msgstr "" +#, fuzzy +msgid "Using ``pgr_bdDijkstra``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2718 `__: pgr_KSP(All signatures)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" -msgstr "" +#, fuzzy +msgid "Using ``pgr_DAGshortestPath``" +msgstr ":doc:`pgr_bdAstarCost`" -msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2718 `__: pgr_maxFlow(Combinations)" +msgid "This applies to all signatures of ``pgr_DAGshortestPath``" msgstr "" -msgid "`#2718 `__: pgr_pushRelabel(Combinations)" +msgid "Examples for One to Many with one route result" msgstr "" #, fuzzy -msgid "New experimental functions." -msgstr ":doc:`routingFunctions`" - -msgid "Metrics" -msgstr "" +msgid "Using ``pgr_bdAstar``" +msgstr ":doc:`pgr_bdAstarCost`" -msgid "`#2951 `__: pgr_bandwidth" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "Ordering" +msgid "Before updating pgRouting enumerate the columns: |result-1-m|" msgstr "" -msgid "`#2954 `__: pgr_kingOrdering" -msgstr "" +#, fuzzy +msgid "Using ``pgr_withPoints``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2955 `__: pgr_sloanOrdering" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "SQL signatures and output standardization" +msgid "|pid-1-m|" msgstr "" -msgid "`#2904 `__: Standardize output columns of functions with different output" +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." msgstr "" -msgid "columns within overloads" +msgid "Examples for Many to One with one route result" msgstr "" -#, fuzzy -msgid "Standardized to |short-generic-result|" -msgstr ":doc:`pgr_createVerticesTable`" - -msgid "`#2905 `__: pgr_withPoints" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "`#2906 `__: pgr_bdDijkstra" +msgid "Before updating pgRouting enumerate the columns: |result-m-1|" msgstr "" -msgid "`#2907 `__: pgr_bellmanFord" -msgstr "" +#, fuzzy +msgid "Using ``pgr_dijkstra``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgid "Migrating `this v3.4 `__ example." msgstr "" -msgid "`#2910 `__: pgr_edwardMoore" +msgid "Examples for Many to Many with one route result" msgstr "" -msgid "`#2913 `__: pgr_dagShortestPath" +msgid "Migrating `this v3.8 `__ example." msgstr "" -msgid "Standardized to |matrix-result|" +msgid "|pid-m-m|" msgstr "" -msgid "`#2905 `__: pgr_withPointsCost" +msgid "Examples for combinations with one route result" msgstr "" -msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgid "Migrating `this v3.8 `this `__ example." msgstr "" #, fuzzy -msgid "Standardized to |generic-result|" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "Migration of spanning tree functions" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" -msgid "`#2909 `__: pgr_turnRestrictedPath" -msgstr "" +msgid "``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" -msgid "Standardized to |result_edge_color|" -msgstr "" +msgid ":ref:`from_result_dij_dd`" +msgstr ":ref:`from_result_dij_dd`" -msgid "`#2924 `__: pgr_edgeColoring" -msgstr "" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" -msgid "Standardized to |result_node_color|" -msgstr "" +msgid ":ref:`from_result_generic_no_seq`" +msgstr ":ref:`from_result_generic_no_seq`" -msgid "`#2924 `__: pgr_bipartite" -msgstr "" +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" -msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgid "v < 3.7" msgstr "" -msgid "Standardized to |result-spantree|" -msgstr "" +msgid ":ref:`from_result_bfs`" +msgstr ":ref:`from_result_bfs`" -msgid "`#2931 `__: pgr_breadthFirstSearch" -msgstr "" +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" -msgid "`#2931 `__: pgr_depthFirstSearch" -msgstr "" +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" -#, fuzzy -msgid "Standardized to |result_node_order|" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" -msgid "`#2934 `__: pgr_topologicalSort" -msgstr "" +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" -#, fuzzy -msgid "Standardized to |result-closure|" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" -msgid "`#2934 `__: pgr_transitiveClosure" -msgstr "" +msgid "``pgr_breadthFisrtSearch``" +msgstr "``pgr_breadthFisrtSearch``" -msgid "Removal of SQL deprecated signatures" +msgid "v < 4.0.0" msgstr "" -msgid "`#2798 `__: pgr_contraction" -msgstr "" +msgid "``pgr_depthFisrtSearch``" +msgstr "``pgr_depthFisrtSearch``" -msgid "`#2683 `__: pgr_trsp" +msgid "to |result-spantree|" msgstr "" -msgid "`#2683 `__: pgr_trspVia" -msgstr "" +#, fuzzy +msgid "Migration from |result-bfs|." +msgstr ":doc:`pgr_withPoints`" -msgid "`#2888 `__: pgr_findCloseEdges" +msgid "Single vertex" msgstr "" -msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "Multiple vertices" msgstr "" -msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|" msgstr "" -msgid "`#2890 `__: pgr_withPointsDD" -msgstr "" +#, fuzzy +msgid "Single vertex example using ``pgr_kruskalDD``" +msgstr ":doc:`pgr_kruskalDD`" -msgid "`#2895 `__: pgr_withPointsKSP" +msgid "Migrating `this v3.6 `__ example." msgstr "" -msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|." msgstr "" -msgid "`#2901 `__: pgr_TSP" -msgstr "" +#, fuzzy +msgid "Multiple vertices example using ``pgr_kruskalDFS``" +msgstr ":doc:`pgr_kruskalDFS`" -msgid "`#2901 `__: pgr_TSPeuclidean" +msgid "Migrating `this v3.6 `__ example." msgstr "" -msgid "Removal of SQL deprecated functions" -msgstr "" +#, fuzzy +msgid "Migration from |result-dij-dd|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2681 `__: pgr_trspViaedges" +msgid "Migration depends on the signature." msgstr "" -msgid "`#2682 `__: pgr_trspViaVertices" +msgid "For single vertex:" msgstr "" -msgid "`#2748 `__: pgr_alphaShape" +msgid "Before updating pgRouting, enumerate |result-1-1| columns" msgstr "" -msgid "`#2751 `__: pgr_createTopology" -msgstr "" +#, fuzzy +msgid "For multiple vertices:" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "`#2752 `__: pgr_analyzeGraph" +msgid "Changes must be done after updating pgRouting." msgstr "" -msgid "`#2755 `__: pgr_analyzeOneWay" +msgid "To get the old version column names |result-dij-dd-m|:" msgstr "" -msgid "`#2827 `__: pgr_createVerticesTable" +msgid "filter out the column ``pred`` and ``depth`` and" msgstr "" -msgid "`#2886 `__: pgr_nodeNetwork" +msgid "rename ``start_vid`` to ``from_v``." msgstr "" #, fuzzy -msgid "Removal of SQL deprecated internal functions" -msgstr ":doc:`routingFunctions`" +msgid "Single vertex example using ``pgr_drivingDistance``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "Multiple vertices example using ``pgr_drivingDistance``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgstr "" +#, fuzzy +msgid "Migration of |result-generic-no-seq|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "After updating pgRouting:" msgstr "" -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "Enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "Enumerate |result-m-1-no-seq| columns" msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "Default value of **driving side** parameter" msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" msgstr "" -msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "Default value = 'r';" msgstr "" -msgid "`#2861 `__ _pgr_endPoint(geometry)" +msgid "In undirected graph: valid values are [``b``, ``B``]" msgstr "" -msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgid "Default value = 'b';" msgstr "" -msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "Single vertex example using ``pgr_withPointsDD``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "Multiple vertices example using ``pgr_withPointsDD``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "Migration of output column name change" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" -msgstr "" +#, fuzzy +msgid "The standardized result columns:" +msgstr "결과 컬럼" -msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgid "|result_edge_color|" msgstr "" -msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "|result_node_color|" msgstr "" -msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -msgstr "" +#, fuzzy +msgid "|result_node_order|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgid "Changes on column names must be done after updating pgRouting." msgstr "" -msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" -msgstr "" +msgid "``pgr_edgeColoring``" +msgstr "``pgr_edgeColoring``" -msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgstr "" +msgid ":ref:`from_old_edge_color`" +msgstr ":ref:`from_old_edge_color`" -msgid "`#2861 `__ _pgr_msg(integer,text,text)" -msgstr "" +msgid "``pgr_bipartite``" +msgstr "``pgr_bipartite``" -msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" -msgstr "" +msgid ":ref:`from_old_node_color`" +msgstr ":ref:`from_old_node_color`" -msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" -msgstr "" +msgid "``pgr_sequentialVertexColoring``" +msgstr "``pgr_sequentialVertexColoring``" -msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" -msgstr "" +msgid "``pgr_topologicalSort``" +msgstr "``pgr_topologicalSort``" -msgid "`#2861 `__ _pgr_quote_ident(text)" -msgstr "" +msgid ":ref:`from_toposort`" +msgstr ":ref:`from_toposort`" -msgid "`#2861 `__ _pgr_startPoint(geometry)" -msgstr "" +msgid "``pgr_transitiveClosure``" +msgstr "``pgr_transitiveClosure``" -msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "" +msgid ":ref:`from_old_closure`" +msgstr ":ref:`from_old_closure`" -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "" +#, fuzzy +msgid "Migration from |result-old-closure|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "" +#, fuzzy +msgid "Migration to: |result-old-closure|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "After update:" msgstr "" -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "" +#, fuzzy +msgid "Remove column ``seq``" +msgstr "결과 컬럼" -msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" msgstr "" -msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration from |result-toposort|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration to: |result_node_order|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "Rename ``sorted_v`` to ``node``" msgstr "" -msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "" +#, fuzzy +msgid "Migration from |old-edge-color|" +msgstr ":doc:`pgr_createVerticesTable`" -msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "" +#, fuzzy +msgid "Migration to: |result_edge_color|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2861 `__ _pgr_versionLess(text,text)" +msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." msgstr "" -msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "" +#, fuzzy +msgid "Migration from |old-node-color|" +msgstr ":doc:`pgr_createVerticesTable`" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" -msgstr "" +#, fuzzy +msgid "Migration to: |result_node_color|" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." msgstr "" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgstr "" +#, fuzzy +msgid "Migration of deleted functions" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "Functions no longer on pgRouting" msgstr "" -msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "" +#, fuzzy +msgid "Migration of ``pgr_alphaShape``" +msgstr ":doc:`pgr_withPoints`" -msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgid "Deprecated" msgstr "" -msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgid "`v3.8.0 `__" msgstr "" -msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgid "Removed" msgstr "" -msgid "Summary of functions and signatures no longer on pgrouting" +msgid "`v4.0.0 `__" msgstr "" -msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgid "**Before Deprecation:** The following was calculated:" msgstr "" -msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "An alphaShape was calculated" msgstr "" -msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "**After Deprecation:**" msgstr "" -msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "PostGIS has two ways of generating alphaShape." msgstr "" -msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "If you have SFCGAL, which you can install using" msgstr "" -msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" -msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" msgstr "" -msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "Other PostGIS options are" msgstr "" -msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgid "`ST_ConvexHull `__" msgstr "" -msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "`ST_ConcaveHull `__" msgstr "" -msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +#, fuzzy +msgid "Migration of ``pgr_nodeNetwork``" +msgstr ":doc:`pgr_analyzeGraph`" + +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" -msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +#, fuzzy +msgid "**Migration**" +msgstr ":doc:`migration`" + +msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" msgstr "" -msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +#, fuzzy +msgid "Migration of ``pgr_createTopology``" +msgstr ":doc:`pgr_createVerticesTable`" + +msgid "A table with `_vertices_pgr` was created." msgstr "" -msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "**After Deprecation:** The user is responsible to create the complete topology." msgstr "" -msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Build a routing topology" msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." msgstr "" -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" msgstr "" -msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." msgstr "" -msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." msgstr "" -msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +#, fuzzy +msgid "Migration of ``pgr_createVerticesTable``" +msgstr ":doc:`pgr_createVerticesTable`" + +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +#, fuzzy +msgid "Migration of ``pgr_analyzeOneWay``" +msgstr ":doc:`pgr_analyzeGraph`" + +msgid "Number of potential problems in directionality" msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "WHERE" msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "Directionality problems were calculated based on codes." msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "Dead ends." msgstr "" -msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" msgstr "" -msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." msgstr "" -msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "In this example :doc:`pgr_extractVertices` has already been applied." msgstr "" -msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "Bridges." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "To determine if the bridges are or not one way." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +#, fuzzy +msgid "Migration of ``pgr_analyzeGraph``" +msgstr ":doc:`pgr_analyzeGraph`" + +msgid "Number of isolated segments." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "Number of dead ends." msgstr "" -msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "Number of potential gaps found near dead ends." msgstr "" -msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "Number of intersections. (between 2 edges)" msgstr "" -msgid "Code enhancements" +msgid "Graph component" msgstr "" -msgid "Removal of unused C/C++ code" +msgid "A connected subgraph that is not part of any larger connected subgraph." msgstr "" -msgid "Refactor the Script to build the update PostgreSQL file." +msgid "Isolated segment" msgstr "" -msgid "One process & driver for:" +msgid "A graph component with only one segment." msgstr "" -msgid "allpairs: johnson and Floyd-Warshall" +msgid "Dead ends" msgstr "" -msgid "Shortest path: Dijkstra and withPoints using Dijkstra" +msgid "A vertex that participates in only one edge." msgstr "" -msgid "Deprecation of internal C/C++ functions" +msgid "gaps" msgstr "" -msgid "Deprecated functions are substituted by new function." +msgid "Space between two geometries." msgstr "" #, fuzzy -msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" -msgstr ":doc:`pgr_drivingDistance`" +msgid "Intersection" +msgstr "소개" + +msgid "Is a topological relationship between two geometries." +msgstr "" #, fuzzy -msgid "_pgr_withPointsDD => _pgr_withPointsddv4" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid "Migration." +msgstr ":doc:`migration`" -msgid "_pgr_kruskal => _pgr_kruskalv4" +msgid "Components." msgstr "" -msgid "_pgr_prim => _pgr_primv4" +msgid "Instead of counting only isolated segments, determine all the components of the graph." msgstr "" -msgid "_pgr_dijkstra => _pgr_dijkstra_v4" +msgid "Depending of the final application requirements use:" msgstr "" #, fuzzy -msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" -msgstr ":doc:`pgr_withPoints`" - -#, fuzzy -msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid ":doc:`pgr_connectedComponents`" +msgstr ":doc:`pgr_contraction`" #, fuzzy -msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid ":doc:`pgr_strongComponents`" +msgstr ":doc:`pgr_stoerWagner`" #, fuzzy -msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid ":doc:`pgr_biconnectedComponents`" +msgstr ":doc:`pgr_contraction`" -msgid "Internal C/C++ functions in legacy" +msgid "For example:" msgstr "" -msgid "`#2683 `__ _trsp" +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." msgstr "" -msgid "`#2683 `__ _v4trsp" +msgid "Potential gaps near dead ends." msgstr "" -msgid "`#2748 `__ _pgr_alphaShape" +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" -msgid "`#2913 `__ _pgr_dagShortestPath" +msgid "Topological relationships." msgstr "" -msgid "All releases" +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -msgid "Kruskal - Family of functions" +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgstr "" -msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "" -msgid "**The main Characteristics are:**" +msgid "Signature:" msgstr "" -msgid "The total weight of all the edges in the tree or forest is minimized." +msgid "`v3.4.0 `__" msgstr "" -msgid "Kruskal's running time: :math:`O(E * log E)`" -msgstr "" +msgid ":doc:`pgr_trsp`" +msgstr ":doc:`pgr_trsp`" #, fuzzy -msgid "Metrics - Family of functions" +msgid "`Migration of restrictions`_" msgstr ":doc:`pgr_withPoints`" -msgid "Migration guide" +msgid "Use ``pgr_dijkstra`` when there are no restrictions." msgstr "" -msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." +msgid "Use :doc:`pgr_dijkstra` instead." msgstr "" -msgid "Results can be different because of the changes." +msgid "To get the original column names:" msgstr "" -msgid "All deprecated functions will be removed on next major version 4.0.0" +msgid "``id1`` is the node" msgstr "" -#, fuzzy -msgid "Migration to standardized columns" -msgstr ":doc:`pgr_withPoints`" - -msgid "There has been an effort to standardize function output columns names and types." +msgid "``id2`` is the edge" msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" - -msgid "|matrix-result|" +msgid "Use ``pgr_trsp`` when there are restrictions." msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" - -msgid "|short-generic-result|" +msgid "Use :doc:`pgr_trsp` (One to One) instead." msgstr "" -msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" - -msgid "|result-spantree|" +msgid "Migration of ``pgr_trsp`` (Edges)" msgstr "" #, fuzzy -msgid "Function" -msgstr "소개" - -#, fuzzy -msgid ":doc:`pgr_dijkstra`" -msgstr ":doc:`pgr_dijkstraVia`" - -#, fuzzy -msgid "`Migration of single path functions`_" -msgstr ":doc:`pgr_withPoints`" - -#, fuzzy -msgid ":doc:`pgr_aStar`" -msgstr ":doc:`pgr_aStarCost`" - -#, fuzzy -msgid ":doc:`pgr_bdAstar`" -msgstr ":doc:`pgr_bdAstarCost`" - -msgid ":doc:`pgr_drivingDistance`" -msgstr ":doc:`pgr_drivingDistance`" - -#, fuzzy -msgid "`Migration of spanning tree functions`_" -msgstr ":doc:`pgr_withPoints`" - -#, fuzzy -msgid ":doc:`pgr_withPointsDD`" -msgstr ":doc:`pgr_withPoints`" - -#, fuzzy -msgid ":doc:`pgr_bdDijkstra`" -msgstr ":doc:`pgr_dijkstraVia`" - -#, fuzzy -msgid ":doc:`pgr_binaryBreadthFirstSearch`" -msgstr ":doc:`pgr_dijkstraNear`" - -#, fuzzy -msgid ":doc:`pgr_bipartite`" -msgstr ":doc:`pgr_prim`" - -#, fuzzy -msgid "`Migration of output column name change`_" -msgstr ":doc:`pgr_withPoints`" - -#, fuzzy -msgid ":doc:`pgr_breadthFirstSearch`" -msgstr ":doc:`pgr_dijkstraNear`" - -#, fuzzy -msgid ":doc:`pgr_depthFirstSearch`" -msgstr ":doc:`pgr_dijkstraNear`" - -#, fuzzy -msgid ":doc:`pgr_edgeColoring`" -msgstr ":doc:`pgr_version`" +msgid ":doc:`pgr_trsp_withPoints`" +msgstr ":doc:`pgr_trspVia_withPoints`" -#, fuzzy -msgid "`Migration of multiple paths functions`_" -msgstr ":doc:`pgr_withPoints`" +msgid "Migration of ``pgr_trspViaVertices``" +msgstr "" -#, fuzzy -msgid ":doc:`pgr_sequentialVertexColoring`" -msgstr ":doc:`pgr_extractVertices`" +msgid ":doc:`pgr_dijkstraVia`" +msgstr ":doc:`pgr_dijkstraVia`" -#, fuzzy -msgid ":doc:`pgr_topologicalSort`" +msgid ":doc:`pgr_trspVia`" msgstr ":doc:`pgr_trspVia`" -msgid ":doc:`pgr_withPoints`" -msgstr ":doc:`pgr_withPoints`" +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgstr "" -#, fuzzy -msgid "`Migration of cost functions`_" -msgstr ":doc:`pgr_withPoints`" +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "" -#, fuzzy -msgid "Migration of cost functions" -msgstr ":doc:`pgr_withPoints`" +msgid "``id1`` is the path identifier" +msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgid "``id2`` is the node" msgstr "" -msgid "The following functions need to be migrated when they are being used in an application." +msgid "``id3`` is the edge" msgstr "" -#, fuzzy -msgid "Version" -msgstr "짧은 버전" +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr "" -msgid "From" +msgid "Use :doc:`pgr_trspVia` instead." msgstr "" -msgid "``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "" -msgid "v < 4.0" +msgid ":doc:`pgr_withPointsVia`" +msgstr ":doc:`pgr_withPointsVia`" + +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr ":doc:`pgr_trspVia_withPoints`" + +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" msgstr "" -msgid "|matrix-pid|" +msgid "Use :doc:`pgr_withPointsVia` instead." msgstr "" -msgid "``pgr_withPointsCostMatrix``" -msgstr "``pgr_withPointsCostMatrix``" +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr "" -msgid "**to** |matrix-result|" +msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgstr "" + +msgid "Not yet classified migrations" msgstr "" #, fuzzy -msgid "Migration of |matrix-pid|" +msgid "Migration of ``pgr_withPointsKSP``" msgstr ":doc:`pgr_withPoints`" -msgid "Signatures to be migrated:" +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." msgstr "" -msgid "One to One" +msgid "|ksp-result|" msgstr "" -msgid "One to Many" +msgid "|generic-result|" msgstr "" -msgid "Many to One" +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." msgstr "" -msgid "Many to Many" +msgid "``pgr_withPointsKSP`` (`One to One`)" msgstr "" -msgid "Combinations" +msgid "Before Migration" msgstr "" -msgid "Breaking change" +msgid "Output columns were |old-pid-result|" msgstr "" -msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgid "the columns ``start_vid`` and ``end_vid`` do not exist." msgstr "" -msgid "New output columns are |matrix-result|" +msgid "Migration" msgstr "" -msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgid "Be aware of the existence of the additional result Columns." msgstr "" -msgid "Examples" +msgid "New output columns are |generic-result|" msgstr "" -msgid "Examples for One to One for cost functions" +msgid "Using `this `__ example." msgstr "" -#, fuzzy -msgid "Using ``pgr_withPointsCost``" -msgstr ":doc:`pgr_withPointsCost`" +msgid "``start_vid`` contains the **start vid** parameter value." +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "``end_vid`` contains the **end vid** parameter value." msgstr "" -msgid "from" +msgid "If needed filter out the additional columns, for example, to return the original columns:" msgstr "" -msgid "to" +msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "" -msgid "Examples for One to Many for cost functions" +#, fuzzy +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Use :doc:`pgr_trsp_withPoints` instead." msgstr "" -msgid "Examples for Many to One for cost functions" +msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." msgstr "" -msgid "Examples for Many to Many for cost functions" +msgid "Starting from `v3.4.0 `__" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Signature to be migrated:" msgstr "" -#, fuzzy -msgid "Examples for Combinations for cost functions" -msgstr ":doc:`pgr_withPoints`" +msgid "Migration is needed, because:" +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Use ``cost`` and ``reverse_cost`` on the inner query" msgstr "" -#, fuzzy -msgid "Migration of multiple paths functions" -msgstr ":doc:`pgr_withPoints`" +msgid "Results are ordered" +msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" +msgid "Works for undirected graphs." msgstr "" -msgid "``pgr_KSP``" -msgstr "``pgr_KSP``" +msgid "New signature" +msgstr "" -msgid "v < 3.6" +msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." msgstr "" -msgid ":ref:`from_ksp_result`" -msgstr ":ref:`from_ksp_result`" +msgid "The optional flag ``directed`` is removed." +msgstr "" -msgid "``pgr_edgeDisjointPaths``" -msgstr "``pgr_edgeDisjointPaths``" +msgid "Before migration" +msgstr "" -msgid ":ref:`from_result_disjoint`" -msgstr ":ref:`from_result_disjoint`" +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgstr "" -#, fuzzy -msgid "Migration of |ksp-result|" -msgstr ":doc:`pgr_withPoints`" +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgstr "" -#, fuzzy -msgid "|nksp-result|" -msgstr ":doc:`pgr_withPoints`" +msgid "The flag ``directed`` is ignored." +msgstr "" -msgid "Before updating pgRouting, enumerate the |ksp-result|" +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." msgstr "" -msgid "One to One example using ``pgr_KSP``" +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." msgstr "" -msgid "Using `this `__ example." +msgid "Do not use the flag ``directed``." msgstr "" -#, fuzzy -msgid "Migration of |result-disjoint|" -msgstr ":doc:`pgr_withPoints`" +msgid "In the query returns only ``edge`` column." +msgstr "" -msgid "Before updating pgRouting, enumerate the |result-disjoint|" +msgid "Migration of restrictions" msgstr "" -msgid "Skip when applicable, ``start_vid``" +msgid "The structure of the restrictions have changed:" msgstr "" -msgid "Skip when applicable, ``end_vid``" +msgid "Old restrictions structure" msgstr "" -#, fuzzy -msgid "One to One example using ``pgr_edgeDisjointPaths``" -msgstr ":doc:`pgr_edgeDisjointPaths`" +msgid "On the deprecated signatures:" +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Column ``rid`` is ignored" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |ksp-result|" +msgid "``via_path``" +msgstr "``via_path``" + +msgid "Must be in reverse order." msgstr "" -#, fuzzy -msgid "Migration of single path functions" -msgstr ":doc:`pgr_withPoints`" +msgid "Is of type ``TEXT``." +msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" +msgid "When more than one via edge must be separated with ``,``." msgstr "" -msgid "``pgr_dijkstra``" -msgstr "``pgr_dijkstra``" +msgid "``target_id``" +msgstr "``target_id``" -msgid "v < 3.5" +msgid "Is the last edge of the forbidden path." msgstr "" -msgid "|old-generic-result|" +msgid "Is of type ``INTEGER``." msgstr "" -msgid "``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "``to_cost``" +msgstr "``to_cost``" -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "Is of type ``FLOAT``." +msgstr "" -msgid "``pgr_bellmanFord``" -msgstr "``pgr_bellmanFord``" +msgid "Creation of the old restrictions table" +msgstr "" -msgid "``pgr_dagShortestPath``" -msgstr "``pgr_dagShortestPath``" +msgid "Old restrictions fill up" +msgstr "" -#, fuzzy -msgid "|result-1-1|" -msgstr ":doc:`pgr_withPoints`" +msgid "Old restrictions contents" +msgstr "" -msgid "``pgr_edwardMoore``" -msgstr "``pgr_edwardMoore``" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgstr "" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +msgid ":math:`3\\rightarrow5`" +msgstr "" -msgid "|old-pid-result|" +msgid "is on column ``via_path`` in reverse order" msgstr "" -#, fuzzy -msgid "Migration of |old-generic-result|" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "is of type ``TEXT``" +msgstr "" -msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" +msgid ":math:`9`" msgstr "" -msgid "Migration of |old-pid-result|" +msgid "is on column ``target_id``" msgstr "" -msgid "To get the old version column names, depending on the signature:" +msgid "is of type ``INTEGER``" msgstr "" -msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" +msgid "New restrictions structure" msgstr "" -#, fuzzy -msgid "Rename the columns:" -msgstr "결과 컬럼" +msgid "Column ``id`` is ignored" +msgstr "" -msgid "``start_vid`` to ``start_pid``" +msgid "Column ``path``" msgstr "" -msgid "``end_vid`` to ``end_pid``" +msgid "Is of type ``ARRAY[ANY-INTEGER]``." msgstr "" -msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" +msgid "Contains all the edges involved on the restriction." msgstr "" -#, fuzzy -msgid "Migration of |result-1-1|" -msgstr ":doc:`pgr_withPoints`" +msgid "The array has the ordered edges of the restriction." +msgstr "" -msgid "To get the old version column names:" +msgid "Column ``cost``" +msgstr "" + +msgid "Is of type ``ANY-NUMERICAL``" msgstr "" -msgid "Filter out the columns: ``start_vid`` and ``end_vid``" +msgid "The creation of the restrictions table" msgstr "" -msgid "Examples with One to One with one route result" +msgid "Adding the restrictions" msgstr "" -#, fuzzy -msgid "Using ``pgr_aStar``" -msgstr ":doc:`pgr_aStarCost`" +msgid "Restrictions data" +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-1-1|" +msgid "By inspection the path is clear." msgstr "" -#, fuzzy -msgid "Using ``pgr_bdDijkstra``" -msgstr ":doc:`pgr_withPoints`" +msgid "To transform the old restrictions table to the new restrictions structure," +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Create a new table with the new restrictions structure." msgstr "" -#, fuzzy -msgid "Using ``pgr_DAGshortestPath``" -msgstr ":doc:`pgr_bdAstarCost`" +msgid "In this migration guide ``new_restrictions`` is been used." +msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." msgstr "" -msgid "This applies to all signatures of ``pgr_DAGshortestPath``" +msgid "``_pgr_array_reverse``:" msgstr "" -msgid "Examples for One to Many with one route result" +msgid "Was created temporally for this migration" msgstr "" -#, fuzzy -msgid "Using ``pgr_bdAstar``" -msgstr ":doc:`pgr_bdAstarCost`" +msgid "Is not documented." +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Will be removed on the next mayor version 4.0.0" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-1-m|" +msgid "The migrated table contents:" msgstr "" #, fuzzy -msgid "Using ``pgr_withPoints``" -msgstr ":doc:`pgr_withPoints`" +msgid ":doc:`pgRouting-concepts`" +msgstr ":doc:`routingFunctions`" -msgid "Migrating `this v3.8 `__ example." +msgid "Ordering - Family of functions" msgstr "" -msgid "|pid-1-m|" +msgid "pgRouting Concepts" msgstr "" -msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" msgstr "" -msgid "Examples for Many to One with one route result" +msgid "Graphs" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-m-1|" +msgid ":math:`V` is a set of vertices, also called nodes." msgstr "" -#, fuzzy -msgid "Using ``pgr_dijkstra``" -msgstr ":doc:`pgr_withPoints`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgstr "" -msgid "Migrating `this v3.4 `__ example." +msgid "There are different kinds of graphs:" msgstr "" -msgid "Examples for Many to Many with one route result" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" msgstr "" -msgid "Migrating `this v3.8 `__ example." +msgid "Undirected simple graph" msgstr "" -msgid "|pid-m-m|" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" msgstr "" -msgid "Examples for combinations with one route result" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" msgstr "" -msgid "Migrating `this v3.8 `this `__ example." +msgid "Directed simple graph" msgstr "" -#, fuzzy -msgid "Migration of spanning tree functions" -msgstr ":doc:`pgr_withPoints`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr "" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" +msgid "Graphs:" msgstr "" -msgid "``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" +msgid "Do not have geometries." +msgstr "" -msgid ":ref:`from_result_dij_dd`" -msgstr ":ref:`from_result_dij_dd`" +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgstr "" -msgid "``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "In pgRouting there are several ways to represent a graph on the database:" +msgstr "" -msgid ":ref:`from_result_generic_no_seq`" -msgstr ":ref:`from_result_generic_no_seq`" +msgid "With ``cost``" +msgstr "" -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "(``id``, ``source``, ``target``, ``cost``)" +msgstr "" -msgid "v < 3.7" +msgid "With ``cost`` and ``reverse_cost``" msgstr "" -msgid ":ref:`from_result_bfs`" -msgstr ":ref:`from_result_bfs`" +msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgstr "" -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgstr "" -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid "Identifier of a vertex." +msgstr "" -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" +msgid "Weight of the edge (``source``, ``target``):" +msgstr "" -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgstr "" -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" +msgid "``cost`` must exist in the query." +msgstr "" -msgid "``pgr_breadthFisrtSearch``" -msgstr "``pgr_breadthFisrtSearch``" +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "" -msgid "v < 4.0.0" +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." msgstr "" -msgid "``pgr_depthFisrtSearch``" -msgstr "``pgr_depthFisrtSearch``" +msgid "Graph with ``cost``" +msgstr "" -msgid "to |result-spantree|" +msgid "The weighted directed graph, :math:`G_d(V,E)`:" msgstr "" -#, fuzzy -msgid "Migration from |result-bfs|." -msgstr ":doc:`pgr_withPoints`" +msgid "Graph data is obtained with a query" +msgstr "" -msgid "Single vertex" +msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" -msgid "Multiple vertices" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|" +msgid "Edges where ``cost`` is non negative are part of the graph." msgstr "" -#, fuzzy -msgid "Single vertex example using ``pgr_kruskalDD``" -msgstr ":doc:`pgr_kruskalDD`" +msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgstr "" -msgid "Migrating `this v3.6 `__ example." +msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|." +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" -#, fuzzy -msgid "Multiple vertices example using ``pgr_kruskalDFS``" -msgstr ":doc:`pgr_kruskalDFS`" +msgid "For the following data:" +msgstr "" -msgid "Migrating `this v3.6 `__ example." +msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." msgstr "" -#, fuzzy -msgid "Migration from |result-dij-dd|" -msgstr ":doc:`pgr_withPoints`" +msgid "The data is representing the following graph:" +msgstr "" -msgid "Migration depends on the signature." +msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "For single vertex:" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" msgstr "" -msgid "Before updating pgRouting, enumerate |result-1-1| columns" +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." msgstr "" -#, fuzzy -msgid "For multiple vertices:" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "Graph with ``cost`` and ``reverse_cost``" +msgstr "" -msgid "Changes must be done after updating pgRouting." +msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" msgstr "" -msgid "To get the old version column names |result-dij-dd-m|:" +msgid "The set of edges :math:`E`:" msgstr "" -msgid "filter out the column ``pred`` and ``depth`` and" +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" msgstr "" -msgid "rename ``start_vid`` to ``from_v``." +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." msgstr "" -#, fuzzy -msgid "Single vertex example using ``pgr_drivingDistance``" -msgstr ":doc:`pgr_withPoints`" +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "The set of vertices :math:`V`:" msgstr "" -msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" +msgid "In a directed graph both edges have directionality" msgstr "" -#, fuzzy -msgid "Multiple vertices example using ``pgr_drivingDistance``" -msgstr ":doc:`pgr_withPoints`" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" msgstr "" -msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid "Edges not part of the graph:" msgstr "" -#, fuzzy -msgid "Migration of |result-generic-no-seq|" -msgstr ":doc:`pgr_withPoints`" +msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgstr "" -msgid "After updating pgRouting:" +msgid ":math:`3` (:math:`3 \\rightarrow 2`)" msgstr "" -msgid "Enumerate |result-1-1-no-seq| columns" +msgid "In a directed graph both edges do not have directionality" msgstr "" -msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "Enumerate |result-m-1-no-seq| columns" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" -msgid "Default value of **driving side** parameter" +msgid "In terms of a directed graph is like having four edges:" msgstr "" -msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." +msgid ":math:`source_i \\leftrightarrow target_i`" msgstr "" -msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" +msgid ":math:`target_i \\leftrightarrow source_i`" msgstr "" -msgid "Default value = 'r';" +msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" msgstr "" -msgid "In undirected graph: valid values are [``b``, ``B``]" +msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" msgstr "" -msgid "Default value = 'b';" +msgid "Graphs without geometries" msgstr "" -#, fuzzy -msgid "Single vertex example using ``pgr_withPointsDD``" -msgstr ":doc:`pgr_withPoints`" +msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Wiki example" msgstr "" -#, fuzzy -msgid "Multiple vertices example using ``pgr_withPointsDD``" -msgstr ":doc:`pgr_withPoints`" +msgid "Solve the example problem taken from `wikipedia `__):" +msgstr "" -msgid "Migrating `this v3.5 `__ example." +msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." msgstr "" -#, fuzzy -msgid "Migration of output column name change" -msgstr ":doc:`pgr_withPoints`" +msgid "Is an undirected graph." +msgstr "" -#, fuzzy -msgid "The standardized result columns:" -msgstr "결과 컬럼" +msgid "Although visually looks like to have geometries, the drawing is not to scale." +msgstr "" -msgid "|result_edge_color|" +msgid "No geometries associated to the vertices or edges" msgstr "" -msgid "|result_node_color|" +msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" msgstr "" -#, fuzzy -msgid "|result_node_order|" -msgstr ":doc:`pgr_withPoints`" +msgid "Has 9 edges:" +msgstr "" -msgid "Changes on column names must be done after updating pgRouting." +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" msgstr "" -msgid "``pgr_edgeColoring``" -msgstr "``pgr_edgeColoring``" +msgid "The graph can be represented in many ways for example:" +msgstr "" -msgid ":ref:`from_old_edge_color`" -msgstr ":ref:`from_old_edge_color`" +msgid "Prepare the database" +msgstr "" -msgid "``pgr_bipartite``" -msgstr "``pgr_bipartite``" +msgid "Create a database for the example, access the database and install pgRouting: ::" +msgstr "" -msgid ":ref:`from_old_node_color`" -msgstr ":ref:`from_old_node_color`" +msgid "Create a table" +msgstr "" -msgid "``pgr_sequentialVertexColoring``" -msgstr "``pgr_sequentialVertexColoring``" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgstr "" -msgid "``pgr_topologicalSort``" -msgstr "``pgr_topologicalSort``" +msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgstr "" -msgid ":ref:`from_toposort`" -msgstr ":ref:`from_toposort`" +msgid "Using this table design for this example:" +msgstr "" -msgid "``pgr_transitiveClosure``" -msgstr "``pgr_transitiveClosure``" +msgid "Insert the data" +msgstr "" -msgid ":ref:`from_old_closure`" -msgstr ":ref:`from_old_closure`" +msgid "Find the shortest path" +msgstr "" -#, fuzzy -msgid "Migration from |result-old-closure|" -msgstr ":doc:`pgr_withPoints`" +msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgstr "" -#, fuzzy -msgid "Migration to: |result-old-closure|" -msgstr ":doc:`pgr_withPoints`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "" -msgid "After update:" +msgid "Vertex information" msgstr "" -#, fuzzy -msgid "Remove column ``seq``" -msgstr "결과 컬럼" +msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" +msgstr "" -msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" +msgid "Graphs with geometries" msgstr "" -#, fuzzy -msgid "Migration from |result-toposort|" -msgstr ":doc:`pgr_withPoints`" +msgid "Create a routing Database" +msgstr "" -#, fuzzy -msgid "Migration to: |result_node_order|" -msgstr ":doc:`pgr_withPoints`" +msgid "The first step is to create a database and load pgRouting in the database." +msgstr "" -msgid "Rename ``sorted_v`` to ``node``" +msgid "Typically create a database for each project." msgstr "" -#, fuzzy -msgid "Migration from |old-edge-color|" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "Once having the database to work in, load your data and build the routing application in that database." +msgstr "" -#, fuzzy -msgid "Migration to: |result_edge_color|" -msgstr ":doc:`pgr_withPoints`" +msgid "Load Data" +msgstr "" -msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." +msgid "There are several ways to load your data into pgRouting." msgstr "" -#, fuzzy -msgid "Migration from |old-node-color|" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "Manually creating a database." +msgstr "" + +msgid "`Graphs without geometries`_" +msgstr "" #, fuzzy -msgid "Migration to: |result_node_color|" -msgstr ":doc:`pgr_withPoints`" +msgid ":doc:`sampledata`: a small graph used in the documentation examples" +msgstr ":doc:`sampledata` 는 이 매뉴얼의 예제로 사용됩니다." -msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." +msgid "Using `osm2pgrouting `__" msgstr "" -#, fuzzy -msgid "Migration of deleted functions" -msgstr ":doc:`pgr_withPoints`" +msgid "There are various open source tools that can help, like:" +msgstr "" -msgid "Functions no longer on pgRouting" +msgid "shp2pgsql" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_alphaShape``" -msgstr ":doc:`pgr_withPoints`" +msgid "postgresql shapefile loader" +msgstr "" -msgid "Deprecated" +msgid "ogr2ogr" msgstr "" -msgid "`v3.8.0 `__" +msgid "vector data conversion utility" msgstr "" -msgid "Removed" +msgid "osm2pgsql" msgstr "" -msgid "`v4.0.0 `__" +msgid "load OSM data into postgresql" msgstr "" -msgid "**Before Deprecation:** The following was calculated:" +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." msgstr "" -msgid "An alphaShape was calculated" +msgid "Breakup a segments on each segment-segment intersection" msgstr "" -msgid "**After Deprecation:**" +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." msgstr "" -msgid "PostGIS has two ways of generating alphaShape." +msgid "Connect a disconnected graph." msgstr "" -msgid "If you have SFCGAL, which you can install using" +msgid "Create the complete graph topology" msgstr "" -msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgid "Create one or more graphs based on the application to be developed." msgstr "" -msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgid "Create a contracted graph for the high speed roads" msgstr "" -msgid "Other PostGIS options are" +msgid "Create graphs per state/country" msgstr "" -msgid "`ST_ConvexHull `__" +msgid "In few words:" msgstr "" -msgid "`ST_ConcaveHull `__" +msgid "Prepare the graph" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_nodeNetwork``" -msgstr ":doc:`pgr_analyzeGraph`" +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgstr "" -msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." +msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." msgstr "" -#, fuzzy -msgid "**Migration**" -msgstr ":doc:`migration`" +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgstr "" -msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" +msgid "The use of indexes on the database design in general:" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_createTopology``" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "Have the geometries indexed." +msgstr "" -msgid "A table with `_vertices_pgr` was created." +msgid "Have the identifiers columns indexed." msgstr "" -msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." msgstr "" -msgid "Build a routing topology" +msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." msgstr "" -msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." +msgid "Adjust costs" msgstr "" -msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." msgstr "" -msgid "When the data comes with geometries and there is no routing topology, then this step is needed." +msgid "Update costs to length of geometry" msgstr "" -msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" msgstr "" -msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgid ":math:`1` when the edge exists in the graph" msgstr "" -msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." +msgid ":math:`-1` when the edge does not exist in the graph" msgstr "" -msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgid "Using that information updating to the length of the geometries:" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_createVerticesTable``" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "Which gives the following results:" +msgstr "" -msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." msgstr "" -#, fuzzy -msgid "Migration of ``pgr_analyzeOneWay``" -msgstr ":doc:`pgr_analyzeGraph`" +msgid "Returning to the original data:" +msgstr "" -msgid "Number of potential problems in directionality" +msgid "Update costs based on codes" msgstr "" -msgid "WHERE" +msgid "Other datasets, can have a column with values like" msgstr "" -msgid "Directionality problems were calculated based on codes." +msgid "``FT`` vehicle flow on the direction of the geometry" msgstr "" -msgid "Dead ends." +msgid "``TF`` vehicle flow opposite of the direction of the geometry" msgstr "" -msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgid "``B`` vehicle flow on both directions" msgstr "" -msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." +msgid "Preparing a code column for the example:" msgstr "" -msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgid "Adjusting the costs based on the codes:" msgstr "" -msgid "Bridges." +msgid "Check the Routing Topology" msgstr "" -msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." +msgid "There are lots of possible problems in a graph." msgstr "" -msgid "To determine if the bridges are or not one way." +msgid "The data used may not have been designed with routing in mind." msgstr "" -#, fuzzy -msgid "Migration of ``pgr_analyzeGraph``" -msgstr ":doc:`pgr_analyzeGraph`" +msgid "A graph has some very specific requirements." +msgstr "" -msgid "Number of isolated segments." +msgid "The graph is disconnected." msgstr "" -msgid "Number of dead ends." +msgid "There are unwanted intersections." msgstr "" -msgid "Number of potential gaps found near dead ends." +msgid "The graph is too large and needs to be contracted." msgstr "" -msgid "Number of intersections. (between 2 edges)" +msgid "A sub graph is needed for the application." msgstr "" -msgid "Graph component" +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." msgstr "" -msgid "A connected subgraph that is not part of any larger connected subgraph." +msgid "Crossing edges" msgstr "" -msgid "Isolated segment" +msgid "To get the crossing edges:" msgstr "" -msgid "A graph component with only one segment." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." msgstr "" -msgid "Dead ends" +msgid "It might be incorrect, for example:" msgstr "" -msgid "A vertex that participates in only one edge." +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "" -msgid "gaps" +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." msgstr "" -msgid "Space between two geometries." +msgid "When it is incorrect, it needs fixing:" msgstr "" -#, fuzzy -msgid "Intersection" -msgstr "소개" +msgid "For vehicles and pedestrians" +msgstr "" -msgid "Is a topological relationship between two geometries." +msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." msgstr "" -#, fuzzy -msgid "Migration." -msgstr ":doc:`migration`" +msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgstr "" -msgid "Components." +msgid "For very specific applications" msgstr "" -msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." msgstr "" -msgid "Depending of the final application requirements use:" +msgid "The data needs a local fix for the specific application." msgstr "" -#, fuzzy -msgid ":doc:`pgr_connectedComponents`" -msgstr ":doc:`pgr_contraction`" +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "" -#, fuzzy -msgid ":doc:`pgr_strongComponents`" -msgstr ":doc:`pgr_stoerWagner`" +msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgstr "" #, fuzzy -msgid ":doc:`pgr_biconnectedComponents`" -msgstr ":doc:`pgr_contraction`" +msgid "Fixing an intersection" +msgstr "소개" -msgid "For example:" +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "" -msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgid "An example use without results" msgstr "" -msgid "Potential gaps near dead ends." +msgid "Routing from :math:`1` to :math:`18` gives no solution." msgstr "" -msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "Analyze the network for intersections." msgstr "" -msgid "Topological relationships." +msgid "The analysis tell us that the network has an intersection." msgstr "" -msgid "Instead of counting intersections, determine topological relationships between geometries." +msgid "Prepare tables" msgstr "" -msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Additional columns to control the origin of the segments." msgstr "" -msgid "Migration of ``pgr_trsp`` (Vertices)" +msgid "Adding new segments." msgstr "" -msgid "Signature:" +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "" -msgid "`v3.4.0 `__" +msgid "Update other values" msgstr "" -msgid ":doc:`pgr_trsp`" -msgstr ":doc:`pgr_trsp`" - -#, fuzzy -msgid "`Migration of restrictions`_" -msgstr ":doc:`pgr_withPoints`" - -msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." msgstr "" -msgid "Use :doc:`pgr_dijkstra` instead." +msgid "Update the topology" msgstr "" -msgid "To get the original column names:" +msgid "Insert the new vertices if any." msgstr "" -msgid "``id1`` is the node" +msgid "Update source and target information on the edges table." msgstr "" -msgid "``id2`` is the edge" +msgid "The example has results" msgstr "" -msgid "Use ``pgr_trsp`` when there are restrictions." +msgid "Routing from :math:`1` to :math:`18` gives a solution." msgstr "" -msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgid "Touching edges" msgstr "" -msgid "Migration of ``pgr_trsp`` (Edges)" +msgid "Visually the edges seem to be connected, but internally they are not." msgstr "" -#, fuzzy -msgid ":doc:`pgr_trsp_withPoints`" -msgstr ":doc:`pgr_trspVia_withPoints`" - -msgid "Migration of ``pgr_trspViaVertices``" +msgid "The validity of the information is application dependent." msgstr "" -msgid ":doc:`pgr_dijkstraVia`" -msgstr ":doc:`pgr_dijkstraVia`" - -msgid ":doc:`pgr_trspVia`" -msgstr ":doc:`pgr_trspVia`" - -msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" -msgid "Use :doc:`pgr_dijkstraVia` instead." +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" -msgid "``id1`` is the path identifier" +msgid "Fixing a gap" msgstr "" -msgid "``id2`` is the node" +msgid "Routing from :math:`1` to :math:`2` gives no solution." msgstr "" -msgid "``id3`` is the edge" +msgid "Analyze the network for gaps." msgstr "" -msgid "Use ``pgr_trspVia`` when there are restrictions" +msgid "The analysis tell us that the network has a gap." msgstr "" -msgid "Use :doc:`pgr_trspVia` instead." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" -msgid "Migration of ``pgr_trspViaEdges``" +msgid "Routing from :math:`1` to :math:`2` gives a solution." msgstr "" -msgid ":doc:`pgr_withPointsVia`" -msgstr ":doc:`pgr_withPointsVia`" - -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid "Connecting components" +msgstr "" -msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgid "To get the graph connectivity:" msgstr "" -msgid "Use :doc:`pgr_withPointsVia` instead." +msgid "There are three basic ways to connect components:" msgstr "" -msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgid "From the vertex to the starting point of the edge" msgstr "" -msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgid "From the vertex to the ending point of the edge" msgstr "" -msgid "Not yet classified migrations" +msgid "From the vertex to the closest vertex on the edge" msgstr "" -#, fuzzy -msgid "Migration of ``pgr_withPointsKSP``" -msgstr ":doc:`pgr_withPoints`" +msgid "This solution requires the edge to be split." +msgstr "" -msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." msgstr "" -msgid "|ksp-result|" +msgid "Get the connectivity" msgstr "" -msgid "|generic-result|" +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "" -msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgid "Insert new edges" msgstr "" -msgid "``pgr_withPointsKSP`` (`One to One`)" +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." msgstr "" -msgid "Before Migration" +msgid "Create the vertices table" msgstr "" -msgid "Output columns were |old-pid-result|" +#, fuzzy +msgid "Using :doc:`pgr_extractVertices` create the table." +msgstr ":doc:`pgr_extractVertices`" + +msgid "Contraction of a graph" msgstr "" -msgid "the columns ``start_vid`` and ``end_vid`` do not exist." +msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "" -msgid "Migration" +msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." msgstr "" -msgid "Be aware of the existence of the additional result Columns." +msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." msgstr "" -msgid "New output columns are |generic-result|" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" msgstr "" -msgid "Using `this `__ example." +msgid "To get the dead ends:" msgstr "" -msgid "``start_vid`` contains the **start vid** parameter value." +msgid "A dead end happens when" msgstr "" -msgid "``end_vid`` contains the **end vid** parameter value." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" -msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgid "The vertex is on the limit of the imported graph." msgstr "" -msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "" -#, fuzzy -msgid "Use :doc:`pgr_withPoints` (One to One) instead." -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgstr "" -msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgid "Is node :math:`4` a dead end or not?" msgstr "" -msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgid "The answer to that question will depend on the application." msgstr "" -msgid "Migration of ``pgr_maxCardinalityMatch``" +msgid "Is there such a small curb:" msgstr "" -msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" -msgid "Starting from `v3.4.0 `__" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" msgstr "" -msgid "Signature to be migrated:" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" msgstr "" -msgid "Migration is needed, because:" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" msgstr "" -msgid "Use ``cost`` and ``reverse_cost`` on the inner query" +msgid "Depending on the answer, modification of the data might be needed." msgstr "" -msgid "Results are ordered" +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." msgstr "" -msgid "Works for undirected graphs." +msgid "Linear edges" msgstr "" -msgid "New signature" +msgid "To get the linear edges:" msgstr "" -msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." msgstr "" -msgid "The optional flag ``directed`` is removed." +msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." msgstr "" -msgid "Before migration" +msgid "Function's structure" msgstr "" -msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgid "Once the graph preparation work has been done above, it is time to use a" msgstr "" -msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgid "The general form of a pgRouting function call is:" msgstr "" -msgid "The flag ``directed`` is ignored." +msgid "\\ \\" msgstr "" -msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" msgstr "" -msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." msgstr "" -msgid "Do not use the flag ``directed``." +msgid "**parameters**: Additional compulsory parameters needed by the function." msgstr "" -msgid "In the query returns only ``edge`` column." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." msgstr "" -msgid "Migration of restrictions" +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." msgstr "" -msgid "The structure of the restrictions have changed:" +msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" -msgid "Old restrictions structure" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "On the deprecated signatures:" +msgid "`Edges SQL`_:" msgstr "" -msgid "Column ``rid`` is ignored" +msgid "Is the first parameter." msgstr "" -msgid "``via_path``" -msgstr "``via_path``" +msgid "It is compulsory." +msgstr "" -msgid "Must be in reverse order." +msgid "It is an inner query." msgstr "" -msgid "Is of type ``TEXT``." +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" msgstr "" -msgid "When more than one via edge must be separated with ``,``." +msgid "**start vid**:" msgstr "" -msgid "``target_id``" -msgstr "``target_id``" +msgid "Is the second parameter." +msgstr "" -msgid "Is the last edge of the forbidden path." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." msgstr "" -msgid "Is of type ``INTEGER``." +msgid "Is the third parameter." msgstr "" -msgid "``to_cost``" -msgstr "``to_cost``" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgstr "" -msgid "Is of type ``FLOAT``." +msgid "Is the fourth parameter." msgstr "" -msgid "Creation of the old restrictions table" +msgid "It is optional." msgstr "" -msgid "Old restrictions fill up" +msgid "It has a name." msgstr "" -msgid "Old restrictions contents" +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." msgstr "" -msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgid "Function's overloads" msgstr "" -msgid ":math:`3\\rightarrow5`" +msgid "A function might have different overloads. The most common are called:" msgstr "" -msgid "is on column ``via_path`` in reverse order" +msgid "`One to One`_" msgstr "" -msgid "is of type ``TEXT``" +msgid "`One to Many`_" msgstr "" -msgid ":math:`9`" +msgid "`Many to One`_" msgstr "" -msgid "is on column ``target_id``" +msgid "`Many to Many`_" msgstr "" -msgid "is of type ``INTEGER``" +msgid "`Combinations`_" msgstr "" -msgid "New restrictions structure" +msgid "Depending on the overload the parameters types change." msgstr "" -msgid "Column ``id`` is ignored" +msgid "**One**: **ANY-INTEGER**" msgstr "" -msgid "Column ``path``" +msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "Is of type ``ARRAY[ANY-INTEGER]``." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." msgstr "" -msgid "Contains all the edges involved on the restriction." +msgid "When routing from:" msgstr "" -msgid "The array has the ordered edges of the restriction." +msgid "From **one** starting vertex" msgstr "" -msgid "Column ``cost``" +msgid "to **one** ending vertex" msgstr "" -msgid "Is of type ``ANY-NUMERICAL``" +msgid "to **many** ending vertices" msgstr "" -msgid "The creation of the restrictions table" +msgid "From **many** starting vertices" msgstr "" -msgid "Adding the restrictions" +msgid "From **many** different starting vertices" msgstr "" -msgid "Restrictions data" +msgid "to **many** different ending vertices" msgstr "" -msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgid "Every tuple specifies a pair of a start vertex and an end vertex" msgstr "" -msgid "By inspection the path is clear." +msgid "Users can define the combinations as desired." msgstr "" -msgid "To transform the old restrictions table to the new restrictions structure," +msgid "Needs a `Combinations SQL`_" msgstr "" -msgid "Create a new table with the new restrictions structure." +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." msgstr "" -msgid "In this migration guide ``new_restrictions`` is been used." +msgid "Edges SQL for" msgstr "" -msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgid "Some uncategorised functions" msgstr "" -msgid "``_pgr_array_reverse``:" +msgid "General without ``id``" msgstr "" -msgid "Was created temporally for this migration" +msgid "General with (X,Y)" msgstr "" -msgid "Is not documented." +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." msgstr "" -msgid "Will be removed on the next mayor version 4.0.0" +msgid "Weight of the edge (``target``, ``source``)," msgstr "" -msgid "The migrated table contents:" +msgid "``x1``" +msgstr "``x1``" + +msgid "X coordinate of ``source`` vertex." msgstr "" -#, fuzzy -msgid ":doc:`pgRouting-concepts`" -msgstr ":doc:`routingFunctions`" +msgid "``y1``" +msgstr "``y1``" -msgid "Ordering - Family of functions" +msgid "Y coordinate of ``source`` vertex." msgstr "" -msgid "pgRouting Concepts" -msgstr "" +msgid "``x2``" +msgstr "``x2``" -msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgid "X coordinate of ``target`` vertex." msgstr "" -msgid "Graphs" -msgstr "" +msgid "``y2``" +msgstr "``y2``" -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" +msgid "Y coordinate of ``target`` vertex." msgstr "" -msgid ":math:`V` is a set of vertices, also called nodes." +msgid "Flow" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgid "Edges SQL for :doc:`flow-family`" msgstr "" -msgid "There are different kinds of graphs:" +msgid "Edges SQL for the following functions of :doc:`flow-family`" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgid "Used in combination signatures" msgstr "" -msgid "Undirected simple graph" +msgid "Points SQL for" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." msgstr "" -msgid "Directed simple graph" +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "Parameters for the Via functions" msgstr "" -msgid "Graphs:" +msgid "SQL query as described." msgstr "" -msgid "Do not have geometries." +msgid "When ``true`` Graph is considered `Directed`" msgstr "" -msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgid "When ``false`` the graph is considered as Undirected." msgstr "" -msgid "In pgRouting there are several ways to represent a graph on the database:" -msgstr "" +msgid "``strict``" +msgstr "``strict``" -msgid "With ``cost``" -msgstr "" +msgid "``false``" +msgstr "``false``" -msgid "(``id``, ``source``, ``target``, ``cost``)" +msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" msgstr "" -msgid "With ``cost`` and ``reverse_cost``" +msgid "When ``false`` ignores missing paths returning all paths found" msgstr "" -msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgstr "" +msgid "``U_turn_on_edge``" +msgstr "``U_turn_on_edge``" -msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." msgstr "" -msgid "Identifier of a vertex." +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." msgstr "" -msgid "Weight of the edge (``source``, ``target``):" +msgid "For the TRSP functions" msgstr "" -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "Array of identifiers of destination vertices." msgstr "" -msgid "``cost`` must exist in the query." +msgid "There are several kinds of columns returned are depending of the function." msgstr "" -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." -msgstr "" +#, fuzzy +msgid "Result columns for single path functions" +msgstr "결과 컬럼" -msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgid "Used in functions that return one path solution per departure and destination." msgstr "" -msgid "Graph with ``cost``" -msgstr "" +msgid ":doc:`pgr_dijkstraNear`" +msgstr ":doc:`pgr_dijkstraNear`" -msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgid "Returns |short-generic-result|" msgstr "" -msgid "Graph data is obtained with a query" -msgstr "" +msgid "``path_seq``" +msgstr "``path_seq``" -msgid "``SELECT id, source, target, cost FROM edges``" +msgid "Relative position in the path. Has value **1** for the beginning of a path." msgstr "" -msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgid "Identifier of the starting vertex of the current path." msgstr "" -msgid "Edges where ``cost`` is non negative are part of the graph." +msgid "Identifier of the ending vertex of the current path." msgstr "" -msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "All vertices in ``source`` and ``target`` are part of the graph." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." msgstr "" -msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." msgstr "" -msgid "For the following data:" +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." msgstr "" -msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." -msgstr "" +#, fuzzy +msgid "Result columns for multiple paths functions" +msgstr "결과 컬럼" -msgid "The data is representing the following graph:" +msgid "Used in functions that return many paths solutions per departure and destination." msgstr "" -msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_KSP`" +msgstr ":doc:`pgr_aStarCost`" -msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_withPointsKSP`" +msgstr ":doc:`pgr_withPoints`" -msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgid "Returns set of |generic-result|" msgstr "" -msgid "Graph with ``cost`` and ``reverse_cost``" -msgstr "" +msgid "``path_id``" +msgstr "``path_id``" -msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgid "Path identifier." msgstr "" -msgid "The set of edges :math:`E`:" +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" -msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid "Result columns for cost functions" msgstr "" -msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgid "Used by:" msgstr "" -msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." msgstr "" -msgid "The set of vertices :math:`V`:" +msgid "Result columns for flow functions" msgstr "" -msgid "In a directed graph both edges have directionality" +msgid "Result columns for spanning tree functions" msgstr "" -msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "Used in functions that return a tree solution per departure." msgstr "" -msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" -msgstr "" +#, fuzzy +msgid "Result columns for simple spanning tree functions" +msgstr "결과 컬럼" -msgid "Edges not part of the graph:" +msgid "Returns set of ``(edge, cost)``" msgstr "" -msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgid "Cost to traverse the edge." msgstr "" -msgid ":math:`3` (:math:`3 \\rightarrow 2`)" +msgid "Performance Tips" msgstr "" -msgid "In a directed graph both edges do not have directionality" +msgid "For the Routing functions" msgstr "" -msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "To get faster results bound the queries to an area of interest of routing." msgstr "" -msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." msgstr "" -msgid "In terms of a directed graph is like having four edges:" +msgid "Given this area:" msgstr "" -msgid ":math:`source_i \\leftrightarrow target_i`" +msgid "Calculate a route:" msgstr "" -msgid ":math:`target_i \\leftrightarrow source_i`" +msgid "How to contribute" msgstr "" -msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgid "Wiki" msgstr "" -msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgid "Edit an existing `pgRouting Wiki `__ page." msgstr "" -msgid "Graphs without geometries" +msgid "Or create a new Wiki page" msgstr "" -msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgid "Create a page on the `pgRouting Wiki `__" msgstr "" -msgid "Wiki example" +msgid "Give the title an appropriate name" msgstr "" -msgid "Solve the example problem taken from `wikipedia `__):" +msgid "`Example `__" msgstr "" -msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." +msgid "Adding Functionality to pgRouting" msgstr "" -msgid "Is an undirected graph." +msgid "Consult the `developer's documentation `__" msgstr "" -msgid "Although visually looks like to have geometries, the drawing is not to scale." -msgstr "" +msgid "Installation" +msgstr "설치" -msgid "No geometries associated to the vertices or edges" +msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" msgstr "" -msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" msgstr "" -msgid "Has 9 edges:" -msgstr "" +msgid "Short Version" +msgstr "짧은 버전" -msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgid "Extracting the tar ball" +msgstr "tar ball 압축 해제" + +msgid "To compile assuming you have all the dependencies in your search path:" msgstr "" -msgid "The graph can be represented in many ways for example:" +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." msgstr "" -msgid "Prepare the database" +msgid "Get the sources" +msgstr "소스 가져오기" + +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" -msgid "Create a database for the example, access the database and install pgRouting: ::" +msgid "To download this release:" msgstr "" -msgid "Create a table" +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." msgstr "" -msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgid "git" +msgstr "git" + +msgid "To download the repository" msgstr "" -msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." msgstr "" -msgid "Using this table design for this example:" -msgstr "" +msgid "Enabling and upgrading in the database" +msgstr "데이터베이스에서 활성화 및 업그레이드 하기" + +msgid "Enabling the database" +msgstr "데이터베이스 활성화" -msgid "Insert the data" +msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." msgstr "" -msgid "Find the shortest path" +msgid "Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" -msgid "To solve this example :doc:`pgr_dijkstra` is used:" -msgstr "" +msgid "Upgrading the database" +msgstr "데이터베이스 업그레이드" -msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" msgstr "" -msgid "Vertex information" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" msgstr "" -msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" -msgstr "" +msgid "Dependencies" +msgstr "종속성" -msgid "Graphs with geometries" -msgstr "" +msgid "Compilation Dependencies" +msgstr "컴파일 종속성" -msgid "Create a routing Database" -msgstr "" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgstr "pgRouting을 컴파일 하기 위해, 다음 종속성이 충족되는지 확인하세요:" -msgid "The first step is to create a database and load pgRouting in the database." -msgstr "" +msgid "C and C++0x compilers" +msgstr "C 와 C++0x 컴파일러" -msgid "Typically create a database for each project." +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" msgstr "" -msgid "Once having the database to work in, load your data and build the routing application in that database." +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" -msgid "Load Data" +msgid "Postgresql version >= 13" msgstr "" -msgid "There are several ways to load your data into pgRouting." -msgstr "" +#, fuzzy +msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgstr "The Boost Graph Library (BGL). Version >= 1.56" -msgid "Manually creating a database." -msgstr "" +#, fuzzy +msgid "CMake >= 3.12" +msgstr "CMake >= 3.2" -msgid "`Graphs without geometries`_" +msgid "For user's documentation" msgstr "" #, fuzzy -msgid ":doc:`sampledata`: a small graph used in the documentation examples" -msgstr ":doc:`sampledata` 는 이 매뉴얼의 예제로 사용됩니다." +msgid "Sphinx >= 4.0" +msgstr "Sphinx >= 1.1" -msgid "Using `osm2pgrouting `__" +msgid "For developer's documentation" msgstr "" -msgid "There are various open source tools that can help, like:" +msgid "Doxygen >= 1.7" msgstr "" -msgid "shp2pgsql" +msgid "For testing" msgstr "" -msgid "postgresql shapefile loader" +msgid "pgtap" msgstr "" -msgid "ogr2ogr" +msgid "pg_prove" msgstr "" -msgid "vector data conversion utility" +msgid "For using:" msgstr "" -msgid "osm2pgsql" +msgid "PostGIS version >= 3.0.0" msgstr "" -msgid "load OSM data into postgresql" +msgid "Example: Installing dependencies on linux" msgstr "" -msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgid "Installing the compilation dependencies" msgstr "" -msgid "Breakup a segments on each segment-segment intersection" -msgstr "" +msgid "Build dependencies" +msgstr "빌드 종속성" -msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." -msgstr "" +msgid "Optional dependencies" +msgstr "선택적 종속성" -msgid "Connect a disconnected graph." +msgid "For documentation" msgstr "" -msgid "Create the complete graph topology" -msgstr "" +msgid "Configuring" +msgstr "구성" -msgid "Create one or more graphs based on the application to be developed." +msgid "pgRouting uses the `cmake` system to do the configuration." msgstr "" -msgid "Create a contracted graph for the high speed roads" +msgid "Configurable variables" msgstr "" -msgid "Create graphs per state/country" +msgid "To see the variables that can be configured" msgstr "" -msgid "In few words:" +msgid "The build directory is different from the source directory" msgstr "" -msgid "Prepare the graph" +msgid "Configuring The Documentation" msgstr "" -msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" msgstr "" -msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." -msgstr "" +msgid "Variable" +msgstr "변수" -msgid "The use of indexes on the database design in general:" -msgstr "" +msgid "Comment" +msgstr "설명" -msgid "Have the geometries indexed." +msgid "BUILD_HTML" msgstr "" -msgid "Have the identifiers columns indexed." +msgid "BOOL=ON" msgstr "" -msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgid "If ON, turn on/off building HTML for user's documentation" msgstr "" -msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." +msgid "BUILD_DOXY" msgstr "" -msgid "Adjust costs" +msgid "If ON, turn on/off building HTML for developer's documentation" msgstr "" -msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgid "BUILD_LATEX" msgstr "" -msgid "Update costs to length of geometry" +msgid "BOOL=OFF" msgstr "" -msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgid "If ON, turn on/off building PDF" msgstr "" -msgid ":math:`1` when the edge exists in the graph" +msgid "BUILD_MAN" msgstr "" -msgid ":math:`-1` when the edge does not exist in the graph" +msgid "If ON, turn on/off building MAN pages" msgstr "" -msgid "Using that information updating to the length of the geometries:" +msgid "DOC_USE_BOOTSTRAP" msgstr "" -msgid "Which gives the following results:" +msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" msgstr "" -msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgid "EN" msgstr "" -msgid "Returning to the original data:" +msgid "if OFF the English documentation will no be built" msgstr "" -msgid "Update costs based on codes" +msgid "ES" msgstr "" -msgid "Other datasets, can have a column with values like" +msgid "if OFF the Spanish documentation will no be built" msgstr "" -msgid "``FT`` vehicle flow on the direction of the geometry" +msgid "SV" msgstr "" -msgid "``TF`` vehicle flow opposite of the direction of the geometry" +msgid "if OFF the Swedish documentation will no be built" msgstr "" -msgid "``B`` vehicle flow on both directions" +msgid "ZH_HANS" msgstr "" -msgid "Preparing a code column for the example:" +msgid "if OFF the Chinese simplified documentation will no be built" msgstr "" -msgid "Adjusting the costs based on the codes:" -msgstr "" +msgid "Building" +msgstr "빌드" -msgid "Check the Routing Topology" +msgid "Using ``make`` to build the code and the documentation" msgstr "" -msgid "There are lots of possible problems in a graph." +msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "" -msgid "The data used may not have been designed with routing in mind." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." msgstr "" -msgid "A graph has some very specific requirements." -msgstr "" +msgid "Linux" +msgstr "리눅스" -msgid "The graph is disconnected." +msgid "The following instructions start from ``path/to/pgrouting``" msgstr "" -msgid "There are unwanted intersections." -msgstr "" +msgid "Testing" +msgstr "테스트" -msgid "The graph is too large and needs to be contracted." +msgid "Currently there is no :code:`make test` and testing is done as follows" msgstr "" -msgid "A sub graph is needed for the application." +msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." msgstr "" -msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" -msgid "Crossing edges" -msgstr "" +msgid "Licensing" +msgstr "라이선스" -msgid "To get the crossing edges:" +msgid "The following licenses can be found in pgRouting:" msgstr "" -msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgid "**License**" +msgstr "**라이선스**" + +msgid "GNU General Public License v2.0 or later" msgstr "" -msgid "It might be incorrect, for example:" +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." msgstr "" -msgid "When it is actually an intersection of roads, where vehicles can make turns." +msgid "Boost Software License - Version 1.0" msgstr "" -msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." msgstr "" -msgid "When it is incorrect, it needs fixing:" +msgid "MIT-X License" msgstr "" -msgid "For vehicles and pedestrians" +msgid "Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" -msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." msgstr "" -msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgid "In general license information should be included in the header of each source file." msgstr "" -msgid "For very specific applications" +msgid "Contributors" msgstr "" -msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgid "This Release Contributors" msgstr "" -msgid "The data needs a local fix for the specific application." +msgid "Individuals in this release |release| (in alphabetical order)" msgstr "" -msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgid "Mohit Rawat, Regina Obe, Vicky Vergara" msgstr "" -msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." msgstr "" -#, fuzzy -msgid "Fixing an intersection" -msgstr "소개" +msgid "Translators (in alphabetical order)" +msgstr "" -msgid "In this example the original edge table will be used to store the additional geometries." +msgid "Chinese:" msgstr "" -msgid "An example use without results" +msgid "Dapeng Wang" msgstr "" -msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgid "Spanish:" msgstr "" -msgid "Analyze the network for intersections." +msgid "Vicky Vergara" msgstr "" -msgid "The analysis tell us that the network has an intersection." +msgid "Swedish:" msgstr "" -msgid "Prepare tables" +msgid "Daniel Nylander" msgstr "" -msgid "Additional columns to control the origin of the segments." +msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" -msgid "Adding new segments." +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" msgstr "" -msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." +msgid "`OSGeo `__" msgstr "" -msgid "Update other values" +msgid "`OSGeo UK `__" msgstr "" -msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgid "`Google Summer of Code `__" msgstr "" -msgid "Update the topology" +msgid "`HighGo Software `__" msgstr "" -msgid "Insert the new vertices if any." +msgid "`Paragon Corporation `__" msgstr "" -msgid "Update source and target information on the edges table." +msgid "Contributors Past & Present:" msgstr "" -msgid "The example has results" +msgid "Individuals (in alphabetical order)" msgstr "" -msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgstr "" -msgid "Touching edges" +msgid "Corporate Sponsors (in alphabetical order)" msgstr "" -msgid "Visually the edges seem to be connected, but internally they are not." +msgid "Camptocamp" msgstr "" -msgid "The validity of the information is application dependent." +msgid "CSIS (University of Tokyo)" msgstr "" -msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgid "Georepublic" msgstr "" -msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgid "Google Summer of Code" msgstr "" -msgid "Fixing a gap" +msgid "HighGo Software" msgstr "" -msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgid "iMaptools" msgstr "" -msgid "Analyze the network for gaps." +msgid "Leopark" msgstr "" -msgid "The analysis tell us that the network has a gap." +msgid "Orkney" msgstr "" -msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." +msgid "OSGeo" msgstr "" -msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgid "OSGeo UK" msgstr "" -msgid "Connecting components" +msgid "Paragon Corporation" msgstr "" -msgid "To get the graph connectivity:" +msgid "Versaterm Inc." msgstr "" -msgid "There are three basic ways to connect components:" +msgid "More Information" msgstr "" -msgid "From the vertex to the starting point of the edge" +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." msgstr "" -msgid "From the vertex to the ending point of the edge" +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." msgstr "" -msgid "From the vertex to the closest vertex on the edge" +msgid "PostGIS extension at the PostGIS project web site https://postgis.net." msgstr "" -msgid "This solution requires the edge to be split." +msgid "Boost C++ source libraries at https://www.boost.org." msgstr "" -msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgid ":doc:`migration`" +msgstr ":doc:`migration`" + +msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" -msgid "Get the connectivity" +msgid "Availability" msgstr "" -msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." +msgid "Version 4.0.0" msgstr "" -msgid "Insert new edges" +msgid "All signatures promoted to official." msgstr "" -msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgid "Version 3.6.0" msgstr "" -msgid "Create the vertices table" +msgid "Standardizing output columns to |nksp-result|" msgstr "" #, fuzzy -msgid "Using :doc:`pgr_extractVertices` create the table." -msgstr ":doc:`pgr_extractVertices`" +msgid "pgr_ksp(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Contraction of a graph" +msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "The graph can be reduced in size using :doc:`contraction-family`" +msgid "New proposed signatures:" msgstr "" -msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." -msgstr "" +#, fuzzy +msgid "pgr_ksp(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." -msgstr "" +#, fuzzy +msgid "pgr_ksp(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" -msgstr "" +#, fuzzy +msgid "pgr_ksp(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "To get the dead ends:" +#, fuzzy +msgid "pgr_ksp(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Version 2.1.0" msgstr "" -msgid "A dead end happens when" +msgid "Signature change" msgstr "" -msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgid "Old signature no longer supported" msgstr "" -msgid "The vertex is on the limit of the imported graph." +msgid "Version 2.0.0" msgstr "" -msgid "If a larger graph is imported then the vertex might not be a dead end" +msgid "Official function." msgstr "" -msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." msgstr "" -msgid "Is node :math:`4` a dead end or not?" +msgid "|Boost| Boost Graph Inside" msgstr "" -msgid "The answer to that question will depend on the application." +msgid "Boost Graph inside" msgstr "" -msgid "Is there such a small curb:" +msgid "Signatures" msgstr "" -msgid "That does not allow a vehicle to use that visual intersection?" +msgid "Summary" msgstr "" -msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgstr "" -msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgstr "" -msgid "Depending on the answer, modification of the data might be needed." +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgstr "" -msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" msgstr "" -msgid "Linear edges" +msgid "**options:** ``[directed, heap_paths]``" msgstr "" -msgid "To get the linear edges:" +msgid "Returns set of |nksp-result|" msgstr "" -msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgid "OR EMPTY SET" msgstr "" -msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." +msgid "Example" msgstr "" -msgid "Function's structure" +msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "" -msgid "Once the graph preparation work has been done above, it is time to use a" +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "The general form of a pgRouting function call is:" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." msgstr "" -msgid "\\ \\" +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgid "Using a combinations table on an directed graph" msgstr "" -msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." +msgid "The combinations table:" msgstr "" -msgid "**parameters**: Additional compulsory parameters needed by the function." +msgid "The query:" msgstr "" -msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgid "Identifier of the destination vertex." msgstr "" -msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgid "**K**" msgstr "" -msgid "For example, for this :doc:`pgr_dijkstra` signature:" +msgid "Number of required paths." msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "KSP Optional parameters" msgstr "" -msgid "`Edges SQL`_:" +msgid "``heap_paths``" +msgstr "``heap_paths``" + +msgid "When ``false`` Returns at most K paths." msgstr "" -msgid "Is the first parameter." +msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" -msgid "It is compulsory." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" -msgid "It is an inner query." +msgid "Additional Examples" msgstr "" -msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" msgstr "" -msgid "**start vid**:" +msgid "Also get the paths in the heap." msgstr "" -msgid "Is the second parameter." +msgid "Get 2 paths using combinations table on an undirected graph" msgstr "" -msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." msgstr "" -msgid "Is the third parameter." +msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgstr "" -msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgid "``pgr_TSP``" +msgstr "``pgr_TSP``" + +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." msgstr "" -msgid "Is the fourth parameter." +msgid "Availability:" msgstr "" -msgid "It is optional." +msgid "Results change depending on input order" msgstr "" -msgid "It has a name." +#, fuzzy +msgid "Only for undirected graphs" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "Breaking change, signatures no longer available:" msgstr "" -msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Function's overloads" +msgid "Version 3.2.1" msgstr "" -msgid "A function might have different overloads. The most common are called:" +msgid "Metric Algorithm from `Boost library `__" msgstr "" -msgid "`One to One`_" +msgid "Simulated Annealing Algorithm no longer supported" msgstr "" -msgid "`One to Many`_" +msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" msgstr "" -msgid "`Many to One`_" +msgid "Version 2.3.0" msgstr "" -msgid "`Many to Many`_" +msgid "Results change depending on input order of the `Matrix SQL`_" msgstr "" -msgid "`Combinations`_" +#, fuzzy +msgid "Negative costs are ignored." +msgstr ":math:`0` 값은 무시됩니다" + +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." msgstr "" -msgid "Depending on the overload the parameters types change." +msgid "With ``directed => false``" msgstr "" -msgid "**One**: **ANY-INTEGER**" +msgid "Will generate a graph that:" msgstr "" -msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgid "is undirected" msgstr "" -msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgid "is fully connected (As long as the graph has one component)" msgstr "" -msgid "When routing from:" +msgid "all traveling costs on edges obey the triangle inequality." msgstr "" -msgid "From **one** starting vertex" +msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" -msgid "to **one** ending vertex" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "" -msgid "to **many** ending vertices" +msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" -msgid "From **many** starting vertices" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." msgstr "" -msgid "From **many** different starting vertices" +msgid "With ``directed => true``" msgstr "" -msgid "to **many** different ending vertices" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "" -msgid "Every tuple specifies a pair of a start vertex and an end vertex" +msgid "is directed" msgstr "" -msgid "Users can define the combinations as desired." +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." msgstr "" -msgid "Needs a `Combinations SQL`_" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" msgstr "" -msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" msgstr "" -msgid "Edges SQL for" +msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" msgstr "" -msgid "Some uncategorised functions" +msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" msgstr "" -msgid "General without ``id``" +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." msgstr "" -msgid "General with (X,Y)" +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" -msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgid "Missing values will be calculated with dijkstra algorithm." msgstr "" -msgid "Weight of the edge (``target``, ``source``)," +msgid "When the graph has more than one component:" msgstr "" -msgid "``x1``" -msgstr "``x1``" +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgstr "" -msgid "X coordinate of ``source`` vertex." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "``y1``" -msgstr "``y1``" +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +msgstr "" -msgid "Y coordinate of ``source`` vertex." +msgid "One cycle attempt to remove crossing edges is done to the TSP results." msgstr "" -msgid "``x2``" -msgstr "``x2``" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgstr "" -msgid "X coordinate of ``target`` vertex." +msgid "Returns set of |tsp-result|" msgstr "" -msgid "``y2``" -msgstr "``y2``" +msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgstr "" -msgid "Y coordinate of ``target`` vertex." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." msgstr "" -msgid "Flow" +msgid "`Matrix SQL`_ as described below" msgstr "" -msgid "Edges SQL for :doc:`flow-family`" +msgid "``ANY-INTEGER``" msgstr "" -msgid "Edges SQL for the following functions of :doc:`flow-family`" +msgid "``ANY-NUMERICAL``" msgstr "" -msgid "Used in combination signatures" +msgid "Cost for going from start_vid to end_vid" msgstr "" -msgid "Points SQL for" +msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" msgstr "" -msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgid "Row sequence." msgstr "" -msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgid "**node**" msgstr "" -msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgid "Identifier of the node/coordinate/point." msgstr "" -msgid "Parameters for the Via functions" +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." msgstr "" -msgid "SQL query as described." +msgid "``0`` for the last row in the tour sequence." msgstr "" -msgid "When ``true`` Graph is considered `Directed`" +msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." msgstr "" -msgid "When ``false`` the graph is considered as Undirected." +msgid "``0`` for the first row in the tour sequence." msgstr "" -msgid "``strict``" -msgstr "``strict``" - -msgid "``false``" -msgstr "``false``" +msgid "Start from vertex :math:`1`" +msgstr "" -msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" +msgid "**Line 6** ``start_vid => 1``" msgstr "" -msgid "When ``false`` ignores missing paths returning all paths found" +msgid "Using points of interest to generate an asymmetric matrix." msgstr "" -msgid "``U_turn_on_edge``" -msgstr "``U_turn_on_edge``" +msgid "To generate an asymmetric matrix:" +msgstr "" -msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" msgstr "" -msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" -msgid "For the TRSP functions" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" msgstr "" -msgid "Array of identifiers of destination vertices." +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" msgstr "" -msgid "There are several kinds of columns returned are depending of the function." +msgid "Triangle inequality might not be satisfied." msgstr "" -#, fuzzy -msgid "Result columns for single path functions" -msgstr "결과 컬럼" +msgid "``start_id != 0 AND end_id != 0``" +msgstr "" -msgid "Used in functions that return one path solution per departure and destination." +msgid "Connected incomplete data" msgstr "" -msgid ":doc:`pgr_dijkstraNear`" -msgstr ":doc:`pgr_dijkstraNear`" +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgstr "" -msgid "Returns |short-generic-result|" +msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." msgstr "" -msgid "``path_seq``" -msgstr "``path_seq``" +msgid "``pgr_TSPeuclidean``" +msgstr "``pgr_TSPeuclidean``" -msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "" -msgid "Identifier of the starting vertex of the current path." +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Identifier of the ending vertex of the current path." +msgid "Using `Boost: metric TSP approx `__" msgstr "" -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." +msgid "Version 3.0.0" msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgid "Name change from pgr_eucledianTSP" msgstr "" -msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgid "New official function." msgstr "" -msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -#, fuzzy -msgid "Result columns for multiple paths functions" -msgstr "결과 컬럼" - -msgid "Used in functions that return many paths solutions per departure and destination." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." msgstr "" -#, fuzzy -msgid ":doc:`pgr_KSP`" -msgstr ":doc:`pgr_aStarCost`" - -#, fuzzy -msgid ":doc:`pgr_withPointsKSP`" -msgstr ":doc:`pgr_withPoints`" - -msgid "Returns set of |generic-result|" +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "" -msgid "``path_id``" -msgstr "``path_id``" - -msgid "Path identifier." +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "" -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" msgstr "" -msgid "Result columns for cost functions" +msgid "With default values" msgstr "" -msgid "Used by:" +msgid "`Coordinates SQL`_" msgstr "" -msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgid "`Coordinates SQL`_ as described below" msgstr "" -msgid "Result columns for flow functions" +msgid "Coordinates SQL" msgstr "" -msgid "Result columns for spanning tree functions" -msgstr "" +msgid "``x``" +msgstr "``x``" -msgid "Used in functions that return a tree solution per departure." +msgid "X value of the coordinate." msgstr "" -#, fuzzy -msgid "Result columns for simple spanning tree functions" -msgstr "결과 컬럼" +msgid "``y``" +msgstr "``y``" -msgid "Returns set of ``(edge, cost)``" +msgid "Y value of the coordinate." msgstr "" -msgid "Cost to traverse the edge." +msgid "Test 29 cities of Western Sahara" msgstr "" -msgid "Performance Tips" +msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" msgstr "" -msgid "For the Routing functions" +msgid "Creating a table for the data and storing the data" msgstr "" -msgid "To get faster results bound the queries to an area of interest of routing." +msgid "Adding a geometry (for visual purposes)" msgstr "" -msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." +msgid "Total tour cost" msgstr "" -msgid "Given this area:" +msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" msgstr "" -msgid "Calculate a route:" +msgid "Getting a geometry of the tour" msgstr "" -msgid "How to contribute" +msgid "Visual results" msgstr "" -msgid "Wiki" +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid "Edit an existing `pgRouting Wiki `__ page." +msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" -msgid "Or create a new Wiki page" +msgid "Combinations signature promoted to official." msgstr "" -msgid "Create a page on the `pgRouting Wiki `__" +msgid "Standardizing output columns to |short-generic-result|" msgstr "" -msgid "Give the title an appropriate name" +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "`Example `__" +msgid "pgr_aStar(One to Many) added ``end_vid`` column." msgstr "" -msgid "Adding Functionality to pgRouting" +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" -msgid "Consult the `developer's documentation `__" +msgid "Version 3.2.0" msgstr "" -msgid "Installation" -msgstr "설치" +msgid "New proposed signature:" +msgstr "" -msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" +msgid "pgr_aStar(Combinations)" msgstr "" -msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgid "Function promoted to official." msgstr "" -msgid "Short Version" -msgstr "짧은 버전" +msgid "Version 2.4.0" +msgstr "" -msgid "Extracting the tar ball" -msgstr "tar ball 압축 해제" +#, fuzzy +msgid "pgr_aStar(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "To compile assuming you have all the dependencies in your search path:" -msgstr "" +#, fuzzy +msgid "pgr_aStar(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." -msgstr "" +#, fuzzy +msgid "pgr_aStar(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Get the sources" -msgstr "소스 가져오기" +msgid "Signature change on pgr_aStar(One to One)" +msgstr "" -msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" msgstr "" -msgid "To download this release:" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "git" -msgstr "git" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "" -msgid "To download the repository" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Enabling and upgrading in the database" -msgstr "데이터베이스에서 활성화 및 업그레이드 하기" +msgid "**options:** ``[directed, heuristic, factor, epsilon]``" +msgstr "" -msgid "Enabling the database" -msgstr "데이터베이스 활성화" +msgid "Returns set of |short-generic-result|" +msgstr "" -msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." +msgid "Optional parameters are `named parameters` and have a default value." msgstr "" -msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" msgstr "" -msgid "Upgrading the database" -msgstr "데이터베이스 업그레이드" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgstr "" -msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" msgstr "" -msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" msgstr "" -msgid "Dependencies" -msgstr "종속성" +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgstr "" -msgid "Compilation Dependencies" -msgstr "컴파일 종속성" +msgid "Example 1" +msgstr "" -msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" -msgstr "pgRouting을 컴파일 하기 위해, 다음 종속성이 충족되는지 확인하세요:" +msgid "Demonstration of repeated values are ignored, and result is sorted." +msgstr "" -msgid "C and C++0x compilers" -msgstr "C 와 C++0x 컴파일러" +msgid "Example 2" +msgstr "" -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgid "Making **start vids** the same as **end vids**." msgstr "" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "Example 3" msgstr "" -msgid "Postgresql version >= 13" +msgid "Manually assigned vertex combinations." msgstr "" -#, fuzzy -msgid "The Boost Graph Library (BGL) >= 1.56.0" -msgstr "The Boost Graph Library (BGL). Version >= 1.56" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" #, fuzzy -msgid "CMake >= 3.12" -msgstr "CMake >= 3.2" +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." -msgid "For user's documentation" +msgid "pgr_aStarCost(Combinations)" msgstr "" #, fuzzy -msgid "Sphinx >= 4.0" -msgstr "Sphinx >= 1.1" +msgid "New proposed function." +msgstr ":doc:`routingFunctions`" -msgid "For developer's documentation" +#, fuzzy +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." + +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" msgstr "" -msgid "Doxygen >= 1.7" +msgid "For undirected graphs, the results are symmetric." msgstr "" -msgid "For testing" +msgid "The returned values are ordered in ascending order:" msgstr "" -msgid "pgtap" +msgid "`start_vid` ascending" msgstr "" -msgid "pg_prove" +msgid "`end_vid` ascending" msgstr "" -msgid "For using:" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "PostGIS version >= 3.0.0" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "Example: Installing dependencies on linux" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Installing the compilation dependencies" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "Build dependencies" -msgstr "빌드 종속성" - -msgid "Optional dependencies" -msgstr "선택적 종속성" - -msgid "For documentation" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Configuring" -msgstr "구성" - -msgid "pgRouting uses the `cmake` system to do the configuration." +msgid "Returns set of |matrix-result|" msgstr "" -msgid "Configurable variables" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" msgstr "" -msgid "To see the variables that can be configured" -msgstr "" +msgid "``pgr_aStarCostMatrix``" +msgstr "``pgr_aStarCostMatrix``" -msgid "The build directory is different from the source directory" +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" -msgid "Configuring The Documentation" +msgid "Using internally the :doc:`pgr_aStar` algorithm" msgstr "" -msgid "User and developers documentation are not build if prerequisites are not found." +msgid "Returns a cost matrix." msgstr "" -msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgid "No ordering is performed" msgstr "" -msgid "Variable" -msgstr "변수" - -msgid "Comment" -msgstr "설명" - -msgid "BUILD_HTML" +msgid "let `v` and `u` are nodes on the graph:" msgstr "" -msgid "BOOL=ON" +msgid "when there is no path from `v` to `u`:" msgstr "" -msgid "If ON, turn on/off building HTML for user's documentation" +msgid "cost from `v` to `u` is :math:`\\inf`" msgstr "" -msgid "BUILD_DOXY" +msgid "when :math:`v = u` then" msgstr "" -msgid "If ON, turn on/off building HTML for developer's documentation" +msgid "cost from `v` to `u` is :math:`0`" msgstr "" -msgid "BUILD_LATEX" +msgid "When the graph is **undirected** the cost matrix is symmetric" msgstr "" -msgid "BOOL=OFF" +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "If ON, turn on/off building PDF" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" msgstr "" -msgid "BUILD_MAN" +msgid "Use with :doc:`pgr_TSP`" msgstr "" -msgid "If ON, turn on/off building MAN pages" -msgstr "" +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" -msgid "DOC_USE_BOOTSTRAP" +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." msgstr "" -msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" +msgid "Result columns change: ``seq`` is removed" msgstr "" -msgid "EN" +msgid "Version 2.5.0" msgstr "" -msgid "if OFF the English documentation will no be built" +msgid "New experimental function." msgstr "" -msgid "ES" +msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." msgstr "" -msgid "if OFF the Spanish documentation will no be built" +msgid "Works for **undirected** graphs." msgstr "" -msgid "SV" +msgid "``node`` ascending" msgstr "" -msgid "if OFF the Swedish documentation will no be built" +msgid "Running time: :math:`O(V + E)`" msgstr "" -msgid "ZH_HANS" +msgid "pgr_articulationPoints(`Edges SQL`_)" msgstr "" -msgid "if OFF the Chinese simplified documentation will no be built" +msgid "Returns set of |result-node|" msgstr "" -msgid "Building" -msgstr "빌드" - -msgid "Using ``make`` to build the code and the documentation" +msgid "The articulation points of the graph" msgstr "" -msgid "The following instructions start from ``path/to/pgrouting/build``" +msgid "Nodes in red are the articulation points." msgstr "" -msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgid "Identifier of the vertex." msgstr "" -msgid "Linux" -msgstr "리눅스" +msgid "`Boost: Biconnected components & articulation points `__" +msgstr "" -msgid "The following instructions start from ``path/to/pgrouting``" +msgid "wikipedia: `Biconnected component `__" msgstr "" -msgid "Testing" -msgstr "테스트" +#, fuzzy +msgid "``pgr_bandwidth`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" -msgid "Currently there is no :code:`make test` and testing is done as follows" +msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "" -msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "" -msgid "Licensing" -msgstr "라이선스" - -msgid "The following licenses can be found in pgRouting:" +msgid "The bandwidth is the maximum of all these distances" msgstr "" -msgid "**License**" -msgstr "**라이선스**" +#, fuzzy +msgid "The implementation is for undirected graphs" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "GNU General Public License v2.0 or later" +msgid "Run time is 0.160789 seconds" msgstr "" -msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgid "pgr_bandwidth(`Edges SQL`_)" msgstr "" -msgid "Boost Software License - Version 1.0" +msgid "Returns ``BIGINT``" msgstr "" -msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." -msgstr "" +#, fuzzy +msgid "For an undirected graph with edges." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "MIT-X License" +msgid "Returns a bigint ``(pgr_bandwidth)``" msgstr "" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." -msgstr "" +msgid "``pgr_bandwidth``" +msgstr "``pgr_bandwidth``" -msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgid "gives the bandwidth of the graph." msgstr "" -msgid "In general license information should be included in the header of each source file." +msgid "Undirected graph with edges before optimization." msgstr "" -msgid "Contributors" +msgid "Undirected graph with edges after optimization." msgstr "" -msgid "This Release Contributors" +msgid "`Boost: bandwidth `_" msgstr "" -msgid "Individuals in this release v4.0.0 (in alphabetical order)" -msgstr "" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" -msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "Translators (in alphabetical order)" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "Chinese:" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "Dapeng Wang" +msgid "pgr_bdAstar(Combinations)" msgstr "" -msgid "Spanish:" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Vicky Vergara" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Swedish:" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Daniel Nylander" +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" -msgid "Corporate Sponsors in this release (in alphabetical order)" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "" -msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "`OSGeo `__" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "`OSGeo UK `__" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "`Google Summer of Code `__" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "`HighGo Software `__" +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "`Paragon Corporation `__" -msgstr "" +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" -msgid "Contributors Past & Present:" +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" -msgid "Individuals (in alphabetical order)" +msgid "pgr_bdAstarCost(Combinations)" msgstr "" -msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgstr "" +#, fuzzy +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." -msgid "Corporate Sponsors (in alphabetical order)" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "Camptocamp" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "CSIS (University of Tokyo)" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "Georepublic" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "Google Summer of Code" +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "HighGo Software" -msgstr "" +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" -msgid "iMaptools" -msgstr "" +#, fuzzy +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." +msgstr ":doc:`pgr_aStarCostMatrix` - 최단 경로의 비용 행렬 반환." -msgid "Leopark" +msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." msgstr "" -msgid "Orkney" +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "OSGeo" -msgstr "" +#, fuzzy +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." -msgid "OSGeo UK" +msgid "Output columns standardized to |short-generic-result|" msgstr "" -msgid "Paragon Corporation" +msgid "pgr_bdDijkstra(Combinations)" msgstr "" -msgid "Versaterm Inc." -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstra(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "More Information" +#, fuzzy +msgid "pgr_bdDijkstra(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_bdDijkstra(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "Signature change on pgr_bdDijkstra(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "PostGIS extension at the PostGIS project web site https://postgis.net." +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Boost C++ source libraries at https://www.boost.org." +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid ":doc:`migration`" -msgstr ":doc:`migration`" +msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgstr "" -msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" msgstr "" -msgid "Availability" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" -msgid "Version 4.0.0" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" msgstr "" -msgid "Version 3.6.0" +msgid "Using a combinations table on an **undirected** graph" msgstr "" -msgid "Standardizing output columns to |nksp-result|" +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" -#, fuzzy -msgid "pgr_ksp(One to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" -msgid "Added ``start_vid`` and ``end_vid`` result columns." +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" -msgid "New proposed signatures:" +msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" #, fuzzy -msgid "pgr_ksp(One to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" - -#, fuzzy -msgid "pgr_ksp(Many to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" - -#, fuzzy -msgid "pgr_ksp(Many to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" - -#, fuzzy -msgid "pgr_ksp(Combinations)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgstr ":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트라 알고리즘" -msgid "Version 2.1.0" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -msgid "Signature change" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Old signature no longer supported" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "" -msgid "Version 2.0.0" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Official function." +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" msgstr "" -msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "|Boost| Boost Graph Inside" -msgstr "" +msgid "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "Boost Graph inside" +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." msgstr "" -msgid "Signatures" +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" -msgid "Summary" +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "Use with :doc:`pgr_TSP`." msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "" +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" -msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgid "New experimental signature:" msgstr "" -msgid "**options:** ``[directed, heap_paths]``" +msgid "pgr_bellmanFord(Combinations)" msgstr "" -msgid "Returns set of |nksp-result|" +msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "OR EMPTY SET" +msgid "Process is valid for edges with both positive and negative edge weights." msgstr "" -msgid "Example" +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." msgstr "" -msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." +msgid "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." msgstr "" -msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgid "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." msgstr "" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." msgstr "" -msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." msgstr "" -msgid "Using a combinations table on an directed graph" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" -msgid "The combinations table:" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "The query:" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Identifier of the destination vertex." +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "**K**" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Number of required paths." +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "KSP Optional parameters" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "" -msgid "``heap_paths``" -msgstr "``heap_paths``" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgstr "" -msgid "When ``false`` Returns at most K paths." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "" -msgid "When ``true`` all the calculated paths while processing are returned." +#, fuzzy +msgid "Using a combinations table on an undirected graph" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "`Boost: Bellman Ford `__" msgstr "" -msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" -msgid "Additional Examples" +msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" -msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "" -msgid "Also get the paths in the heap." +msgid "Version 3.7.0" msgstr "" -msgid "Get 2 paths using combinations table on an undirected graph" +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." msgstr "" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." msgstr "" -msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." msgstr "" -msgid "``pgr_TSP``" -msgstr "``pgr_TSP``" +#, fuzzy +msgid "This implementation work for both directed and undirected graphs." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgid "Running time: :math:`\\Theta(VE)`" msgstr "" -msgid "Availability:" +msgid "Running space: :math:`\\Theta(VE)`" msgstr "" -msgid "Version 3.2.1" +msgid "Throws when there are no edges in the graph" msgstr "" -msgid "Metric Algorithm from `Boost library `__" +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" msgstr "" -msgid "Simulated Annealing Algorithm no longer supported" +msgid "Returns set of ``(vid, centrality)``" msgstr "" -msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "Version 2.3.0" +msgid "Explanation" msgstr "" -msgid "Results change depending on input order of the `Matrix SQL`_" +msgid "The betweenness centrality are between parenthesis." msgstr "" -#, fuzzy -msgid "Negative costs are ignored." -msgstr ":math:`0` 값은 무시됩니다" - -msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "" -msgid "With ``directed => false``" +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." msgstr "" -msgid "Will generate a graph that:" +msgid "Removing vertex :math:`6` will create three graph components." msgstr "" -msgid "is undirected" +msgid "Removing vertex :math:`10` will create two graph components." msgstr "" -msgid "is fully connected (As long as the graph has one component)" -msgstr "" +msgid "``vid``" +msgstr "``vid``" -msgid "all traveling costs on edges obey the triangle inequality." -msgstr "" +msgid "``centrality``" +msgstr "``centrality``" -msgid "When ``start_vid = 0 OR end_vid = 0``" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +msgid "`Boost: betweenness centrality `_" msgstr "" -msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgstr "" +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." msgstr "" -msgid "With ``directed => true``" +#, fuzzy +msgid "Result columns change:" +msgstr "결과 컬럼" + +msgid "``n_seq`` is removed" msgstr "" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +msgid "``seq`` changed type to ``BIGINT``" msgstr "" -msgid "is directed" +msgid "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." msgstr "" -msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgid "Components are described by edges." msgstr "" -msgid "As an undirected graph is required, the directed graph is transformed as follows:" +msgid "``component`` ascending." msgstr "" -msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgid "``edge`` ascending." msgstr "" -msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" +msgid "pgr_biconnectedComponents(`Edges SQL`_)" msgstr "" -msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" +msgid "Returns set of |result-component-E|" msgstr "" -msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgid "The biconnected components of the graph" msgstr "" -msgid "When the data does not come from an undirected graph or its not fully connected:" +msgid "``component``" +msgstr "``component``" + +msgid "Component identifier." msgstr "" -msgid "Missing values will be calculated with dijkstra algorithm." +msgid "Has the value of the minimum edge identifier in the component." msgstr "" -msgid "When the graph has more than one component:" +msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" -msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "" -msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." msgstr "" -msgid "One cycle attempt to remove crossing edges is done to the TSP results." +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" -msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." msgstr "" -msgid "Returns set of |tsp-result|" +msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." msgstr "" -msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" msgstr "" -msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "" -msgid "`Matrix SQL`_ as described below" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "``ANY-INTEGER``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "``ANY-NUMERICAL``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Cost for going from start_vid to end_vid" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Row sequence." +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" msgstr "" -msgid "**node**" +msgid "`Boost: Breadth First Search `__" msgstr "" -msgid "Identifier of the node/coordinate/point." +msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -msgid "``0`` for the last row in the tour sequence." +msgid "``pgr_bipartite`` - Experimental" msgstr "" -msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "" -msgid "``0`` for the first row in the tour sequence." +msgid "Output columns standardized to |result_node_color|" msgstr "" -msgid "Start from vertex :math:`1`" +msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." msgstr "" -msgid "**Line 6** ``start_vid => 1``" +msgid "The algorithm works in undirected graph only." msgstr "" -msgid "Using points of interest to generate an asymmetric matrix." +msgid "The returned values are not ordered." msgstr "" -msgid "To generate an asymmetric matrix:" +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." msgstr "" -msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgid "If graph is not bipartite then algorithm returns empty set." msgstr "" -msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" +msgid "pgr_bipartite(`Edges SQL`_)" msgstr "" -msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgid "When the graph is bipartite" msgstr "" -msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgid "Additional Example" msgstr "" -msgid "Triangle inequality might not be satisfied." +msgid "The odd length cyclic graph can not be bipartite." msgstr "" -msgid "``start_id != 0 AND end_id != 0``" +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." msgstr "" -msgid "Connected incomplete data" +msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgid "`Boost: is_bipartite `__" msgstr "" -msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." +msgid "`Wikipedia: bipartite graph `__" msgstr "" -msgid "``pgr_TSPeuclidean``" -msgstr "``pgr_TSPeuclidean``" +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" -msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." msgstr "" -msgid "Using `Boost: metric TSP approx `__" +msgid "pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "Name change from pgr_eucledianTSP" +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "New official function." +msgid "Function promoted to proposed." msgstr "" -msgid "Results change depending on input order of the `Coordinates SQL`_" +msgid "Running time: Polynomial" msgstr "" -msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "The coordinates are quite similar for the same identifier, for example ::" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "The coordinates are quite different for the same identifier, for example ::" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "With default values" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "`Coordinates SQL`_" +msgid "Returns set of |result-flow|" msgstr "" -msgid "`Coordinates SQL`_ as described below" +msgid "From vertex :math:`11` to vertex :math:`12`" msgstr "" -msgid "Coordinates SQL" +msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "``x``" -msgstr "``x``" - -msgid "X value of the coordinate." +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -msgid "``y``" -msgstr "``y``" - -msgid "Y value of the coordinate." +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "Test 29 cities of Western Sahara" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgid "`Boost: Boykov Kolmogorov max flow `__" msgstr "" -msgid "Creating a table for the data and storing the data" +msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" -msgid "Adding a geometry (for visual purposes)" +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "" -msgid "Total tour cost" -msgstr "" +#, fuzzy +msgid "Version 4.0.0:" +msgstr "짧은 버전" -msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" +msgid "Standardizing output columns to |result-spantree|" msgstr "" -msgid "Getting a geometry of the tour" +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "" -msgid "Visual results" +msgid "The implementation will work on any type of graph." msgstr "" -msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." msgstr "" -msgid "``pgr_aStar`` — Shortest path using the A* algorithm." +msgid "Running time: :math:`O(E + V)`" msgstr "" -msgid "Standardizing output columns to |short-generic-result|" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" msgstr "" -msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgstr "" -msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgid "**options:** ``[max_depth, directed]``" msgstr "" -msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" msgstr "" -msgid "New proposed signature:" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" -msgid "pgr_aStar(Combinations)" +msgid "DFS optional parameters" msgstr "" -msgid "Version 2.4.0" +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." msgstr "" -#, fuzzy -msgid "pgr_aStar(One to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" - -#, fuzzy -msgid "pgr_aStar(Many to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" - -#, fuzzy -msgid "pgr_aStar(Many to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" - -msgid "Signature change on pgr_aStar(One to One)" +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." msgstr "" -msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgid "The resulting traversal is different." msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "|ascending| |descending|" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "ascending" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "descending" msgstr "" -msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "`Wikipedia: Breadth First Search algorithm `__" msgstr "" -msgid "**options:** ``[directed, heuristic, factor, epsilon]``" -msgstr "" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "Returns set of |short-generic-result|" +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." msgstr "" -msgid "Optional parameters are `named parameters` and have a default value." +msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." msgstr "" -msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" +msgid "``edge`` ascending" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgid "Running time: :math:`O(E * (V + E))`" msgstr "" -msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgid "pgr_bridges(`Edges SQL`_)" msgstr "" -msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgid "Returns set of |result-edge|" msgstr "" -msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgid "The bridges of the graph" msgstr "" -msgid "Example 1" +msgid "Identifier of the edge that is a bridge." msgstr "" -msgid "Demonstration of repeated values are ignored, and result is sorted." +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "Example 2" +msgid "`Boost: Connected components `__" msgstr "" -msgid "Making **start vids** the same as **end vids**." +msgid "``pgr_chinesePostman`` - Experimental" msgstr "" -msgid "Example 3" +msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." msgstr "" -msgid "Manually assigned vertex combinations." +msgid "Returns ``EMPTY SET`` on a disconnected graph" msgstr "" -msgid "``pgr_aStarCost``" -msgstr "``pgr_aStarCost``" - -#, fuzzy -msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." - -msgid "pgr_aStarCost(Combinations)" +msgid "pgr_chinesePostman(`Edges SQL`_)" msgstr "" -#, fuzzy -msgid "New proposed function." -msgstr ":doc:`routingFunctions`" - -#, fuzzy -msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." -msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." - -msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" +msgid "Returns set of |result-1-1-no-seq|" msgstr "" -msgid "For undirected graphs, the results are symmetric." +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "" -msgid "The returned values are ordered in ascending order:" +msgid "Sequential value starting from ``1``" msgstr "" -msgid "`start_vid` ascending" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." msgstr "" -msgid "`end_vid` ascending" +msgid "Aggregate cost from ``start_v`` to ``node``." msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "Return value when the graph if disconnected" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "RETURNS ``FLOAT``" msgstr "" -msgid "Returns set of |matrix-result|" -msgstr "" +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgid "Minimum costs of a circuit path." msgstr "" -msgid "``pgr_aStarCostMatrix``" -msgstr "``pgr_aStarCostMatrix``" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" -msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." msgstr "" -msgid "Using internally the :doc:`pgr_aStar` algorithm" +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." msgstr "" -msgid "Returns a cost matrix." +msgid "Components are described by vertices" msgstr "" -msgid "No ordering is performed" +msgid "``component`` ascending" msgstr "" -msgid "let `v` and `u` are nodes on the graph:" +msgid "pgr_connectedComponents(`Edges SQL`_)" msgstr "" -msgid "when there is no path from `v` to `u`:" +msgid "Returns set of |result-component-V|" msgstr "" -msgid "cost from `v` to `u` is :math:`\\inf`" +msgid "The connected components of the graph" msgstr "" -msgid "when :math:`v = u` then" +msgid "Has the value of the minimum node identifier in the component." msgstr "" -msgid "cost from `v` to `u` is :math:`0`" +msgid "Identifier of the vertex that belongs to the ``component``." msgstr "" -msgid "When the graph is **undirected** the cost matrix is symmetric" +msgid "Connecting disconnected components" msgstr "" -msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "wikipedia: `Connected component `__" msgstr "" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" + +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "Use with :doc:`pgr_TSP`" +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "Version 3.8.0" +msgstr "" -msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgid "New signature:" msgstr "" -msgid "Result columns change: ``seq`` is removed" +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." msgstr "" -msgid "Version 2.5.0" +msgid "New name and order of optional parameters." msgstr "" -msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "Works for **undirected** graphs." +msgid "Name change from ``pgr_contractGraph``" +msgstr "" + +msgid "Bug fixes" msgstr "" -msgid "``node`` ascending" +msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." msgstr "" -msgid "Running time: :math:`O(V + E)`" +msgid "Does not return the full contracted graph." msgstr "" -msgid "pgr_articulationPoints(`Edges SQL`_)" +msgid "Only changes on the graph are returned." msgstr "" -msgid "Returns set of |result-node|" +msgid "The returned values include:" msgstr "" -msgid "The articulation points of the graph" +msgid "The new edges generated by linear contraction." msgstr "" -msgid "Nodes in red are the articulation points." +msgid "The modified vertices generated by dead end contraction." msgstr "" -msgid "Identifier of the vertex." +msgid "The returned values are ordered as follows:" msgstr "" -msgid "`Boost: Biconnected components & articulation points `__" +msgid "column ``id`` ascending when its a modified vertex." msgstr "" -msgid "wikipedia: `Biconnected component `__" +msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "" -#, fuzzy -msgid "``pgr_bandwidth`` - Experimental" -msgstr ":doc:`pgr_edwardMoore`" - -msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" +msgid "Currently there are two types of contraction methods included in this function:" msgstr "" -msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." msgstr "" -msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." msgstr "" -msgid "The bandwidth is the maximum of all these distances" +msgid "pgr_contraction(`Edges SQL`_, [**options**])" msgstr "" -#, fuzzy -msgid "The implementation is for undirected graphs" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgstr "" -msgid "Run time is 0.160789 seconds" +msgid "Returns set of |result-contract|" msgstr "" -msgid "pgr_bandwidth(`Edges SQL`_)" +msgid "Dead end and linear contraction in that order on an undirected graph." msgstr "" -msgid "Returns ``BIGINT``" +msgid "Contraction optional parameters" msgstr "" -#, fuzzy -msgid "For an undirected graph with edges." -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "``methods``" +msgstr "``methods``" -msgid "Returns a bigint ``(pgr_bandwidth)``" +msgid "``INTEGER[]``" msgstr "" -msgid "``pgr_bandwidth``" -msgstr "``pgr_bandwidth``" - -msgid "gives the bandwidth of the graph." +msgid "``ARRAY[1,2]``" msgstr "" -msgid "Undirected graph with edges before optimization." +msgid "Ordered contraction operations." msgstr "" -msgid "Undirected graph with edges after optimization." +msgid "1 = Dead end contraction" msgstr "" -msgid "`Boost: bandwidth `_" +msgid "2 = Linear contraction" msgstr "" -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +msgid "``cycles``" +msgstr "``cycles``" -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgid ":math:`1`" msgstr "" -msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "Number of times the contraction methods will be performed." msgstr "" -msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgid "``forbidden``" +msgstr "``forbidden``" + +msgid "``BIGINT[]``" msgstr "" -msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgid "``ARRAY[]::BIGINT[]``" msgstr "" -msgid "pgr_bdAstar(Combinations)" +msgid "Identifiers of vertices forbidden for contraction." msgstr "" -#, fuzzy -msgid "pgr_bdAstar(One to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "The function returns a single row. The columns of the row are:" +msgstr "" -#, fuzzy -msgid "pgr_bdAstar(Many to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "``type``" +msgstr "``type``" -#, fuzzy -msgid "pgr_bdAstar(Many to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "Type of the row." +msgstr "" -msgid "Signature change on pgr_bdAstar(One to One)" +msgid "``v`` when the row is a vertex." msgstr "" -msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" +msgid "Column ``id`` has a positive value." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "``e`` when the row is an edge." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Column ``id`` has a negative value." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "All numbers on this column are ``DISTINCT``" msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "When ``type`` = **'v'**." msgstr "" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Identifier of the modified vertex." msgstr "" -msgid "``pgr_bdAstarCost``" -msgstr "``pgr_bdAstarCost``" +msgid "When ``type`` = **'e'**." +msgstr "" -msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgid "Decreasing sequence starting from **-1**." msgstr "" -msgid "pgr_bdAstarCost(Combinations)" +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." msgstr "" -#, fuzzy -msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." -msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "Array of contracted vertex identifiers." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +msgid "Only dead end contraction" +msgstr "" -#, fuzzy -msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." -msgstr ":doc:`pgr_aStarCostMatrix` - 최단 경로의 비용 행렬 반환." +msgid "Only linear contraction" +msgstr "" -msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." +msgid "The cycle" msgstr "" -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." msgstr "" -#, fuzzy -msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." -msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgstr "" -msgid "pgr_bdDijkstra(Combinations)" +msgid "Contracting sample data" msgstr "" -#, fuzzy -msgid "pgr_bdDijkstra(One to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "In this section, building and using a contracted graph will be shown by example." +msgstr "" -#, fuzzy -msgid "pgr_bdDijkstra(Many to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "The :doc:`sampledata` for an undirected graph is used" +msgstr "" -#, fuzzy -msgid "pgr_bdDijkstra(Many to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "a dead end operation first followed by a linear operation." +msgstr "" -#, fuzzy -msgid "Signature change on pgr_bdDijkstra(One to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "Construction of the graph in the database" +msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The original graph:" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "After doing the dead end contraction operation:" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "After doing the linear contraction operation to the graph above:" msgstr "" -msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgid "The process to create the contraction graph on the database:" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgid "Add additional columns" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgid "Column." msgstr "" -msgid "Using a combinations table on an **undirected** graph" +msgid "The vertices set belonging to the vertex/edge" msgstr "" -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid "``is_contracted``" +msgstr "``is_contracted``" + +msgid "On the vertex table" msgstr "" -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgstr "" -msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." msgstr "" -msgid "pgr_bdDijkstraCost(Combinations)" +msgid "``is_new``" +msgstr "``is_new``" + +msgid "On the edge table" msgstr "" -#, fuzzy -msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." -msgstr ":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트라 알고리즘" +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Store contraction information" msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgid "Store the contraction results in a table." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Update the edges and vertices tables" msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." msgstr "" -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "Insert the new edges generated by pgr_contraction." +msgstr "" -msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgid "The contracted graph" msgstr "" -msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgid "Vertices that belong to the contracted graph." msgstr "" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "Edges that belong to the contracted graph." msgstr "" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgid "Visually:" msgstr "" -msgid "Use with :doc:`pgr_TSP`." +msgid "Using the contracted graph" msgstr "" -#, fuzzy -msgid "``pgr_bellmanFord`` - Experimental" -msgstr ":doc:`pgr_edwardMoore`" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgstr "" -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" msgstr "" -msgid "pgr_bellmanFord(Combinations)" +msgid "Case 1: Both source and target belong to the contracted graph." msgstr "" -msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." +msgid "Case 2: Source and/or target belong to an edge subgraph." msgstr "" -msgid "Process is valid for edges with both positive and negative edge weights." +msgid "Case 3: Source and/or target belong to a vertex." msgstr "" -msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgid "The final application should consider all of those cases." msgstr "" -msgid "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." +msgid "Create a view (or table) of the contracted graph:" msgstr "" -msgid "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." +msgid "Create the function that will use the contracted graph." msgstr "" -msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "" -msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +#, fuzzy +msgid "``pgr_contractionDeadEnd`` - Proposed" +msgstr ":doc:`pgr_extractVertices`" + +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "A node is considered a dead end node when:" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "On undirected graphs:" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "The number of adjacent vertices is 1." msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "On directed graphs:" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "When there is only one adjacent vertex or" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" +msgid "**options:** ``[directed, forbidden]``" msgstr "" #, fuzzy -msgid "Using a combinations table on an undirected graph" +msgid "Dead end contraction on an undirected graph." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "`Boost: Bellman Ford `__" +msgid "The green nodes are dead end nodes." msgstr "" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." msgstr "" -msgid "``pgr_betweennessCentrality`` - Experimental" +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" msgstr "" -msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgid "**Empty**" msgstr "" -msgid "Version 3.7.0" +msgid "Value = ``e`` indicating the row is an edge." msgstr "" -msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgid "A pseudo `id` of the edge." msgstr "" -msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." +msgid "Identifier of the source vertex of the current edge." msgstr "" -msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." +msgid "Identifier of the target vertex of the current edge." msgstr "" -#, fuzzy -msgid "This implementation work for both directed and undirected graphs." -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "Weight of the current edge." +msgstr "" -msgid "Running time: :math:`\\Theta(VE)`" +msgid "Dead end vertex on undirected graph" msgstr "" -msgid "Running space: :math:`\\Theta(VE)`" +msgid "They have only one adjacent node." msgstr "" -msgid "Throws when there are no edges in the graph" +msgid "Dead end vertex on directed graph" msgstr "" -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgid "The green nodes are dead end nodes" msgstr "" -msgid "Returns set of ``(vid, centrality)``" +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgid "Node" msgstr "" -msgid "Explanation" +msgid "Adjacent nodes" msgstr "" -msgid "The betweenness centrality are between parenthesis." +msgid "Dead end" msgstr "" -msgid "The leaf vertices have betweenness centrality :math:`0`." +msgid "Reason" msgstr "" -msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +#, fuzzy +msgid ":math:`6`" +msgstr ":math:`G(V,E)`" + +msgid ":math:`\\{1\\}`" msgstr "" -msgid "Removing vertex :math:`6` will create three graph components." +msgid "Yes" msgstr "" -msgid "Removing vertex :math:`10` will create two graph components." +msgid "Has only one adjacent node." msgstr "" -msgid "``vid``" -msgstr "``vid``" +#, fuzzy +msgid ":math:`7`" +msgstr ":math:`G(V,E)`" -msgid "``centrality``" -msgstr "``centrality``" +msgid ":math:`\\{2\\}`" +msgstr "" -msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +#, fuzzy +msgid ":math:`8`" +msgstr ":math:`G(V,E)`" + +#, fuzzy +msgid ":math:`\\{2, 3\\}`" +msgstr ":math:`G(V,E)`" + +msgid "Has more than one adjacent node and all edges are incoming." msgstr "" -msgid "`Boost: betweenness centrality `_" +msgid ":math:`\\{4\\}`" msgstr "" -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +#, fuzzy +msgid ":math:`10`" +msgstr ":math:`G(V,E)`" -msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +#, fuzzy +msgid ":math:`\\{4, 5\\}`" +msgstr ":math:`G(V,E)`" + +msgid "No" msgstr "" -#, fuzzy -msgid "Result columns change:" -msgstr "결과 컬럼" +msgid "Has more than one adjacent node and all edges are outgoing." +msgstr "" -msgid "``n_seq`` is removed" +msgid ":math:`1,2,3,4,5`" msgstr "" -msgid "``seq`` changed type to ``BIGINT``" +msgid "Many adjacent nodes." msgstr "" -msgid "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." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "" -msgid "Components are described by edges." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." msgstr "" -msgid "``component`` ascending." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "" -msgid "``edge`` ascending." +msgid "Step by step dead end contraction" msgstr "" -msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -msgid "Returns set of |result-component-E|" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" msgstr "" -msgid "The biconnected components of the graph" +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." msgstr "" -msgid "``component``" -msgstr "``component``" +msgid "Creating the contracted graph" +msgstr "" -msgid "Component identifier." +msgid "Steps for the creation of the contracted graph" msgstr "" -msgid "Has the value of the minimum edge identifier in the component." +msgid "Add additional columns." msgstr "" -msgid "Identifier of the edge that belongs to the ``component``." +msgid "Save results into a table." msgstr "" -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgid "The contracted vertices are not part of the contracted graph." msgstr "" -msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgid "Using when departure and destination are in the contracted graph" msgstr "" -msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." +msgid "Using when departure/destination is not in the contracted graph" msgstr "" -msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgid "Using when departure and destination are not in the contracted graph" msgstr "" -msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +#, fuzzy +msgid "``pgr_contractionHierarchies`` - Experimental" +msgstr ":doc:`pgr_stoerWagner`" + +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." msgstr "" -msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." msgstr "" -msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "The process is done on graphs having only edges with positive costs." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." msgstr "" -msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" msgstr "" -msgid "`Boost: Breadth First Search `__" +msgid "added shortcut edges, with negative identifiers;" msgstr "" -msgid "https://cp-algorithms.com/graph/01_bfs.html" +msgid "contracted nodes with an order." msgstr "" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "" -msgid "``pgr_bipartite`` - Experimental" +msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" msgstr "" -msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +msgid "Returns set of |result-contraction-hierarchies|" msgstr "" -msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgid "Contraction hierarchies optional parameters" msgstr "" -msgid "The algorithm works in undirected graph only." +msgid "True if the graph is directed, False otherwise." msgstr "" -msgid "The returned values are not ordered." +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "" -msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgid "Type of the ``id``." msgstr "" -msgid "If graph is not bipartite then algorithm returns empty set." +msgid "Column ``id`` has a positive value" msgstr "" -msgid "pgr_bipartite(`Edges SQL`_)" +msgid "Column ``id`` has a negative value" msgstr "" -msgid "When the graph is bipartite" +msgid "``metric``" +msgstr "``metric``" + +msgid "``vertex_order``" +msgstr "``vertex_order``" + +#, fuzzy +msgid "On an undirected graph" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "" -msgid "Additional Example" +msgid "building contraction hierarchies on the whole graph" msgstr "" -msgid "The odd length cyclic graph can not be bipartite." +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." msgstr "" -msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "" -msgid "Edges in blue represent odd length cycle subgraph." +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." msgstr "" -msgid "`Boost: is_bipartite `__" +msgid "We obtain the contracted graph above:" msgstr "" -msgid "`Wikipedia: bipartite graph `__" +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." msgstr "" -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +msgid "On an undirected graph with forbidden vertices" +msgstr "" -msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgid "building contraction with a set of forbidden vertices" msgstr "" -msgid "pgr_boykovKolmogorov(Combinations)" +msgid "Contraction process steps details" msgstr "" -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgid "Shortcut building process" msgstr "" -msgid "Function promoted to proposed." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." msgstr "" -msgid "Running time: Polynomial" +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Initialize the queue with a first vertices order" msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" msgstr "" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "" +#, fuzzy +msgid ":math:`v`" +msgstr ":math:`G(V,E)`" + +#, fuzzy +msgid ":math:`\\{p, r, u\\}`" +msgstr ":math:`G(V,E)`" + +#, fuzzy +msgid ":math:`p`" +msgstr ":math:`G(V,E)`" + +#, fuzzy +msgid ":math:`\\{u, v\\}`" +msgstr ":math:`G(V,E)`" + +#, fuzzy +msgid ":math:`u`" +msgstr ":math:`G(V,E)`" + +#, fuzzy +msgid ":math:`\\{p, v, w\\}`" +msgstr ":math:`G(V,E)`" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgstr "" +#, fuzzy +msgid ":math:`r`" +msgstr ":math:`G(V,E)`" -msgid "Returns set of |result-flow|" -msgstr "" +#, fuzzy +msgid ":math:`\\{v, w\\}`" +msgstr ":math:`G(V,E)`" -msgid "From vertex :math:`11` to vertex :math:`12`" -msgstr "" +#, fuzzy +msgid ":math:`w`" +msgstr ":math:`G(V,E)`" -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "" +#, fuzzy +msgid ":math:`\\{r, u\\}`" +msgstr ":math:`G(V,E)`" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" +msgid "Adjacent edges are removed." msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." msgstr "" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." msgstr "" -msgid "`Boost: Boykov Kolmogorov max flow `__" +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." msgstr "" -msgid "``pgr_breadthFirstSearch`` - Experimental" +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "" -msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgid "Build the final vertex order" msgstr "" -#, fuzzy -msgid "Version 4.0.0:" -msgstr "짧은 버전" - -msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." msgstr "" -msgid "The implementation will work on any type of graph." +msgid "Add shortcuts to the initial graph" msgstr "" -msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." msgstr "" -msgid "Running time: :math:`O(E + V)`" -msgstr "" +#, fuzzy +msgid "Use the contraction" +msgstr "소개" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "" +#, fuzzy +msgid "Build the contraction" +msgstr "소개" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "Add shortcuts and hierarchy in the existing tables" msgstr "" -msgid "**options:** ``[max_depth, directed]``" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "" -msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgid "Update and insert the results in the two tables." msgstr "" -msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgid "Use a Dijkstra shortest path algorithm on it" msgstr "" -msgid "DFS optional parameters" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" msgstr "" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." -msgstr "" +#, fuzzy +msgid "``pgr_contractionLinear`` - Proposed" +msgstr ":doc:`pgr_extractVertices`" -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" -msgid "The resulting traversal is different." +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" msgstr "" -msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." -msgstr "" +#, fuzzy +msgid "Linear contraction on an undirected graph." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "|ascending| |descending|" +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "" -msgid "ascending" +msgid "All edges adjacent will not be part of the contracted graph." msgstr "" -msgid "descending" +msgid "The red lines will be new edges of the contracted graph." msgstr "" -msgid "`Wikipedia: Breadth First Search algorithm `__" +msgid "**contraction Order**" msgstr "" -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" - -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." msgstr "" -msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." +msgid "A node connects two (or more) `linear` edges when" msgstr "" -msgid "``edge`` ascending" +msgid "The number of adjacent vertices is 2." msgstr "" -msgid "Running time: :math:`O(E * (V + E))`" +msgid "In case of a directed graph, a node is considered a `linear` node when" msgstr "" -msgid "pgr_bridges(`Edges SQL`_)" +msgid "Linearity is symmetrical." msgstr "" -msgid "Returns set of |result-edge|" +msgid "Linearity is not symmetrical" msgstr "" -msgid "The bridges of the graph" +msgid "Graph where linearity is not symmetrical." msgstr "" -msgid "Identifier of the edge that is a bridge." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "" -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "" -msgid "`Boost: Connected components `__" +msgid "The three edges can be replaced by one undirected edge" msgstr "" -msgid "``pgr_chinesePostman`` - Experimental" +msgid "Edge :math:`1 - 3`." msgstr "" -msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgid "With cost: :math:`4`." msgstr "" -msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." msgstr "" -msgid "pgr_chinesePostman(`Edges SQL`_)" +msgid "Linearity is symmetrical" msgstr "" -msgid "Returns set of |result-1-1-no-seq|" +msgid "Graph where linearity is symmetrical." msgstr "" -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgid "The four edges can be replaced by two directed edges." msgstr "" -msgid "Sequential value starting from ``1``" +msgid "Edge :math:`3 - 1`." msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgid "With cost: :math:`6`." msgstr "" -msgid "Aggregate cost from ``start_v`` to ``node``." +msgid "The four edges can be replaced by one undirected edge." msgstr "" -msgid "``pgr_chinesePostmanCost`` - Experimental" +msgid "Step by step linear contraction" msgstr "" -msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" msgstr "" -msgid "Return value when the graph if disconnected" +msgid "Contracting vertex :math:`3`," msgstr "" -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgid "The vertex :math:`3` is removed from the graph" msgstr "" -msgid "RETURNS ``FLOAT``" +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." msgstr "" -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" - -msgid "Minimum costs of a circuit path." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" -msgid "``pgr_connectedComponents``" -msgstr "``pgr_connectedComponents``" - -msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgid "Contracting vertex :math:`2`:" msgstr "" -msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgid "The vertex :math:`2` is removed from the graph" msgstr "" -msgid "Components are described by vertices" +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." msgstr "" -msgid "``component`` ascending" +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "" -msgid "pgr_connectedComponents(`Edges SQL`_)" +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." msgstr "" -msgid "Returns set of |result-component-V|" +msgid "Create the contracted graph." msgstr "" -msgid "The connected components of the graph" +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "Has the value of the minimum node identifier in the component." +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" -msgid "Identifier of the vertex that belongs to the ``component``." +msgid "Version 3.4.0" msgstr "" -msgid "Connecting disconnected components" +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." msgstr "" -msgid "wikipedia: `Connected component `__" +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." msgstr "" -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" - -msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "Version 3.8.0" +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" -msgid "New signature:" +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" msgstr "" -msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgid "where :math:`|V|` is the number of vertices," msgstr "" -msgid "New name and order of optional parameters." +msgid ":math:`m` is the maximum degree of the vertices in the graph." msgstr "" -msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" msgstr "" -msgid "Name change from ``pgr_contractGraph``" +msgid "Returns set of |result_node_order|" msgstr "" -msgid "Bug fixes" +msgid "Graph ordering of pgRouting :doc:`sampledata`" msgstr "" -msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." +msgid "Returns set of ``(seq, node)``" msgstr "" -msgid "Does not return the full contracted graph." +msgid "Sequence of the order starting from 1." msgstr "" -msgid "Only changes on the graph are returned." +msgid "New ordering in reverse order." msgstr "" -msgid "The returned values include:" +msgid "`Boost: Cuthill-McKee Ordering `__" msgstr "" -msgid "The new edges generated by linear contraction." +msgid "`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" -msgid "The modified vertices generated by dead end contraction." -msgstr "" +#, fuzzy +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr ":doc:`pgr_dagShortestPath`" -msgid "The returned values are ordered as follows:" +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." msgstr "" -msgid "column ``id`` ascending when its a modified vertex." +msgid "pgr_dagShortestPath(Combinations)" msgstr "" -msgid "column ``id`` with negative numbers descending when its a new edge." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." msgstr "" -msgid "Currently there are two types of contraction methods included in this function:" +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." msgstr "" -msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." msgstr "" -msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgid "The `agg_cost` the non included values `(v, v)` is `0`" msgstr "" -msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "Returns set of |result-contract|" +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" msgstr "" -msgid "Dead end and linear contraction in that order on an undirected graph." +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "Contraction optional parameters" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "``methods``" -msgstr "``methods``" - -msgid "``INTEGER[]``" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "``ARRAY[1,2]``" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Ordered contraction operations." +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "1 = Dead end contraction" +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" msgstr "" -msgid "2 = Linear contraction" +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" msgstr "" -msgid "``cycles``" -msgstr "``cycles``" - -msgid ":math:`1`" +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "" -msgid "Number of times the contraction methods will be performed." +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "" -msgid "``forbidden``" -msgstr "``forbidden``" - -msgid "``BIGINT[]``" -msgstr "" +#, fuzzy +msgid "Return columns" +msgstr "결과 컬럼" -msgid "``ARRAY[]::BIGINT[]``" +msgid "Making **start_vids** the same as **end_vids**" msgstr "" -msgid "Identifiers of vertices forbidden for contraction." +msgid "`Boost: DAG shortest paths `__" msgstr "" -msgid "The function returns a single row. The columns of the row are:" +msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" -msgid "``type``" -msgstr "``type``" +msgid "``pgr_degree``" +msgstr "``pgr_degree``" -msgid "Type of the row." +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." msgstr "" -msgid "``v`` when the row is a vertex." +msgid "Error messages adjustment." msgstr "" -msgid "Column ``id`` has a positive value." +msgid "New signature with only Edges SQL." msgstr "" -msgid "``e`` when the row is an edge." +msgid "Calculates the degree of the vertices of an undirected graph" msgstr "" -msgid "Column ``id`` has a negative value." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." msgstr "" -msgid "All numbers on this column are ``DISTINCT``" +msgid "A loop contributes 2 to a vertex's degree." msgstr "" -msgid "When ``type`` = **'v'**." +msgid "A vertex with degree 0 is called an isolated vertex." msgstr "" -msgid "Identifier of the modified vertex." +msgid "Isolated vertex is not part of the result" msgstr "" -msgid "When ``type`` = **'e'**." +msgid "Vertex not participating on the subgraph is considered and isolated vertex." msgstr "" -msgid "Decreasing sequence starting from **-1**." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." msgstr "" -msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgid "The code can be used as base code for the particular application requirements." msgstr "" -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" - -msgid "Array of contracted vertex identifiers." +msgid "No ordering is performed." msgstr "" -msgid "When ``type`` = **'v'**: :math:`-1`" +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" msgstr "" -msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" msgstr "" -msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgid "RETURNS SETOF |result-degree|" msgstr "" -msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgid "Edges" msgstr "" -msgid "Only dead end contraction" +msgid "example" msgstr "" -msgid "Only linear contraction" +msgid "Get the degree of the vertices defined on the edges table" msgstr "" -msgid "The cycle" -msgstr "" +#, fuzzy +msgid "Edges and Vertices" +msgstr "색인과 표" -msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgid "Extracting the vertex information" msgstr "" -msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "" -msgid "Contracting sample data" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" -msgid "In this section, building and using a contracted graph will be shown by example." +msgid "Calculate the degree of the nodes:" msgstr "" -msgid "The :doc:`sampledata` for an undirected graph is used" +msgid "`Vertex SQL`_" msgstr "" -msgid "a dead end operation first followed by a linear operation." +msgid "`Vertex SQL`_ as described below" msgstr "" -msgid "Construction of the graph in the database" -msgstr "" +msgid "``dryrun``" +msgstr "``dryrun``" -msgid "The original graph:" +msgid "When true do not process and get in a NOTICE the resulting query." msgstr "" -msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." +msgid "For the `Edges and Vertices`_ signature:" msgstr "" -msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgid "For the `Edges`_ signature:" msgstr "" -msgid "After doing the dead end contraction operation:" +msgid "Vertex SQL" msgstr "" -msgid "After doing the linear contraction operation to the graph above:" -msgstr "" +msgid "``in_edges``" +msgstr "``in_edges``" -msgid "The process to create the contraction graph on the database:" +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." msgstr "" -msgid "Add additional columns" +msgid "When missing, ``out_edges`` must exist." msgstr "" -msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" +msgid "``out_edges``" +msgstr "``out_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." msgstr "" -msgid "Column." +msgid "When missing, ``in_edges`` must exist." msgstr "" -msgid "The vertices set belonging to the vertex/edge" +msgid "Vertex identifier" msgstr "" -msgid "``is_contracted``" -msgstr "``is_contracted``" +msgid "``degree``" +msgstr "``degree``" -msgid "On the vertex table" +msgid "Number of edges that are incident to the vertex ``id``" msgstr "" -msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgid "Degree of a loop" msgstr "" -msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgid "Using the `Edges`_ signature." msgstr "" -msgid "``is_new``" -msgstr "``is_new``" - -msgid "On the edge table" +msgid "Using the `Edges and Vertices`_ signature." msgstr "" -msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgid "Degree of a sub graph" msgstr "" -msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgid "For the following is a subgraph of the :doc:`sampledata`:" msgstr "" -msgid "Store contraction information" +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" msgstr "" -msgid "Store the contraction results in a table." +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" msgstr "" -msgid "Update the edges and vertices tables" +msgid "The vertices not participating on the edge are considered isolated" msgstr "" -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "their degree is 0 in the subgraph and" msgstr "" -msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgid "their degree is not shown in the output." msgstr "" -msgid "Insert the new edges generated by pgr_contraction." +msgid "Using a vertex table" msgstr "" -msgid "The contracted graph" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." msgstr "" -msgid "Vertices that belong to the contracted graph." +msgid "Extract the vertex information and save into a table:" msgstr "" -msgid "Edges that belong to the contracted graph." +msgid "Dry run execution" msgstr "" -msgid "Visually:" +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." msgstr "" -msgid "Using the contracted graph" +msgid "The results can be used as base code to make a refinement based on the backend development needs." msgstr "" -msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgid "Finding dead ends" msgstr "" -msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." msgstr "" -msgid "Case 1: Both source and target belong to the contracted graph." +msgid "The degree of a dead end is 1." msgstr "" -msgid "Case 2: Source and/or target belong to an edge subgraph." -msgstr "" +#, fuzzy +msgid "Finding linear vertices" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Case 3: Source and/or target belong to a vertex." +msgid "The degree of a linear vertex is 2." msgstr "" -msgid "The final application should consider all of those cases." +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "" -msgid "Create a view (or table) of the contracted graph:" +msgid ":doc:`pgr_extractVertices`" +msgstr ":doc:`pgr_extractVertices`" + +msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "" -msgid "Create the function that will use the contracted graph." +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." msgstr "" -msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgid "Version 3.3.0" msgstr "" -msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." msgstr "" -#, fuzzy -msgid "``pgr_contractionDeadEnd`` - Proposed" -msgstr ":doc:`pgr_extractVertices`" +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "" -msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." msgstr "" -msgid "A node is considered a dead end node when:" +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." msgstr "" -msgid "On undirected graphs:" +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." msgstr "" -msgid "The number of adjacent vertices is 1." +msgid "It does not produce the shortest path from a root vertex to a target vertex." msgstr "" -msgid "On directed graphs:" +msgid "The aggregate cost of traversal is not guaranteed to be minimal." msgstr "" -msgid "When there is only one adjacent vertex or" +msgid "The returned values are ordered in ascending order of `start_vid`." msgstr "" -msgid "When all edges are incoming regardless of the number of adjacent vertices." +msgid "Depth First Search Running time: :math:`O(E + V)`" msgstr "" -msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" msgstr "" -msgid "**options:** ``[directed, forbidden]``" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgstr "" -#, fuzzy -msgid "Dead end contraction on an undirected graph." -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "**options:** ``[directed, max_depth]``" +msgstr "" -msgid "The green nodes are dead end nodes." +msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" -msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgid "`Boost: Depth First Search `__" msgstr "" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgid "`Boost: Undirected DFS `__" msgstr "" -msgid "**Empty**" +msgid "`Wikipedia: Depth First Search algorithm `__" msgstr "" -msgid "Value = ``e`` indicating the row is an edge." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" -msgid "A pseudo `id` of the edge." +msgid "Version 3.5.0" msgstr "" -msgid "Identifier of the source vertex of the current edge." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "Identifier of the target vertex of the current edge." +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." msgstr "" -msgid "Weight of the current edge." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" -msgid "Dead end vertex on undirected graph" +msgid "Version 3.1.0" msgstr "" -msgid "They have only one adjacent node." +#, fuzzy +msgid "pgr_dijkstra(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Version 2.2.0" msgstr "" -msgid "Dead end vertex on directed graph" +#, fuzzy +msgid "pgr_dijkstra(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_dijkstra(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_dijkstra(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" -msgid "The green nodes are dead end nodes" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Node" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "Adjacent nodes" +msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Dead end" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "Reason" +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" -#, fuzzy -msgid ":math:`6`" -msgstr ":math:`G(V,E)`" +msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" +msgstr "" -msgid ":math:`\\{1\\}`" +msgid "Directed graph with cost and reverse cost columns" msgstr "" -msgid "Yes" +msgid "1) Path from :math:`6` to :math:`10`" msgstr "" -msgid "Has only one adjacent node." +msgid "2) Path from :math:`6` to :math:`7`" msgstr "" -#, fuzzy -msgid ":math:`7`" -msgstr ":math:`G(V,E)`" +msgid "3) Path from :math:`12` to :math:`10`" +msgstr "" -msgid ":math:`\\{2\\}`" +msgid "4) Path from :math:`12` to :math:`7`" msgstr "" -#, fuzzy -msgid ":math:`8`" -msgstr ":math:`G(V,E)`" +msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" +msgstr "" -#, fuzzy -msgid ":math:`\\{2, 3\\}`" -msgstr ":math:`G(V,E)`" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgstr "" -msgid "Has more than one adjacent node and all edges are incoming." +msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" msgstr "" -msgid ":math:`\\{4\\}`" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" msgstr "" -#, fuzzy -msgid ":math:`10`" -msgstr ":math:`G(V,E)`" +msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" +msgstr "" -#, fuzzy -msgid ":math:`\\{4, 5\\}`" -msgstr ":math:`G(V,E)`" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgstr "" -msgid "No" +msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" -msgid "Has more than one adjacent node and all edges are outgoing." +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" -msgid ":math:`1,2,3,4,5`" +msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" -msgid "Many adjacent nodes." +msgid "Undirected graph with cost and reverse cost columns" msgstr "" -msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." +msgid "9) Path from :math:`6` to :math:`10`" msgstr "" -msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgid "10) Path from :math:`6` to :math:`7`" msgstr "" -msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." +msgid "11) Path from :math:`12` to :math:`10`" msgstr "" -msgid "Step by step dead end contraction" +msgid "12) Path from :math:`12` to :math:`7`" msgstr "" -msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" msgstr "" -msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" msgstr "" -msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" msgstr "" -msgid "Creating the contracted graph" +msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" msgstr "" -msgid "Steps for the creation of the contracted graph" +msgid "For **directed** graphs only with ``cost`` column" msgstr "" -msgid "Add additional columns." +msgid "Directed graph only with cost column" msgstr "" -msgid "Save results into a table." +msgid "17) Path from :math:`6` to :math:`10`" msgstr "" -msgid "The contracted vertices are not part of the contracted graph." +msgid "18) Path from :math:`6` to :math:`7`" msgstr "" -msgid "Using when departure and destination are in the contracted graph" +msgid "19) Path from :math:`12` to :math:`10`" msgstr "" -msgid "Using when departure/destination is not in the contracted graph" +msgid "20) Path from :math:`12` to :math:`7`" msgstr "" -msgid "Using when departure and destination are not in the contracted graph" +msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" msgstr "" -#, fuzzy -msgid "``pgr_contractionHierarchies`` - Experimental" -msgstr ":doc:`pgr_stoerWagner`" +msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" +msgstr "" -msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" msgstr "" -msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" msgstr "" -msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgid "For **undirected** graphs only with ``cost`` column" msgstr "" -msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgid "Undirected graph only with cost column" msgstr "" -msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgid "25) Path from :math:`6` to :math:`10`" msgstr "" -msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgid "26) Path from :math:`6` to :math:`7`" msgstr "" -msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgid "27) Path from :math:`12` to :math:`10`" msgstr "" -msgid "The process is done on graphs having only edges with positive costs." +msgid "28) Path from :math:`12` to :math:`7`" msgstr "" -msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" msgstr "" -msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" msgstr "" -msgid "added shortcut edges, with negative identifiers;" +msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" msgstr "" -msgid "contracted nodes with an order." +msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" msgstr "" -msgid "The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "Equvalences between signatures" msgstr "" -msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" -msgid "Returns set of |result-contraction-hierarchies|" +msgid "33) Using `One to One`_" msgstr "" -msgid "Contraction hierarchies optional parameters" +msgid "34) Using `One to Many`_" msgstr "" -msgid "True if the graph is directed, False otherwise." +msgid "35) Using `Many to One`_" msgstr "" -msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" +msgid "36) Using `Many to Many`_" msgstr "" -msgid "Type of the ``id``." +msgid "37) Using `Combinations`_" msgstr "" -msgid "Column ``id`` has a positive value" +msgid "`Boost: Dijkstra shortest paths `__" msgstr "" -msgid "Column ``id`` has a negative value" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" -msgid "``metric``" -msgstr "``metric``" +msgid "``pgr_dijkstraCost``" +msgstr "``pgr_dijkstraCost``" -msgid "``vertex_order``" -msgstr "``vertex_order``" +#, fuzzy +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." #, fuzzy -msgid "On an undirected graph" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "pgr_dijkstraCost(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "The following query shows the original data involved in the contraction operation on an undirected graph." -msgstr "" +#, fuzzy +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr ":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트라 알고리즘" -msgid "building contraction hierarchies on the whole graph" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "After computing the contraction hierarchies, an order is now given to the vertices," +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "We obtain the contracted graph above:" +msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." -msgstr "" +msgid "``pgr_dijkstraCostMatrix``" +msgstr "``pgr_dijkstraCostMatrix``" -msgid "On an undirected graph with forbidden vertices" +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." msgstr "" -msgid "building contraction with a set of forbidden vertices" +msgid "Using Dijkstra algorithm, calculate and return a cost matrix." msgstr "" -msgid "Contraction process steps details" +msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "Shortcut building process" -msgstr "" +msgid "``pgr_dijkstraNear``" +msgstr "``pgr_dijkstraNear``" -msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." msgstr "" -msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgid "Uses Dijkstra algorithm." msgstr "" -msgid "Initialize the queue with a first vertices order" +msgid "Works for **directed** and **undirected** graphs." msgstr "" -msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" +msgid "When there are more than one path to the same vertex with same cost:" msgstr "" -#, fuzzy -msgid ":math:`v`" -msgstr ":math:`G(V,E)`" - -#, fuzzy -msgid ":math:`\\{p, r, u\\}`" -msgstr ":math:`G(V,E)`" - -#, fuzzy -msgid ":math:`p`" -msgstr ":math:`G(V,E)`" - -#, fuzzy -msgid ":math:`\\{u, v\\}`" -msgstr ":math:`G(V,E)`" +msgid "The algorithm will return just one path" +msgstr "" -#, fuzzy -msgid ":math:`u`" -msgstr ":math:`G(V,E)`" +msgid "Optionally allows to find more than one path." +msgstr "" -#, fuzzy -msgid ":math:`\\{p, v, w\\}`" -msgstr ":math:`G(V,E)`" +msgid "When more than one path is to be returned:" +msgstr "" -#, fuzzy -msgid ":math:`r`" -msgstr ":math:`G(V,E)`" +msgid "Results are sorted in increasing order of:" +msgstr "" -#, fuzzy -msgid ":math:`\\{v, w\\}`" -msgstr ":math:`G(V,E)`" +msgid "aggregate cost" +msgstr "" -#, fuzzy -msgid ":math:`w`" -msgstr ":math:`G(V,E)`" +msgid "Within the same value of aggregate costs:" +msgstr "" -#, fuzzy -msgid ":math:`\\{r, u\\}`" -msgstr ":math:`G(V,E)`" +msgid "results are sorted by (source, target)" +msgstr "" -msgid "Adjacent edges are removed." +msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" msgstr "" -msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgid "One to Many; :math:`drt`" msgstr "" -msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgid "Many to One: :math:`drt`" msgstr "" -msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgid "Many to Many: :math:`drt * |Starting vids|`" msgstr "" -msgid "A hierarchy will now be constructed by contracting again the vertices in this order." +msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "" -msgid "Build the final vertex order" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "Add shortcuts to the initial graph" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -#, fuzzy -msgid "Use the contraction" -msgstr "소개" +msgid "**options A:** ``[directed, cap]``" +msgstr "" -#, fuzzy -msgid "Build the contraction" -msgstr "소개" +msgid "**options B:** ``[directed, cap, global]``" +msgstr "" -msgid "Add shortcuts and hierarchy in the existing tables" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "**options:** ``[directed, cap]``" msgstr "" -msgid "Update and insert the results in the two tables." +msgid "Departing on car from vertex :math:`6` find the nearest subway station." msgstr "" -msgid "Use a Dijkstra shortest path algorithm on it" +msgid "Using a **directed** graph for car routing." msgstr "" -msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" -#, fuzzy -msgid "``pgr_contractionLinear`` - Proposed" -msgstr ":doc:`pgr_extractVertices`" +msgid "The defaults used:" +msgstr "" -msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgid "`directed => true`" msgstr "" -msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgid "`cap => 1`" msgstr "" -#, fuzzy -msgid "Linear contraction on an undirected graph." -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "The result shows that station at vertex :math:`11` is the nearest." +msgstr "" -msgid "The green nodes are linear nodes and will not be part of the contracted graph." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "All edges adjacent will not be part of the contracted graph." +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" msgstr "" -msgid "The red lines will be new edges of the contracted graph." +msgid "On line `4`: using the positional parameter: `directed` set to ``true``" msgstr "" -msgid "**contraction Order**" +msgid "In line `5`: using named parameter `cap => 2`" msgstr "" -msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." msgstr "" -msgid "A node connects two (or more) `linear` edges when" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "The number of adjacent vertices is 2." +msgid "**options:** ``[directed, cap, global]``" msgstr "" -msgid "In case of a directed graph, a node is considered a `linear` node when" +msgid "Find the best pedestrian connection between two lines of buses" msgstr "" -msgid "Linearity is symmetrical." +msgid "Using an **undirected** graph for pedestrian routing" msgstr "" -msgid "Linearity is not symmetrical" +msgid "The first subway line stations are at :math:`\\{15, 16\\}`" msgstr "" -msgid "Graph where linearity is not symmetrical." +msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" -msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." +msgid "On line `4`: using the named parameter: `directed => false`" msgstr "" -msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." +msgid "`global => true`" msgstr "" -msgid "The three edges can be replaced by one undirected edge" +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." msgstr "" -msgid "Edge :math:`1 - 3`." +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "" -msgid "With cost: :math:`4`." +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgid "Find the best car connection between all the stations of two subway lines" msgstr "" -msgid "Linearity is symmetrical" +msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" -msgid "Graph where linearity is symmetrical." +msgid "The second subway line stations are at :math:`\\{15, 16\\}`" msgstr "" -msgid "The four edges can be replaced by two directed edges." +msgid "The combinations contents:" msgstr "" -msgid "Edge :math:`3 - 1`." +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" msgstr "" -msgid "With cost: :math:`6`." +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" msgstr "" -msgid "The four edges can be replaced by one undirected edge." +msgid "On line `8`: using the named parameter is `global => false`" msgstr "" -msgid "Step by step linear contraction" +msgid "From the results:" msgstr "" -msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" msgstr "" -msgid "Contracting vertex :math:`3`," +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" -msgid "The vertex :math:`3` is removed from the graph" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" msgstr "" -msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" msgstr "" -msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" -msgid "Contracting vertex :math:`2`:" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "" -msgid "The vertex :math:`2` is removed from the graph" +msgid "Dijkstra optional parameters" msgstr "" -msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgid "Near optional parameters" msgstr "" -msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgid "``cap``" +msgstr "``cap``" + +msgid "Find at most ``cap`` number of nearest shortest paths" msgstr "" -msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." +msgid "``global``" +msgstr "``global``" + +msgid "When ``true``: only ``cap`` limit results will be returned" msgstr "" -msgid "Create the contracted graph." +msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgid "``pgr_dijkstraNearCost``" +msgstr "``pgr_dijkstraNearCost``" + +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "Version 3.4.0" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "The implementation is for **undirected** graphs." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "where :math:`|V|` is the number of vertices," +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" msgstr "" -msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Returns set of |result_node_order|" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "" -msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" -msgid "Returns set of ``(seq, node)``" +msgid "``pgr_dijkstraVia``" +msgstr "``pgr_dijkstraVia``" + +msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" -msgid "Sequence of the order starting from 1." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" -msgid "New ordering in reverse order." +msgid "Route" msgstr "" -msgid "`Boost: Cuthill-McKee Ordering `__" +msgid "is a sequence of paths." msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgid "Path" msgstr "" -#, fuzzy -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr ":doc:`pgr_dagShortestPath`" +msgid "is a section of the route." +msgstr "" -msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgid "One Via" msgstr "" -msgid "pgr_dagShortestPath(Combinations)" +msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" msgstr "" -msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgid "**options:** ``[directed, strict, U_turn_on_edge]``" msgstr "" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgid "Returns set of |via-result|" msgstr "" -msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." msgstr "" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgid "Via optional parameters" msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgid "When ``true`` departing from a visited vertex will not try to avoid" msgstr "" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgid "Identifier of a path. Has value **1** for the first path." msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgid "-1 for the last node of the path." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgid "-2 for the last node of the route." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgid "``route_agg_cost``" +msgstr "``route_agg_cost``" + +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgid "The main query" msgstr "" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgid "Aggregate cost of the third path." msgstr "" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgid "Route's aggregate cost of the route at the end of the third path." msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgid "Nodes visited in the route." msgstr "" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgid "The aggregate costs of the route when the visited vertices are reached." msgstr "" -#, fuzzy -msgid "Return columns" -msgstr "결과 컬럼" +msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgstr "" -msgid "Making **start_vids** the same as **end_vids**" +msgid ":doc:`via-category`." msgstr "" -msgid "`Boost: DAG shortest paths `__" +msgid ":doc:`dijkstra-family`." msgstr "" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +#, fuzzy +msgid "pgr_drivingDistance(Single vertex)" +msgstr ":doc:`pgr_drivingDistance`" -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "" -msgid "Error messages adjustment." -msgstr "" +#, fuzzy +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr ":doc:`pgr_drivingDistance`" -msgid "New signature with only Edges SQL." +msgid "Result column name change: ``from_v`` to ``start_vid``." msgstr "" -msgid "Calculates the degree of the vertices of an undirected graph" +msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgid "Signature change:" msgstr "" -msgid "A loop contributes 2 to a vertex's degree." +msgid "pgr_drivingDistance(single vertex)" msgstr "" -msgid "A vertex with degree 0 is called an isolated vertex." +msgid "New official signature:" msgstr "" -msgid "Isolated vertex is not part of the result" +msgid "pgr_drivingDistance(multiple vertices)" msgstr "" -msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." msgstr "" -msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "" -msgid "The code can be used as base code for the particular application requirements." +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" -msgid "No ordering is performed." +msgid "**options:** [directed, equicost]" msgstr "" -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgid "Single Vertex" msgstr "" -msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgid "From vertex :math:`11` for a distance of :math:`3.0`" msgstr "" -msgid "RETURNS SETOF |result-degree|" +msgid "Multiple Vertices" msgstr "" -msgid "Edges" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" msgstr "" -msgid "example" +msgid "Driving distance optional parameters" msgstr "" -msgid "Get the degree of the vertices defined on the edges table" -msgstr "" +msgid "``equicost``" +msgstr "``equicost``" -#, fuzzy -msgid "Edges and Vertices" -msgstr "색인과 표" +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgstr "" -msgid "Extracting the vertex information" +msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgid "end-before" msgstr "" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" -msgid "Calculate the degree of the nodes:" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" -msgid "`Vertex SQL`_" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -msgid "`Vertex SQL`_ as described below" +msgid "Output columns standardized to |result_edge_color|" msgstr "" -msgid "``dryrun``" -msgstr "``dryrun``" +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgstr "" -msgid "When true do not process and get in a NOTICE the resulting query." +msgid "The implementation is for **undirected** and **loop-free** graphs" msgstr "" -msgid "For the `Edges and Vertices`_ signature:" +msgid "loop free" msgstr "" -msgid "For the `Edges`_ signature:" +msgid "no self-loops and no parallel edges." msgstr "" -msgid "Vertex SQL" +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "" -msgid "``in_edges``" -msgstr "``in_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." msgstr "" -msgid "When missing, ``out_edges`` must exist." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." msgstr "" -msgid "``out_edges``" -msgstr "``out_edges``" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgstr "" -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgid "The algorithm tries to assign the least possible color to every edge." msgstr "" -msgid "When missing, ``in_edges`` must exist." +msgid "Does not always produce optimal coloring." msgstr "" -msgid "Vertex identifier" +msgid "The returned rows are ordered in ascending order of the edge identifier." msgstr "" -msgid "``degree``" -msgstr "``degree``" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" +msgstr "" -msgid "Number of edges that are incident to the vertex ``id``" +msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" msgstr "" -msgid "Degree of a loop" +msgid "where :math:`|E|` is the number of edges in the graph," msgstr "" -msgid "Using the `Edges`_ signature." +msgid ":math:`|V|` is the number of vertices in the graph." msgstr "" -msgid "Using the `Edges and Vertices`_ signature." +msgid "pgr_edgeColoring(`Edges SQL`_)" msgstr "" -msgid "Degree of a sub graph" +msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" -msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgid "`Boost: Edge Coloring `__" msgstr "" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgid "`Wikipedia: Graph coloring `__" msgstr "" -msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "" -msgid "The vertices not participating on the edge are considered isolated" +msgid "Output columns standardized to |generic-result|" msgstr "" -msgid "their degree is 0 in the subgraph and" +msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" -msgid "their degree is not shown in the output." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." msgstr "" -msgid "Using a vertex table" +msgid "The main characterics are:" msgstr "" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgid "Calculates the edge disjoint paths between any two groups of vertices." msgstr "" -msgid "Extract the vertex information and save into a table:" +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." msgstr "" -msgid "Dry run execution" +msgid "The graph can be directed or undirected." msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "" -msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "Finding dead ends" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "The degree of a dead end is 1." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -#, fuzzy -msgid "Finding linear vertices" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "" -msgid "The degree of a linear vertex is 2." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." msgstr "" -msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "Manually assigned vertex combinations on an undirected graph." msgstr "" -msgid ":doc:`pgr_extractVertices`" -msgstr ":doc:`pgr_extractVertices`" +msgid "``pgr_edmondsKarp``" +msgstr "``pgr_edmondsKarp``" -msgid "``pgr_depthFirstSearch`` - Proposed" +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" -msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgid "pgr_edmondsKarp(Combinations)" msgstr "" -msgid "Version 3.3.0" +msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgid "Running time: :math:`O( V * E ^ 2)`" msgstr "" -msgid "The implementation works for both **directed** and **undirected** graphs." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgid "`Boost: Edmonds Karp max flow `__" msgstr "" -msgid "The returned values are ordered in ascending order of `start_vid`." +msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" -msgid "Depth First Search Running time: :math:`O(E + V)`" -msgstr "" +#, fuzzy +msgid "``pgr_edwardMoore`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "pgr_edwardMoore(Combinations)" msgstr "" -msgid "**options:** ``[directed, max_depth]``" +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." msgstr "" -msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." msgstr "" -msgid "`Boost: Depth First Search `__" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" msgstr "" -msgid "`Boost: Undirected DFS `__" +msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" -msgid "`Wikipedia: Depth First Search algorithm `__" +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." msgstr "" -msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgid "Running time:" msgstr "" -msgid "Version 3.5.0" +msgid "Worst case: :math:`O(| V | * | E |)`" msgstr "" -msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "Average case: :math:`O( | E | )`" msgstr "" -msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "Version 3.1.0" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -#, fuzzy -msgid "pgr_dijkstra(Combinations)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" -msgid "Version 2.2.0" +msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -#, fuzzy -msgid "pgr_dijkstra(One to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "Using a combinations table on an **undirected** graph." +msgstr "" -#, fuzzy -msgid "pgr_dijkstra(Many to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgstr "" -#, fuzzy -msgid "pgr_dijkstra(Many to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "``pgr_extractVertices``" +msgstr "``pgr_extractVertices``" -msgid "Signature change on pgr_dijkstra(One to One)" +msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "RETURNS SETOF |result-extract|" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "When line geometry is known" msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network." +msgid "(Optional) identifier of the edge." msgstr "" -msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "" +msgid "``geom``" +msgstr "``geom``" -msgid "Directed graph with cost and reverse cost columns" +msgid "``LINESTRING``" +msgstr "``LINESTRING``" + +msgid "Geometry of the edge." msgstr "" -msgid "1) Path from :math:`6` to :math:`10`" +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." msgstr "" -msgid "2) Path from :math:`6` to :math:`7`" +msgid "Ignored columns:" msgstr "" -msgid "3) Path from :math:`12` to :math:`10`" +msgid "``startpoint``" +msgstr "``startpoint``" + +msgid "``endpoint``" +msgstr "``endpoint``" + +msgid "When vertex geometry is known" msgstr "" -msgid "4) Path from :math:`12` to :math:`7`" +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." msgstr "" -msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" +msgid "``POINT``" +msgstr "``POINT``" + +msgid "POINT geometry of the starting vertex." msgstr "" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgid "POINT geometry of the ending vertex." msgstr "" -msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgid "When identifiers of vertices are known" msgstr "" -msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." msgstr "" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgid "``NULL`` When the ``id`` is not part of the inner query" msgstr "" -msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" +msgid "X value of the point geometry" msgstr "" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "``NULL`` When no geometry is provided" msgstr "" -msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" +msgid "Geometry of the point" msgstr "" -msgid "Undirected graph with cost and reverse cost columns" +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "" -msgid "9) Path from :math:`6` to :math:`10`" +msgid "Create a routing topology" msgstr "" -msgid "10) Path from :math:`6` to :math:`7`" +msgid "Make sure the database does not have the ``vertices_table``" msgstr "" -msgid "11) Path from :math:`12` to :math:`10`" +msgid "Clean up the columns of the routing topology to be created" msgstr "" -msgid "12) Path from :math:`12` to :math:`7`" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" -msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" +msgid "For big edge tables that are been prepared," msgstr "" -msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" +msgid "Create it as ``UNLOGGED`` and" msgstr "" -msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" +msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" msgstr "" -msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" +msgid "Inspect the vertices table" msgstr "" -msgid "For **directed** graphs only with ``cost`` column" +msgid "Create the routing topology on the edge table" msgstr "" -msgid "Directed graph only with cost column" +msgid "Updating the ``source`` information" msgstr "" -msgid "17) Path from :math:`6` to :math:`10`" +msgid "Updating the ``target`` information" msgstr "" -msgid "18) Path from :math:`6` to :math:`7`" +msgid "Inspect the routing topology" msgstr "" -msgid "19) Path from :math:`12` to :math:`10`" +msgid "**Generated topology**" msgstr "" -msgid "20) Path from :math:`12` to :math:`7`" +msgid "``pgr_findCloseEdges``" +msgstr "``pgr_findCloseEdges``" + +msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" +msgid "``partial`` option is removed." msgstr "" -msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." msgstr "" -msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "" -msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." msgstr "" -msgid "For **undirected** graphs only with ``cost`` column" +msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "" -msgid "Undirected graph only with cost column" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -msgid "25) Path from :math:`6` to :math:`10`" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "" -msgid "26) Path from :math:`6` to :math:`7`" +msgid "**options:** ``[cap, dryrun]``" msgstr "" -msgid "27) Path from :math:`12` to :math:`10`" +msgid "Returns set of |result-find|" msgstr "" -msgid "28) Path from :math:`12` to :math:`7`" +msgid "One point" msgstr "" -msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" +msgid "Get two close edges to points of interest with :math:`pid = 5`" msgstr "" -msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" +msgid "``cap => 2``" msgstr "" -msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" +msgid "Many points" msgstr "" -msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" +msgid "For each points of interests, find the closest edge." msgstr "" -msgid "Equvalences between signatures" +msgid "**point**" msgstr "" -msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The point geometry" msgstr "" -msgid "33) Using `One to One`_" +msgid "**points**" msgstr "" -msgid "34) Using `One to Many`_" +msgid "``POINT[]``" msgstr "" -msgid "35) Using `Many to One`_" +msgid "An array of point geometries" msgstr "" -msgid "36) Using `Many to Many`_" +msgid "**tolerance**" msgstr "" -msgid "37) Using `Combinations`_" +msgid "Max distance between geometries" msgstr "" -msgid "`Boost: Dijkstra shortest paths `__" +msgid "Limit output rows" msgstr "" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "When ``false`` calculations are performed." msgstr "" -msgid "``pgr_dijkstraCost``" -msgstr "``pgr_dijkstraCost``" +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgstr "" -#, fuzzy -msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." -msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." +msgid "``geometry``" +msgstr "``geometry``" -#, fuzzy -msgid "pgr_dijkstraCost(Combinations)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "The ``LINESTRING`` geometry of the edge." +msgstr "" -#, fuzzy -msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." -msgstr ":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트라 알고리즘" +msgid "When :math:`cap = 1`, it is the closest edge." +msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "At the right ``r`` of the segment." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "When the point is on the line it is considered to be on the right." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "At the left ``l`` of the segment." msgstr "" -msgid "``pgr_dijkstraCostMatrix``" -msgstr "``pgr_dijkstraCostMatrix``" +msgid "``distance``" +msgstr "``distance``" -msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgid "Distance from the point to the edge." msgstr "" -msgid "Using Dijkstra algorithm, calculate and return a cost matrix." +msgid "Original ``POINT`` geometry." msgstr "" -msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" msgstr "" -msgid "``pgr_dijkstraNear``" -msgstr "``pgr_dijkstraNear``" - -msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgid "One point in an edge" msgstr "" -msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgid "The green node is the original point." msgstr "" -msgid "Uses Dijkstra algorithm." +msgid "``geom`` has the value of the original point." msgstr "" -msgid "Works for **directed** and **undirected** graphs." +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." msgstr "" -msgid "When there are more than one path to the same vertex with same cost:" +msgid "The point is located at the left of the edge." msgstr "" -msgid "The algorithm will return just one path" +msgid "One point dry run execution" msgstr "" -msgid "Optionally allows to find more than one path." +msgid "Using the query from the previous example:" msgstr "" -msgid "When more than one path is to be returned:" +msgid "Returns ``EMPTY SET``." msgstr "" -msgid "Results are sorted in increasing order of:" +msgid "``dryrun => true``" msgstr "" -msgid "aggregate cost" +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "" -msgid "Within the same value of aggregate costs:" +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "" -msgid "results are sorted by (source, target)" +msgid "Many points in an edge" msgstr "" -msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" +msgid "The green nodes are the **original points**" msgstr "" -msgid "One to Many; :math:`drt`" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" msgstr "" -msgid "Many to One: :math:`drt`" +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." msgstr "" -msgid "Many to Many: :math:`drt * |Starting vids|`" +msgid "Many points dry run execution" msgstr "" -msgid "Combinations: :math:`drt * |Starting vids|`" +msgid "Do not process query" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "Find at most two routes to a given point" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "Using :doc:`pgr_withPoints`" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "A point of interest table" msgstr "" -msgid "**options A:** ``[directed, cap]``" +msgid "Handling points outside the graph." msgstr "" -msgid "**options B:** ``[directed, cap, global]``" +msgid "Points of interest" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." msgstr "" -msgid "**options:** ``[directed, cap]``" +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." msgstr "" -msgid "Departing on car from vertex :math:`6` find the nearest subway station." +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." msgstr "" -msgid "Using a **directed** graph for car routing." +msgid "A unique identifier." msgstr "" -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "Identifier of the nearest segment." msgstr "" -msgid "The defaults used:" +msgid "Is it on the left, right or both sides of the segment ``edge_id``." msgstr "" -msgid "`directed => true`" +msgid "Where in the segment is the point located." msgstr "" -msgid "`cap => 1`" +msgid "The geometry of the points." msgstr "" -msgid "The result shows that station at vertex :math:`11` is the nearest." +msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." msgstr "" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" -msgstr "" +msgid "``newPoint``" +msgstr "``newPoint``" -msgid "On line `4`: using the positional parameter: `directed` set to ``true``" +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." msgstr "" -msgid "In line `5`: using named parameter `cap => 2`" +msgid "Points of interest fill up" msgstr "" -msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgid "Inserting the points of interest." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Filling the rest of the table." msgstr "" -msgid "**options:** ``[directed, cap, global]``" +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "" -msgid "Find the best pedestrian connection between two lines of buses" +msgid "The points of interest:" msgstr "" -msgid "Using an **undirected** graph for pedestrian routing" -msgstr "" +msgid "``pgr_floydWarshall``" +msgstr "``pgr_floydWarshall``" -msgid "The first subway line stations are at :math:`\\{15, 16\\}`" +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" -msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," msgstr "" -msgid "On line `4`: using the named parameter: `directed => false`" +msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "" -msgid "`global => true`" +msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgid "Boost `Floyd-Warshall `_" msgstr "" -msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" -msgstr "" +msgid "``pgr_full_version``" +msgstr "``pgr_full_version``" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "Find the best car connection between all the stations of two subway lines" +msgid "Get complete details of pgRouting version information" msgstr "" -msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgid "pgr_full_version()" msgstr "" -msgid "The second subway line stations are at :math:`\\{15, 16\\}`" +msgid "RETURNS |result-version|" msgstr "" -msgid "The combinations contents:" +msgid "Information about when this documentation was built" msgstr "" -msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" -msgstr "" +msgid "``version``" +msgstr "``version``" -msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgid "pgRouting version" msgstr "" -msgid "On line `8`: using the named parameter is `global => false`" -msgstr "" +msgid "``build_type``" +msgstr "``build_type``" -msgid "From the results:" +msgid "The Build type" msgstr "" -msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" -msgstr "" +msgid "``compile_date``" +msgstr "``compile_date``" -msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "Compilation date" msgstr "" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" -msgstr "" +msgid "``library``" +msgstr "``library``" -msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgid "Library name and version" msgstr "" -msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgstr "" +msgid "``system``" +msgstr "``system``" -msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgid "Operative system" msgstr "" -msgid "Dijkstra optional parameters" -msgstr "" +msgid "``postgreSQL``" +msgstr "``postgreSQL``" -msgid "Near optional parameters" +msgid "pgsql used" msgstr "" -msgid "``cap``" -msgstr "``cap``" +msgid "``compiler``" +msgstr "``compiler``" -msgid "Find at most ``cap`` number of nearest shortest paths" +msgid "Compiler and version" msgstr "" -msgid "``global``" -msgstr "``global``" +msgid "``boost``" +msgstr "``boost``" -msgid "When ``true``: only ``cap`` limit results will be returned" +msgid "Boost version" msgstr "" -msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" -msgstr "" +msgid "``hash``" +msgstr "``hash``" -msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "Git hash of pgRouting build" msgstr "" -msgid "``pgr_dijkstraNearCost``" -msgstr "``pgr_dijkstraNearCost``" +#, fuzzy +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr ":doc:`pgr_hawickCircuits`" -msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +#, fuzzy +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." + +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "The algorithm implementation works only for directed graph" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgstr "" + +msgid "The algorithm outputs the distinct circuits present in the graph." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid ":math:`|c|` is the number of circuits in the graph." msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" +msgid "Circuits present in the pgRouting :doc:`sampledata`" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgid "Identifier of the starting vertex of the circuit." msgstr "" -msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "Identifier of the ending vertex of the circuit." msgstr "" -msgid "``pgr_dijkstraVia``" -msgstr "``pgr_dijkstraVia``" +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "" -msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgid "``pgr_isPlanar`` - Experimental" msgstr "" -msgid "Route" +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." msgstr "" -msgid "is a sequence of paths." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." msgstr "" -msgid "Path" +msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "is a section of the route." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "" -msgid "One Via" +msgid "Applicable only for **undirected** graphs." msgstr "" -msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgid "The algorithm does not considers traversal costs in the calculations." msgstr "" -msgid "**options:** ``[directed, strict, U_turn_on_edge]``" +msgid "Running time: :math:`O(|V|)`" msgstr "" -msgid "Returns set of |via-result|" +msgid "pgr_isPlanar(`Edges SQL`)" msgstr "" -msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgid "RETURNS ``BOOLEAN``" msgstr "" -msgid "Via optional parameters" +msgid "Returns a boolean ``(pgr_isplanar)``" msgstr "" -msgid "When ``true`` departing from a visited vertex will not try to avoid" +msgid "``pgr_isplanar``" +msgstr "``pgr_isplanar``" + +msgid "`true` when the graph is planar." msgstr "" -msgid "Identifier of a path. Has value **1** for the first path." +msgid "`false` when the graph is not planar." msgstr "" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." msgstr "" -msgid "-1 for the last node of the path." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." msgstr "" -msgid "-2 for the last node of the route." +msgid "`Boost: Boyer Myrvold `__" msgstr "" -msgid "``route_agg_cost``" -msgstr "``route_agg_cost``" +msgid "``pgr_johnson``" +msgstr "``pgr_johnson``" -msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +#, fuzzy +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." + +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" -msgid "The main query" +msgid "Boost `Johnson `_" msgstr "" -msgid "Aggregate cost of the third path." +#, fuzzy +msgid "``pgr_kingOrdering`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" + +#, fuzzy +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "Route's aggregate cost of the route at the end of the third path." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" -msgid "Nodes visited in the route." +#, fuzzy +msgid "The implementation targets undirected graphs." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" -msgid "The aggregate costs of the route when the visited vertices are reached." +msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" msgstr "" -msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgid "where :math:`|E|` is the number of edges," msgstr "" -msgid ":doc:`via-category`." +msgid ":math:`m` is the maximum degree among all vertices." msgstr "" -msgid ":doc:`dijkstra-family`." +msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "`Boost: King Ordering `__" msgstr "" -#, fuzzy -msgid "pgr_drivingDistance(Single vertex)" -msgstr ":doc:`pgr_drivingDistance`" +msgid "``pgr_kruskal``" +msgstr "``pgr_kruskal``" -msgid "Added ``depth`` and ``start_vid`` result columns." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" -#, fuzzy -msgid "pgr_drivingDistance(Multiple vertices)" -msgstr ":doc:`pgr_drivingDistance`" - -msgid "Result column name change: ``from_v`` to ``start_vid``." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." msgstr "" -msgid "Added ``depth`` and ``pred`` result columns." +msgid "EMPTY SET is returned when there are no edges in the graph." msgstr "" -msgid "Signature change:" +msgid "pgr_kruskal(`Edges SQL`_)" msgstr "" -msgid "pgr_drivingDistance(single vertex)" +msgid "Returns set of |result-mst|" msgstr "" -msgid "New official signature:" +msgid "Minimum spanning forest" msgstr "" -msgid "pgr_drivingDistance(multiple vertices)" +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." msgstr "" -msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgid "Added ``pred`` result columns." msgstr "" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "Returned tree nodes from a root vertex are on Breath First Search order" msgstr "" -msgid "**options:** [directed, equicost]" +msgid "Breath First Search Running time: :math:`O(E + V)`" msgstr "" -msgid "Single Vertex" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "From vertex :math:`11` for a distance of :math:`3.0`" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "Multiple Vertices" +msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" msgstr "" -msgid "Driving distance optional parameters" +msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" -msgid "``equicost``" -msgstr "``equicost``" +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgstr "" -msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgid "Returned tree nodes from a root vertex are on Depth First Search order." msgstr "" -msgid "When ``false`` which resembles several calls using the single vertex signature." +msgid "Depth First Search running time: :math:`O(E + V)`" msgstr "" -msgid "end-before" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "``pgr_edgeColoring`` - Experimental" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" msgstr "" -msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" msgstr "" -msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "The implementation is for **undirected** and **loop-free** graphs" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" -msgid "loop free" +msgid "Returned tree nodes from a root vertex are on Depth First Search order" msgstr "" -msgid "no self-loops and no parallel edges." +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "Provides the color to be assigned to all the edges present in the graph." +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +#, fuzzy +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" + +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "" -msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." msgstr "" -msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgid "The algorithm works in directed graph only." msgstr "" -msgid "The algorithm tries to assign the least possible color to every edge." +msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "Does not always produce optimal coloring." +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "" -msgid "The returned rows are ordered in ascending order of the edge identifier." +msgid "Running time: :math:`O((V+E)log(V+E))`" msgstr "" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" +msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" msgstr "" -msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" +msgid "Returns set of |result-idom|" msgstr "" -msgid "where :math:`|E|` is the number of edges in the graph," +msgid "The dominator tree with root vertex :math:`5`" msgstr "" -msgid ":math:`|V|` is the number of vertices in the graph." +msgid "SQL query as described above." msgstr "" -msgid "pgr_edgeColoring(`Edges SQL`_)" +msgid "**root vertex**" msgstr "" -msgid "Graph coloring of pgRouting :doc:`sampledata`" +msgid "Returns set of ``(seq, vertex_id, idom)``" msgstr "" -msgid "`Boost: Edge Coloring `__" +msgid "``vertex_id``" +msgstr "``vertex_id``" + +msgid "Identifier of vertex ." msgstr "" -msgid "`Wikipedia: Graph coloring `__" +msgid "``idom``" +msgstr "``idom``" + +msgid "Immediate dominator of vertex." msgstr "" -msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgid "Dominator tree of another component." msgstr "" -msgid "pgr_edgeDisjointPaths(Combinations)" +msgid "`Boost: Lengauer-Tarjan dominator `__" msgstr "" -msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgid "`Wikipedia: dominator tree `__" msgstr "" -msgid "The main characterics are:" +#, fuzzy +msgid "``pgr_lineGraph`` - Proposed" +msgstr ":doc:`pgr_analyzeGraph`" + +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "" -msgid "Calculates the edge disjoint paths between any two groups of vertices." +#, fuzzy +msgid "Works for directed and undirected graphs." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" -msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "" -msgid "The graph can be directed or undirected." +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" msgstr "" -msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "When the graph is directed the result is directed." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "When the graph is undirected the result is undirected." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "The ``reverse_cost`` is always :math:`-1`." msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" msgstr "" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgid "Returns set of |result-lineg|" msgstr "" -msgid "Manually assigned vertex combinations on an undirected graph." +msgid "For an undirected graph with edges :math:'{2,4,5,8}'" msgstr "" -msgid "``pgr_edmondsKarp``" -msgstr "``pgr_edmondsKarp``" +msgid "Gives a local identifier for the edge" +msgstr "" -msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgid "When `negative`: the source is the reverse edge in the original graph." msgstr "" -msgid "pgr_edmondsKarp(Combinations)" +msgid "When `negative`: the target is the reverse edge in the original graph." msgstr "" -msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" +msgid "Weight of the edge (``source``, ``target``)." msgstr "" -msgid "Running time: :math:`O( V * E ^ 2)`" +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Weight of the edge (``target``, ``source``)." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Given the following directed graph" msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" msgstr "" -msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgid "Representation as directed with shared edge identifiers" msgstr "" -msgid "`Boost: Edmonds Karp max flow `__" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "" -msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgid "hundreds" msgstr "" #, fuzzy -msgid "``pgr_edwardMoore`` - Experimental" -msgstr ":doc:`pgr_edwardMoore`" +msgid "the source vertex" +msgstr "소스 가져오기" -msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgid "tens" msgstr "" -msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgid "always 0, acts as a separator" msgstr "" -msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgid "units" msgstr "" -msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgid "the target vertex" msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" +msgid "In this image," msgstr "" -msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgid "Single or double head arrows represent one edge (row) on the edges table." msgstr "" -msgid "Running time:" +msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "" -msgid "Worst case: :math:`O(| V | * | E |)`" +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." msgstr "" -msgid "Average case: :math:`O( | E | )`" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "The graph can be created as follows:" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Line Graph of a directed graph represented with shared edges" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "The result is a directed graph." msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "" -msgid "Using a combinations table on an **undirected** graph." +msgid "For all the other values of ``seq`` represent one edge." msgstr "" -msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "" -msgid "``pgr_extractVertices``" -msgstr "``pgr_extractVertices``" - -msgid "``pgr_extractVertices`` — Extracts the vertices information" +msgid "When positive: the edge exists." msgstr "" -msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgid "When negative: the edge does not exist." msgstr "" -msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgid "Representation as directed with unique edge identifiers" msgstr "" -msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgid "Single head arrows represent one edge (row) on the edges table." msgstr "" -msgid "RETURNS SETOF |result-extract|" +msgid "There are no double head arrows" msgstr "" -msgid "When line geometry is known" +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." msgstr "" -msgid "(Optional) identifier of the edge." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." msgstr "" -msgid "``geom``" -msgstr "``geom``" - -msgid "``LINESTRING``" -msgstr "``LINESTRING``" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgstr "" -msgid "Geometry of the edge." +msgid "Line Graph of a directed graph represented with unique edges" msgstr "" -msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "" -msgid "Ignored columns:" +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "" -msgid "``startpoint``" -msgstr "``startpoint``" +msgid "wikipedia: `Line Graph `__" +msgstr "" -msgid "``endpoint``" -msgstr "``endpoint``" +msgid "mathworld: `Line Graph `__" +msgstr "" -msgid "When vertex geometry is known" +msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" -msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." msgstr "" -msgid "``POINT``" -msgstr "``POINT``" +msgid "Version 2.6.0" +msgstr "" -msgid "POINT geometry of the starting vertex." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." msgstr "" -msgid "POINT geometry of the ending vertex." +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" msgstr "" -msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" msgstr "" -msgid "When identifiers of vertices are known" +msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "" -msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." msgstr "" -msgid "``NULL`` When the ``id`` is not part of the inner query" +msgid "This function is for **directed** graphs." msgstr "" -msgid "X value of the point geometry" +msgid "Results are undefined when a negative vertex id is used in the input graph." msgstr "" -msgid "``NULL`` When no geometry is provided" +msgid "Results are undefined when a duplicated edge id is used in the input graph." msgstr "" -msgid "Geometry of the point" +msgid "Running time: TBD" msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgid "pgr_lineGraphFull(`Edges SQL`_)" msgstr "" -msgid "Create a routing topology" +msgid "Returns set of |result-linegf|" msgstr "" -msgid "Make sure the database does not have the ``vertices_table``" +msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" -msgid "Clean up the columns of the routing topology to be created" +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "" -msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgid "The data" msgstr "" -msgid "For big edge tables that are been prepared," +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." msgstr "" -msgid "Create it as ``UNLOGGED`` and" +msgid "|first|" msgstr "" -msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" +msgid "first" msgstr "" -msgid "Inspect the vertices table" +msgid "The transformation" msgstr "" -msgid "Create the routing topology on the edge table" +msgid "|second|" msgstr "" -msgid "Updating the ``source`` information" +msgid "second" msgstr "" -msgid "Updating the ``target`` information" +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." msgstr "" -msgid "Inspect the routing topology" +msgid "Creating table that identifies transformed vertices" msgstr "" -msgid "**Generated topology**" +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." msgstr "" -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgstr "" -msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." +msgid "Store edge results" msgstr "" -msgid "``partial`` option is removed." +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "" -msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgid "Create the mapping table" msgstr "" -msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgid "From the original graph's vertex information" msgstr "" -msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgid "Add the new vertices" msgstr "" -msgid "``EMPTY SET`` is returned on dryrun executions" +msgid "Filling the mapping table" msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "The positive vertex identifiers are the original identifiers" msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "Inspecting the vertices map" msgstr "" -msgid "**options:** ``[cap, dryrun]``" +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "" -msgid "Returns set of |result-find|" +msgid "Updating values from self loops" msgstr "" -msgid "One point" +msgid "Inspecting the vertices table" msgstr "" -msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgid "Updating from inner self loops" msgstr "" -msgid "``cap => 2``" +msgid "Adding a soft restriction" msgstr "" -msgid "Many points" +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" -msgid "For each points of interests, find the closest edge." +msgid "Identifying the restriction" msgstr "" -msgid "**point**" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "The point geometry" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" -msgid "**points**" +msgid "Adding a value to the restriction" msgstr "" -msgid "``POINT[]``" +msgid "Updating the cost to the edge:" msgstr "" -msgid "An array of point geometries" +msgid "Routing from :math:`6` to :math:`3`" msgstr "" -msgid "**tolerance**" +msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." msgstr "" -msgid "Max distance between geometries" +msgid "Simplifying leaf vertices" msgstr "" -msgid "Limit output rows" +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "" -msgid "When ``false`` calculations are performed." +msgid "Using the vertex map give the leaf verices their original value." msgstr "" -msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgid "On the source column" msgstr "" -msgid "``geometry``" -msgstr "``geometry``" +msgid "On the target column" +msgstr "" -msgid "The ``LINESTRING`` geometry of the edge." +msgid "Removing self loops on leaf nodes" msgstr "" -msgid "When :math:`cap = 1`, it is the closest edge." +msgid "The self loops of the leaf nodes are" msgstr "" -msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgid "Which can be removed" msgstr "" -msgid "Value in ``[r, l]`` indicating if the point is:" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "" -msgid "At the right ``r`` of the segment." +msgid "Complete routing graph" msgstr "" -msgid "When the point is on the line it is considered to be on the right." +msgid "Add edges from the original graph" msgstr "" -msgid "At the left ``l`` of the segment." +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "" -msgid "``distance``" -msgstr "``distance``" +msgid "Some administrative tasks to get new identifiers for the edges" +msgstr "" -msgid "Distance from the point to the edge." +msgid "Add the newly calculated edges" msgstr "" -msgid "Original ``POINT`` geometry." +msgid "Using the routing graph" msgstr "" -msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "" -msgid "One point in an edge" +msgid "Routing from :math:`5` to :math:`1`" msgstr "" -msgid "The green node is the original point." +msgid "https://en.wikipedia.org/wiki/Line_graph" msgstr "" -msgid "``geom`` has the value of the original point." +msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "" -msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgid "``pgr_makeConnected`` - Experimental" msgstr "" -msgid "The point is located at the left of the edge." +msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" -msgid "One point dry run execution" +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." msgstr "" -msgid "Using the query from the previous example:" +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." msgstr "" -msgid "Returns ``EMPTY SET``." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "" -msgid "``dryrun => true``" +msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "" -msgid "Generates a PostgreSQL ``NOTICE`` with the code used." +msgid "Returns set of |result-component-make|" msgstr "" -msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "Many points in an edge" +msgid "`Boost: make connected `__" msgstr "" -msgid "The green nodes are the **original points**" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" + +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "" -msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." msgstr "" -msgid "Many points dry run execution" +msgid "Deprecated signature" msgstr "" -msgid "Do not process query" +msgid "directed => ``false`` when used." msgstr "" -msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "" -msgid "Find at most two routes to a given point" +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." msgstr "" -msgid "Using :doc:`pgr_withPoints`" +msgid "A maximum matching is a matching that contains the largest possible number of edges." msgstr "" -msgid "A point of interest table" +msgid "There may be many maximum matchings." msgstr "" -msgid "Handling points outside the graph." +msgid "Calculates one possible maximum cardinality matching in a graph." msgstr "" -msgid "Points of interest" +msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" msgstr "" -msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." msgstr "" -msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." +msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" msgstr "" -msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgid "Using all edges." msgstr "" -msgid "A unique identifier." +msgid "SQL query, which should return a set of rows with the following columns:" msgstr "" -msgid "Identifier of the nearest segment." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." msgstr "" -msgid "Is it on the left, right or both sides of the segment ``edge_id``." +msgid "A positive value represents the existence of the edge (``target``, ``source``)" msgstr "" -msgid "Where in the segment is the point located." +msgid "Identifier of the edge in the original query." msgstr "" -msgid "The geometry of the points." +msgid "`Boost: maximum_matching `__" msgstr "" -msgid "The distance between ``geom`` and the segment ``edge_id``." +msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "" -msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." +msgid "https://en.wikipedia.org/wiki/Ackermann_function" msgstr "" -msgid "``newPoint``" -msgstr "``newPoint``" +msgid "``pgr_maxFlow``" +msgstr "``pgr_maxFlow``" -msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" -msgid "Points of interest fill up" +msgid "pgr_maxFlow(Combinations)" msgstr "" -msgid "Inserting the points of interest." +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" -msgid "Filling the rest of the table." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" -msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." +msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." msgstr "" -msgid "The points of interest:" +msgid "Running time: :math:`O( V ^ 3)`" msgstr "" -msgid "``pgr_floydWarshall``" -msgstr "``pgr_floydWarshall``" - -msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Boost `Floyd-Warshall `_" +msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "``pgr_full_version``" -msgstr "``pgr_full_version``" - -msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgid "RETURNS ``BIGINT``" msgstr "" -msgid "Get complete details of pgRouting version information" +msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "pgr_full_version()" +msgid "`Boost: push relabel max flow `__" msgstr "" -msgid "RETURNS |result-version|" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" -msgid "Information about when this documentation was built" +msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "" -msgid "``version``" -msgstr "``version``" - -msgid "pgRouting version" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "" -msgid "``build_type``" -msgstr "``build_type``" - -msgid "The Build type" +msgid "pgr_maxFlowMinCost(Combinations)" msgstr "" -msgid "``compile_date``" -msgstr "``compile_date``" - -msgid "Compilation date" +msgid "|Boost| Boost Graph Inside." msgstr "" -msgid "``library``" -msgstr "``library``" +msgid "**TODO** check which statement is true:" +msgstr "" -msgid "Library name and version" +msgid "The cost value of all input edges must be nonnegative." msgstr "" -msgid "``system``" -msgstr "``system``" +msgid "Process is done when the cost value of all input edges is nonnegative." +msgstr "" -msgid "Operative system" +msgid "Process is done on edges with nonnegative cost." msgstr "" -msgid "``postgreSQL``" -msgstr "``postgreSQL``" +msgid "Running time: :math:`O(U * (E + V * logV))`" +msgstr "" -msgid "pgsql used" +msgid "where :math:`U` is the value of the max flow." msgstr "" -msgid "``compiler``" -msgstr "``compiler``" +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr "" -msgid "Compiler and version" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "``boost``" -msgstr "``boost``" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "" -msgid "Boost version" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "``hash``" -msgstr "``hash``" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "" -msgid "Git hash of pgRouting build" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -#, fuzzy -msgid "``pgr_hawickCircuits`` - Experimental" -msgstr ":doc:`pgr_hawickCircuits`" +msgid "Returns set of |result-flow-mincost|" +msgstr "" -#, fuzzy -msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." -msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." +msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" +msgstr "" -msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "" -msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" -msgid "The algorithm implementation works only for directed graph" +msgid "**The cost value of all input edges must be nonnegative.**" msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgid "When the maximum flow is 0 then there is no flow and **0** is returned." msgstr "" -msgid "The algorithm outputs the distinct circuits present in the graph." +msgid "Uses :doc:`pgr_maxFlowMinCost`." msgstr "" -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid ":math:`|c|` is the number of circuits in the graph." +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "Id of the circuit starting from ``1``" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgid "RETURNS FLOAT" msgstr "" -msgid "Identifier of the starting vertex of the circuit." +msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "Identifier of the ending vertex of the circuit." +msgid "``pgr_pickDeliver`` - Experimental" msgstr "" -msgid "Identifier of the node in the path from a vid to next vid." +msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." msgstr "" -msgid "``pgr_isPlanar`` - Experimental" +msgid "Optimization problem is NP-hard." msgstr "" -msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgid "pickup and Delivery with time windows." msgstr "" -msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgid "All vehicles are equal." msgstr "" -msgid "This implementation use the Boyer-Myrvold Planarity Testing." +msgid "Same Starting location." msgstr "" -msgid "It will return a boolean value depending upon the planarity of the graph." +msgid "Same Ending location which is the same as Starting location." msgstr "" -msgid "Applicable only for **undirected** graphs." +msgid "All vehicles travel at the same speed." msgstr "" -msgid "The algorithm does not considers traversal costs in the calculations." +msgid "A customer is for doing a pickup or doing a deliver." msgstr "" -msgid "Running time: :math:`O(|V|)`" +msgid "has an open time." msgstr "" -msgid "pgr_isPlanar(`Edges SQL`)" +msgid "has a closing time." msgstr "" -msgid "RETURNS ``BOOLEAN``" +msgid "has a service time." msgstr "" -msgid "Returns a boolean ``(pgr_isplanar)``" +msgid "has an (x, y) location." msgstr "" -msgid "``pgr_isplanar``" -msgstr "``pgr_isplanar``" +msgid "There is a customer where to deliver a pickup." +msgstr "" -msgid "`true` when the graph is planar." +msgid "travel time between customers is distance / speed" msgstr "" -msgid "`false` when the graph is not planar." +msgid "pickup and delivery pair is done with the same vehicle." msgstr "" -msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgid "All trucks depart at time 0." msgstr "" -msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgid "the algorithm will raise an exception when" msgstr "" -msgid "`Boost: Boyer Myrvold `__" +msgid "If there is a pickup-deliver pair than violates time window" msgstr "" -msgid "``pgr_johnson``" -msgstr "``pgr_johnson``" +msgid "The speed, max_cycles, ma_capacity have illegal values" +msgstr "" -#, fuzzy -msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." -msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." +msgid "Six different initial will be optimized - the best solution found will be result" +msgstr "" -msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgid "Signature" msgstr "" -msgid "pgr johnson(`Edges SQL`_, [``directed``])" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" -msgid "Boost `Johnson `_" +msgid "**options:** ``[factor, max_cycles, initial_sol]``" msgstr "" -#, fuzzy -msgid "``pgr_kingOrdering`` - Experimental" -msgstr ":doc:`pgr_edwardMoore`" +msgid "Returns set of |result-pickdrop|" +msgstr "" -#, fuzzy -msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "Solve the following problem" +msgstr "" -msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." +msgid "Given the vehicles:" msgstr "" -msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." +msgid "and the orders:" msgstr "" -#, fuzzy -msgid "The implementation targets undirected graphs." -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "The parameters are:" +msgstr "" -msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." +msgid "A `SELECT` statement that returns the following columns:" msgstr "" -msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" +msgid "id, demand" msgstr "" -msgid "where :math:`|E|` is the number of edges," +msgid "p_node_id, p_open, p_close, [p_service,]" msgstr "" -msgid ":math:`m` is the maximum degree among all vertices." +msgid "d_node_id, d_open, d_close, [d_service,]" msgstr "" -msgid "pgr_kingOrdering(`Edges SQL`_)" +msgid "id, capacity" msgstr "" -msgid "`Boost: King Ordering `__" +msgid "start_node_id, start_open, start_close [, start_service,]" msgstr "" -msgid "``pgr_kruskal``" -msgstr "``pgr_kruskal``" +msgid "[end_node_id, end_open, end_close, end_service]" +msgstr "" -msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "EMPTY SET is returned when there are no edges in the graph." +msgid "Replaces ``pgr_gsoc_vrppdtw``" msgstr "" -msgid "pgr_kruskal(`Edges SQL`_)" +msgid "Pickup and Delivery:" msgstr "" -msgid "Returns set of |result-mst|" +msgid "capacitated" msgstr "" -msgid "Minimum spanning forest" +msgid "with time windows." msgstr "" -msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgid "have (x, y) start and ending locations." msgstr "" -msgid "Added ``pred`` result columns." +msgid "have a start and ending service times." msgstr "" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "An order is for doing a pickup and a a deliver." msgstr "" -msgid "Returned tree nodes from a root vertex are on Breath First Search order" +msgid "has (x, y) pickup and delivery locations." msgstr "" -msgid "Breath First Search Running time: :math:`O(E + V)`" +msgid "has opening and closing times for the pickup and delivery locations." msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "has a pickup and deliver service times." msgstr "" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "Six different optional different initial solutions" msgstr "" -msgid "The Minimum Spanning Tree having as root vertex :math:`6`" +msgid "the best solution found will be result" msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" msgstr "" -msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." +msgid "p_x, p_y, p_open, p_close, [p_service,]" msgstr "" -msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgid "d_x, d_y, d_open, d_close, [d_service]" msgstr "" -msgid "Returned tree nodes from a root vertex are on Depth First Search order." +msgid "start_x, start_y, start_open, start_close [, start_service, ]" msgstr "" -msgid "Depth First Search running time: :math:`O(E + V)`" +msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgstr "" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "There are 25 vehicles in the problem all with the same characteristics." msgstr "" -msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgid "The original orders" msgstr "" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "" -msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "The original data needs to be converted to an appropriate table:" msgstr "" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "The query" msgstr "" -msgid "Returned tree nodes from a root vertex are on Depth First Search order" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgstr "" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "The best solution found for **lc101** is a travel time: 828.94" msgstr "" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "This implementation's travel time: 854.54" msgstr "" -#, fuzzy -msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" -msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" +msgid "``pgr_prim``" +msgstr "``pgr_prim``" -msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" -msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." msgstr "" -msgid "The algorithm works in directed graph only." +msgid "Prim's running time: :math:`O(E * log V)`" msgstr "" -msgid "The algorithm returns *idom* of each vertex." +msgid "pgr_prim(`Edges SQL`_)" msgstr "" -msgid "If the *root vertex* not present in the graph then it returns empty set." +msgid "Minimum spanning forest of a subgraph" msgstr "" -msgid "Running time: :math:`O((V+E)log(V+E))`" +msgid "`Boost: Prim's algorithm documentation `__" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "Returns set of |result-idom|" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" -msgid "The dominator tree with root vertex :math:`5`" +msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -msgid "SQL query as described above." +msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "**root vertex**" +msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" -msgid "Returns set of ``(seq, vertex_id, idom)``" +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." msgstr "" -msgid "``vertex_id``" -msgstr "``vertex_id``" - -msgid "Identifier of vertex ." +msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "" -msgid "``idom``" -msgstr "``idom``" - -msgid "Immediate dominator of vertex." +msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "Dominator tree of another component." +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "`Boost: Lengauer-Tarjan dominator `__" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" -msgid "`Wikipedia: dominator tree `__" +msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "" -#, fuzzy -msgid "``pgr_lineGraph`` - Proposed" -msgstr ":doc:`pgr_analyzeGraph`" - -msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -#, fuzzy -msgid "Works for directed and undirected graphs." -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "``pgr_pushRelabel``" +msgstr "``pgr_pushRelabel``" -msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" -msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." +msgid "pgr_pushRelabel(Combinations)" msgstr "" -msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "" -msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" msgstr "" -msgid "When the graph is directed the result is directed." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" msgstr "" -msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" msgstr "" -msgid "When the graph is undirected the result is undirected." +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" msgstr "" -msgid "The ``reverse_cost`` is always :math:`-1`." +msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" -msgstr "" +msgid "``pgr_separateCrossing``" +msgstr "``pgr_separateCrossing``" -msgid "Returns set of |result-lineg|" +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "" -msgid "For an undirected graph with edges :math:'{2,4,5,8}'" -msgstr "" +#, fuzzy +msgid "Proposed function." +msgstr ":doc:`routingFunctions`" -msgid "Gives a local identifier for the edge" +msgid "This is an auxiliary function for separating crossing edges." msgstr "" -msgid "When `negative`: the source is the reverse edge in the original graph." +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" msgstr "" -msgid "When `negative`: the target is the reverse edge in the original graph." +msgid "RETURNS |result-separate|" msgstr "" -msgid "Weight of the edge (``source``, ``target``)." +msgid "Get the segments of the crossing geometries" msgstr "" -msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." -msgstr "" +msgid "``tolerance``" +msgstr "``tolerance``" -msgid "Weight of the edge (``target``, ``source``)." +msgid "0.01" msgstr "" -msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgid "Used in ST_Snap before ST_Split" msgstr "" -msgid "Given the following directed graph" +msgid "Get the code for further refinement." msgstr "" -msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" -msgid "Representation as directed with shared edge identifiers" -msgstr "" +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" -msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" msgstr "" -msgid "hundreds" +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." msgstr "" -#, fuzzy -msgid "the source vertex" -msgstr "소스 가져오기" +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "" -msgid "tens" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" -msgid "always 0, acts as a separator" +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "" -msgid "units" +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." msgstr "" -msgid "the target vertex" +msgid "The implementation is applicable only for **undirected** graphs." msgstr "" -msgid "In this image," +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "" -msgid "Single or double head arrows represent one edge (row) on the edges table." +msgid "Color identifiers values are in the Range :math:`[1, |V|]`" msgstr "" -msgid "The numbers in the yellow shadow are the edge identifiers." +msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "" -msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." msgstr "" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgid "The returned rows are ordered in ascending order of the vertex value." msgstr "" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" msgstr "" -msgid "The graph can be created as follows:" +msgid ":math:`d` is the maximum degree of the vertices in the graph," msgstr "" -msgid "Line Graph of a directed graph represented with shared edges" +msgid ":math:`k` is the number of colors used." msgstr "" -msgid "The result is a directed graph." +msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgid "`Boost: Sequential Vertex Coloring `__" msgstr "" -msgid "For all the other values of ``seq`` represent one edge." +#, fuzzy +msgid "``pgr_sloanOrdering`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" + +#, fuzzy +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" -msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "When positive: the edge exists." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "When negative: the edge does not exist." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "Representation as directed with unique edge identifiers" +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "Single head arrows represent one edge (row) on the edges table." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" -msgid "There are no double head arrows" +msgid "pgr_sloanOrdering(`Edges SQL`_)" msgstr "" -msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgid ":Example : Sloan ordering without specifying start vertex" msgstr "" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgid "New sloan ordering order." msgstr "" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" -msgid "Line Graph of a directed graph represented with unique edges" +msgid "`Boost: Sloan Ordering `__" msgstr "" -msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +#, fuzzy +msgid "``pgr_stoerWagner`` - Experimental" +msgstr ":doc:`pgr_stoerWagner`" + +msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "" -msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgid "Version 3.0" msgstr "" -msgid "wikipedia: `Line Graph `__" +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." msgstr "" -msgid "mathworld: `Line Graph `__" +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." msgstr "" -msgid "``pgr_lineGraphFull`` - Experimental" +msgid "Sum of the weights of all edges between the two sets is mincut." msgstr "" -msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgid "A **mincut** is a cut having the least weight." msgstr "" -msgid "Version 2.6.0" +msgid "Values are returned when graph is connected." msgstr "" -msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgid "When there is no edge in graph then EMPTY SET is return." msgstr "" -msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" -msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." msgstr "" -msgid "Forbid the routing between two edges by removing the connecting edge" +msgid "Running time: :math:`O(V*E + V^2*log V)`." msgstr "" -msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgid "pgr_stoerWagner(`Edges SQL`_)" msgstr "" -msgid "This function is for **directed** graphs." +msgid "Returns set of |result-mincut|" msgstr "" -msgid "Results are undefined when a negative vertex id is used in the input graph." +msgid "min cut of the main subgraph" msgstr "" -msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgid "Returns set of ``(seq, edge, cost, mincut)``" msgstr "" -msgid "Running time: TBD" +msgid "Edges which divides the set of vertices into two." msgstr "" -msgid "pgr_lineGraphFull(`Edges SQL`_)" +msgid "Cost to traverse of edge." msgstr "" -msgid "Returns set of |result-linegf|" +msgid "**mincut**" msgstr "" -msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" +msgid "Min-cut weight of a undirected graph." msgstr "" -msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgid "Additional Example:" msgstr "" -msgid "The data" +msgid "min cut of an edge" msgstr "" -msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgid "Using :doc:`pgr_connectedComponents`" msgstr "" -msgid "|first|" +msgid "`Boost: Stoer Wagner min cut `__" msgstr "" -msgid "first" +msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" -msgid "The transformation" +msgid "``pgr_strongComponents``" +msgstr "``pgr_strongComponents``" + +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." msgstr "" -msgid "|second|" +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." msgstr "" -msgid "second" +msgid "Works for **directed** graphs." msgstr "" -msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgid "Components are described by vertices identifiers." msgstr "" -msgid "Creating table that identifies transformed vertices" +msgid "pgr_strongComponents(`Edges SQL`_)" msgstr "" -msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgid "The strong components of the graph" msgstr "" -msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgid "`Boost: Strong components `__" msgstr "" -msgid "Store edge results" +msgid "wikipedia: `Strongly connected component `__" msgstr "" -msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" +msgid "``pgr_topologicalSort`` - Experimental" msgstr "" -msgid "Create the mapping table" +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." msgstr "" -msgid "From the original graph's vertex information" +#, fuzzy +msgid "Standardize output to |result_node_order|" +msgstr ":doc:`pgr_createVerticesTable`" + +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." msgstr "" -msgid "Add the new vertices" +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "Filling the mapping table" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "" -msgid "The positive vertex identifiers are the original identifiers" +msgid "will return one of them." msgstr "" -msgid "Inspecting the vertices map" +msgid "The returned values are ordered in topological order:" msgstr "" -msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgid "pgr_topologicalSort(`Edges SQL`_)" msgstr "" -msgid "Updating values from self loops" +msgid "Topologically sorting the graph" msgstr "" -msgid "Inspecting the vertices table" +msgid "Sequential value starting from :math:`1`" msgstr "" -msgid "Updating from inner self loops" +msgid "Linear topological ordering of the vertices" msgstr "" -msgid "Adding a soft restriction" +msgid "Additional examples" msgstr "" -msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." +msgid "Topologically sorting the one way segments" msgstr "" -msgid "Identifying the restriction" +msgid "Graph is not a DAG" msgstr "" -msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgid "`Boost: topological sort `__" msgstr "" -msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" -msgid "Adding a value to the restriction" +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "Updating the cost to the edge:" +#, fuzzy +msgid "Standardized output to |result-closure|" +msgstr ":doc:`pgr_createVerticesTable`" + +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "" -msgid "Routing from :math:`6` to :math:`3`" +msgid "Process is valid for directed graphs." msgstr "" -msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." +msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "Simplifying leaf vertices" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" -msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgid "The returned values are not ordered" msgstr "" -msgid "Using the vertex map give the leaf verices their original value." +msgid "The returned graph is compressed" msgstr "" -msgid "On the source column" +msgid "Running time: :math:`O(|V||E|)`" msgstr "" -msgid "On the target column" +msgid "The pgr_transitiveClosure function has the following signature:" msgstr "" -msgid "Removing self loops on leaf nodes" +msgid "pgr_transitiveClosure(`Edges SQL`_)" msgstr "" -msgid "The self loops of the leaf nodes are" +msgid "Returns set of |result-closure|" msgstr "" -msgid "Which can be removed" +msgid "Rechability of a subgraph" msgstr "" -msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgid "Identifier of the source of the edges" msgstr "" -msgid "Complete routing graph" +msgid "``target_array``" +msgstr "``target_array``" + +msgid "Identifiers of the targets of the edges" msgstr "" -msgid "Add edges from the original graph" +msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "Add all the edges that are not involved in the line graph process to the new table" +msgid "`Boost: transitive closure `__" msgstr "" -msgid "Some administrative tasks to get new identifiers for the edges" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "Add the newly calculated edges" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" + +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "Using the routing graph" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "When using this method for routing with soft restrictions there will be uturns" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "Routing from :math:`5` to :math:`1`" +#, fuzzy +msgid "pgr_trsp(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_trsp(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_trsp(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_trsp(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_trsp(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Deprecated signatures" msgstr "" -msgid "https://en.wikipedia.org/wiki/Line_graph" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "``pgr_makeConnected`` - Experimental" +msgid "New prototypes" msgstr "" -msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" + +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" + +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." msgstr "" -msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "" -msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgid "The general algorithm is as follows:" msgstr "" -msgid "The algorithm does not considers geometric topology in the calculations." +msgid "Execute a Dijkstra." msgstr "" -msgid "pgr_makeConnected(`Edges SQL`_)" +msgid "If the solution passes thru a restriction then." msgstr "" -msgid "Returns set of |result-component-make|" +msgid "Execute the **TRSP** algorithm with restrictions." msgstr "" -msgid "List of edges that are needed to connect the graph." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "`Boost: make connected `__" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "``pgr_maxCardinalityMatch``" -msgstr "``pgr_maxCardinalityMatch``" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "" -msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "Deprecated signature" +msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" -msgid "directed => ``false`` when used." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -msgid "Renamed from ``pgr_maximumCardinalityMatching``" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "" -msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgid "Using a combinations table on an undirected graph." msgstr "" -msgid "There may be many maximum matchings." +msgid "`Deprecated documentation `_" msgstr "" -msgid "Calculates one possible maximum cardinality matching in a graph." +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" + +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" -msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" +msgid "The paths represents the sections of the route." msgstr "" -msgid "Using all edges." +msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" -msgid "SQL query, which should return a set of rows with the following columns:" +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "" -msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgid "Execute the **TRSP** algorithm with restrictions for the paths." msgstr "" -msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "" -msgid "Identifier of the edge in the original query." +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" msgstr "" -msgid "`Boost: maximum_matching `__" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" -msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgid "Simulation of how algorithm works." msgstr "" -msgid "https://en.wikipedia.org/wiki/Ackermann_function" +msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" -msgid "``pgr_maxFlow``" -msgstr "``pgr_maxFlow``" +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +msgstr "" -msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" -msgid "pgr_maxFlow(Combinations)" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" -msgid "Calculates the maximum flow from the sources to the targets." +msgid "Getting the same result as ``pgr_trspVia``:" msgstr "" -msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgid "Example 8" msgstr "" -msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." +msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" -msgid "Running time: :math:`O( V ^ 3)`" +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +msgid ":doc:`via-category`" +msgstr ":doc:`via-category`" + +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" + +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +msgid "**Driving side** parameter is positional unnamed." msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgid "Valid values depend on kind of graph" msgstr "" -msgid "RETURNS ``BIGINT``" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "Maximum flow possible from the source(s) to the target(s)" +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" -msgid "`Boost: push relabel max flow `__" +msgid "is a sequence of paths" msgstr "" -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "Build the Graph with the new points." msgstr "" -msgid "``pgr_maxFlowMinCost`` - Experimental" +msgid "The points identifiers will be converted to negative values." msgstr "" -msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgid "The vertices identifiers will remain positive." msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" +msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "|Boost| Boost Graph Inside." +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "" -msgid "**TODO** check which statement is true:" +msgid "Execute the **TRSP** algorithm with restrictions for the path." msgstr "" -msgid "The cost value of all input edges must be nonnegative." +msgid "Do not use negative values on identifiers of the inner queries." msgstr "" -msgid "Process is done when the cost value of all input edges is nonnegative." +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" msgstr "" -msgid "Process is done on edges with nonnegative cost." +msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "" -msgid "Running time: :math:`O(U * (E + V * logV))`" +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" -msgid "where :math:`U` is the value of the max flow." +msgid "When positive it is considered a vertex identifier" msgstr "" -msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgid "When negative it is considered a point identifier" msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgid "[**driving side**]" msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +#, fuzzy +msgid "For directed graph:" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "[``r``, ``R``] for right driving side" msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgid "[``l``, ``L``] for left driving side" msgstr "" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +#, fuzzy +msgid "For undirected graph:" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "[``b``, ``B``] for both driving sides" msgstr "" -msgid "Returns set of |result-flow-mincost|" +msgid "Default values when parameter is missing:" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" +#, fuzzy +msgid "[``r``, ``R``] for directed graph" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +#, fuzzy +msgid "[``l``, ``L``] for undirected graph" +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "With points optional parameters" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgid "``details``" +msgstr "``details``" + +msgid "For showing points stops." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgid "When ``true`` the results will include the points that are in the path." msgstr "" -msgid "**The cost value of all input edges must be nonnegative.**" +msgid "When ``false`` the results will not include the points that are in the path." msgstr "" -msgid "When the maximum flow is 0 then there is no flow and **0** is returned." +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." msgstr "" -msgid "Uses :doc:`pgr_maxFlowMinCost`." +msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." msgstr "" -msgid "RETURNS FLOAT" +msgid "Usage variations" msgstr "" -msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" -msgid "``pgr_pickDeliver`` - Experimental" +msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." msgstr "" -msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" +msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" -msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." msgstr "" -msgid "Optimization problem is NP-hard." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" -msgid "pickup and Delivery with time windows." +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" -msgid "All vehicles are equal." +msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "Same Starting location." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "Same Ending location which is the same as Starting location." +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "All vehicles travel at the same speed." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "A customer is for doing a pickup or doing a deliver." +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" + +msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "has an open time." +msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "" -msgid "has a closing time." +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "has a service time." +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "has an (x, y) location." +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "There is a customer where to deliver a pickup." +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "travel time between customers is distance / speed" +msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "pickup and delivery pair is done with the same vehicle." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "All trucks depart at time 0." +msgid "Vertices of the graph are:" msgstr "" -msgid "the algorithm will raise an exception when" +msgid "**positive** when it belongs to the `Edges SQL`_" msgstr "" -msgid "If there is a pickup-deliver pair than violates time window" +msgid "**negative** when it belongs to the `Points SQL`_" msgstr "" -msgid "The speed, max_cycles, ma_capacity have illegal values" +msgid "The `agg_cost` in the non included values `(v, v)` is `0`" msgstr "" -msgid "Six different initial will be optimized - the best solution found will be result" +msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "Signature" +#, fuzzy +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgstr "최적화를 위해 중복값은 무시됩니다." + +msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "" -msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "**options:** ``[factor, max_cycles, initial_sol]``" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "Returns set of |result-pickdrop|" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "Solve the following problem" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "Given the vehicles:" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" msgstr "" -msgid "and the orders:" +msgid "**options:** ``[directed, details]``" msgstr "" -msgid "The parameters are:" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" msgstr "" -msgid "A `SELECT` statement that returns the following columns:" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "id, demand" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" msgstr "" -msgid "p_node_id, p_open, p_close, [p_service,]" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." msgstr "" -msgid "d_node_id, d_open, d_close, [d_service,]" +msgid "Two combinations" msgstr "" -msgid "id, capacity" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" msgstr "" -msgid "start_node_id, start_open, start_close [, start_service,]" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" -msgid "[end_node_id, end_open, end_close, end_service]" +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Experimental" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "Passes in front or visits with right side driving." msgstr "" -msgid "Replaces ``pgr_gsoc_vrppdtw``" +msgid "For point :math:`6` and vertex :math:`11`." msgstr "" -msgid "Pickup and Delivery:" +msgid "Passes in front or visits with left side driving." msgstr "" -msgid "capacitated" +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" -msgid "with time windows." +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" msgstr "" -msgid "have (x, y) start and ending locations." +msgid "Output columns standardized to |nksp-result|" msgstr "" -msgid "have a start and ending service times." +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" -msgid "An order is for doing a pickup and a a deliver." +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "has (x, y) pickup and delivery locations." +msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" msgstr "" -msgid "has opening and closing times for the pickup and delivery locations." +msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" msgstr "" -msgid "has a pickup and deliver service times." +msgid "Special optional parameters" msgstr "" -msgid "Six different optional different initial solutions" +msgid "``stop_on_first``" +msgstr "``stop_on_first``" + +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "" -msgid "the best solution found will be result" +msgid "When ``false`` returns at most K paths" msgstr "" -msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgid "When ``true`` returns only paths that do not violate restrictions" msgstr "" -msgid "p_x, p_y, p_open, p_close, [p_service,]" +msgid "When ``false`` returns the paths found" msgstr "" -msgid "d_x, d_y, d_open, d_close, [d_service]" +msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." msgstr "" -msgid "start_x, start_y, start_open, start_close [, start_service, ]" +msgid "No results because the only path available follows a restriction." msgstr "" -msgid "[ end_x, end_y, end_open, end_close, end_service ]" +msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" msgstr "" -msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" msgstr "" -msgid "There are 25 vehicles in the problem all with the same characteristics." +msgid "``pgr_version``" +msgstr "``pgr_version``" + +msgid "``pgr_version`` — Query for pgRouting version information." msgstr "" -msgid "The original orders" +msgid "Breaking change on result columns" msgstr "" -msgid "The data comes in different rows for the pickup and the delivery of the same order." +msgid "Support for old signature ends" msgstr "" -msgid "The original data needs to be converted to an appropriate table:" +msgid "Returns pgRouting version information." msgstr "" -msgid "The query" +msgid "pgr_version()" msgstr "" -msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgid "RETURNS ``TEXT``" msgstr "" -msgid "The best solution found for **lc101** is a travel time: 828.94" +msgid "pgRouting Version for this documentation" msgstr "" -msgid "This implementation's travel time: 854.54" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" -msgid "``pgr_prim``" -msgstr "``pgr_prim``" +msgid "**No documentation available**" +msgstr "" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "**TBD**" msgstr "" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgid "TBD" msgstr "" -msgid "Prim's running time: :math:`O(E * log V)`" +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." msgstr "" -msgid "pgr_prim(`Edges SQL`_)" +msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "Minimum spanning forest of a subgraph" +msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "`Boost: Prim's algorithm documentation `__" +msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "pgr_withPoints(Combinations)" msgstr "" -msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgid "**options:** ``[directed, details])``" msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" msgstr "" -msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "``pgr_pushRelabel``" -msgstr "``pgr_pushRelabel``" +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgstr "" -msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "pgr_pushRelabel(Combinations)" +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." msgstr "" -msgid "Renamed from ``pgr_maxFlowPushRelabel``" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +msgid "**Driving side** parameter is unnamed and compulsory." msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Output columns standardized to |matrix-result|" msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "``pgr_separateCrossing``" -msgstr "``pgr_separateCrossing``" +msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgstr "" -msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." +msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" msgstr "" -#, fuzzy -msgid "Proposed function." -msgstr ":doc:`routingFunctions`" +msgid "pgr_withpointscost(text,text,text,boolean,character)" +msgstr "" -msgid "This is an auxiliary function for separating crossing edges." +msgid "pgr_withPointsCost(Combinations)" msgstr "" -msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." msgstr "" -msgid "RETURNS |result-separate|" +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." msgstr "" -msgid "Get the segments of the crossing geometries" +msgid "The returned values are in the form of a set of |matrix-result|." msgstr "" -msgid "``tolerance``" -msgstr "``tolerance``" +msgid "**positive** when it belongs to the edges_sql" +msgstr "" -msgid "0.01" +msgid "**negative** when it belongs to the points_sql" msgstr "" -msgid "Used in ST_Snap before ST_Split" +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." msgstr "" -msgid "Get the code for further refinement." +msgid "For **undirected** graphs, the results are **symmetric**." msgstr "" -msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "``pgr_separateTouching``" -msgstr "``pgr_separateTouching``" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "" -msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" -msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgid "**options:** ``[directed]``" msgstr "" -msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." msgstr "" -msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." msgstr "" -msgid "The implementation is applicable only for **undirected** graphs." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." msgstr "" -msgid "Provides the color to be assigned to all the vertices present in the graph." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." msgstr "" -msgid "Color identifiers values are in the Range :math:`[1, |V|]`" +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "The algorithm tries to assign the least possible color to every vertex." +msgid "Being close to the graph does not mean have a shorter route." msgstr "" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgid "Right side driving topology" msgstr "" -msgid "The returned rows are ordered in ascending order of the vertex value." +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" +msgid "Left side driving topology" msgstr "" -msgid ":math:`d` is the maximum degree of the vertices in the graph," +msgid "Does not matter driving side driving topology" msgstr "" -msgid ":math:`k` is the number of colors used." +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." msgstr "" -msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "`Boost: Sequential Vertex Coloring `__" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" msgstr "" -#, fuzzy -msgid "``pgr_sloanOrdering`` - Experimental" -msgstr ":doc:`pgr_edwardMoore`" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgstr "" -#, fuzzy -msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "Returning a **symmetrical** cost matrix" +msgstr "" -msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." +msgid "Using the default ``side`` value on the **points_sql** query" msgstr "" -msgid "Finds a pseudoperipheral vertex pair to determine good starting points" +msgid "Using the default ``driving side`` value" msgstr "" -msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "" -msgid "Typically produces better orderings than simple breadth-first approaches." +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "pgr_sloanOrdering(`Edges SQL`_)" +msgid "Output columns standardized to |result-spantree|" msgstr "" -msgid ":Example : Sloan ordering without specifying start vertex" +msgid "When ``details`` is ``false``:" msgstr "" -msgid "New sloan ordering order." +msgid "Points reached within the distance are not included." msgstr "" -msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." +msgid "Deprecated signatures:" msgstr "" -msgid "`Boost: Sloan Ordering `__" +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." msgstr "" -#, fuzzy -msgid "``pgr_stoerWagner`` - Experimental" -msgstr ":doc:`pgr_stoerWagner`" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgstr "" -msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" msgstr "" -msgid "Version 3.0" +msgid "**options A:** ``[directed, details]``" msgstr "" -msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgid "**options B:** ``[directed, details, equicost]``" msgstr "" -msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" msgstr "" -msgid "Sum of the weights of all edges between the two sets is mincut." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." msgstr "" -msgid "A **mincut** is a cut having the least weight." +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" msgstr "" -msgid "Values are returned when graph is connected." +msgid "**options:** ``[directed, details, equicost]``" msgstr "" -msgid "When there is no edge in graph then EMPTY SET is return." +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" msgstr "" -msgid "When the graph is unconnected then EMPTY SET is return." +msgid "Negative values represent a point" msgstr "" -msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "Running time: :math:`O(V*E + V^2*log V)`." +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "pgr_stoerWagner(`Edges SQL`_)" +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "Returns set of |result-mincut|" +msgid "Driving side does not matter" msgstr "" -msgid "min cut of the main subgraph" +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." msgstr "" -msgid "Returns set of ``(seq, edge, cost, mincut)``" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" + +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" -msgid "Edges which divides the set of vertices into two." +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "Cost to traverse of edge." +#, fuzzy +msgid "pgr_withPointsKSP(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_withPointsKSP(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_withPointsKSP(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_withPointsKSP(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" -msgid "**mincut**" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "Min-cut weight of a undirected graph." +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "Additional Example:" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "min cut of an edge" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "Using :doc:`pgr_connectedComponents`" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" msgstr "" -msgid "`Boost: Stoer Wagner min cut `__" +msgid "**options:** ``[directed, heap_paths, details]``" msgstr "" -msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." msgstr "" -msgid "``pgr_strongComponents``" -msgstr "``pgr_strongComponents``" +msgid "For a directed graph." +msgstr "" -msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgid "No details are given about distance of other points of the query." msgstr "" -msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." +msgid "No heap paths are returned." msgstr "" -msgid "Works for **directed** graphs." +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "Components are described by vertices identifiers." +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" msgstr "" -msgid "pgr_strongComponents(`Edges SQL`_)" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" msgstr "" -msgid "The strong components of the graph" +msgid "Using a combinations table on an **directed** graph" msgstr "" -msgid "`Boost: Strong components `__" +msgid "Number of required paths" msgstr "" -msgid "wikipedia: `Strongly connected component `__" +msgid "withPointsKSP optional parameters" msgstr "" -msgid "``pgr_topologicalSort`` - Experimental" +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgid "Left driving side" msgstr "" -msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." msgstr "" -msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgid "Right driving side" msgstr "" -msgid "For optimization purposes, if there are more than one answer, the function" +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." msgstr "" -msgid "will return one of them." +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" + +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." msgstr "" -msgid "The returned values are ordered in topological order:" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "pgr_topologicalSort(`Edges SQL`_)" +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" -msgid "Topologically sorting the graph" +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" msgstr "" -msgid "Sequential value starting from :math:`1`" +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." msgstr "" -msgid "Linear topological ordering of the vertices" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "Additional examples" +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" -msgid "Topologically sorting the one way segments" +msgid "Prim - Family of functions" msgstr "" -msgid "Graph is not a DAG" +msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." msgstr "" -msgid "`Boost: topological sort `__" +msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." msgstr "" -msgid "``pgr_transitiveClosure`` - Experimental" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" msgstr "" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "Boost: `Prim's algorithm `__" msgstr "" -msgid "Transforms the input directed graph into the transitive closure of the graph." +msgid "Wikipedia: `Prim's algorithm `__" msgstr "" -msgid "Process is valid for directed graphs." +msgid "Proposed Functions" msgstr "" -msgid "The transitive closure of an undirected graph produces a cluster graph" +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" -msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgid "Reference" msgstr "" -msgid "The returned values are not ordered" +msgid "Release Notes" msgstr "" -msgid "The returned graph is compressed" +msgid "To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" -msgid "Running time: :math:`O(|V||E|)`" +msgid "Mayors" msgstr "" -msgid "The pgr_transitiveClosure function has the following signature:" +msgid "pgRouting 4" msgstr "" -msgid "pgr_transitiveClosure(`Edges SQL`_)" +msgid "Minors 4.x" msgstr "" -msgid "Returns set of |result-closure|" +msgid "pgRouting 4.1" msgstr "" -msgid "Rechability of a subgraph" +msgid "pgRouting 4.0" msgstr "" -msgid "Identifier of the source of the edges" +msgid "pgRouting 4.0.1 Release Notes" msgstr "" -msgid "``target_array``" -msgstr "``target_array``" - -msgid "Identifiers of the targets of the edges" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" msgstr "" -msgid "Identifiers of the vertices that are reachable from vertex v." +msgid "Bug Fixes" msgstr "" -msgid "`Boost: transitive closure `__" +msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "`#3034 `__: metrics driver should not be using new" msgstr "" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" +msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "`#3040 `__: Check and fix cppcoreguidelines-virtual-class-destructor" msgstr "" -#, fuzzy -msgid "pgr_trsp(One to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#3039 `__: Check and fix cppcoreguidelines-special-member-functions" +msgstr "" -#, fuzzy -msgid "pgr_trsp(One to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#3038 `__: Check and fix cppcoreguidelines-prefer-member-initializer" +msgstr "" -#, fuzzy -msgid "pgr_trsp(Many to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#3037 `__: Check and fix cppcoreguidelines-init-variables" +msgstr "" -#, fuzzy -msgid "pgr_trsp(Many to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#3035 `__: Pass by reference on existing drivers" +msgstr "" #, fuzzy -msgid "pgr_trsp(Combinations)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "Administration" +msgstr "소개" -msgid "Deprecated signatures" +msgid "`#3031 `__: pgtap license to Creative commons and License texts standardization" msgstr "" -msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "pgRouting 4.0.0 Release Notes" msgstr "" -msgid "New prototypes" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" -msgid "pgr_trspViaVertices" -msgstr "pgr_trspViaVertices" - -msgid "pgr_trspViaEdges" -msgstr "pgr_trspViaEdges" - -msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgid "Build" msgstr "" -msgid "It does no guarantee the shortest path as it might contain restriction paths." +msgid "C++ standard is std17" msgstr "" -msgid "The general algorithm is as follows:" +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" -msgid "Execute a Dijkstra." +msgid "The code is not yet modified to use std17:" msgstr "" -msgid "If the solution passes thru a restriction then." +msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions." +msgid "The user's documentation is built by default." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The doxygen documentation is built by default." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "For developers:" msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Tidy checks are done on CI." msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Documentation build" msgstr "" -msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." +msgid "The doxygen documentation is built by default" msgstr "" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "The HTML documentation is built by default" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgid "`WITH-DOC` is not used anymore" msgstr "" -msgid "Using a combinations table on an undirected graph." +msgid "User Documentation is not built when" msgstr "" -msgid "`Deprecated documentation `_" +msgid "Sphinx is not found" msgstr "" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" - -msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgid "When all Sphinx formats are OFF" msgstr "" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" msgstr "" -msgid "The paths represents the sections of the route." +msgid "When all languages are OFF" msgstr "" -msgid "Execute a :doc:`pgr_dijkstraVia`." +msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" msgstr "" -msgid "For the set of sub paths of the solution that pass through a restriction then" +msgid "Documentation output location: ``build/doc/_build/``" msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions for the paths." +msgid "For example: for HTML output is on `build/doc/_build/html` directory" msgstr "" -msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." +msgid "Developers' Documentation is not built when" msgstr "" -msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgid "Doxygen is not found" msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" -msgid "Simulation of how algorithm works." +msgid "Summary of changes by function" msgstr "" -msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" -msgstr "" +msgid "pgr_aStar" +msgstr "pgr_aStar" -msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." -msgstr "" +msgid "pgr_aStarCost" +msgstr "pgr_aStarCost" -msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." -msgstr "" +msgid "pgr_bandwidth" +msgstr "pgr_bandwidth" -msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" +msgid "pgr_bdAstar" +msgstr "pgr_bdAstar" -msgid "Getting the same result as ``pgr_trspVia``:" -msgstr "" +msgid "pgr_bdAstarCost" +msgstr "pgr_bdAstarCost" -msgid "Example 8" -msgstr "" +msgid "pgr_bdDijkstra" +msgstr "pgr_bdDijkstra" -msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." -msgstr "" +msgid "pgr_bdDijkstraCost" +msgstr "pgr_bdDijkstraCost" -msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." -msgstr "" +msgid "pgr_bellmanFord" +msgstr "pgr_bellmanFord" -msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "" +msgid "pgr_binaryBreadthFirstSearch" +msgstr "pgr_binaryBreadthFirstSearch" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." -msgstr "" +msgid "pgr_bipartite" +msgstr "pgr_bipartite" -msgid ":doc:`via-category`" -msgstr ":doc:`via-category`" +msgid "pgr_boykovKolmogorov" +msgstr "pgr_boykovKolmogorov" -msgid "``pgr_trspVia_withPoints``" -msgstr "``pgr_trspVia_withPoints``" +msgid "pgr_breadthFirstSearch" +msgstr "pgr_breadthFirstSearch" -msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." +msgid ":" msgstr "" -msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" +msgid "pgr_contraction" +msgstr "pgr_contraction" -msgid "is a sequence of paths" -msgstr "" +msgid "pgr_dagShortestPath" +msgstr "pgr_dagShortestPath" -msgid "Build the Graph with the new points." -msgstr "" +msgid "pgr_depthFirstSearch" +msgstr "pgr_depthFirstSearch" -msgid "The points identifiers will be converted to negative values." -msgstr "" +msgid "pgr_dijkstra" +msgstr "pgr_dijkstra" -msgid "The vertices identifiers will remain positive." -msgstr "" +msgid "pgr_dijkstraCost" +msgstr "pgr_dijkstraCost" -msgid "Execute a :doc:`pgr_withPointsVia`." -msgstr "" +msgid "pgr_dijkstraNear" +msgstr "pgr_dijkstraNear" -msgid "For the set of paths of the solution that pass through a restriction then" -msgstr "" +msgid "pgr_dijkstraNearCost" +msgstr "pgr_dijkstraNearCost" -msgid "Execute the **TRSP** algorithm with restrictions for the path." -msgstr "" +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" -msgid "Do not use negative values on identifiers of the inner queries." -msgstr "" +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" -msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" -msgstr "" +msgid "pgr_edgeDisjointPaths" +msgstr "pgr_edgeDisjointPaths" -msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgstr "" +msgid "pgr_edmondsKarp" +msgstr "pgr_edmondsKarp" -msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." -msgstr "" +msgid "pgr_edwardMoore" +msgstr "pgr_edwardMoore" -msgid "When positive it is considered a vertex identifier" -msgstr "" +msgid "pgr_kingOrdering" +msgstr "pgr_kingOrdering" -msgid "When negative it is considered a point identifier" -msgstr "" +msgid "pgr_KSP" +msgstr "pgr_KSP" -msgid "[**driving side**]" -msgstr "" +msgid "pgr_maxCardinalityMatch" +msgstr "pgr_maxCardinalityMatch" -msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" -msgstr "" +msgid "pgr_maxFlow" +msgstr "pgr_maxFlow" -#, fuzzy -msgid "For directed graph:" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "pgr_pushRelabel" +msgstr "pgr_pushRelabel" -msgid "[``r``, ``R``] for right driving side" -msgstr "" +msgid "pgr_sequentialVertexColoring" +msgstr "pgr_sequentialVertexColoring" + +msgid "pgr_sloanOrdering" +msgstr "pgr_sloanOrdering" -msgid "[``l``, ``L``] for left driving side" -msgstr "" +msgid "pgr_topologicalSort" +msgstr "pgr_topologicalSort" -#, fuzzy -msgid "For undirected graph:" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "pgr_transitiveClosure" +msgstr "pgr_transitiveClosure" -msgid "[``b``, ``B``] for both driving sides" -msgstr "" +msgid "pgr_trsp" +msgstr "pgr_trsp" -msgid "Default values when parameter is missing:" -msgstr "" +msgid "pgr_trspVia" +msgstr "pgr_trspVia" #, fuzzy -msgid "[``r``, ``R``] for directed graph" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "pgr_trspVia_withPoints" +msgstr ":doc:`pgr_trspVia_withPoints`" #, fuzzy -msgid "[``l``, ``L``] for undirected graph" -msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +msgid "pgr_trsp_withPoints" +msgstr ":doc:`pgr_trspVia_withPoints`" -msgid "With points optional parameters" -msgstr "" +msgid "pgr_TSP" +msgstr "pgr_TSP" -msgid "``details``" -msgstr "``details``" +msgid "pgr_TSPeuclidean" +msgstr "pgr_TSPeuclidean" -msgid "For showing points stops." -msgstr "" +msgid "pgr_turnRestrictedPath" +msgstr "pgr_turnRestrictedPath" -msgid "When ``true`` the results will include the points that are in the path." -msgstr "" +msgid "pgr_withPoints" +msgstr "pgr_withPoints" -msgid "When ``false`` the results will not include the points that are in the path." -msgstr "" +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" -msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." -msgstr "" +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" -msgid "Use ``pgr_findCloseEdges`` for points on the fly" -msgstr "" +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" -msgid "Using :doc:`pgr_findCloseEdges`:" -msgstr "" +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" -msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." -msgstr "" +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "Functions promoted to official" msgstr "" -msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgid "`#2701 `__: pgr_trsp" msgstr "" -msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgid "`#2701 `__: pgr_trspVia" msgstr "" -msgid "Usage variations" +msgid "`#2701 `__: pgr_trspVia_withPoints" msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +msgid "`#2701 `__: pgr_trsp_withPoints" msgstr "" -msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." +msgid "`#2700 `__: pgr_withPoints" msgstr "" -msgid "The algorithm performs a :doc:`pgr_withPointsVia`" +msgid "`#2700 `__: pgr_withPointsCost" msgstr "" -msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgid "`#2700 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "`#2700 `__: pgr_withPointsDD" msgstr "" -msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "`#2700 `__: pgr_withPointsKSP" msgstr "" -msgid "Getting the same result as ``pgr_trspVia_withPoints``:" +msgid "`#2700 `__: pgr_withPointsVia" msgstr "" -msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "" -msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" - -msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." +msgid "Signatures promoted to official" msgstr "" -msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgid "`#2718 `__: pgr_aStar(Combinations)" msgstr "" -msgid "Vertices of the graph are:" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" msgstr "" -msgid "**positive** when it belongs to the `Edges SQL`_" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" msgstr "" -msgid "**negative** when it belongs to the `Points SQL`_" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" msgstr "" -msgid "The `agg_cost` in the non included values `(v, v)` is `0`" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" msgstr "" -msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" msgstr "" -#, fuzzy -msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." -msgstr "최적화를 위해 중복값은 무시됩니다." - -msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgid "`#2718 `__: pgr_KSP(All signatures)" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" msgstr "" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" msgstr "" -msgid "**options:** ``[directed, details]``" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" -msgstr "" +#, fuzzy +msgid "New experimental functions." +msgstr ":doc:`routingFunctions`" -msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgid "Metrics" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgid "`#2951 `__: pgr_bandwidth" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgid "Ordering" msgstr "" -msgid "Two combinations" +msgid "`#2954 `__: pgr_kingOrdering" msgstr "" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgid "`#2955 `__: pgr_sloanOrdering" msgstr "" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." +msgid "SQL signatures and output standardization" msgstr "" -msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2904 `__: Standardize output columns of functions with different output" msgstr "" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgid "columns within overloads" msgstr "" -msgid "Passes in front or visits with right side driving." -msgstr "" +#, fuzzy +msgid "Standardized to |short-generic-result|" +msgstr ":doc:`pgr_createVerticesTable`" -msgid "For point :math:`6` and vertex :math:`11`." +msgid "`#2905 `__: pgr_withPoints" msgstr "" -msgid "Passes in front or visits with left side driving." +msgid "`#2906 `__: pgr_bdDijkstra" msgstr "" -msgid "``pgr_turnRestrictedPath`` - Experimental" +msgid "`#2907 `__: pgr_bellmanFord" msgstr "" -msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" msgstr "" -msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" +msgid "`#2910 `__: pgr_edwardMoore" msgstr "" -msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "`#2913 `__: pgr_dagShortestPath" msgstr "" -msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +msgid "Standardized to |matrix-result|" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" +msgid "`#2905 `__: pgr_withPointsCost" msgstr "" -msgid "Special optional parameters" +msgid "`#2905 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "``stop_on_first``" -msgstr "``stop_on_first``" +#, fuzzy +msgid "Standardized to |generic-result|" +msgstr ":doc:`pgr_createVerticesTable`" -msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgid "`#2909 `__: pgr_edgeDisjointPaths" msgstr "" -msgid "When ``false`` returns at most K paths" +msgid "`#2909 `__: pgr_turnRestrictedPath" msgstr "" -msgid "When ``true`` returns only paths that do not violate restrictions" +msgid "Standardized to |result_edge_color|" msgstr "" -msgid "When ``false`` returns the paths found" +msgid "`#2924 `__: pgr_edgeColoring" msgstr "" -msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." +msgid "Standardized to |result_node_color|" msgstr "" -msgid "No results because the only path available follows a restriction." +msgid "`#2924 `__: pgr_bipartite" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" +msgid "`#2927 `__: pgr_sequentialVertexColoring" msgstr "" -msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" +msgid "Standardized to |result-spantree|" msgstr "" -msgid "``pgr_version``" -msgstr "``pgr_version``" +msgid "`#2931 `__: pgr_breadthFirstSearch" +msgstr "" -msgid "``pgr_version`` — Query for pgRouting version information." +msgid "`#2931 `__: pgr_depthFirstSearch" msgstr "" -msgid "Breaking change on result columns" +#, fuzzy +msgid "Standardized to |result_node_order|" +msgstr ":doc:`pgr_createVerticesTable`" + +msgid "`#2934 `__: pgr_topologicalSort" msgstr "" -msgid "Support for old signature ends" +#, fuzzy +msgid "Standardized to |result-closure|" +msgstr ":doc:`pgr_createVerticesTable`" + +msgid "`#2934 `__: pgr_transitiveClosure" msgstr "" -msgid "Returns pgRouting version information." +msgid "Removal of SQL deprecated signatures" msgstr "" -msgid "pgr_version()" +msgid "`#2798 `__: pgr_contraction" msgstr "" -msgid "RETURNS ``TEXT``" +msgid "`#2683 `__: pgr_trsp" msgstr "" -msgid "pgRouting Version for this documentation" +msgid "`#2683 `__: pgr_trspVia" msgstr "" -msgid "``pgr_vrpOneDepot`` - Experimental" +msgid "`#2888 `__: pgr_findCloseEdges" msgstr "" -msgid "**No documentation available**" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "**TBD**" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "TBD" +msgid "`#2890 `__: pgr_withPointsDD" msgstr "" -msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgid "`#2895 `__: pgr_withPointsKSP" msgstr "" -msgid "pgr_withPoints(Combinations)" +msgid "`#2899 `__: pgr_maxCardinalityMatch" msgstr "" -msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgid "`#2901 `__: pgr_TSP" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgid "`#2901 `__: pgr_TSPeuclidean" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgid "Removal of SQL deprecated functions" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgid "`#2681 `__: pgr_trspViaedges" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgid "`#2682 `__: pgr_trspViaVertices" msgstr "" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgid "`#2748 `__: pgr_alphaShape" msgstr "" -msgid "**options:** ``[directed, details])``" +msgid "`#2751 `__: pgr_createTopology" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgid "`#2752 `__: pgr_analyzeGraph" msgstr "" -msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgid "`#2755 `__: pgr_analyzeOneWay" msgstr "" -msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgid "`#2827 `__: pgr_createVerticesTable" msgstr "" -msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgid "`#2886 `__: pgr_nodeNetwork" msgstr "" -msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +#, fuzzy +msgid "Removal of SQL deprecated internal functions" +msgstr ":doc:`routingFunctions`" + +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" msgstr "" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" msgstr "" -msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" msgstr "" -msgid "pgr_withPointsCost(Combinations)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" msgstr "" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" msgstr "" -msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" msgstr "" -msgid "The returned values are in the form of a set of |matrix-result|." +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "**positive** when it belongs to the edges_sql" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" msgstr "" -msgid "**negative** when it belongs to the points_sql" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" msgstr "" -msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "" -msgid "For **undirected** graphs, the results are **symmetric**." +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgid "`#2861 `__ _pgr_endPoint(geometry)" msgstr "" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" msgstr "" -msgid "**options:** ``[directed]``" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" msgstr "" -msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" msgstr "" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" msgstr "" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" msgstr "" -msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" msgstr "" -msgid "Being close to the graph does not mean have a shorter route." +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" msgstr "" -msgid "Right side driving topology" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "" -msgid "Left side driving topology" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" msgstr "" -msgid "Does not matter driving side driving topology" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" msgstr "" -msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" msgstr "" -msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" msgstr "" -msgid "Returning a **symmetrical** cost matrix" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" msgstr "" -msgid "Using the default ``side`` value on the **points_sql** query" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "Using the default ``driving side`` value" +msgid "`#2861 `__ _pgr_quote_ident(text)" msgstr "" -msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2861 `__ _pgr_startPoint(geometry)" msgstr "" -msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "Output columns standardized to |result-spantree|" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "When ``details`` is ``false``:" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" msgstr "" -msgid "Points reached within the distance are not included." +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" msgstr "" -msgid "Deprecated signatures:" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" msgstr "" -msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "**options A:** ``[directed, details]``" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "**options B:** ``[directed, details, equicost]``" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgid "`#2861 `__ _pgr_versionLess(text,text)" msgstr "" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "**options:** ``[directed, details, equicost]``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" msgstr "" -msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "Negative values represent a point" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" msgstr "" -msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" msgstr "" -msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "Driving side does not matter" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" msgstr "" -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +msgid "Summary of functions and signatures no longer on pgrouting" +msgstr "" -msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(One to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(Many to One)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(Many to Many)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "" -#, fuzzy -msgid "pgr_withPointsKSP(Combinations)" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgstr "" -msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" msgstr "" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "**options:** ``[directed, heap_paths, details]``" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "For a directed graph." +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "No details are given about distance of other points of the query." +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "No heap paths are returned." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "Using a combinations table on an **directed** graph" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "Number of required paths" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "withPointsKSP optional parameters" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "Left driving side" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "Right driving side" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" msgstr "" -msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" msgstr "" -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgstr "" -msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "Prim - Family of functions" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgid "Removal of unused C/C++ code" msgstr "" -msgid "Boost: `Prim's algorithm `__" +msgid "Refactor the Script to build the update PostgreSQL file." msgstr "" -msgid "Wikipedia: `Prim's algorithm `__" +msgid "One process & driver for:" msgstr "" -msgid "Proposed Functions" +msgid "allpairs: johnson and Floyd-Warshall" msgstr "" -msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid "Shortest path: Dijkstra and withPoints using Dijkstra" msgstr "" -msgid "Reference" +msgid "Deprecation of internal C/C++ functions" msgstr "" -msgid "Release Notes" +msgid "Deprecated functions are substituted by new function." msgstr "" -msgid "To see the full list of changes check the list of `Git commits `_ on Github." +#, fuzzy +msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" +msgstr ":doc:`pgr_drivingDistance`" + +#, fuzzy +msgid "_pgr_withPointsDD => _pgr_withPointsddv4" +msgstr ":doc:`pgr_trspVia_withPoints`" + +msgid "_pgr_kruskal => _pgr_kruskalv4" msgstr "" -msgid "Mayors" +msgid "_pgr_prim => _pgr_primv4" msgstr "" -msgid "pgRouting 4" +msgid "_pgr_dijkstra => _pgr_dijkstra_v4" msgstr "" -msgid "Minors 4.x" +#, fuzzy +msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" +msgstr ":doc:`pgr_withPoints`" + +#, fuzzy +msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgstr ":doc:`pgr_trspVia_withPoints`" + +#, fuzzy +msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" +msgstr ":doc:`pgr_trspVia_withPoints`" + +msgid "Internal C/C++ functions in legacy" msgstr "" -msgid "pgRouting 4.1" +msgid "`#2683 `__ _trsp" msgstr "" -msgid "pgRouting 4.1.0 Release Notes" +msgid "`#2683 `__ _v4trsp" msgstr "" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgid "`#2748 `__ _pgr_alphaShape" msgstr "" -msgid "No changes yet" +msgid "`#2913 `__ _pgr_dagShortestPath" msgstr "" msgid "pgRouting 3" @@ -14850,9 +14914,6 @@ msgstr "" msgid "Removed unnecessary column seq" msgstr "" -msgid "Bug Fixes" -msgstr "" - msgid "pgr_maxFlowMinCost" msgstr "pgr_maxFlowMinCost" diff --git a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po index 3f617a0ea7..4d82920b0f 100644 --- a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-12-10 19:55+0000\n" +"POT-Creation-Date: 2026-03-04 00:25+0000\n" "PO-Revision-Date: 2025-12-08 08:47+0000\n" "Last-Translator: Daniel Nylander \n" "Language-Team: Swedish \n" @@ -3522,12644 +3522,14151 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" -msgid "pgRouting 4.0" -msgstr "pgRouting 4.0" +msgid "pgRouting 4.1.0 Release Notes" +msgstr "Versionsinformation för pgRouting 4.1.0" -msgid "pgRouting 4.0.0-alpha1 Release Notes" -msgstr "pgRouting 4.0.0-alpha1 Release Notes" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.1.0 `__" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" +msgid "Code enhancements" +msgstr "Förbättringar av koden" -msgid "Build" -msgstr "Skapa" +#, fuzzy +msgid "`#3049 `__: Use enumeration on drivers and process." +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid "C++ standard is std17" -msgstr "C++-standarden är std17" +#, fuzzy +msgid "`#3054 `__: Change error message when edges_sql is empty" +msgstr "`#1640 `__: pgr_withPoints misslyckas när points_sql är tom" -msgid "Using this standard, all supported toolchains across our CI matrix will work." -msgstr "Med hjälp av denna standard kommer alla verktygskedjor som stöds i vår CI-matris att fungera." +#, fuzzy +msgid "`#3055 `__: bdDijkstra: use the shortest_path process and driver" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "The code is not yet modified to use std17:" -msgstr "Koden är ännu inte modifierad för att använda std17:" +#, fuzzy +msgid "`#3056 `__: edwardMoore: use the shortest_path process and driver" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." -msgstr "Om det behövs: ``-DCMAKE_CXX_STANDARD=14`` för att sänka standarden." +#, fuzzy +msgid "`#3060 `__: dagShortestPath: use the shortest_path process and driver" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "The user's documentation is built by default." -msgstr "Användarens dokumentation byggs som standard." +#, fuzzy +msgid "`#3064 `__: Astar: create and use a process and driver for Astar" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "The doxygen documentation is built by default." -msgstr "Doxygen-dokumentationen byggs som standard." +#, fuzzy +msgid "`#3075 `__: Spanning tree: create and use a process and driver" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "For developers:" -msgstr "För utvecklare:" +#, fuzzy +msgid "`#3086 `__: MaxFlow: create and use a process and driver" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." -msgstr "Ställ in `-DUSE_CLANG_TIDY=ON` för clang tidy-kontroller." +#, fuzzy +msgid "`#3089 `__: edgeDisjoint and bellmanFord use shortestPath driver and process" +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid "Tidy checks are done on CI." -msgstr "Ordentliga kontroller görs på CI." +msgid "All releases" +msgstr "Alla utgåvor" -msgid "Documentation build" -msgstr "Uppbyggnad av dokumentation" +msgid "Kruskal - Family of functions" +msgstr "Kruskal - Familj av funktioner" -msgid "The doxygen documentation is built by default" -msgstr "Doxygen-dokumentationen byggs som standard" +msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgstr "Kruskals algoritm är en \"greedy minimum spanning tree\"-algoritm som i varje cykel hittar och lägger till den kant med minsta möjliga vikt som förbinder två träd i skogen." -msgid "The HTML documentation is built by default" -msgstr "HTML-dokumentationen byggs som standard" +msgid "**The main Characteristics are:**" +msgstr "**De viktigaste egenskaperna är:**" -msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" -msgstr "HTML-dokumentationen för översatta språk (en, es, sv, zh_Hans) byggs som standard" +msgid "The total weight of all the edges in the tree or forest is minimized." +msgstr "Den totala vikten för alla kanter i trädet eller skogen minimeras." -msgid "`WITH-DOC` is not used anymore" -msgstr "`WITH-DOC` används inte längre" +msgid "Kruskal's running time: :math:`O(E * log E)`" +msgstr "Kruskals körtid: :math:`O(E * log E)`" -msgid "User Documentation is not built when" -msgstr "Användardokumentation skapas inte när" +msgid "Metrics - Family of functions" +msgstr "Metrics - Familj av funktioner" -msgid "Sphinx is not found" -msgstr "Sfinxen hittas inte" +msgid "Migration guide" +msgstr "Migrationsguide" -msgid "When all Sphinx formats are OFF" -msgstr "När alla Sphinx-format är OFF" +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." +msgstr "Flera funktioner har förändringar på signaturerna och/eller har ersatts av nya funktioner." -msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" -msgstr "För att inte bygga HTML-standardformat: `-DBUILD_HTML=OFF`" +msgid "Results can be different because of the changes." +msgstr "Resultaten kan bli annorlunda på grund av förändringarna." -msgid "When all languages are OFF" -msgstr "När alla språk är OFF" +msgid "All deprecated functions will be removed on next major version 4.0.0" +msgstr "Alla föråldrade funktioner kommer att tas bort i nästa större version 4.0.0" -msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" -msgstr "Om du bara vill bygga på engelska: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" +msgid "Migration to standardized columns" +msgstr "Migrering till standardiserade kolumner" -msgid "Documentation output location: ``build/doc/_build/``" -msgstr "Plats för dokumentationsutdata: ``build/doc/_build/``" +msgid "There has been an effort to standardize function output columns names and types." +msgstr "Det har gjorts försök att standardisera namn och typer på kolumner för funktionsutdata." -msgid "For example: for HTML output is on `build/doc/_build/html` directory" -msgstr "Till exempel: för HTML-utdata i katalogen `build/doc/_build/html`" +msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgid "Developers' Documentation is not built when" -msgstr "Dokumentation för utvecklare byggs inte när" +msgid "|matrix-result|" +msgstr "|matrix-result|" -msgid "Doxygen is not found" -msgstr "Doxygen hittas inte" +msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" -msgstr "Om du inte vill bygga Doxygen-dokumentation: `-DBUILD_DOXY=OFF`" +msgid "|short-generic-result|" +msgstr "|short-generic-result|" -msgid "Summary of changes by function" -msgstr "Sammanfattning av förändringar per funktion" +msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgid "pgr_aStar" -msgstr "pgr_aStar" +msgid "|result-spantree|" +msgstr "|result-spantree|" -msgid "Combinations signature promoted to official." -msgstr "Kombinationer signatur befordrad till tjänsteman." +msgid "Function" +msgstr "Funktion" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +msgid ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_dijkstra`" -msgid "pgr_bandwidth" -msgstr "pgr_bandwidth" +msgid "`Migration of single path functions`_" +msgstr "`Migrering av funktioner med en enda sökväg`_" -msgid "New experimental function." -msgstr "Ny experimentell funktion." +msgid ":doc:`pgr_aStar`" +msgstr ":doc:`pgr_aStar`" -msgid "pgr_bdAstar" -msgstr "pgr_bdAstar" +msgid ":doc:`pgr_bdAstar`" +msgstr ":doc:`pgr_bdAstar`" -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" +msgid ":doc:`pgr_drivingDistance`" +msgstr ":doc:`pgr_drivingDistance`" -msgid "pgr_bdDijkstra" -msgstr "pgr_bdDijkstra" +msgid "`Migration of spanning tree functions`_" +msgstr "`Migration av funktioner för spänningsträd`_" -msgid "Output columns standardized to |short-generic-result|" -msgstr "Utdatakolumner standardiserade till |short-generic-result|" +msgid ":doc:`pgr_withPointsDD`" +msgstr ":doc:`pgr_withPointsDD`" -msgid "pgr_bdDijkstraCost" -msgstr "pgr_bdDijkstraCost" +msgid ":doc:`pgr_bdDijkstra`" +msgstr ":doc:`pgr_bdDijkstra`" -msgid "pgr_bellmanFord" -msgstr "pgr_bellmanFord" +msgid ":doc:`pgr_binaryBreadthFirstSearch`" +msgstr ":doc:`pgr_binaryBreadthFirstSearch`" -msgid "pgr_binaryBreadthFirstSearch" -msgstr "pgr_binaryBreadthFirstSearch" +msgid ":doc:`pgr_bipartite`" +msgstr ":doc:`pgr_bipartite`" -msgid "pgr_bipartite" -msgstr "pgr_bipartite" +msgid "`Migration of output column name change`_" +msgstr "`Migrering av namnändring för utdatakolumn`_" -msgid "Output columns standardized to |result_node_color|" -msgstr "Utdatakolumner standardiserade till |result_node_color|" +msgid ":doc:`pgr_breadthFirstSearch`" +msgstr ":doc:`pgr_breadthFirstSearch`" -msgid "pgr_boykovKolmogorov" -msgstr "pgr_boykovKolmogorov" +msgid ":doc:`pgr_depthFirstSearch`" +msgstr ":doc:`pgr_depthFirstSearch`" -msgid "pgr_breadthFirstSearch" -msgstr "pgr_breadthFirstSearch" +msgid ":doc:`pgr_edgeColoring`" +msgstr ":doc:`pgr_edgeColoring`" -msgid ":" -msgstr ":" +msgid "`Migration of multiple paths functions`_" +msgstr "`Migrering av funktioner för flera sökvägar`_" -msgid "Standardizing output columns to |result-spantree|" -msgstr "Standardisering av utdatakolumner till |result-spantree|" +msgid ":doc:`pgr_sequentialVertexColoring`" +msgstr ":doc:`pgr_sequentialVertexColoring`" -msgid "pgr_contraction" -msgstr "pgr_contraction" +msgid ":doc:`pgr_topologicalSort`" +msgstr ":doc:`pgr_topologicalSort`" -msgid "Breaking change, signatures no longer available:" -msgstr "Förändring på gång, signaturer inte längre tillgängliga:" +msgid ":doc:`pgr_withPoints`" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`Migration of cost functions`_" +msgstr "`Migrering av kostnadsfunktioner`_" -msgid "pgr_dagShortestPath" -msgstr "pgr_dagShortestPath" +msgid "Migration of cost functions" +msgstr "Migrering av kostnadsfunktioner" -msgid "pgr_depthFirstSearch" -msgstr "pgr_depthFirstSearch" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for cost functions` är |matrix-result|" -msgid "pgr_dijkstra" -msgstr "pgr_dijkstra" +msgid "The following functions need to be migrated when they are being used in an application." +msgstr "Följande funktioner måste migreras när de används i en applikation." -msgid "pgr_dijkstraCost" -msgstr "pgr_dijkstraCost" +msgid "Version" +msgstr "Version" -msgid "pgr_dijkstraNear" -msgstr "pgr_dijkstraNear" +msgid "From" +msgstr "Från" -msgid "Function promoted to official." -msgstr "Funktion befordrad till tjänsteman." +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" -msgid "pgr_dijkstraNearCost" -msgstr "pgr_dijkstraNearCost" +msgid "v < 4.0" +msgstr "v < 4.0" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" +msgid "|matrix-pid|" +msgstr "|matrix-pid|" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" -msgid "Output columns standardized to |result_edge_color|" -msgstr "Utgångskolumner standardiserade till |result_edge_color|" +msgid "**to** |matrix-result|" +msgstr "**till** |matrix-result|" -msgid "pgr_edgeDisjointPaths" -msgstr "pgr_edgeDisjointPaths" +msgid "Migration of |matrix-pid|" +msgstr "Migrering av |matrix-pid|" -msgid "Output columns standardized to |generic-result|" -msgstr "Utdatakolumner standardiserade till |generic-result|" +msgid "Signatures to be migrated:" +msgstr "Signaturer som ska migreras:" -msgid "pgr_edmondsKarp" -msgstr "pgr_edmondsKarp" +msgid "One to One" +msgstr "En till en" -msgid "pgr_edwardMoore" -msgstr "pgr_edwardMoore" +msgid "One to Many" +msgstr "En till många" -msgid "Version 3.2.0" -msgstr "Version 3.2.0" +msgid "Many to One" +msgstr "Många till en" -msgid "New experimental signature:" -msgstr "Ny experimentell signatur:" +msgid "Many to Many" +msgstr "Många till många" -msgid "pgr_edwardMoore(Combinations)" -msgstr "pgr_edwardMoore(Combinations)" +msgid "Combinations" +msgstr "Kombinationer" -msgid "Version 3.0.0" -msgstr "Version 3.0.0" +msgid "Breaking change" +msgstr "Brytande förändring" + +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgstr "Om du använder ``pgr_withPointsCost``: kolumnnamn måste ändras efter uppdatering av pgRouting" + +msgid "New output columns are |matrix-result|" +msgstr "Nya utdatakolumner är |matrix-result|" + +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgstr "För att få kolumnnamnen i den gamla versionen: byt namn på ``start_vid`` till ``start_pid`` och ``end_vid`` till ``end_pid``." + +msgid "Examples" +msgstr "Exempel" + +msgid "Examples for One to One for cost functions" +msgstr "Exempel på One to One för kostnadsfunktioner" + +msgid "Using ``pgr_withPointsCost``" +msgstr "Använda ``pgr_withPointsCost``" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "from" +msgstr "från" + +msgid "to" +msgstr "till" + +msgid "Examples for One to Many for cost functions" +msgstr "Exempel på One to Many för kostnadsfunktioner" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "Examples for Many to One for cost functions" +msgstr "Exempel på Many to One för kostnadsfunktioner" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "Examples for Many to Many for cost functions" +msgstr "Exempel på Many to Many för kostnadsfunktioner" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "Examples for Combinations for cost functions" +msgstr "Exempel på Kombinationer för kostnadsfunktioner" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "Migration of multiple paths functions" +msgstr "Migrering av funktioner för flera banor" + +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |nksp-result|" + +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" + +msgid "v < 3.6" +msgstr "v < 3.6" + +msgid ":ref:`from_ksp_result`" +msgstr ":ref:`from_ksp_result`" + +msgid "``pgr_edgeDisjointPaths``" +msgstr "``pgr_edgeDisjointPaths``" + +msgid ":ref:`from_result_disjoint`" +msgstr ":ref:`from_result_disjoint`" + +msgid "Migration of |ksp-result|" +msgstr "Migrering av |ksp-result|" + +msgid "|nksp-result|" +msgstr "|nksp-result|" + +msgid "Before updating pgRouting, enumerate the |ksp-result|" +msgstr "Innan du uppdaterar pgRouting, räkna upp |ksp-result|" + +msgid "One to One example using ``pgr_KSP``" +msgstr "Ett till ett exempel med hjälp av ``pgr_KSP``" + +msgid "Using `this `__ example." +msgstr "Använda `det här `__ exemplet." + +msgid "Migration of |result-disjoint|" +msgstr "Migrering av |result-disjoint|" + +msgid "Before updating pgRouting, enumerate the |result-disjoint|" +msgstr "Innan du uppdaterar pgRouting, räkna upp |result-disjoint|" + +msgid "Skip when applicable, ``start_vid``" +msgstr "Hoppa över när det är tillämpligt, ``start_vid``" + +msgid "Skip when applicable, ``end_vid``" +msgstr "Hoppa över när det är tillämpligt, ``end_vid``" + +msgid "One to One example using ``pgr_edgeDisjointPaths``" +msgstr "Ett till ett exempel med hjälp av ``pgr_edgeDisjointPaths``" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "Before updating pgRouting enumerate the columns: |ksp-result|" +msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |ksp-result|" + +msgid "Migration of single path functions" +msgstr "Migrering av funktioner med en enda sökväg" + +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |short-generic-result|" + +msgid "``pgr_dijkstra``" +msgstr "``pgr_dijkstra``" + +msgid "v < 3.5" +msgstr "v < 3.5" + +msgid "|old-generic-result|" +msgstr "|old-generic-result|" + +msgid "``pgr_aStar``" +msgstr "``pgr_aStar``" + +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" + +msgid "``pgr_bellmanFord``" +msgstr "``pgr_bellmanFord``" + +msgid "``pgr_dagShortestPath``" +msgstr "``pgr_dagShortestPath``" + +msgid "|result-1-1|" +msgstr "|result-1-1|" + +msgid "``pgr_edwardMoore``" +msgstr "``pgr_edwardMoore``" + +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" + +msgid "|old-pid-result|" +msgstr "|old-pid-result|" + +msgid "Migration of |old-generic-result|" +msgstr "Migrering av |old-generic-result|" + +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" +msgstr "Innan du uppdaterar pgRouting, räkna upp motsvarande kolumner i signaturen" + +msgid "Migration of |old-pid-result|" +msgstr "Migrering av |old-pid-result|" + +msgid "To get the old version column names, depending on the signature:" +msgstr "För att få den gamla versionen kolumnnamn, beroende på signaturen:" + +msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" +msgstr "Filtrera bort kolumnerna: ``start_vid`` och/eller ``slut_vid``" + +msgid "Rename the columns:" +msgstr "Byt namn på kolumnerna:" + +msgid "``start_vid`` to ``start_pid``" +msgstr "``start_vid`` till ``start_pid``" + +msgid "``end_vid`` to ``end_pid``" +msgstr "``slut_vid`` till ``slut_pid``" + +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" +msgstr "Om du använder ``pgr_withPoints``: kolumnnamn måste ändras efter uppdatering av pgRouting" + +msgid "Migration of |result-1-1|" +msgstr "Migrering av |result-1-1|" + +msgid "To get the old version column names:" +msgstr "För att få kolumnnamnen i den gamla versionen:" + +msgid "Filter out the columns: ``start_vid`` and ``end_vid``" +msgstr "Filtrera bort kolumnerna: ``start_vid`` och ``slut_vid``" + +msgid "Examples with One to One with one route result" +msgstr "Exempel med en till en med en rutt resultat" + +msgid "Using ``pgr_aStar``" +msgstr "Använda ``pgr_aStar``" + +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." + +msgid "Before updating pgRouting enumerate the columns: |result-1-1|" +msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |result-1-1|" + +msgid "Using ``pgr_bdDijkstra``" +msgstr "Använda ``pgr_bdDijkstra``" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "Using ``pgr_DAGshortestPath``" +msgstr "Använda ``pgr_DAGshortestPath``" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "This applies to all signatures of ``pgr_DAGshortestPath``" +msgstr "Detta gäller för alla signaturer av ``pgr_DAGshortestPath``" + +msgid "Examples for One to Many with one route result" +msgstr "Exempel för One to Many med ett ruttresultat" + +msgid "Using ``pgr_bdAstar``" +msgstr "Använda ``pgr_bdAstar``" + +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." + +msgid "Before updating pgRouting enumerate the columns: |result-1-m|" +msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-1-m|" + +msgid "Using ``pgr_withPoints``" +msgstr "Använda ``pgr_withPoints``" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "|pid-1-m|" +msgstr "|pid-1-m|" + +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." +msgstr "För att få de gamla signaturkolumnnamnen: filtrera bort kolumnen ``start_vid`` och byt namn på ``end_vid`` till ``end_pid``." + +msgid "Examples for Many to One with one route result" +msgstr "Exempel för Many to One med ett ruttresultat" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "Before updating pgRouting enumerate the columns: |result-m-1|" +msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-m-1|" + +msgid "Using ``pgr_dijkstra``" +msgstr "Använda ``pgr_dijkstra``" + +msgid "Migrating `this v3.4 `__ example." +msgstr "Migrering av `this v3.4 `__ exempel." + +msgid "Examples for Many to Many with one route result" +msgstr "Exempel för Many to Many med ett ruttresultat" + +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." + +msgid "|pid-m-m|" +msgstr "|pid-m-m|" + +msgid "Examples for combinations with one route result" +msgstr "Exempel på kombinationer med ett vägresultat" + +msgid "Migrating `this v3.8 `this `__ example." +msgstr "Migrering av `this v3.8 `this `__ exempel." + +msgid "Migration of spanning tree functions" +msgstr "Migrering av spanning tree-funktioner" + +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for spanning tree functions` är |result-spantree|" + +msgid "``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" + +msgid ":ref:`from_result_dij_dd`" +msgstr ":ref:`from_result_dij_dd`" + +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" + +msgid ":ref:`from_result_generic_no_seq`" +msgstr ":ref:`from_result_generic_no_seq`" + +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" + +msgid "v < 3.7" +msgstr "v < 3.7" + +msgid ":ref:`from_result_bfs`" +msgstr ":ref:`from_result_bfs`" + +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" + +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" + +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" + +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" + +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" + +msgid "``pgr_breadthFisrtSearch``" +msgstr "``pgr_breadthFisrtSearch``" + +msgid "v < 4.0.0" +msgstr "v < 4.0.0" + +msgid "``pgr_depthFisrtSearch``" +msgstr "``pgr_depthFisrtSearch``" + +msgid "to |result-spantree|" +msgstr "till |result-spantree|" + +msgid "Migration from |result-bfs|." +msgstr "Migrering från |result-bfs|." + +msgid "Single vertex" +msgstr "Enstaka toppunkt" + +msgid "Multiple vertices" +msgstr "Flera hörn" + +msgid "Before updating pgRouting enumerate the columns: |result-bfs|" +msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|" + +msgid "Single vertex example using ``pgr_kruskalDD``" +msgstr "Exempel på enstaka toppar med ``pgr_kruskalDD``" + +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrering av `this v3.6 `__ exempel." + +msgid "Before updating pgRouting enumerate the columns: |result-bfs|." +msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|." + +msgid "Multiple vertices example using ``pgr_kruskalDFS``" +msgstr "Exempel på flera vertikaler med hjälp av ``pgr_kruskalDFS``" + +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrering av `this v3.6 `__ exempel." + +msgid "Migration from |result-dij-dd|" +msgstr "Migrering från |result-dij-dd|" + +msgid "Migration depends on the signature." +msgstr "Migrationen beror på signaturen." + +msgid "For single vertex:" +msgstr "För enstaka toppunkt:" + +msgid "Before updating pgRouting, enumerate |result-1-1| columns" +msgstr "Innan du uppdaterar pgRouting, räkna upp |result-1-1| kolumner" + +msgid "For multiple vertices:" +msgstr "För flera hörn:" + +msgid "Changes must be done after updating pgRouting." +msgstr "Ändringar måste göras efter uppdatering av pgRouting." + +msgid "To get the old version column names |result-dij-dd-m|:" +msgstr "För att få den gamla versionens kolumnnamn |result-dij-dd-m|:" + +msgid "filter out the column ``pred`` and ``depth`` and" +msgstr "filtrera bort kolumnen ``pred`` och ``depth`` och" + +msgid "rename ``start_vid`` to ``from_v``." +msgstr "byt namn på ``start_vid`` till ``from_v``." + +msgid "Single vertex example using ``pgr_drivingDistance``" +msgstr "Exempel på en enda vertex med hjälp av ``pgr_drivingDistance``" + +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." + +msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" +msgstr "Innan du uppdaterar pgRouting, räkna upp kolumnerna |result-1-1-no-seq|" + +msgid "Multiple vertices example using ``pgr_drivingDistance``" +msgstr "Exempel på flera toppar med hjälp av ``pgr_drivingDistance``" + +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." + +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgstr "För att få den gamla versionens kolumnnamn |result-dij-dd-m|: filtrera bort kolumnen ``pred`` och ``depth`` och byt namn på ``start_vid`` till ``from_v``." + +msgid "Migration of |result-generic-no-seq|" +msgstr "Migrering av |result-generic-no-seq|" + +msgid "After updating pgRouting:" +msgstr "Efter uppdatering av pgRouting:" + +msgid "Enumerate |result-1-1-no-seq| columns" +msgstr "Räkna upp kolumner för resultat-1-1-icke-seq" + +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgstr "Använd ett icke namngivet giltigt värde för **körsida** efter parametern **avstånd**." + +msgid "Enumerate |result-m-1-no-seq| columns" +msgstr "Räkna upp |result-m-1-no-seq|-kolumner" + +msgid "Default value of **driving side** parameter" +msgstr "Standardvärde för parametern **förarsida**" + +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." +msgstr "*parametern *driving side** är namnlös och giltiga värden skiljer sig åt för riktade och oriktade grafer." + +msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" +msgstr "I riktad graf: giltiga värden är [``r``, ``R``, ``l``, ``L``]" + +msgid "Default value = 'r';" +msgstr "Standardvärde = \"r\";" + +msgid "In undirected graph: valid values are [``b``, ``B``]" +msgstr "I en oriktad graf: giltiga värden är [``b``, ``B``]" + +msgid "Default value = 'b';" +msgstr "Standardvärde = \"b\";" + +msgid "Single vertex example using ``pgr_withPointsDD``" +msgstr "Exempel på en enda toppunkt med ``pgr_withPointsDD``" + +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." + +msgid "Multiple vertices example using ``pgr_withPointsDD``" +msgstr "Exempel på flera vertikaler med hjälp av ``pgr_withPointsDD``" + +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." + +msgid "Migration of output column name change" +msgstr "Ändring av namn på utdatakolumn vid migrering" + +msgid "The standardized result columns:" +msgstr "De standardiserade resultatkolumnerna:" + +msgid "|result_edge_color|" +msgstr "|result_edge_color|" + +msgid "|result_node_color|" +msgstr "|result_node_color|" + +msgid "|result_node_order|" +msgstr "|result_node_order|" + +msgid "Changes on column names must be done after updating pgRouting." +msgstr "Ändringar av kolumnnamn måste göras efter uppdatering av pgRouting." + +msgid "``pgr_edgeColoring``" +msgstr "``pgr_edgeColoring``" + +msgid ":ref:`from_old_edge_color`" +msgstr ":ref:`from_old_edge_color`" + +msgid "``pgr_bipartite``" +msgstr "``pgr_bipartite``" + +msgid ":ref:`from_old_node_color`" +msgstr ":ref:`from_old_node_color`" + +msgid "``pgr_sequentialVertexColoring``" +msgstr "``pgr_sequentialVertexColoring``" + +msgid "``pgr_topologicalSort``" +msgstr "``pgr_topologicalSort``" + +msgid ":ref:`from_toposort`" +msgstr ":ref:`from_toposort`" + +msgid "``pgr_transitiveClosure``" +msgstr "``pgr_transitiveClosure``" + +msgid ":ref:`from_old_closure`" +msgstr ":ref:`from_old_closure`" + +msgid "Migration from |result-old-closure|" +msgstr "Migrering från |result-old-closure|" + +msgid "Migration to: |result-old-closure|" +msgstr "Migrering till: |result-old-closure|" + +msgid "After update:" +msgstr "Efter uppdatering:" + +msgid "Remove column ``seq``" +msgstr "Ta bort kolumnen ``seq``" + +msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" +msgstr "Byt namn på ``vid`` till ``node`` och ``target_array`` till ``targets``" + +msgid "Migration from |result-toposort|" +msgstr "Migrering från |result-toposort|" + +msgid "Migration to: |result_node_order|" +msgstr "Migrering till: |result_node_order|" + +msgid "Rename ``sorted_v`` to ``node``" +msgstr "Byt namn på ``sorted_v`` till ``node``" + +msgid "Migration from |old-edge-color|" +msgstr "Migrering från |old-edge-color|" + +msgid "Migration to: |result_edge_color|" +msgstr "Migration till: |result_edge_color|" + +msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." +msgstr "Byt namn på ``edge_id`` till ``edge`` och ``color_id`` till ``color``." + +msgid "Migration from |old-node-color|" +msgstr "Migrering från |old-node-color|" + +msgid "Migration to: |result_node_color|" +msgstr "Migration till: |result_node_color|" + +msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." +msgstr "Byt namn på ``vertex_id`` till ``node`` och ``color_id`` till ``color``." + +msgid "Migration of deleted functions" +msgstr "Migrering av borttagna funktioner" + +msgid "Functions no longer on pgRouting" +msgstr "Funktionerna finns inte längre på pgRouting" + +msgid "Migration of ``pgr_alphaShape``" +msgstr "Migrering av ``pgr_alphaShape``" + +msgid "Deprecated" +msgstr "Föråldrat" + +msgid "`v3.8.0 `__" +msgstr "`v3.8.0 `__" + +msgid "Removed" +msgstr "Borttagen" + +msgid "`v4.0.0 `__" +msgstr "`v4.0.0 `__" + +msgid "**Before Deprecation:** The following was calculated:" +msgstr "**För Deprecation:** Följande beräknades:" + +msgid "An alphaShape was calculated" +msgstr "En alphaShape beräknades" + +msgid "**After Deprecation:**" +msgstr "**After Deprecation:**" + +msgid "PostGIS has two ways of generating alphaShape." +msgstr "PostGIS har två sätt att generera alphaShape." + +msgid "If you have SFCGAL, which you can install using" +msgstr "Om du har SFCGAL, som du kan installera med hjälp av" + +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgstr "Sedan PostGIS 3.5+ används `CG_AlphaShape `__" + +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgstr "För PostGIS 3.5+ använd det gamla namnet ``ST_AlphaShape``" + +msgid "Other PostGIS options are" +msgstr "Andra PostGIS-alternativ är" + +msgid "`ST_ConvexHull `__" +msgstr "`ST_ConvevexHull `__" + +msgid "`ST_ConcaveHull `__" +msgstr "`ST_ConcaveHull `__" + +msgid "Migration of ``pgr_nodeNetwork``" +msgstr "Migrering av ``pgr_nodeNetwork``" + +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." +msgstr "**Before Deprecation:** En tabell med `_nodded` skapades. med delade kanter." + +msgid "**Migration**" +msgstr "**Migration**" + +msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" +msgstr "Använd :doc:`pgr_separateTouching` och/eller använd :doc:`pgr_separateCrossing`" + +msgid "Migration of ``pgr_createTopology``" +msgstr "Migrering av ``pgr_createTopology``" + +msgid "A table with `_vertices_pgr` was created." +msgstr "En tabell med `_vertices_pgr` skapades." + +msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgstr "**Efter Deprecation:** Användaren är ansvarig för att skapa den kompletta topologin." + +msgid "Build a routing topology" +msgstr "Bygga upp en routingtopologi" + +msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." +msgstr "Den grundläggande informationen för att använda de flesta av pgRouting-funktionerna ``id, source, target, cost, [reverse_cost]`` är vad som i pgRouting kallas routingtopologin." + +msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." +msgstr "``reverse_cost`` är valfritt men rekommenderas starkt för att minska databasens storlek på grund av storleken på geometrikolumnerna. I den här dokumentationen används dock ``reverse_cost`` i den här dokumentationen." + +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." +msgstr "När data levereras med geometrier och det inte finns någon routningstopologi behövs det här steget." + +msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." +msgstr "Alla geometriernas start- och slutpunkter behöver en identifierare som ska lagras i kolumnerna ``källa`` och ``mål`` i datatabellen. På samma sätt måste ``cost`` och ``reverse_cost`` ha värdet för att korsa kanten i båda riktningarna." + +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgstr "Om kolumnerna inte finns måste de läggas till i tabellen i fråga. (se `ALTER TABLE `__)" + +msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." +msgstr "Funktionen :doc:`pgr_extractVertices` används för att skapa en vertices-tabell baserad på kantidentifieraren och geometrin för kanten i grafen." + +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgstr "Slutligen fylls ``källan`` och ``målet`` på med hjälp av de data som finns lagrade i topparnas tabeller." + +msgid "Migration of ``pgr_createVerticesTable``" +msgstr "Migrering av ``pgr_createVerticesTable``" + +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgstr "**Efter deprecation:** Användaren är ansvarig för att skapa vertices-tabellen, index, etc. De kan använda :doc:`pgr_extractVertices` för det ändamålet." + +msgid "Migration of ``pgr_analyzeOneWay``" +msgstr "Migrering av ``pgr_analyzeOneWay``" + +msgid "Number of potential problems in directionality" +msgstr "Antal potentiella problem med riktverkan" + +msgid "WHERE" +msgstr "VAR" + +msgid "Directionality problems were calculated based on codes." +msgstr "Riktningsproblem beräknades baserat på koder." + +msgid "Dead ends." +msgstr "Dödlägen." + +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgstr "Ett routingproblem kan uppstå när det från ett toppunkt bara finns en väg in eller en väg ut, men inte båda:" + +msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." +msgstr "Antingen genom att spara eller direkt använda :doc:`pgr_extractVertices` får du information om återvändsgränder och avgör om den intilliggande kanten är enkelriktad eller inte." + +msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgstr "I detta exempel har :doc:`pgr_extractVertices` redan tillämpats." + +msgid "Bridges." +msgstr "Broar." + +msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." +msgstr "Ett annat routningsproblem kan uppstå när det finns en kant i en odelad graf vars borttagning ökar antalet anslutna komponenter, och bron bara går åt ett håll." + +msgid "To determine if the bridges are or not one way." +msgstr "För att avgöra om broarna är enkelriktade eller inte." + +msgid "Migration of ``pgr_analyzeGraph``" +msgstr "Migrering av ``pgr_analyzeGraph``" + +msgid "Number of isolated segments." +msgstr "Antal isolerade segment." + +msgid "Number of dead ends." +msgstr "Antal återvändsgränder." + +msgid "Number of potential gaps found near dead ends." +msgstr "Antal potentiella luckor som hittats nära återvändsgränder." + +msgid "Number of intersections. (between 2 edges)" +msgstr "Antal skärningspunkter. (mellan 2 kanter)" + +msgid "Graph component" +msgstr "Grafkomponent" + +msgid "A connected subgraph that is not part of any larger connected subgraph." +msgstr "En sammanhängande delgraf som inte är en del av någon större sammanhängande delgraf." + +msgid "Isolated segment" +msgstr "Isolerat segment" + +msgid "A graph component with only one segment." +msgstr "En grafkomponent med endast ett segment." + +msgid "Dead ends" +msgstr "Döda ändar" + +msgid "A vertex that participates in only one edge." +msgstr "En vertex som bara deltar i en kant." + +msgid "gaps" +msgstr "luckor" + +msgid "Space between two geometries." +msgstr "Utrymme mellan två geometrier." + +msgid "Intersection" +msgstr "Korsningar" + +msgid "Is a topological relationship between two geometries." +msgstr "Är ett topologiskt förhållande mellan två geometrier." + +msgid "Migration." +msgstr "Migration." + +msgid "Components." +msgstr "Komponenter." + +msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgstr "Istället för att bara räkna isolerade segment kan du bestämma alla komponenter i grafen." + +msgid "Depending of the final application requirements use:" +msgstr "Beroende på de slutliga kraven för applikationen:" + +msgid ":doc:`pgr_connectedComponents`" +msgstr ":doc:`pgr_connectedComponents`" + +msgid ":doc:`pgr_strongComponents`" +msgstr ":doc:`pgr_strongComponents`" + +msgid ":doc:`pgr_biconnectedComponents`" +msgstr ":doc:`pgr_biconnectedComponents`" + +msgid "For example:" +msgstr "Till exempel:" + +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgstr "I stället för att räkna återvändsgränderna kan du bestämma alla återvändsgränder i grafen med hjälp av :doc:`pgr_degree`." + +msgid "Potential gaps near dead ends." +msgstr "Potentiella luckor nära återvändsgränder." + +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgstr "Istället för att räkna potentiella mellanrum mellan geometrier, bestäm de geometriska mellanrummen i grafen med hjälp av :doc:`pgr_findCloseEdges`." + +msgid "Topological relationships." +msgstr "Topologiska relationer." + +msgid "Instead of counting intersections, determine topological relationships between geometries." +msgstr "Istället för att räkna korsningar, bestäm topologiska relationer mellan geometrier." + +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "Flera PostGIS-funktioner kan användas: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." + +msgid "Migration of ``pgr_trsp`` (Vertices)" +msgstr "Migrering av ``pgr_trsp`` (toppar)" + +msgid "Signature:" +msgstr "Underskrift:" + +msgid "`v3.4.0 `__" +msgstr "`v3.4.0 `__" + +msgid ":doc:`pgr_trsp`" +msgstr ":doc:`pgr_trsp`" + +msgid "`Migration of restrictions`_" +msgstr "`Flyttning av restriktioner`_" + +msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgstr "Använd ``pgr_dijkstra`` när det inte finns några begränsningar." + +msgid "Use :doc:`pgr_dijkstra` instead." +msgstr "Använd :doc:`pgr_dijkstra` istället." + +msgid "To get the original column names:" +msgstr "För att få de ursprungliga kolumnnamnen:" + +msgid "``id1`` is the node" +msgstr "``id1`` är noden" + +msgid "``id2`` is the edge" +msgstr "``id2`` är kanten" + +msgid "Use ``pgr_trsp`` when there are restrictions." +msgstr "Använd ``pgr_trsp`` när det finns begränsningar." + +msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgstr "Använd :doc:`pgr_trsp` (One to One) istället." + +msgid "Migration of ``pgr_trsp`` (Edges)" +msgstr "Migrering av ``pgr_trsp`` (kanter)" + +msgid ":doc:`pgr_trsp_withPoints`" +msgstr ":doc:`pgr_trsp_withPoints`" + +msgid "Migration of ``pgr_trspViaVertices``" +msgstr "Migrering av ``pgr_trspViaVertices``" + +msgid ":doc:`pgr_dijkstraVia`" +msgstr ":doc:`pgr_dijkstraVia`" + +msgid ":doc:`pgr_trspVia`" +msgstr ":doc:`pgr_trspVia`" + +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgstr "Använd ``pgr_dijkstraVia`` när det inte finns några begränsningar" + +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "Använd :doc:`pgr_dijkstraVia` istället." + +msgid "``id1`` is the path identifier" +msgstr "``id1`` är identifieraren för sökvägen" + +msgid "``id2`` is the node" +msgstr "``id2`` är noden" + +msgid "``id3`` is the edge" +msgstr "``id3`` är kanten" + +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr "Använd ``pgr_trspVia`` när det finns begränsningar" + +msgid "Use :doc:`pgr_trspVia` instead." +msgstr "Använd :doc:`pgr_trspVia` istället." + +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "Migrering av ``pgr_trspViaEdges``" + +msgid ":doc:`pgr_withPointsVia`" +msgstr ":doc:`pgr_withPointsVia`" + +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr ":doc:`pgr_trspVia_withPoints`" + +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgstr "Använd ``pgr_withPointsVia`` när det inte finns några begränsningar" + +msgid "Use :doc:`pgr_withPointsVia` instead." +msgstr "Använd :doc:`pgr_withPointsVia` istället." + +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr "Använd ``pgr_trspVia_withPoints`` när det finns begränsningar" + +msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgstr "Använd :doc:`pgr_trspVia_withPoints` istället." + +msgid "Not yet classified migrations" +msgstr "Ännu ej klassificerade migrationer" + +msgid "Migration of ``pgr_withPointsKSP``" +msgstr "Migrering av ``pgr_withPointsKSP``" + +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "Från och med `v3.6.0 `__ :doc:`pgr_withPointsKSP` standardiseras resultatkolumnerna." + +msgid "|ksp-result|" +msgstr "|ksp-result|" + +msgid "|generic-result|" +msgstr "|generic-result|" + +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgstr "Och parametern ``driving side`` ändrades från namngiven valfri till icke namngiven **driving side** och dess giltighet skiljer sig åt för riktade och oriktade grafer." + +msgid "``pgr_withPointsKSP`` (`One to One`)" +msgstr "``pgr_withPointsKSP`` (`En till en`)" + +msgid "Before Migration" +msgstr "Före migration" + +msgid "Output columns were |old-pid-result|" +msgstr "Utgångskolumnerna var |old-pid-result|" + +msgid "the columns ``start_vid`` and ``end_vid`` do not exist." +msgstr "kolumnerna ``start_vid`` och ``end_vid`` finns inte." + +msgid "Migration" +msgstr "Migrering" + +msgid "Be aware of the existence of the additional result Columns." +msgstr "Var medveten om att det finns ytterligare resultat Kolumner." + +msgid "New output columns are |generic-result|" +msgstr "Nya utdatakolumner är |generic-result|" + +msgid "Using `this `__ example." +msgstr "Använda `det här `__ exemplet." + +msgid "``start_vid`` contains the **start vid** parameter value." +msgstr "``start_vid`` innehåller parametervärdet **start vid**." + +msgid "``end_vid`` contains the **end vid** parameter value." +msgstr "``end_vid`` innehåller parametervärdet **end vid**." + +msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgstr "Vid behov kan du filtrera bort de extra kolumnerna, t.ex. för att få tillbaka de ursprungliga kolumnerna:" + +msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgstr "Använd ``pgr_withPoints`` när det inte finns några begränsningar." + +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr "Använd :doc:`pgr_withPoints` (One to One) istället." + +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgstr "Använd ``pgr_trsp_withPoints`` när det finns begränsningar." + +msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgstr "Använd :doc:`pgr_trsp_withPoints` istället." + +msgid "Migration of ``pgr_maxCardinalityMatch``" +msgstr "Migrering av ``pgr_maxCardinalityMatch``" + +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgstr ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." + +msgid "Starting from `v3.4.0 `__" +msgstr "Startar från `v3.4.0 `__" + +msgid "Signature to be migrated:" +msgstr "Signatur som ska migreras:" + +msgid "Migration is needed, because:" +msgstr "Migration behövs, eftersom:" + +msgid "Use ``cost`` and ``reverse_cost`` on the inner query" +msgstr "Använd ``cost`` och ``reverse_cost`` på den inre frågan" + +msgid "Results are ordered" +msgstr "Resultaten är ordnade" + +msgid "Works for undirected graphs." +msgstr "Fungerar för oledade grafer." + +msgid "New signature" +msgstr "Ny signatur" + +msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." +msgstr "``pgr_maxCardinalityMatch(text)`` returnerar endast ``kant`` kolumnen." + +msgid "The optional flag ``directed`` is removed." +msgstr "Den valfria flaggan ``directed`` tas bort." + +msgid "Before migration" +msgstr "Före migration" + +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgstr "Kolumner som används är \"utgående\" och \"kommande\" för att representera existensen av en kant." + +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgstr "Flaggan ``directed`` användes för att ange om det var för en **directed** eller **undirected** graf." + +msgid "The flag ``directed`` is ignored." +msgstr "Flaggan ``directed`` ignoreras." + +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgstr "Oavsett dess värde ger det resultatet med tanke på grafen som **undirected**." + +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgstr "Använd kolumnerna ``cost`` och ``reverse_cost`` för att representera existensen av en kant." + +msgid "Do not use the flag ``directed``." +msgstr "Använd inte flaggan ``directed``." + +msgid "In the query returns only ``edge`` column." +msgstr "I frågan returneras endast kolumnen ``edge``." + +msgid "Migration of restrictions" +msgstr "Överföring av restriktioner" + +msgid "The structure of the restrictions have changed:" +msgstr "Strukturen på restriktionerna har förändrats:" + +msgid "Old restrictions structure" +msgstr "Gammal begränsningsstruktur" + +msgid "On the deprecated signatures:" +msgstr "På de föråldrade signaturerna:" + +msgid "Column ``rid`` is ignored" +msgstr "Kolumnen ``rid`` ignoreras" + +msgid "``via_path``" +msgstr "``via_path``" + +msgid "Must be in reverse order." +msgstr "Måste vara i omvänd ordning." + +msgid "Is of type ``TEXT``." +msgstr "Är av typen ``TEXT``." + +msgid "When more than one via edge must be separated with ``,``." +msgstr "När mer än en via edge måste separeras med ``,``." + +msgid "``target_id``" +msgstr "``target_id``" + +msgid "Is the last edge of the forbidden path." +msgstr "Är den sista kanten av den förbjudna vägen." + +msgid "Is of type ``INTEGER``." +msgstr "Är av typen ``INTEGER``." + +msgid "``to_cost``" +msgstr "``to_cost``" + +msgid "Is of type ``FLOAT``." +msgstr "Är av typen ``FLOAT``." + +msgid "Creation of the old restrictions table" +msgstr "Skapande av den gamla restriktionstabellen" + +msgid "Old restrictions fill up" +msgstr "Gamla restriktioner fylls på" + +msgid "Old restrictions contents" +msgstr "Gamla restriktioner innehåll" + +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgstr "Begränsningen med ``rid = 2`` representerar :math:`3 \\rightarrow 5 \\rightarrow9``" + +msgid ":math:`3\\rightarrow5`" +msgstr ":math:`3\\rightarrow5`" + +msgid "is on column ``via_path`` in reverse order" +msgstr "är på kolumn ``via_path`` i omvänd ordning" + +msgid "is of type ``TEXT``" +msgstr "är av typen ``TEXT``" + +msgid ":math:`9`" +msgstr ":math:`9`" + +msgid "is on column ``target_id``" +msgstr "är på kolumn ``target_id``" + +msgid "is of type ``INTEGER``" +msgstr "är av typen ``INTEGER``" + +msgid "New restrictions structure" +msgstr "Ny struktur för restriktioner" + +msgid "Column ``id`` is ignored" +msgstr "Kolumnen ``id`` ignoreras" + +msgid "Column ``path``" +msgstr "Kolumn \"sökväg" + +msgid "Is of type ``ARRAY[ANY-INTEGER]``." +msgstr "Är av typen ``ARRAY[ANY-INTEGER]``." + +msgid "Contains all the edges involved on the restriction." +msgstr "Innehåller alla kanter som är involverade i begränsningen." + +msgid "The array has the ordered edges of the restriction." +msgstr "Arrayen har restriktionens ordnade kanter." + +msgid "Column ``cost``" +msgstr "Kolumn ``kostnad``" + +msgid "Is of type ``ANY-NUMERICAL``" +msgstr "Är av typen ``ANY-NUMERICAL``" + +msgid "The creation of the restrictions table" +msgstr "Skapandet av begränsningstabellen" + +msgid "Adding the restrictions" +msgstr "Lägga till begränsningar" + +msgid "Restrictions data" +msgstr "Begränsningar data" + +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgstr "Restriktionen med ``rid = 2`` representerar sökvägen :math:`3 \\rightarrow5 \\rightarrow9``." + +msgid "By inspection the path is clear." +msgstr "Vid inspektion är vägen tydlig." + +msgid "To transform the old restrictions table to the new restrictions structure," +msgstr "Att omvandla den gamla begränsningstabellen till den nya begränsningsstrukturen," + +msgid "Create a new table with the new restrictions structure." +msgstr "Skapa en ny tabell med den nya begränsningsstrukturen." + +msgid "In this migration guide ``new_restrictions`` is been used." +msgstr "I den här migreringsguiden används ``new_restrictions``." + +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgstr "För denna migrering tillhandahåller pgRouting en hjälpfunktion för reversering av en array ``_pgr_array_reverse`` som behövs för migreringen." + +msgid "``_pgr_array_reverse``:" +msgstr "``_pgr_array_reverse``:" + +msgid "Was created temporally for this migration" +msgstr "Skapades temporärt för denna migration" + +msgid "Is not documented." +msgstr "Är inte dokumenterad." + +msgid "Will be removed on the next mayor version 4.0.0" +msgstr "Kommer att tas bort i nästa borgmästarversion 4.0.0" + +msgid "The migrated table contents:" +msgstr "Det migrerade tabellinnehållet:" + +msgid ":doc:`pgRouting-concepts`" +msgstr ":doc:`pgRouting-concepts`" + +msgid "Ordering - Family of functions" +msgstr "Beställning - Familj av funktioner" + +msgid "pgRouting Concepts" +msgstr "pgRouting-koncept" + +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgstr "Det här är en enkel guide som går igenom några av stegen för att komma igång med pgRouting. Den här guiden täcker:" + +msgid "Graphs" +msgstr "Diagram" + +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" +msgstr "En graf är ett ordnat par :math:`G = (V ,E)` där:" + +msgid ":math:`V` is a set of vertices, also called nodes." +msgstr ":math:`V` is a set of vertices, also called nodes." + +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" + +msgid "There are different kinds of graphs:" +msgstr "Det finns olika typer av grafer:" + +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" + +msgid "Undirected simple graph" +msgstr "Ogirigerad enkel graf" + +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" + +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" + +msgid "Directed simple graph" +msgstr "Riktad enkel graf" + +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" + +msgid "Graphs:" +msgstr "Diagram:" + +msgid "Do not have geometries." +msgstr "Har inte geometrier." + +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgstr "Vissa grafteoretiska problem kräver att graferna har vikter, som kallas **kostnad** i pgRouting." + +msgid "In pgRouting there are several ways to represent a graph on the database:" +msgstr "I pgRouting finns det flera sätt att representera en graf i databasen:" + +msgid "With ``cost``" +msgstr "Med ``kostnad``" + +msgid "(``id``, ``source``, ``target``, ``cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``)" + +msgid "With ``cost`` and ``reverse_cost``" +msgstr "Med ``kostnad`` och ``omvänd_kostnad``" + +msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" + +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgstr "Identifierare av kanten. Krav på att använda databasen på ett konsekvent sätt." + +msgid "Identifier of a vertex." +msgstr "Identifierare för en vertex." + +msgid "Weight of the edge (``source``, ``target``):" +msgstr "Kantvikt (``källa``, ``mål``):" + +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgstr "När den är negativ finns inte kanten (``källa``, ``mål``) i grafen." + +msgid "``cost`` must exist in the query." +msgstr "``cost`` måste finnas i frågan." + +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "När den är negativ finns inte kanten (``mål``, ``källa``) i grafen." + +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgstr "Beslutet om grafen ska vara **directed** eller **undirected** fattas när en pgRouting-algoritm körs." + +msgid "Graph with ``cost``" +msgstr "Graf med ``kostnad``" -msgid "pgr_kingOrdering" -msgstr "pgr_kingOrdering" +msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgstr "Den viktade riktade grafen, :math:`G_d(V,E)`:" -msgid "pgr_KSP" -msgstr "pgr_KSP" +msgid "Graph data is obtained with a query" +msgstr "Grafdata erhålls med en fråga" -msgid "All signatures promoted to official." -msgstr "Alla signaturer har uppgraderats till officiella." +msgid "``SELECT id, source, target, cost FROM edges``" +msgstr "``Välj id, källa, mål, kostnad från kanter``" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" -msgid "pgr_maxCardinalityMatch(text,boolean)" -msgstr "pgr_maxCardinalityMatch(text,boolean)" +msgid "Edges where ``cost`` is non negative are part of the graph." +msgstr "Kanter där ``kostnad`` inte är negativ är en del av grafen." -msgid "pgr_maxFlow" -msgstr "pgr_maxFlow" +msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgid "pgr_pushRelabel" -msgstr "pgr_pushRelabel" +msgid "All vertices in ``source`` and ``target`` are part of the graph." +msgstr "Alla hörn i ``källa`` och ``mål`` är en del av grafen." -msgid "pgr_sequentialVertexColoring" -msgstr "pgr_sequentialVertexColoring" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "I en riktad graf har kanten :math:`(source_{id}, target_{id}, cost_{id})` riktning: :math:`source_{id} \\rightarrow target_{id}`" + +msgid "For the following data:" +msgstr "För följande uppgifter:" + +msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." +msgstr "Edge :math:`2` (:math:`1 \\rightarrow 3`) är inte en del av grafen." + +msgid "The data is representing the following graph:" +msgstr "Uppgifterna representeras av följande graf:" + +msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "I en ostyrd graf har kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` inte riktning: :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" + +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" +msgstr "I termer av en riktad graf är det som att ha två kanter: :math:`source_{id} \\leftrightarrow target_{id}`" + +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgstr "Kanten :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) är inte en del av grafen." + +msgid "Graph with ``cost`` and ``reverse_cost``" +msgstr "Graf med ``kostnad`` och ``omvända_kostnader``" + +msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgstr "``SELECT id, källa, mål, kostnad, omvänd_kostnad FROM kanter``" + +msgid "The set of edges :math:`E`:" +msgstr "Mängden kanter :math:`E`:" + +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" + +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgstr "Edges :math:`(source \\rightarrow target)` där ``cost`` är icke-negativ är en del av grafen." + +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "Edges :math:`(target \\rightarrow source)` där ``reverse_cost`` är icke-negativ är en del av grafen." + +msgid "The set of vertices :math:`V`:" +msgstr "Mängden hörn :math:`V`:" + +msgid "In a directed graph both edges have directionality" +msgstr "I en riktad graf har båda kanterna riktning" + +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` har riktning: :math:`källa_{id} \\rightarrow mål_{id}`" + +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgstr "kanten :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` har riktning: :math:`target_{id} \\rightarrow source_{id}`" + +msgid "Edges not part of the graph:" +msgstr "Kanter som inte är en del av grafen:" + +msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgstr ":math:`2` (:math:`1 \\rightarrow 3`)" + +msgid ":math:`3` (:math:`3 \\rightarrow 2`)" +msgstr ":math:`3` (:math:`3 \\rightarrow 2`)" + +msgid "In a directed graph both edges do not have directionality" +msgstr "I en riktad graf har inte båda kanterna riktning" + +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "Kant :math:`(källa_{id}, mål_{id}, kostnad_{id})` är :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" + +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgstr "Kant :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` är :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" + +msgid "In terms of a directed graph is like having four edges:" +msgstr "I termer av en riktad graf är det som att ha fyra kanter:" + +msgid ":math:`source_i \\leftrightarrow target_i`" +msgstr ":math:`source_i \\leftrightarrow target_i`" + +msgid ":math:`target_i \\leftrightarrow source_i`" +msgstr ":math:`target_i \\leftrightarrow source_i`" + +msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" + +msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" + +msgid "Graphs without geometries" +msgstr "Grafer utan geometrier" + +msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgstr "Problem med personliga relationer, släktforskning och filberoende kan lösas med hjälp av pgRouting. Dessa problem har normalt inte geometrier som är kopplade till grafen." + +msgid "Wiki example" +msgstr "Wiki-exempel" + +msgid "Solve the example problem taken from `wikipedia `__):" +msgstr "Lös exempelproblemet hämtat från `wikipedia `__):" + +msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." +msgstr "Problemet är att hitta den kortaste vägen från :math:`1` till :math:`5`." + +msgid "Is an undirected graph." +msgstr "Är en odelad graf." + +msgid "Although visually looks like to have geometries, the drawing is not to scale." +msgstr "Även om det visuellt ser ut att finnas geometrier är ritningen inte skalenlig." + +msgid "No geometries associated to the vertices or edges" +msgstr "Inga geometrier associerade till hörn eller kanter" + +msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" +msgstr "Har 6 hörn :math:`\\{1,2,3,4,5,6\\}`" + +msgid "Has 9 edges:" +msgstr "Har 9 kanter:" + +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" + +msgid "The graph can be represented in many ways for example:" +msgstr "Grafen kan representeras på många olika sätt, t.ex:" + +msgid "Prepare the database" +msgstr "Förbereda databasen" + +msgid "Create a database for the example, access the database and install pgRouting: ::" +msgstr "Skapa en databas för exemplet, gå in i databasen och installera pgRouting: ::" + +msgid "Create a table" +msgstr "Skapa en tabell" + +msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgstr "De grundläggande element som behövs för att utföra grundläggande routing på en odelad graf är:" + +msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" + +msgid "Using this table design for this example:" +msgstr "Använd denna bordsdesign för detta exempel:" + +msgid "Insert the data" +msgstr "Infoga data" + +msgid "Find the shortest path" +msgstr "Hitta den kortaste vägen" + +msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgstr "För att lösa detta exempel används :doc:`pgr_dijkstra`:" + +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "För att gå från :math:`1` till :math:`5` går vägen genom följande hörn: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" + +msgid "Vertex information" +msgstr "Information om toppunkt" + +msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" +msgstr "För att få information om topparna, använd :doc:`pgr_extractVertices`" + +msgid "Graphs with geometries" +msgstr "Grafer med geometrier" + +msgid "Create a routing Database" +msgstr "Skapa en routningsdatabas" + +msgid "The first step is to create a database and load pgRouting in the database." +msgstr "Det första steget är att skapa en databas och ladda pgRouting i databasen." + +msgid "Typically create a database for each project." +msgstr "Vanligtvis skapas en databas för varje projekt." + +msgid "Once having the database to work in, load your data and build the routing application in that database." +msgstr "När du väl har en databas att arbeta i laddar du dina data och bygger routingapplikationen i den databasen." + +msgid "Load Data" +msgstr "Ladda data" + +msgid "There are several ways to load your data into pgRouting." +msgstr "Det finns flera sätt att ladda dina data i pgRouting." + +msgid "Manually creating a database." +msgstr "Skapa en databas manuellt." + +msgid "`Graphs without geometries`_" +msgstr "`Grafer utan geometrier`_" + +msgid ":doc:`sampledata`: a small graph used in the documentation examples" +msgstr ":doc:`sampledata`: a small graph used in the documentation examples" + +msgid "Using `osm2pgrouting `__" +msgstr "Använda `osm2pgrouting `__" + +msgid "There are various open source tools that can help, like:" +msgstr "Det finns olika verktyg med öppen källkod som kan hjälpa till, t.ex:" + +msgid "shp2pgsql" +msgstr "shp2pgsql" + +msgid "postgresql shapefile loader" +msgstr "postgresql shapefile-laddare" + +msgid "ogr2ogr" +msgstr "ogr2ogr" + +msgid "vector data conversion utility" +msgstr "verktyg för konvertering av vektordata" + +msgid "osm2pgsql" +msgstr "osm2pgsql" + +msgid "load OSM data into postgresql" +msgstr "ladda OSM-data till postgresql" + +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgstr "Observera att dessa verktyg **inte** kommer att importera data i en struktur som är kompatibel med pgRouting och när detta händer måste topologin justeras." + +msgid "Breakup a segments on each segment-segment intersection" +msgstr "Dela upp ett segment på varje segment-segment intersektion" + +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgstr "Om de saknas, lägg till kolumner och tilldela värden för ``källa``, ``mål``, ``kostnad``, ``omvänd kostnad``." + +msgid "Connect a disconnected graph." +msgstr "Anslut en frånkopplad graf." + +msgid "Create the complete graph topology" +msgstr "Skapa den fullständiga grafens topologi" + +msgid "Create one or more graphs based on the application to be developed." +msgstr "Skapa en eller flera grafer baserat på den applikation som ska utvecklas." -msgid "pgr_sloanOrdering" -msgstr "pgr_sloanOrdering" +msgid "Create a contracted graph for the high speed roads" +msgstr "Skapa ett sammandraget diagram för höghastighetsvägarna" -msgid "pgr_topologicalSort" -msgstr "pgr_topologicalSort" +msgid "Create graphs per state/country" +msgstr "Skapa grafer per stat/land" -msgid "Standardize output to |result_node_order|" -msgstr "Standardisera utdata till |result_node_order|" +msgid "In few words:" +msgstr "Med några få ord:" -msgid "pgr_transitiveClosure" -msgstr "pgr_transitiveClosure" +msgid "Prepare the graph" +msgstr "Förbered grafen" -msgid "Standardized output to |result-closure|" -msgstr "Standardisera utdata till |result-closure|" +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgstr "Vad och hur du ska förbereda grafen beror på applikationen och/eller på datakvaliteten och/eller på hur nära informationen är en topologi som kan användas av pgRouting och/eller på andra faktorer som inte nämns." -msgid "pgr_trsp" -msgstr "pgr_trsp" +msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." +msgstr "Stegen för att förbereda grafen involverar geometriska operationer med hjälp av `PostGIS `__ och vissa andra involverar grafoperationer som :doc:`pgr_contraction` för att dra ihop en graf." -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgstr "I workshopen `__ finns en steg-för-stegbeskrivning av hur man skapar en graf med hjälp av Open Street Map-data för en liten applikation." -msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "The use of indexes on the database design in general:" +msgstr "Användningen av index på databasdesignen i allmänhet:" -msgid "pgr_trspVia" -msgstr "pgr_trspVia" +msgid "Have the geometries indexed." +msgstr "Låt geometrierna vara indexerade." -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgid "Have the identifiers columns indexed." +msgstr "Låt kolumnerna med identifierare indexeras." -msgid "pgr_trspVia_withPoints" -msgstr "pgr_trspVia_withPoints" +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgstr "Vänligen se dokumentationen för `PostgreSQL `__ och dokumentationen för `PostGIS `__." -msgid "**Driving side** parameter is positional unnamed." -msgstr "**Driving side** parametern är positionell utan namn." +msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." +msgstr "Data som kommer från OSM och använder `osm2pgrouting `__ som ett importverktyg, kommer med routingtopologin. Se ett exempel på användning av ``osm2pgrouting`` på `workshop `__." -msgid "Valid values depend on kind of graph" -msgstr "Giltiga värden beror på typ av graf" +msgid "Adjust costs" +msgstr "Justera kostnader" -msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgstr "I det här exemplet kommer värdena ``cost`` och ``reverse_cost`` att vara det dubbla av geometrins längd." -msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "Update costs to length of geometry" +msgstr "Uppdatera kostnaderna till geometrins längd" -msgid "pgr_trsp_withPoints" -msgstr "pgr_trsp_withPoints" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgstr "Antag att kolumnerna ``kostnad`` och ``omvända_kostnader`` i urvalsdata representerar:" -msgid "**Driving side** parameter is positional unnamed and compulsory." -msgstr "**Driving side** parametern är positionell, namnlös och obligatorisk." +msgid ":math:`1` when the edge exists in the graph" +msgstr ":math:`1` when the edge exists in the graph" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgid ":math:`-1` when the edge does not exist in the graph" +msgstr ":math:`-1` when the edge does not exist in the graph" -msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Using that information updating to the length of the geometries:" +msgstr "Med hjälp av den informationen uppdateras geometriernas längd:" -msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Which gives the following results:" +msgstr "Vilket ger följande resultat:" -msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgstr "Observera att för att kunna följa dokumentationsexemplen är allt baserat på den ursprungliga grafen." -msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgid "Returning to the original data:" +msgstr "Återgå till de ursprungliga uppgifterna:" -msgid "pgr_TSP" -msgstr "pgr_TSP" +msgid "Update costs based on codes" +msgstr "Uppdatera kostnader baserat på koder" -msgid "Results change depending on input order" -msgstr "Resultaten ändras beroende på inmatningsordning" +msgid "Other datasets, can have a column with values like" +msgstr "Andra dataset kan ha en kolumn med värden som" -msgid "Only for undirected graphs" -msgstr "Endast för odelade grafer" +msgid "``FT`` vehicle flow on the direction of the geometry" +msgstr "``FT`` fordonsflöde i geometrins riktning" -msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgid "``TF`` vehicle flow opposite of the direction of the geometry" +msgstr "``TF`` fordonsflöde motsatt geometrins riktning" -msgid "pgr_TSPeuclidean" -msgstr "pgr_TSPeuclidean" +msgid "``B`` vehicle flow on both directions" +msgstr "``B`` fordonsflöde i båda riktningarna" -msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" -msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgid "Preparing a code column for the example:" +msgstr "Förbereda en kodkolumn för exemplet:" -msgid "pgr_turnRestrictedPath" -msgstr "pgr_turnRestrictedPath" +msgid "Adjusting the costs based on the codes:" +msgstr "Justering av kostnaderna baserat på koderna:" -msgid "Output columns standardized to |nksp-result|" -msgstr "Utdatakolumner standardiserade till |nksp-result|" +msgid "Check the Routing Topology" +msgstr "Kontrollera routingtopologin" -msgid "pgr_withPoints" -msgstr "pgr_withPoints" +msgid "There are lots of possible problems in a graph." +msgstr "Det finns många möjliga problem i en graf." -msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "The data used may not have been designed with routing in mind." +msgstr "De data som används kanske inte har utformats med tanke på routing." -msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "A graph has some very specific requirements." +msgstr "En graf har några mycket specifika krav." -msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "The graph is disconnected." +msgstr "Grafen är frånkopplad." -msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "There are unwanted intersections." +msgstr "Det finns oönskade korsningar." -msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" -msgstr "pgr_withpoints(text,text,text,boolean,character,boolean)" +msgid "The graph is too large and needs to be contracted." +msgstr "Grafen är för stor och behöver krympas." -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" +msgid "A sub graph is needed for the application." +msgstr "En subgraf behövs för applikationen." -msgid "**Driving side** parameter is unnamed and compulsory." -msgstr "*parametern *Driving side** är inte namngiven och är obligatorisk." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgstr "och många andra problem som pgRouting-användaren, det vill säga applikationsutvecklaren, kan stöta på." -msgid "Output columns standardized to |matrix-result|" -msgstr "Utmatningskolumner standardiserade till |matrix-result|" +msgid "Crossing edges" +msgstr "Korsande kanter" -msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -msgstr "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +msgid "To get the crossing edges:" +msgstr "För att få de korsande kanterna:" -msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -msgstr "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgstr "Den informationen är korrekt, till exempel när det gäller fordon, är det en tunnel eller bro som korsar en annan väg." -msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -msgstr "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgid "It might be incorrect, for example:" +msgstr "Det kan till exempel vara felaktigt:" -msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgstr "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgid "When it is actually an intersection of roads, where vehicles can make turns." +msgstr "När det faktiskt är en korsning av vägar, där fordon kan svänga." -msgid "pgr_withpointscost(text,text,text,boolean,character)" -msgstr "pgr_withpointscost(text,text,text,boolean,character)" +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgstr "När det gäller elektriska ledningar kan den elektriska ledningen byta väg även i en tunnel eller på en bro." -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" +msgid "When it is incorrect, it needs fixing:" +msgstr "När den är felaktig behöver den åtgärdas:" -msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +msgid "For vehicles and pedestrians" +msgstr "För fordon och fotgängare" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" +msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." +msgstr "Om data kommer från OSM och importerades till databasen med hjälp av ``osm2pgrouting``, måste korrigeringen göras i `OSM-portalen `__ och data importeras igen." -msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgstr "I allmänhet när data kommer från en leverantör som har förberett data för routing av fordon och det finns ett problem, ska data åtgärdas från leverantören" -msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "For very specific applications" +msgstr "För mycket specifika tillämpningar" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgstr "Uppgifterna är korrekta om de ses ur de dirigerande fordonens eller fotgängarnas synvinkel." -msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "The data needs a local fix for the specific application." +msgstr "Uppgifterna behöver en lokal fix för den specifika applikationen." -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "När korsningarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas `__." -msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgstr "De nya kanterna måste läggas till i kanttabellen, resten av attributen måste uppdateras i de nya kanterna, de gamla kanterna måste tas bort och routingtopologin måste uppdateras." -msgid "Functions promoted to official" -msgstr "Funktioner som befordrats till tjänsteman" +msgid "Fixing an intersection" +msgstr "Fixa en korsning" -msgid "`#2701 `__: pgr_trsp" -msgstr "`#2701 `__: pgr_trsp" +msgid "In this example the original edge table will be used to store the additional geometries." +msgstr "I detta exempel kommer den ursprungliga kanttabellen att användas för att lagra de extra geometrierna." -msgid "`#2701 `__: pgr_trspVia" -msgstr "`#2701 `__: pgr_trspVia" +msgid "An example use without results" +msgstr "Ett exempel på användning utan resultat" -msgid "`#2701 `__: pgr_trspVia_withPoints" -msgstr "`#2701 `__: pgr_trspVia_withPoints" +msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgstr "Routning från :math:`1` till :math:`18` ger ingen lösning." -msgid "`#2701 `__: pgr_trsp_withPoints" -msgstr "`#2701 `__: pgr_trsp_withPoints" +msgid "Analyze the network for intersections." +msgstr "Analysera nätverket för korsningar." -msgid "`#2700 `__: pgr_withPoints" -msgstr "`#2700 `__: pgr_withPoints" +msgid "The analysis tell us that the network has an intersection." +msgstr "Analysen visar att nätverket har en korsning." -msgid "`#2700 `__: pgr_withPointsCost" -msgstr "`#2700 `__: pgr_withPointsCost" +msgid "Prepare tables" +msgstr "Förbereda tabeller" -msgid "`#2700 `__: pgr_withPointsCostMatrix" -msgstr "`#2700 `__: pgr_withPointsCostMatrix" +msgid "Additional columns to control the origin of the segments." +msgstr "Ytterligare kolumner för att styra segmentens ursprung." -msgid "`#2700 `__: pgr_withPointsDD" -msgstr "`#2700 `__: pgr_withPointsDD" +msgid "Adding new segments." +msgstr "Lägga till nya segment." -msgid "`#2700 `__: pgr_withPointsKSP" -msgstr "`#2700 `__: pgr_withPointsKSP" +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." +msgstr "Anropar :doc:`pgr_separateCrossing` och lägger till de nya segmenten i tabellen över kanter." -msgid "`#2700 `__: pgr_withPointsVia" -msgstr "`#2700 `__: pgr_withPointsVia" +msgid "Update other values" +msgstr "Uppdatera andra värden" -msgid "`#2983 `__: pgr_dijkstraNear" -msgstr "`#2983 `__: pgr_dijkstraNear" +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgstr "I det här exemplet uppdateras endast ``cost`` och ``reverse_cost``, där de baseras på geometrins längd och riktningen bibehålls med hjälp av funktionen ``sign``." -msgid "`#2983 `__: pgr_dijkstraNearCost" -msgstr "`#2983 `__: pgr_dijkstraNearCost" +msgid "Update the topology" +msgstr "Uppdatera topologin" -msgid "`#2983 `__: pgr_dijkstraVia" -msgstr "`#2983 `__: pgr_dijkstraVia" +msgid "Insert the new vertices if any." +msgstr "Infoga eventuella nya hörn." -msgid "Signatures promoted to official" -msgstr "Underskrifter befordrade till officiella" +msgid "Update source and target information on the edges table." +msgstr "Uppdatera käll- och målinformationen i kanttabellen." -msgid "`#2718 `__: pgr_aStar(Combinations)" -msgstr "`#2718 `__: pgr_aStar(Kombinationer)" +msgid "The example has results" +msgstr "Exemplet har resultat" -msgid "`#2718 `__: pgr_aStarCost(Combinations)" -msgstr "`#2718 `__: pgr_aStarCost(Kombinationer)" +msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgstr "Routning från :math:`1` till :math:`18` ger en lösning." -msgid "`#2718 `__: pgr_bdAstar(Combinations)" -msgstr "`#2718 `__: pgr_bdAstar(Kombinationer)" +msgid "Touching edges" +msgstr "Beröring av kanter" -msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" -msgstr "`#2718 `__: pgr_bdAstarCost(Kombinationer)" +msgid "Visually the edges seem to be connected, but internally they are not." +msgstr "Visuellt verkar kanterna vara sammankopplade, men internt är de inte det." -msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" -msgstr "`#2718 `__: pgr_bdDijkstra(Kombinationer)" +msgid "The validity of the information is application dependent." +msgstr "Informationens giltighet är applikationsberoende." -msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" -msgstr "`#2718 `__: pgr_bdDijkstraCost(Kombinationer)" +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgstr "Kanske finns det en liten barriär för fordon men inte för fotgängare." -msgid "`#2718 `__: pgr_dijkstra(Combinations)" -msgstr "`#2718 `__: pgr_dijkstra(Kombinationer)" +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "När beröringarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas `__." -msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" -msgstr "`#2718 `__: pgr_dijkstraCost(Kombinationer)" +msgid "Fixing a gap" +msgstr "Åtgärda en lucka" -msgid "`#2718 `__: pgr_KSP(All signatures)" -msgstr "`#2718 `__: pgr_KSP(Alla signaturer)" +msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgstr "Routning från :math:`1` till :math:`2` ger ingen lösning." -msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" -msgstr "`#2718 `__: pgr_boykovKolmogorov(Kombinationer)" +msgid "Analyze the network for gaps." +msgstr "Analysera nätverket för att hitta luckor." -msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" -msgstr "`#2718 `__: pgr_edmondsKarp(Kombinationer)" +msgid "The analysis tell us that the network has a gap." +msgstr "Analysen visar att det finns en lucka i nätverket." -msgid "`#2718 `__: pgr_maxFlow(Combinations)" -msgstr "`#2718 `__: pgr_maxFlow(Kombinationer)" +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." +msgstr "Anropar :doc:`pgr_separateTouching` och lägger till de nya segmenten i tabellen över kanter." -msgid "`#2718 `__: pgr_pushRelabel(Combinations)" -msgstr "`#2718 `__: pgr_pushRelabel(Kombinationer)" +msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgstr "En routning från :math:`1` till :math:`2` ger en lösning." -msgid "New experimental functions." -msgstr "Nya experimentella funktioner." +msgid "Connecting components" +msgstr "Anslutning av komponenter" -msgid "Metrics" -msgstr "Mätvärde" +msgid "To get the graph connectivity:" +msgstr "För att få grafens anslutningsmöjligheter:" -msgid "`#2951 `__: pgr_bandwidth" -msgstr "`#2951 `__: pgr_bandbredd" +msgid "There are three basic ways to connect components:" +msgstr "Det finns tre grundläggande sätt att ansluta komponenter:" -msgid "Ordering" -msgstr "Ordning" +msgid "From the vertex to the starting point of the edge" +msgstr "Från toppunkten till startpunkten för kanten" -msgid "`#2954 `__: pgr_kingOrdering" -msgstr "`#2954 `__: pgr_kingOrdering" +msgid "From the vertex to the ending point of the edge" +msgstr "Från toppunkten till slutpunkten för kanten" -msgid "`#2955 `__: pgr_sloanOrdering" -msgstr "`#2955 `__: pgr_sloanOrdering" +msgid "From the vertex to the closest vertex on the edge" +msgstr "Från toppunkten till den närmaste toppunkten på kanten" -msgid "SQL signatures and output standardization" -msgstr "SQL-signaturer och standardisering av utdata" +msgid "This solution requires the edge to be split." +msgstr "Denna lösning kräver att kanten delas." -msgid "`#2904 `__: Standardize output columns of functions with different output" -msgstr "`#2904 `__: Standardisera utdatakolumner för funktioner med olika utdata" +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgstr "I detta exempel kommer :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` att användas." -msgid "columns within overloads" -msgstr "kolumner inom överbelastningar" +msgid "Get the connectivity" +msgstr "Få anslutningsmöjligheterna" -msgid "Standardized to |short-generic-result|" -msgstr "Standardiserad till |short-generic-result|" +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." +msgstr "I det här exemplet behöver tabellen edges en extra kolumn och tabellen vertex byggs om helt och hållet." -msgid "`#2905 `__: pgr_withPoints" -msgstr "`#2905 `__: pgr_withPoints" +msgid "Insert new edges" +msgstr "Infoga nya kanter" -msgid "`#2906 `__: pgr_bdDijkstra" -msgstr "`#2906 `__: pgr_bdDijkstra" +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgstr "Använd :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` för att infoga resultaten i tabellen över kanter." -msgid "`#2907 `__: pgr_bellmanFord" -msgstr "`#2907 `__: pgr_bellmanFord" +msgid "Create the vertices table" +msgstr "Skapa en tabell över hörnpunkter" -msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgstr "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgid "Using :doc:`pgr_extractVertices` create the table." +msgstr "Skapa tabellen med hjälp av :doc:`pgr_extractVertices`." -msgid "`#2910 `__: pgr_edwardMoore" -msgstr "`#2910 `__: pgr_edwardMoore" +msgid "Contraction of a graph" +msgstr "Sammandragning av en graf" -msgid "`#2913 `__: pgr_dagShortestPath" -msgstr "`#2913 `__: pgr_dagShortestPath" +msgid "The graph can be reduced in size using :doc:`contraction-family`" +msgstr "Grafen kan minskas i storlek med hjälp av :doc:`contraction-family`" -msgid "Standardized to |matrix-result|" -msgstr "Standardiserat till |matrix-result|" +msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." +msgstr "När kontrakt ska ingås beror på grafens storlek, behandlingstider, uppgifternas riktighet, den slutliga applikationen eller någon annan faktor som inte nämns." -msgid "`#2905 `__: pgr_withPointsCost" -msgstr "`#2905 `__: pgr_withPointsCost" +msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." +msgstr "En ganska bra metod för att ta reda på om sammandragning kan vara användbart är på grund av antalet återvändsgränder och/eller antalet linjära kanter." -msgid "`#2905 `__: pgr_withPointsCostMatrix" -msgstr "`#2905 `__: pgr_withPointsCostMatrix" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgstr "En fullständig metod för hur man kontraherar och hur man använder den kontraherade grafen beskrivs på :doc:`contraction-family`" -msgid "Standardized to |generic-result|" -msgstr "Standardiserat till |generic-result|" +msgid "To get the dead ends:" +msgstr "För att få bort återvändsgränderna:" -msgid "`#2909 `__: pgr_edgeDisjointPaths" -msgstr "`#2909 `__: pgr_edgeDisjointPaths" +msgid "A dead end happens when" +msgstr "En återvändsgränd uppstår när" -msgid "`#2909 `__: pgr_turnRestrictedPath" -msgstr "`#2909 `__: pgr_turnRestrictedPath" +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgstr "Toppunkten är gränsen för en återvändsgränd, en väg med genomfartsförbud eller en väg med utfartsförbud." -msgid "Standardized to |result_edge_color|" -msgstr "Standardiserad till |result_edge_color|" +msgid "The vertex is on the limit of the imported graph." +msgstr "Toppunkten ligger på gränsen för den importerade grafen." -msgid "`#2924 `__: pgr_edgeColoring" -msgstr "`#2924 `__: pgr_edgeColoring" +msgid "If a larger graph is imported then the vertex might not be a dead end" +msgstr "Om en större graf importeras är det inte säkert att toppunkten är en återvändsgränd" -msgid "Standardized to |result_node_color|" -msgstr "Standardiserad till |result_node_color|" +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgstr "Noden :math:`4`, är en återvändsgränd i frågan, även om den visuellt ser ut som en slutpunkt för 3 kanter." -msgid "`#2924 `__: pgr_bipartite" -msgstr "`#2924 `__: pgr_bipartite" +msgid "Is node :math:`4` a dead end or not?" +msgstr "Är noden :math:`4` en återvändsgränd eller inte?" -msgid "`#2927 `__: pgr_sequentialVertexColoring" -msgstr "`#2927 `__: pgr_sequentialVertexColoring" +msgid "The answer to that question will depend on the application." +msgstr "Svaret på den frågan beror på vilken applikation det gäller." -msgid "Standardized to |result-spantree|" -msgstr "Standardiserad till |result-spantree|" +msgid "Is there such a small curb:" +msgstr "Finns det en sådan liten trottoarkant:" -msgid "`#2931 `__: pgr_breadthFirstSearch" -msgstr "`#2931 `__: pgr_breadthFirstSearch" +msgid "That does not allow a vehicle to use that visual intersection?" +msgstr "Som inte tillåter ett fordon att använda den visuella korsningen?" -msgid "`#2931 `__: pgr_depthFirstSearch" -msgstr "`#2931 `__: pgr_depthFirstSearch" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgstr "Är applikationen för fotgängare och därför kan fotgängaren enkelt gå på den lilla trottoaren?" -msgid "Standardized to |result_node_order|" -msgstr "Standardisera till |result_node_order|" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgstr "Gäller applikationen el och elledningar som enkelt kan förlängas ovanpå den lilla trottoarkanten?" -msgid "`#2934 `__: pgr_topologicalSort" -msgstr "`#2934 `__: pgr_topologicalSort" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgstr "Finns det en stor klippa och från örnens utsikt ser det ut som att återvändsgränden ligger nära segmentet?" -msgid "Standardized to |result-closure|" -msgstr "Standardisera till |result-closure|" +msgid "Depending on the answer, modification of the data might be needed." +msgstr "Beroende på svaret kan det bli nödvändigt att ändra uppgifterna." -msgid "`#2934 `__: pgr_transitiveClosure" -msgstr "`#2934 `__: pgr_transitiveClosure" +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." +msgstr "När det finns många återvändsgränder kan funktionerna :doc:`contraction-family` användas för att dra ihop grafen för att påskynda bearbetningen." -msgid "Removal of SQL deprecated signatures" -msgstr "Borttagning av SQL-signaturer som inte längre är aktuella" +msgid "Linear edges" +msgstr "Linjära kanter" -msgid "`#2798 `__: pgr_contraction" -msgstr "`#2798 `__: pgr_kontraktion" +msgid "To get the linear edges:" +msgstr "För att få de linjära kanterna:" -msgid "`#2683 `__: pgr_trsp" -msgstr "`#2683 `__: pgr_trsp" +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgstr "Dessa linjära hörn är korrekta, till exempel när de hörnen är farthinder, stoppsignaler och applikationen tar hänsyn till dem." -msgid "`#2683 `__: pgr_trspVia" -msgstr "`#2683 `__: pgr_trspVia" +msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." +msgstr "När det finns många linjära toppar, som inte behöver beaktas, för att påskynda bearbetningen, kan funktionerna :doc:`contraction-family` användas för att kontrahera problemet." -msgid "`#2888 `__: pgr_findCloseEdges" -msgstr "`#2888 `__: pgr_findCloseEdges" +msgid "Function's structure" +msgstr "Funktionens struktur" -msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "Once the graph preparation work has been done above, it is time to use a" +msgstr "När förberedelserna för grafen har gjorts ovan är det dags att använda en" -msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "The general form of a pgRouting function call is:" +msgstr "Den allmänna formen för ett pgRouting-funktionsanrop är:" -msgid "`#2890 `__: pgr_withPointsDD" -msgstr "`#2890 `__: pgr_withPointsDD" +msgid "\\ \\" +msgstr "\\ \\" -msgid "`#2895 `__: pgr_withPointsKSP" -msgstr "`#2895 `__: pgr_withPointsKSP" +msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgstr "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgid "`#2899 `__: pgr_maxCardinalityMatch" -msgstr "`#2899 `__: pgr_maxCardinalityMatch" +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." +msgstr "`Innerfrågor`_: Är obligatoriska parametrar som är ``TEXT``-strängar som innehåller SQL-frågor." -msgid "`#2901 `__: pgr_TSP" -msgstr "`#2901 `__: pgr_TSP" +msgid "**parameters**: Additional compulsory parameters needed by the function." +msgstr "**parametrar**: Ytterligare obligatoriska parametrar som behövs för funktionen." -msgid "`#2901 `__: pgr_TSPeuclidean" -msgstr "`#2901 `__: pgr_TSPeuclidean" +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgstr "``Optionella parametrar``: Är icke obligatoriska **namngivna** parametrar som har ett standardvärde när de utelämnas." -msgid "Removal of SQL deprecated functions" -msgstr "Borttagning av föråldrade SQL-funktioner" +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgstr "De obligatoriska parametrarna är positionsparametrar och de valfria parametrarna är namnparametrar." -msgid "`#2681 `__: pgr_trspViaedges" -msgstr "`#2681 `__: pgr_trspViaedges" +msgid "For example, for this :doc:`pgr_dijkstra` signature:" +msgstr "Till exempel, för denna :doc:`pgr_dijkstra` signatur:" -msgid "`#2682 `__: pgr_trspViaVertices" -msgstr "`#2682 `__: pgr_trspViaVertices" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" -msgid "`#2748 `__: pgr_alphaShape" -msgstr "`#2748 `__: pgr_alphaShape" +msgid "`Edges SQL`_:" +msgstr "`Kanter SQL`_:" -msgid "`#2751 `__: pgr_createTopology" -msgstr "`#2751 `__: pgr_createTopology" +msgid "Is the first parameter." +msgstr "Är den första parametern." -msgid "`#2752 `__: pgr_analyzeGraph" -msgstr "`#2752 `__: pgr_analyzeGraph" +msgid "It is compulsory." +msgstr "Det är obligatoriskt." -msgid "`#2755 `__: pgr_analyzeOneWay" -msgstr "`#2755 `__: pgr_analyzeOneWay" +msgid "It is an inner query." +msgstr "Det är en inre frågeställning." -msgid "`#2827 `__: pgr_createVerticesTable" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgstr "Den har inget namn, så **Edges SQL** ger en uppfattning om vilken typ av inre fråga som måste användas" -msgid "`#2886 `__: pgr_nodeNetwork" -msgstr "`#2886 `__: pgr_nodeNetwork" +msgid "**start vid**:" +msgstr "**start vid**:" -msgid "Removal of SQL deprecated internal functions" -msgstr "Borttagning av interna funktioner i SQL som inte längre är aktuella" +msgid "Is the second parameter." +msgstr "Är den andra parametern." -msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" -msgstr "`#2748 `__ _pgr_alphaShape(text,dubbel precision)" +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." +msgstr "Den har inget namn, så **start vid** ger en uppfattning om vad den andra parameterns värde ska innehålla." -msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" -msgstr "`#2861 `__ _pgr_checkVertTab(text,text[],heltal,text)" +msgid "Is the third parameter." +msgstr "Är den tredje parametern." -msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" -msgstr "`#2861 `__ _pgr_createIndex(text,text,text,heltal,text)" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgstr "Den har inget namn, så **slut vid** ger en uppfattning om vad den tredje parameterns värde ska innehålla" -msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" -msgstr "`#2861 `__ _pgr_createIndex(text,text,text,text,heltal,text)" +msgid "Is the fourth parameter." +msgstr "Är den fjärde parametern." -msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" -msgstr "`#2913 `__ _pgr_dagShortestPath(text,valfri matris,valfri matris,boolean,boolean)" +msgid "It is optional." +msgstr "Det är valfritt." -msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgstr "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "It has a name." +msgstr "Den har ett namn." -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstraNear(text,valfri matris,valfri matris,bigint,boolean)" +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgstr "En fullständig beskrivning av parametrarna finns i avsnittet `Parametrar`_ för varje funktion." -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "Function's overloads" +msgstr "Funktionens överbelastningar" -msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstraNear(text,bigint,valfri matris,bigint,boolean)" +msgid "A function might have different overloads. The most common are called:" +msgstr "En funktion kan ha olika överbelastningar. De vanligaste kallas:" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "`One to One`_" +msgstr "`En till en`_" -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "`One to Many`_" +msgstr "`En till många`_" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "`Many to One`_" +msgstr "`Många till en`_" -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "`Many to Many`_" +msgstr "`Många till många`_" -msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" -msgstr "`#2735 `__ _pgr_drivingDistance(text,valfri matris,dubbel precision,boolean,boolean)" +msgid "`Combinations`_" +msgstr "`Kombinationer`_" -msgid "`#2861 `__ _pgr_endPoint(geometry)" -msgstr "`#2861 `__ _pgr_endPoint(geometry)" +msgid "Depending on the overload the parameters types change." +msgstr "Beroende på överbelastningen ändras parametertyperna." -msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" -msgstr "`#2861 `__ __pgr_getColumnName(text,text,heltal,text)" +msgid "**One**: **ANY-INTEGER**" +msgstr "**One**: **ANY-INTEGER**" -msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" -msgstr "`#2861 `__ __pgr_getColumnName(text,text,text,heltal,text)" +msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgstr "**Många**: ``ARRAY`` [**ANY-INTEGER**]" -msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" -msgstr "`#2861 `__ __pgr_getColumnType(text,text,heltal,text)" +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgstr "Beroende på funktion kan överbelastningarna variera. Men konceptet med ändring av parametertyp förblir detsamma." -msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" -msgstr "`#2861 `__ __pgr_getColumnType(text,text,text,heltal,text)" +msgid "When routing from:" +msgstr "När du dirigerar från:" -msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" -msgstr "`#2861 `__ __pgr_getTableName(text,heltal,text)" +msgid "From **one** starting vertex" +msgstr "Från **en** startpunkt" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" -msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,heltal,text)" +msgid "to **one** ending vertex" +msgstr "till **en** avslutande toppunkt" -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" -msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,text,heltal,text)" +msgid "to **many** ending vertices" +msgstr "till **många** avslutande hörn" -msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgstr "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgid "From **many** starting vertices" +msgstr "Från **många** startpunkter" -msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgstr "`#2745 `__ _pgr_kruskal(text,valfri matris,text,bigint,dubbel precision)" +msgid "From **many** different starting vertices" +msgstr "Från **många** olika startpunkter" -msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -msgstr "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean,boolean)" +msgid "to **many** different ending vertices" +msgstr "till **många** olika slutpunkter" -msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" -msgstr "`#2897 `__ _pgr_ksp(text,bigint,bigint,heltal,boolean,boolean)" +msgid "Every tuple specifies a pair of a start vertex and an end vertex" +msgstr "Varje tupel specificerar ett par av en startvertex och en slutvertex" -msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" -msgstr "`#2897 `__ _pgr_ksp(text,text,heltal,boolean,boolean)" +msgid "Users can define the combinations as desired." +msgstr "Användarna kan definiera kombinationerna som de vill." -msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgstr "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgid "Needs a `Combinations SQL`_" +msgstr "Behöver en `Combinations SQL`_" -msgid "`#2861 `__ _pgr_msg(integer,text,text)" -msgstr "`#2861 `__ _pgr_msg(heltal,text,text)" +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." +msgstr "Det finns flera olika typer av giltiga inre frågor och de kolumner som returneras beror också på funktionen. Vilken typ av inner query som används beror på funktionens krav. För att förenkla de många olika typerna används **ANY-INTEGER** och **ANY-NUMERICAL**." -msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" -msgstr "`#2861 `__ _pgr_onerror(boolean,heltal,text,text,text,text,text)" +msgid "Edges SQL for" +msgstr "Edges SQL för" -msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" -msgstr "`#2861 `__ _pgr_pointtoid(geometri,dubbel precision,text,heltal)" +msgid "Some uncategorised functions" +msgstr "Vissa okategoriserade funktioner" -msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" -msgstr "`#2743 `__ _pgr_prim(text,valfri matris,text,bigint,dubbel precision)" +msgid "General without ``id``" +msgstr "Allmänt utan ``id``" -msgid "`#2861 `__ _pgr_quote_ident(text)" -msgstr "`#2861 `__ _pgr_quote_ident(text)" +msgid "General with (X,Y)" +msgstr "Allmänt med (X,Y)" -msgid "`#2861 `__ _pgr_startPoint(geometry)" -msgstr "`#2861 `__ _pgr_startPoint(geometry)" +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgstr "När den är negativ: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen." -msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "`#2683 `__ _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" +msgid "Weight of the edge (``target``, ``source``)," +msgstr "Kantvikt (``mål``, ``källa``)," -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,valfri matris,valfri matris,boolean)" +msgid "``x1``" +msgstr "``x1``" -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,valfri matris,bigint,boolean)" +msgid "X coordinate of ``source`` vertex." +msgstr "X-koordinat för ``källans`` toppunkt." -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,valfri matris,boolean)" +msgid "``y1``" +msgstr "``y1``" -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" +msgid "Y coordinate of ``source`` vertex." +msgstr "Y-koordinat för ``källans`` toppunkt." -msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgstr "`#2682 `__ _pgr_trspViaVertices(text,heltal[],boolean,boolean,text)" +msgid "``x2``" +msgstr "``x2``" -msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" +msgid "X coordinate of ``target`` vertex." +msgstr "X-koordinat för ``mål`` vertex." -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)" +msgid "``y2``" +msgstr "``y2``" -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,tecken,boolean)" +msgid "Y coordinate of ``target`` vertex." +msgstr "Y-koordinat för \"målets\" toppunkt." -msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" +msgid "Flow" +msgstr "Flöde" -msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" +msgid "Edges SQL for :doc:`flow-family`" +msgstr "Edges SQL för :doc:`flow-family`" -msgid "`#2861 `__ _pgr_versionLess(text,text)" -msgstr "`#2861 `__ _pgr_versionLess(text,text)" +msgid "Edges SQL for the following functions of :doc:`flow-family`" +msgstr "Edges SQL för följande funktioner i :doc:`flow-family`" -msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "`#2890 `__ _pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" +msgid "Used in combination signatures" +msgstr "Används i kombinationssignaturer" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" -msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,valfri matris,valfri matris,heltal,tecken,boolean,boolean,boolean,boolean,boolean)" +msgid "Points SQL for" +msgstr "Punkt SQL för" -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgstr "Huvudparametern för de flesta pgRouting-funktioner är en fråga som väljer ut kanterna i grafen." -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,text,heltal,tecken,boolean,boolean,boolean,boolean)" +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgstr "Beroende på vilken familj eller kategori en funktion tillhör kommer den att ha ytterligare parametrar, varav vissa är obligatoriska och andra valfria." -msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgstr "`#2741 `__ _pgr_withPointsVia(text,bigint[],dubbel precision[],boolean)" +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgstr "De obligatoriska parametrarna är namnlösa och måste anges i den ordning som krävs. De valfria parametrarna är namngivna parametrar och kommer att ha ett standardvärde." -msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2741 `__ _pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)" +msgid "Parameters for the Via functions" +msgstr "Parametrar för Via-funktionerna" -msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__ _trsp(text,text,valfri matris,valfri matris,boolean)" +msgid "SQL query as described." +msgstr "SQL-fråga enligt beskrivning." -msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__ _v4trsp(text,text,valfri matris,valfri matris,boolean)" +msgid "When ``true`` Graph is considered `Directed`" +msgstr "När en \"sann\" graf anses vara \"riktad" -msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" -msgstr "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgid "When ``false`` the graph is considered as Undirected." +msgstr "När ``false`` betraktas grafen som Undirected." -msgid "Summary of functions and signatures no longer on pgrouting" -msgstr "Sammanfattning av funktioner och signaturer som inte längre finns på pgrouting" +msgid "``strict``" +msgstr "``strict``" -msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" -msgstr "`#2748 `__ pgr_alphashape(geometri,dubbel precision)" +msgid "``false``" +msgstr "``false``" -msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgstr "`#2752 `__ pgr_analyzegraph(text,dubbel precision,text,text,text,text,text,text)" +msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" +msgstr "När ``true`` om en sökväg saknas stoppar och returnerar **EMPTY SET**" -msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" -msgstr "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean,text,text,text)" +msgid "When ``false`` ignores missing paths returning all paths found" +msgstr "När ``false`` ignorerar saknade sökvägar returneras alla sökvägar som hittats" -msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "``U_turn_on_edge``" +msgstr "``U_turn_on_edge``" -msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" -msgstr "`#2751 `__ pgr_createtopology(text,dubbel precision,text,text,text,text,text,boolean)" +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgstr "När ``true`` avgår från ett besökt toppunkt kommer inte att försöka undvika att använda den kant som användes för att nå det. Med andra ord är det tillåtet att använda kanten med samma identifierare i U-svängen." -msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" -msgstr "`#2827 `__ pgr_createverticestable(text,text,text,text,text,text)" +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgstr "När ``false`` när en avgång från en besökt topp försöker undvika att använda den kant som användes för att nå den. Med andra ord, U-sväng med kanten med samma identifierare används när ingen annan väg hittas." -msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "`#2888 `__ pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean,boolean)" +msgid "For the TRSP functions" +msgstr "För TRSP-funktionerna" -msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "`#2888 `__ pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean,boolean)" +msgid "Array of identifiers of destination vertices." +msgstr "Array med identifierare för målpunkter." -msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgstr "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgid "There are several kinds of columns returned are depending of the function." +msgstr "Det finns flera olika typer av kolonner som returneras beroende på funktion." -msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgstr "`#2886 `__ pgr_nodenetwork(text,dubbel precision,text,text,text,text,text,boolean)" +msgid "Result columns for single path functions" +msgstr "Resultatkolumner för funktioner med enkel sökväg" -msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "`#2683 `__ pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" +msgid "Used in functions that return one path solution per departure and destination." +msgstr "Används i funktioner som returnerar en lösning per avgång och destination." -msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "`#2683 `__ pgr_trsp(text,heltal,heltal,boolean,boolean,text)" +msgid ":doc:`pgr_dijkstraNear`" +msgstr ":doc:`pgr_dijkstraNear`" -msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "`#2681 `__ pgr_trspViaedges(text,heltal[],dubbel precision[],boolean,boolean,text)" +msgid "Returns |short-generic-result|" +msgstr "Returnerar |short-generic-result|" -msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "`#2682 `__ pgr_trspViaVertices(text,valfri matris,boolean,boolean,text)" +msgid "``path_seq``" +msgstr "``path_seq``" -msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" +msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgstr "Relativ position i tågläget. Har värdet **1** för början av ett tågläge." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)" +msgid "Identifier of the starting vertex of the current path." +msgstr "Identifierar startpunkten för den aktuella banan." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "Identifier of the ending vertex of the current path." +msgstr "Identifierare för den aktuella banans slutpunkt." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." +msgstr "Identifierare av noden i sökvägen från ``start_vid`` till ``slut_vid``." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgstr "Identifierare av den kant som används för att gå från ``node`` till nästa nod i sökvägssekvensen. **-1** för den sista noden i sökvägen." -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgstr "Kostnad för att gå från ``nod`` med hjälp av ``edge`` till nästa nod i vägsekvensen." -msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgstr "När kolumnerna ``start_vid`` eller ``end_vid`` har negativa värden är identifieraren för en Point." -msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "`#2901 `__ pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" +msgid "Result columns for multiple paths functions" +msgstr "Resultatkolumner för funktioner med flera sökvägar" -msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCostMatrix(text,text,valfri matris,boolean,tecken)" +msgid "Used in functions that return many paths solutions per departure and destination." +msgstr "Används i funktioner som returnerar många banlösningar per avgång och destination." -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,valfri matris,valfri matris,boolean,tecken)" +msgid ":doc:`pgr_KSP`" +msgstr ":doc:`pgr_KSP`" -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,valfri matris,bigint,boolean,tecken)" +msgid ":doc:`pgr_withPointsKSP`" +msgstr ":doc:`pgr_withPointsKSP`" -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,valfri matris,boolean,tecken)" +msgid "Returns set of |generic-result|" +msgstr "Returnerar uppsättning av |generic-result|" -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "``path_id``" +msgstr "``path_id``" -msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" -msgstr "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,tecken)" +msgid "Path identifier." +msgstr "Identifierare för sökväg." -msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "`#2890 `__ pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgstr "Har värdet **1** för den första i en sökväg från ``start_vid`` till ``slut_vid``." -msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "`#2890 `__ pgr_withPointsDD(text,text,bigint,dubbel precision,boolean,tecken,boolean)" +msgid "Result columns for cost functions" +msgstr "Resultatkolumner för kostnadsfunktioner" -msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgid "Used by:" +msgstr "Används av:" -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)" +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgstr "När kolumnerna start_vid eller end_vid har negativa värden är identifieraren för en Point." -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,valfri matris,bigint,boolean,tecken,boolean)" +msgid "Result columns for flow functions" +msgstr "Resultatkolumner för flödesfunktioner" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,valfri matris,boolean,tecken,boolean)" +msgid "Result columns for spanning tree functions" +msgstr "Resultatkolumner för funktioner för spännträd" -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,tecken,boolean)" +msgid "Used in functions that return a tree solution per departure." +msgstr "Används i funktioner som returnerar en trädlösning per avgång." -msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPoints(text,text,text,boolean,tecken,boolean)" +msgid "Result columns for simple spanning tree functions" +msgstr "Resultatkolumner för funktioner för enkla spännträd" -msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "`#2919 `__ pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)" +msgid "Returns set of ``(edge, cost)``" +msgstr "Returnerar uppsättning av ``(kant, kostnad)``" -msgid "Code enhancements" -msgstr "Förbättringar av koden" +msgid "Cost to traverse the edge." +msgstr "Kostnad för att korsa kanten." -msgid "Removal of unused C/C++ code" -msgstr "Borttagning av oanvänd C/C++-kod" +msgid "Performance Tips" +msgstr "Tips om prestanda" -msgid "Refactor the Script to build the update PostgreSQL file." -msgstr "Refaktorera skriptet för att bygga uppdateringsfilen PostgreSQL." +msgid "For the Routing functions" +msgstr "För Routing-funktionerna" -msgid "One process & driver for:" -msgstr "En process & drivrutin för:" +msgid "To get faster results bound the queries to an area of interest of routing." +msgstr "För att få snabbare resultat avgränsar du frågorna till ett intresseområde för routning." -msgid "allpairs: johnson and Floyd-Warshall" -msgstr "alla par: johnson och Floyd-Warshall" +msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." +msgstr "I det här exemplet Använd en inre fråga SQL som inte innehåller några kanter i routningsfunktionen och som ligger inom resultatområdet." -msgid "Shortest path: Dijkstra and withPoints using Dijkstra" -msgstr "Kortaste vägen: Dijkstra och withPoints med hjälp av Dijkstra" +msgid "Given this area:" +msgstr "Med tanke på detta område:" -msgid "Deprecation of internal C/C++ functions" -msgstr "Avveckling av interna C/C++-funktioner" +msgid "Calculate a route:" +msgstr "Beräkna en rutt:" -msgid "Deprecated functions are substituted by new function." -msgstr "Föråldrade funktioner ersätts av nya funktioner." +msgid "How to contribute" +msgstr "Hur du bidrar" -msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" -msgstr "_pgr_drivingDistance => _pgr_drivingDistancev4" +msgid "Wiki" +msgstr "Wiki" -msgid "_pgr_withPointsDD => _pgr_withPointsddv4" -msgstr "_pgr_medPointsDD => _pgr_medPointsddv4" +msgid "Edit an existing `pgRouting Wiki `__ page." +msgstr "Redigera en befintlig sida i `pgRouting Wiki `__." -msgid "_pgr_kruskal => _pgr_kruskalv4" -msgstr "_pgr_kruskal => _pgr_kruskalv4" +msgid "Or create a new Wiki page" +msgstr "Eller skapa en ny Wiki-sida" -msgid "_pgr_prim => _pgr_primv4" -msgstr "_pgr_prim => _pgr_primv4" +msgid "Create a page on the `pgRouting Wiki `__" +msgstr "Skapa en sida på `pgRouting Wiki `__" -msgid "_pgr_dijkstra => _pgr_dijkstra_v4" -msgstr "_pgr_dijkstra => _pgr_dijkstra_v4" +msgid "Give the title an appropriate name" +msgstr "Ge titeln ett lämpligt namn" -msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" -msgstr "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" +msgid "`Example `__" +msgstr "exempel `__" -msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" -msgstr "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgid "Adding Functionality to pgRouting" +msgstr "Lägga till funktionalitet i pgRouting" -msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" -msgstr "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" +msgid "Consult the `developer's documentation `__" +msgstr "Se dokumentationen för utvecklare `__" -msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" -msgstr "_pgr_medPointsVia => _pgr_medPointsvia_v4" +msgid "Installation" +msgstr "Installation" -msgid "Internal C/C++ functions in legacy" -msgstr "Interna C/C++-funktioner i äldre" +msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" +msgstr "Instruktioner för nedladdning och installation av binärfiler för olika operativsystem, ytterligare anmärkningar och korrigeringar som inte ingår i denna dokumentation finns i `Installation wiki `__" -msgid "`#2683 `__ _trsp" -msgstr "`#2683 `__ _trsp" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgstr "För att använda pgRouting måste PostGIS vara installerat, läs informationen om installation i denna installationsguide `__" -msgid "`#2683 `__ _v4trsp" -msgstr "`#2683 `__ _v4trsp" +msgid "Short Version" +msgstr "Kort version" -msgid "`#2748 `__ _pgr_alphaShape" -msgstr "`#2748 `__ _pgr_alphaShape" +msgid "Extracting the tar ball" +msgstr "Extrahera tar-bollen" -msgid "`#2913 `__ _pgr_dagShortestPath" -msgstr "`#2913 `__ _pgr_dagShortestPath" +msgid "To compile assuming you have all the dependencies in your search path:" +msgstr "För att kompilera förutsatt att du har alla beroenden i din sökväg:" -msgid "All releases" -msgstr "Alla utgåvor" +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." +msgstr "När pgRouting har installerats måste det aktiveras i varje enskild databas som du vill använda det i." -msgid "Kruskal - Family of functions" -msgstr "Kruskal - Familj av funktioner" +msgid "Get the sources" +msgstr "Hämta källorna" -msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." -msgstr "Kruskals algoritm är en \"greedy minimum spanning tree\"-algoritm som i varje cykel hittar och lägger till den kant med minsta möjliga vikt som förbinder två träd i skogen." +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgstr "Den senaste versionen av pgRouting finns på https://github.com/pgRouting/pgrouting/releases/latest" -msgid "**The main Characteristics are:**" -msgstr "**De viktigaste egenskaperna är:**" +msgid "To download this release:" +msgstr "För att ladda ner denna release:" -msgid "The total weight of all the edges in the tree or forest is minimized." -msgstr "Den totala vikten för alla kanter i trädet eller skogen minimeras." +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgstr "Gå till :ref:`install-short` för mer instruktioner om hur du extraherar tar ball och kompilerar pgRouting." -msgid "Kruskal's running time: :math:`O(E * log E)`" -msgstr "Kruskals körtid: :math:`O(E * log E)`" +msgid "git" +msgstr "git" -msgid "Metrics - Family of functions" -msgstr "Metrics - Familj av funktioner" +msgid "To download the repository" +msgstr "Så här laddar du ner arkivet" -msgid "Migration guide" -msgstr "Migrationsguide" +msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." +msgstr "Gå till :ref:`install-short` för mer instruktioner om hur du kompilerar pgRouting (det finns ingen tarball inblandad när du laddar ner pgRouting-arkivet från GitHub)." -msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." -msgstr "Flera funktioner har förändringar på signaturerna och/eller har ersatts av nya funktioner." +msgid "Enabling and upgrading in the database" +msgstr "Aktivering och uppgradering i databasen" -msgid "Results can be different because of the changes." -msgstr "Resultaten kan bli annorlunda på grund av förändringarna." +msgid "Enabling the database" +msgstr "Aktivering av databasen" -msgid "All deprecated functions will be removed on next major version 4.0.0" -msgstr "Alla föråldrade funktioner kommer att tas bort i nästa större version 4.0.0" +msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." +msgstr "pgRouting är en PostgreSQL-förlängning och beror på PostGIS för att tillhandahålla funktioner till slutanvändaren. Nedanstående kod demonstrerar aktivering av PostGIS och pgRouting i databasen." -msgid "Migration to standardized columns" -msgstr "Migrering till standardiserade kolumner" +msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgstr "Kontroll av PostGIS- och pgRouting-version efter att de har aktiverats i databasen." -msgid "There has been an effort to standardize function output columns names and types." -msgstr "Det har gjorts försök att standardisera namn och typer på kolumner för funktionsutdata." +msgid "Upgrading the database" +msgstr "Uppgradering av databasen" -msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgstr "Använd följande kommando för att uppgradera pgRouting i databasen till version 4.1.0:" -msgid "|matrix-result|" -msgstr "|matrix-result|" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgstr "Mer information finns på https://www.postgresql.org/docs/current/sql-createextension.html" -msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgid "Dependencies" +msgstr "Beroenden" -msgid "|short-generic-result|" -msgstr "|short-generic-result|" +msgid "Compilation Dependencies" +msgstr "Beroenden för kompilering" -msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgstr "För att kunna kompilera pgRouting måste du se till att följande beroenden är uppfyllda:" -msgid "|result-spantree|" -msgstr "|result-spantree|" +msgid "C and C++0x compilers" +msgstr "C- och C++0x-kompilatorer" -msgid "Function" -msgstr "Funktion" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgstr "Kompilering med Boost 1.56 upp till Boost 1.74 kräver C++-kompilator med standardstöd för C++03 eller C++11" -msgid ":doc:`pgr_dijkstra`" -msgstr ":doc:`pgr_dijkstra`" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgstr "Kompilering med Boost 1.75 kräver C++-kompilator med stöd för C++14-standarden" -msgid "`Migration of single path functions`_" -msgstr "`Migrering av funktioner med en enda sökväg`_" +msgid "Postgresql version >= 13" +msgstr "Postgresql-version >= 13" -msgid ":doc:`pgr_aStar`" -msgstr ":doc:`pgr_aStar`" +msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgstr "Boost Graph Library (BGL) >= 1.56.0" -msgid ":doc:`pgr_bdAstar`" -msgstr ":doc:`pgr_bdAstar`" +msgid "CMake >= 3.12" +msgstr "CMake >= 3.12" -msgid ":doc:`pgr_drivingDistance`" -msgstr ":doc:`pgr_drivingDistance`" +msgid "For user's documentation" +msgstr "För användardokumentation" -msgid "`Migration of spanning tree functions`_" -msgstr "`Migration av funktioner för spänningsträd`_" +msgid "Sphinx >= 4.0" +msgstr "Sphinx >= 4.0" -msgid ":doc:`pgr_withPointsDD`" -msgstr ":doc:`pgr_withPointsDD`" +msgid "For developer's documentation" +msgstr "För dokumentation för utvecklare" -msgid ":doc:`pgr_bdDijkstra`" -msgstr ":doc:`pgr_bdDijkstra`" +msgid "Doxygen >= 1.7" +msgstr "Doxygen >= 1.7" -msgid ":doc:`pgr_binaryBreadthFirstSearch`" -msgstr ":doc:`pgr_binaryBreadthFirstSearch`" +msgid "For testing" +msgstr "För testning" -msgid ":doc:`pgr_bipartite`" -msgstr ":doc:`pgr_bipartite`" +msgid "pgtap" +msgstr "pgtap" -msgid "`Migration of output column name change`_" -msgstr "`Migrering av namnändring för utdatakolumn`_" +msgid "pg_prove" +msgstr "pg_prove" -msgid ":doc:`pgr_breadthFirstSearch`" -msgstr ":doc:`pgr_breadthFirstSearch`" +msgid "For using:" +msgstr "För användning:" -msgid ":doc:`pgr_depthFirstSearch`" -msgstr ":doc:`pgr_depthFirstSearch`" +msgid "PostGIS version >= 3.0.0" +msgstr "PostGIS version >= 3.0.0" -msgid ":doc:`pgr_edgeColoring`" -msgstr ":doc:`pgr_edgeColoring`" +msgid "Example: Installing dependencies on linux" +msgstr "Exempel: Installera beroenden på Linux" -msgid "`Migration of multiple paths functions`_" -msgstr "`Migrering av funktioner för flera sökvägar`_" +msgid "Installing the compilation dependencies" +msgstr "Installera kompileringsberoendena" -msgid ":doc:`pgr_sequentialVertexColoring`" -msgstr ":doc:`pgr_sequentialVertexColoring`" +msgid "Build dependencies" +msgstr "Bygg beroenden" -msgid ":doc:`pgr_topologicalSort`" -msgstr ":doc:`pgr_topologicalSort`" +msgid "Optional dependencies" +msgstr "Valfria beroenden" -msgid ":doc:`pgr_withPoints`" -msgstr ":doc:`pgr_withPoints`" +msgid "For documentation" +msgstr "För dokumentation" -msgid "`Migration of cost functions`_" -msgstr "`Migrering av kostnadsfunktioner`_" +msgid "Configuring" +msgstr "Konfigurering" -msgid "Migration of cost functions" -msgstr "Migrering av kostnadsfunktioner" +msgid "pgRouting uses the `cmake` system to do the configuration." +msgstr "pgRouting använder `cmake`-systemet för att göra konfigurationen." -msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" -msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for cost functions` är |matrix-result|" +msgid "Configurable variables" +msgstr "Konfigurerbara variabler" -msgid "The following functions need to be migrated when they are being used in an application." -msgstr "Följande funktioner måste migreras när de används i en applikation." +msgid "To see the variables that can be configured" +msgstr "För att se vilka variabler som kan konfigureras" -msgid "Version" -msgstr "Version" +msgid "The build directory is different from the source directory" +msgstr "Byggkatalogen skiljer sig från källkatalogen" -msgid "From" -msgstr "Från" +msgid "Configuring The Documentation" +msgstr "Konfigurera dokumentationen" -msgid "``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" +msgid "User and developers documentation are not build if prerequisites are not found." +msgstr "Användar- och utvecklardokumentation byggs inte om förutsättningarna inte hittas." -msgid "v < 4.0" -msgstr "v < 4.0" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgstr "Det mesta av arbetet med dokumentationen har lagts på HTML-filerna. Några variabler för att bygga dokumentation:" -msgid "|matrix-pid|" -msgstr "|matrix-pid|" +msgid "Variable" +msgstr "Variabel" -msgid "``pgr_withPointsCostMatrix``" -msgstr "``pgr_withPointsCostMatrix``" +msgid "Comment" +msgstr "Kommentar" -msgid "**to** |matrix-result|" -msgstr "**till** |matrix-result|" +msgid "BUILD_HTML" +msgstr "BUILD_HTML" -msgid "Migration of |matrix-pid|" -msgstr "Migrering av |matrix-pid|" +msgid "BOOL=ON" +msgstr "BOOL=ON" -msgid "Signatures to be migrated:" -msgstr "Signaturer som ska migreras:" +msgid "If ON, turn on/off building HTML for user's documentation" +msgstr "Om ON, aktivera/avaktivera HTML-skapande för användardokumentation" -msgid "One to One" -msgstr "En till en" +msgid "BUILD_DOXY" +msgstr "BYGG_DOXY" -msgid "One to Many" -msgstr "En till många" +msgid "If ON, turn on/off building HTML for developer's documentation" +msgstr "Om ON, aktivera/avaktivera HTML-skapande för utvecklarens dokumentation" -msgid "Many to One" -msgstr "Många till en" +msgid "BUILD_LATEX" +msgstr "BUILD_LATEX" -msgid "Many to Many" -msgstr "Många till många" +msgid "BOOL=OFF" +msgstr "BOOL=OFF" -msgid "Combinations" -msgstr "Kombinationer" +msgid "If ON, turn on/off building PDF" +msgstr "Om ON, slå på/av byggnad PDF" -msgid "Breaking change" -msgstr "Brytande förändring" +msgid "BUILD_MAN" +msgstr "BYGGHANDLARE" -msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" -msgstr "Om du använder ``pgr_withPointsCost``: kolumnnamn måste ändras efter uppdatering av pgRouting" +msgid "If ON, turn on/off building MAN pages" +msgstr "Om ON, aktivera/avaktivera byggnadens MAN-sidor" -msgid "New output columns are |matrix-result|" -msgstr "Nya utdatakolumner är |matrix-result|" +msgid "DOC_USE_BOOTSTRAP" +msgstr "DOC_ANVÄNDA_BOOTSTRAP" -msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." -msgstr "För att få kolumnnamnen i den gamla versionen: byt namn på ``start_vid`` till ``start_pid`` och ``end_vid`` till ``end_pid``." +msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" +msgstr "Om PÅ, använd sphinx-bootstrap för HTML-sidor i användardokumentationen" -msgid "Examples" -msgstr "Exempel" +msgid "EN" +msgstr "EN" -msgid "Examples for One to One for cost functions" -msgstr "Exempel på One to One för kostnadsfunktioner" +msgid "if OFF the English documentation will no be built" +msgstr "om OFF den engelska dokumentationen kommer inte att byggas" -msgid "Using ``pgr_withPointsCost``" -msgstr "Använda ``pgr_withPointsCost``" +msgid "ES" +msgstr "ES" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "if OFF the Spanish documentation will no be built" +msgstr "om OFF den spanska dokumentationen kommer inte att byggas" -msgid "from" -msgstr "från" +msgid "SV" +msgstr "SV" -msgid "to" -msgstr "till" +msgid "if OFF the Swedish documentation will no be built" +msgstr "om OFF kommer den svenska dokumentationen inte att byggas" -msgid "Examples for One to Many for cost functions" -msgstr "Exempel på One to Many för kostnadsfunktioner" +msgid "ZH_HANS" +msgstr "ZH_HANS" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "if OFF the Chinese simplified documentation will no be built" +msgstr "om OFF den kinesiska förenklade dokumentationen kommer inte att byggas" -msgid "Examples for Many to One for cost functions" -msgstr "Exempel på Many to One för kostnadsfunktioner" +msgid "Building" +msgstr "Byggnad" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "Using ``make`` to build the code and the documentation" +msgstr "Använda ``make`` för att bygga koden och dokumentationen" -msgid "Examples for Many to Many for cost functions" -msgstr "Exempel på Many to Many för kostnadsfunktioner" +msgid "The following instructions start from ``path/to/pgrouting/build``" +msgstr "Följande instruktioner startar från ``stigen/till/pgrouting/build``" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgstr "Vi har testat på flera plattformar, För installation eller ominstallation behövs alla steg." -msgid "Examples for Combinations for cost functions" -msgstr "Exempel på Kombinationer för kostnadsfunktioner" +msgid "Linux" +msgstr "Linux" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "The following instructions start from ``path/to/pgrouting``" +msgstr "Följande instruktioner börjar från ``path/to/pgrouting``" -msgid "Migration of multiple paths functions" -msgstr "Migrering av funktioner för flera banor" +msgid "Testing" +msgstr "Testar" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" -msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |nksp-result|" +msgid "Currently there is no :code:`make test` and testing is done as follows" +msgstr "För närvarande finns det ingen :code:`make test` och testning görs på följande sätt" -msgid "``pgr_KSP``" -msgstr "``pgr_KSP``" +msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." +msgstr "pgRouting är en förlängning av `PostGIS `__ och `PostgreSQL `__ geospatial databas och lägger till routing och annan nätverksanalysfunktionalitet. En föregångare till pgRouting - pgDijkstra, skriven av Sylvain Pasche från `Camptocamp `__, utökades senare av Orkney och döptes om till pgRouting. Projektet stöds och underhålls nu av `Georepublic `__, `Paragon Corporation `__ och en bred användargrupp." -msgid "v < 3.6" -msgstr "v < 3.6" +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgstr "pgRouting är en del av `OSGeo Community Projects `__ från `OSGeo Foundation `__ och ingår i `OSGeoLive `__." -msgid ":ref:`from_ksp_result`" -msgstr ":ref:`from_ksp_result`" +msgid "Licensing" +msgstr "Licens" -msgid "``pgr_edgeDisjointPaths``" -msgstr "``pgr_edgeDisjointPaths``" +msgid "The following licenses can be found in pgRouting:" +msgstr "Följande licenser finns i pgRouting:" -msgid ":ref:`from_result_disjoint`" -msgstr ":ref:`from_result_disjoint`" +msgid "**License**" +msgstr "**Licens**" -msgid "Migration of |ksp-result|" -msgstr "Migrering av |ksp-result|" +msgid "GNU General Public License v2.0 or later" +msgstr "GNU General Public License v2.0 eller senare" -msgid "|nksp-result|" -msgstr "|nksp-result|" +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgstr "De flesta funktioner i pgRouting är tillgängliga under `GNU General Public License v2.0 eller senare `_." -msgid "Before updating pgRouting, enumerate the |ksp-result|" -msgstr "Innan du uppdaterar pgRouting, räkna upp |ksp-result|" +msgid "Boost Software License - Version 1.0" +msgstr "Licens för Boost-programvara - Version 1.0" -msgid "One to One example using ``pgr_KSP``" -msgstr "Ett till ett exempel med hjälp av ``pgr_KSP``" +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgstr "Vissa Boost-tillägg är tillgängliga under `Boost Software License - Version 1.0 `_." -msgid "Using `this `__ example." -msgstr "Använda `det här `__ exemplet." +msgid "MIT-X License" +msgstr "MIT-X-licens" -msgid "Migration of |result-disjoint|" -msgstr "Migrering av |result-disjoint|" +msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgstr "Viss kod som tillhandahålls av iMaptools.com är tillgänglig under MIT-X-licens." -msgid "Before updating pgRouting, enumerate the |result-disjoint|" -msgstr "Innan du uppdaterar pgRouting, räkna upp |result-disjoint|" +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgstr "Manualen för pgRouting är licensierad under en `Creative Commons Attribution-Share Alike 3.0 License `_." -msgid "Skip when applicable, ``start_vid``" -msgstr "Hoppa över när det är tillämpligt, ``start_vid``" +msgid "In general license information should be included in the header of each source file." +msgstr "I allmänhet bör licensinformation inkluderas i sidhuvudet för varje källfil." -msgid "Skip when applicable, ``end_vid``" -msgstr "Hoppa över när det är tillämpligt, ``end_vid``" +msgid "Contributors" +msgstr "Medverkande" -msgid "One to One example using ``pgr_edgeDisjointPaths``" -msgstr "Ett till ett exempel med hjälp av ``pgr_edgeDisjointPaths``" +msgid "This Release Contributors" +msgstr "Medverkande i denna utgåva" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "Individuals in this release |release| (in alphabetical order)" +msgstr "Personer i denna utgåva |release| (i alfabetisk ordning)" -msgid "Before updating pgRouting enumerate the columns: |ksp-result|" -msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |ksp-result|" +msgid "Mohit Rawat, Regina Obe, Vicky Vergara" +msgstr "Mohit Rawat, Regina Obe, Vicky Vergara" -msgid "Migration of single path functions" -msgstr "Migrering av funktioner med en enda sökväg" +msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgstr "Och alla de människor som ger oss lite av sin tid genom att kommentera, hitta problem, göra pull requests etc. i någon av våra produkter: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" -msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |short-generic-result|" +msgid "Translators (in alphabetical order)" +msgstr "Översättare (i alfabetisk ordning)" -msgid "``pgr_dijkstra``" -msgstr "``pgr_dijkstra``" +msgid "Chinese:" +msgstr "Kinesiska:" -msgid "v < 3.5" -msgstr "v < 3.5" +msgid "Dapeng Wang" +msgstr "Dapeng Wang" -msgid "|old-generic-result|" -msgstr "|old-generic-result|" +msgid "Spanish:" +msgstr "Spanska:" -msgid "``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "Vicky Vergara" +msgstr "Vicky Vergara" -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "Swedish:" +msgstr "Svenska:" -msgid "``pgr_bellmanFord``" -msgstr "``pgr_bellmanFord``" +msgid "Daniel Nylander" +msgstr "Daniel Nylander" -msgid "``pgr_dagShortestPath``" -msgstr "``pgr_dagShortestPath``" +msgid "Corporate Sponsors in this release (in alphabetical order)" +msgstr "Företagssponsorer i denna utgåva (i alfabetisk ordning)" -msgid "|result-1-1|" -msgstr "|result-1-1|" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "Dessa är företagsenheter som har bidragit med utvecklingstid, hosting eller direkt monetär finansiering till pgRouting-projektet:" -msgid "``pgr_edwardMoore``" -msgstr "``pgr_edwardMoore``" +msgid "`OSGeo `__" +msgstr "`OSGeo `__" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +msgid "`OSGeo UK `__" +msgstr "oSGeo Storbritannien `__" -msgid "|old-pid-result|" -msgstr "|old-pid-result|" +msgid "`Google Summer of Code `__" +msgstr "googles sommarprogram för kodning `__" -msgid "Migration of |old-generic-result|" -msgstr "Migrering av |old-generic-result|" +msgid "`HighGo Software `__" +msgstr "`HighGo-programvara `__" -msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" -msgstr "Innan du uppdaterar pgRouting, räkna upp motsvarande kolumner i signaturen" +msgid "`Paragon Corporation `__" +msgstr "`Paragon Corporation `__" -msgid "Migration of |old-pid-result|" -msgstr "Migrering av |old-pid-result|" +msgid "Contributors Past & Present:" +msgstr "Tidigare och nuvarande bidragsgivare:" -msgid "To get the old version column names, depending on the signature:" -msgstr "För att få den gamla versionen kolumnnamn, beroende på signaturen:" +msgid "Individuals (in alphabetical order)" +msgstr "Enskilda personer (i alfabetisk ordning)" -msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" -msgstr "Filtrera bort kolumnerna: ``start_vid`` och/eller ``slut_vid``" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgid "Rename the columns:" -msgstr "Byt namn på kolumnerna:" +msgid "Corporate Sponsors (in alphabetical order)" +msgstr "Företagssponsorer (i alfabetisk ordning)" -msgid "``start_vid`` to ``start_pid``" -msgstr "``start_vid`` till ``start_pid``" +msgid "Camptocamp" +msgstr "Camptocamp" -msgid "``end_vid`` to ``end_pid``" -msgstr "``slut_vid`` till ``slut_pid``" +msgid "CSIS (University of Tokyo)" +msgstr "CSIS (Universitetet i Tokyo)" -msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" -msgstr "Om du använder ``pgr_withPoints``: kolumnnamn måste ändras efter uppdatering av pgRouting" +msgid "Georepublic" +msgstr "Georepublik" -msgid "Migration of |result-1-1|" -msgstr "Migrering av |result-1-1|" +msgid "Google Summer of Code" +msgstr "Google Summer of Code" -msgid "To get the old version column names:" -msgstr "För att få kolumnnamnen i den gamla versionen:" +msgid "HighGo Software" +msgstr "HighGo programvara" -msgid "Filter out the columns: ``start_vid`` and ``end_vid``" -msgstr "Filtrera bort kolumnerna: ``start_vid`` och ``slut_vid``" +msgid "iMaptools" +msgstr "iMaptools" -msgid "Examples with One to One with one route result" -msgstr "Exempel med en till en med en rutt resultat" +msgid "Leopark" +msgstr "Leopark" -msgid "Using ``pgr_aStar``" -msgstr "Använda ``pgr_aStar``" +msgid "Orkney" +msgstr "Orkney" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrering av `this v3.5 `__ exempel." +msgid "OSGeo" +msgstr "OSGeo" -msgid "Before updating pgRouting enumerate the columns: |result-1-1|" -msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |result-1-1|" +msgid "OSGeo UK" +msgstr "OSGeo Storbritannien" -msgid "Using ``pgr_bdDijkstra``" -msgstr "Använda ``pgr_bdDijkstra``" +msgid "Paragon Corporation" +msgstr "Paragon Corporation" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "Versaterm Inc." +msgstr "Versaterm Inc." -msgid "Using ``pgr_DAGshortestPath``" -msgstr "Använda ``pgr_DAGshortestPath``" +msgid "More Information" +msgstr "Mer information" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "Den senaste programvaran, dokumentationen och nyheter finns tillgängliga på pgRoutings webbplats https://pgrouting.org." -msgid "This applies to all signatures of ``pgr_DAGshortestPath``" -msgstr "Detta gäller för alla signaturer av ``pgr_DAGshortestPath``" +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgstr "PostgreSQL-databasserver på PostgreSQL-huvudwebbplatsen https://www.postgresql.org." -msgid "Examples for One to Many with one route result" -msgstr "Exempel för One to Many med ett ruttresultat" +msgid "PostGIS extension at the PostGIS project web site https://postgis.net." +msgstr "PostGIS-tillägg på PostGIS-projektets webbplats https://postgis.net." -msgid "Using ``pgr_bdAstar``" -msgstr "Använda ``pgr_bdAstar``" +msgid "Boost C++ source libraries at https://www.boost.org." +msgstr "Boost C++-källbibliotek på https://www.boost.org." -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrering av `this v3.5 `__ exempel." +msgid ":doc:`migration`" +msgstr ":doc:`migration`" -msgid "Before updating pgRouting enumerate the columns: |result-1-m|" -msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-1-m|" +msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_KSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra." -msgid "Using ``pgr_withPoints``" -msgstr "Använda ``pgr_withPoints``" +msgid "Availability" +msgstr "Tillgänglighet" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "Version 4.0.0" +msgstr "Version 4.0.0" -msgid "|pid-1-m|" -msgstr "|pid-1-m|" +msgid "All signatures promoted to official." +msgstr "Alla signaturer har uppgraderats till officiella." -msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." -msgstr "För att få de gamla signaturkolumnnamnen: filtrera bort kolumnen ``start_vid`` och byt namn på ``end_vid`` till ``end_pid``." +msgid "Version 3.6.0" +msgstr "Version 3.6.0" -msgid "Examples for Many to One with one route result" -msgstr "Exempel för Many to One med ett ruttresultat" +msgid "Standardizing output columns to |nksp-result|" +msgstr "Standardisering av utdatakolumner till |nksp-result|" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "pgr_ksp(One to One)" +msgstr "pgr_ksp(One to One)" -msgid "Before updating pgRouting enumerate the columns: |result-m-1|" -msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-m-1|" +msgid "Added ``start_vid`` and ``end_vid`` result columns." +msgstr "Lagt till resultatkolumnerna ``start_vid`` och ``end_vid``." -msgid "Using ``pgr_dijkstra``" -msgstr "Använda ``pgr_dijkstra``" +msgid "New proposed signatures:" +msgstr "Nya föreslagna signaturer:" -msgid "Migrating `this v3.4 `__ example." -msgstr "Migrering av `this v3.4 `__ exempel." +msgid "pgr_ksp(One to Many)" +msgstr "pgr_ksp(One to Many)" -msgid "Examples for Many to Many with one route result" -msgstr "Exempel för Many to Many med ett ruttresultat" +msgid "pgr_ksp(Many to One)" +msgstr "pgr_ksp(Many to One)" -msgid "Migrating `this v3.8 `__ example." -msgstr "Migrering av `this v3.8 `__ exempel." +msgid "pgr_ksp(Many to Many)" +msgstr "pgr_ksp(Many to Many)" -msgid "|pid-m-m|" -msgstr "|pid-m-m|" +msgid "pgr_ksp(Combinations)" +msgstr "pgr_ksp(Combinations)" -msgid "Examples for combinations with one route result" -msgstr "Exempel på kombinationer med ett vägresultat" +msgid "Version 2.1.0" +msgstr "Version 2.1.0" -msgid "Migrating `this v3.8 `this `__ example." -msgstr "Migrering av `this v3.8 `this `__ exempel." +msgid "Signature change" +msgstr "Ändring av signatur" -msgid "Migration of spanning tree functions" -msgstr "Migrering av spanning tree-funktioner" +msgid "Old signature no longer supported" +msgstr "Gammal signatur stöds inte längre" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" -msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for spanning tree functions` är |result-spantree|" +msgid "Version 2.0.0" +msgstr "Version 2.0.0" -msgid "``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" +msgid "Official function." +msgstr "Officiell funktion." -msgid ":ref:`from_result_dij_dd`" -msgstr ":ref:`from_result_dij_dd`" +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgstr "Algoritmen K för kortaste vägen baseras på Yens algoritm. \"K\" är antalet önskade kortaste vägar." -msgid "``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "|Boost| Boost Graph Inside" +msgstr "|Boost| Boost-graf inuti" -msgid ":ref:`from_result_generic_no_seq`" -msgstr ":ref:`from_result_generic_no_seq`" +msgid "Boost Graph inside" +msgstr "Öka grafen inuti" -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "Signatures" +msgstr "Underskrifter" -msgid "v < 3.7" -msgstr "v < 3.7" +msgid "Summary" +msgstr "Sammanfattning" -msgid ":ref:`from_result_bfs`" -msgstr ":ref:`from_result_bfs`" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" +msgid "**options:** ``[directed, heap_paths]``" +msgstr "**options:** ``[directed, heap_paths]``" -msgid "``pgr_breadthFisrtSearch``" -msgstr "``pgr_breadthFisrtSearch``" +msgid "Returns set of |nksp-result|" +msgstr "Returnerar uppsättning av |nksp-result|" -msgid "v < 4.0.0" -msgstr "v < 4.0.0" +msgid "OR EMPTY SET" +msgstr "ELLER TOM UPPSÄTTNING" -msgid "``pgr_depthFisrtSearch``" -msgstr "``pgr_depthFisrtSearch``" +msgid "Example" +msgstr "Exempel" -msgid "to |result-spantree|" -msgstr "till |result-spantree|" +msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." +msgstr "Hämta 2 vägar från :math:`6` till :math:`17` på en riktad graf." -msgid "Migration from |result-bfs|." -msgstr "Migrering från |result-bfs|." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Hämta 2 vägar från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf." -msgid "Single vertex" -msgstr "Enstaka toppunkt" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en riktad graf." -msgid "Multiple vertices" -msgstr "Flera hörn" +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till topparna :math:`\\{10, 17\\}` i en riktad graf." -msgid "Before updating pgRouting enumerate the columns: |result-bfs|" -msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|" +msgid "Using a combinations table on an directed graph" +msgstr "Använda en kombinationstabell på en riktad graf" -msgid "Single vertex example using ``pgr_kruskalDD``" -msgstr "Exempel på enstaka toppar med ``pgr_kruskalDD``" +msgid "The combinations table:" +msgstr "Kombinationsbordet:" -msgid "Migrating `this v3.6 `__ example." -msgstr "Migrering av `this v3.6 `__ exempel." +msgid "The query:" +msgstr "Frågeställningen:" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|." -msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|." +msgid "Identifier of the destination vertex." +msgstr "Identifierare för målvertexen." -msgid "Multiple vertices example using ``pgr_kruskalDFS``" -msgstr "Exempel på flera vertikaler med hjälp av ``pgr_kruskalDFS``" +msgid "**K**" +msgstr "**K**" -msgid "Migrating `this v3.6 `__ example." -msgstr "Migrering av `this v3.6 `__ exempel." +msgid "Number of required paths." +msgstr "Antal nödvändiga sökvägar." -msgid "Migration from |result-dij-dd|" -msgstr "Migrering från |result-dij-dd|" +msgid "KSP Optional parameters" +msgstr "KSP Valfria parametrar" -msgid "Migration depends on the signature." -msgstr "Migrationen beror på signaturen." +msgid "``heap_paths``" +msgstr "``heap_paths``" -msgid "For single vertex:" -msgstr "För enstaka toppunkt:" +msgid "When ``false`` Returns at most K paths." +msgstr "När ``false`` Returnerar högst K sökvägar." -msgid "Before updating pgRouting, enumerate |result-1-1| columns" -msgstr "Innan du uppdaterar pgRouting, räkna upp |result-1-1| kolumner" +msgid "When ``true`` all the calculated paths while processing are returned." +msgstr "När ``true`` returneras alla beräknade banor under bearbetningen." -msgid "For multiple vertices:" -msgstr "För flera hörn:" +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgstr "Grovt sett, när den kortaste vägen har ``N`` kanter, kommer högen att innehålla ungefär än ``N * K`` vägar för litet värde av ``K`` och ``K > 5``." -msgid "Changes must be done after updating pgRouting." -msgstr "Ändringar måste göras efter uppdatering av pgRouting." +msgid "Additional Examples" +msgstr "Ytterligare exempel" -msgid "To get the old version column names |result-dij-dd-m|:" -msgstr "För att få den gamla versionens kolumnnamn |result-dij-dd-m|:" +msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" +msgstr "Hämta 2 vägar från :math:`6` till :math:`17` på en odelad graf" -msgid "filter out the column ``pred`` and ``depth`` and" -msgstr "filtrera bort kolumnen ``pred`` och ``depth`` och" +msgid "Also get the paths in the heap." +msgstr "Hämta även sökvägarna i högen." -msgid "rename ``start_vid`` to ``from_v``." -msgstr "byt namn på ``start_vid`` till ``from_v``." +msgid "Get 2 paths using combinations table on an undirected graph" +msgstr "Få 2 vägar med hjälp av kombinationstabell på en oriktad graf" -msgid "Single vertex example using ``pgr_drivingDistance``" -msgstr "Exempel på en enda vertex med hjälp av ``pgr_drivingDistance``" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en odelad graf." -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrering av `this v3.5 `__ exempel." +msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" -msgstr "Innan du uppdaterar pgRouting, räkna upp kolumnerna |result-1-1-no-seq|" +msgid "``pgr_TSP``" +msgstr "``pgr_TSP``" -msgid "Multiple vertices example using ``pgr_drivingDistance``" -msgstr "Exempel på flera toppar med hjälp av ``pgr_drivingDistance``" +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSP`` - Approximation med hjälp av *metrisk* algoritm." -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrering av `this v3.5 `__ exempel." +msgid "Availability:" +msgstr "Tillgänglighet:" -msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." -msgstr "För att få den gamla versionens kolumnnamn |result-dij-dd-m|: filtrera bort kolumnen ``pred`` och ``depth`` och byt namn på ``start_vid`` till ``from_v``." +msgid "Results change depending on input order" +msgstr "Resultaten ändras beroende på inmatningsordning" -msgid "Migration of |result-generic-no-seq|" -msgstr "Migrering av |result-generic-no-seq|" +msgid "Only for undirected graphs" +msgstr "Endast för odelade grafer" -msgid "After updating pgRouting:" -msgstr "Efter uppdatering av pgRouting:" +msgid "Breaking change, signatures no longer available:" +msgstr "Förändring på gång, signaturer inte längre tillgängliga:" -msgid "Enumerate |result-1-1-no-seq| columns" -msgstr "Räkna upp kolumner för resultat-1-1-icke-seq" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." -msgstr "Använd ett icke namngivet giltigt värde för **körsida** efter parametern **avstånd**." +msgid "Version 3.2.1" +msgstr "Version 3.2.1" -msgid "Enumerate |result-m-1-no-seq| columns" -msgstr "Räkna upp |result-m-1-no-seq|-kolumner" +msgid "Metric Algorithm from `Boost library `__" +msgstr "Metrisk algoritm från `Boost-biblioteket `__" -msgid "Default value of **driving side** parameter" -msgstr "Standardvärde för parametern **förarsida**" +msgid "Simulated Annealing Algorithm no longer supported" +msgstr "Simulated Annealing Algorithm stöds inte längre" -msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." -msgstr "*parametern *driving side** är namnlös och giltiga värden skiljer sig åt för riktade och oriktade grafer." +msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgstr "Parametrar relaterade till Simulated Annealing Algorithm ignoreras: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" -msgstr "I riktad graf: giltiga värden är [``r``, ``R``, ``l``, ``L``]" +msgid "Version 2.3.0" +msgstr "Version 2.3.0" -msgid "Default value = 'r';" -msgstr "Standardvärde = \"r\";" +msgid "Results change depending on input order of the `Matrix SQL`_" +msgstr "Resultaten ändras beroende på inmatningsordningen för `Matrix SQL`_" -msgid "In undirected graph: valid values are [``b``, ``B``]" -msgstr "I en oriktad graf: giltiga värden är [``b``, ``B``]" +msgid "Negative costs are ignored." +msgstr "Negativa kostnader ignoreras." -msgid "Default value = 'b';" -msgstr "Standardvärde = \"b\";" +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgstr "Kan användas med :doc:`costMatrix-category` funktioner helst med `directed => false`." -msgid "Single vertex example using ``pgr_withPointsDD``" -msgstr "Exempel på en enda toppunkt med ``pgr_withPointsDD``" +msgid "With ``directed => false``" +msgstr "Med ``riktad => falsk``" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrering av `this v3.5 `__ exempel." +msgid "Will generate a graph that:" +msgstr "Kommer att generera en graf som:" -msgid "Multiple vertices example using ``pgr_withPointsDD``" -msgstr "Exempel på flera vertikaler med hjälp av ``pgr_withPointsDD``" +msgid "is undirected" +msgstr "är ostyrd" -msgid "Migrating `this v3.5 `__ example." -msgstr "Migrering av `this v3.5 `__ exempel." +msgid "is fully connected (As long as the graph has one component)" +msgstr "är helt sammanhängande (så länge grafen har en komponent)" -msgid "Migration of output column name change" -msgstr "Ändring av namn på utdatakolumn vid migrering" +msgid "all traveling costs on edges obey the triangle inequality." +msgstr "alla resekostnader på kanter följer triangelolikheten." -msgid "The standardized result columns:" -msgstr "De standardiserade resultatkolumnerna:" +msgid "When ``start_vid = 0 OR end_vid = 0``" +msgstr "När ``start_vid = 0 OR end_vid = 0``" -msgid "|result_edge_color|" -msgstr "|result_edge_color|" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +msgstr "De lösningar som genereras är garanterat * dubbelt så långa som den optimala turen i värsta fall*" -msgid "|result_node_color|" -msgstr "|result_node_color|" +msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgstr "När ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgid "|result_node_order|" -msgstr "|result_node_order|" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen, eftersom `end_vid` tvingas vara i en fast position." -msgid "Changes on column names must be done after updating pgRouting." -msgstr "Ändringar av kolumnnamn måste göras efter uppdatering av pgRouting." +msgid "With ``directed => true``" +msgstr "Med ``riktad => sann``" -msgid "``pgr_edgeColoring``" -msgstr "``pgr_edgeColoring``" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen" -msgid ":ref:`from_old_edge_color`" -msgstr ":ref:`from_old_edge_color`" +msgid "is directed" +msgstr "är riktad" -msgid "``pgr_bipartite``" -msgstr "``pgr_bipartite``" +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgstr "vissa (eller alla) resekostnader på kanter kanske inte följer triangelolikheten." -msgid ":ref:`from_old_node_color`" -msgstr ":ref:`from_old_node_color`" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" +msgstr "Eftersom det krävs en oriktad graf, omvandlas den riktade grafen enligt följande:" -msgid "``pgr_sequentialVertexColoring``" -msgstr "``pgr_sequentialVertexColoring``" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgstr "kanterna `(u, v)` och `(v, u)` anses vara samma kant (betecknas `(u, v)`)" -msgid "``pgr_topologicalSort``" -msgstr "``pgr_topologicalSort``" +msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" +msgstr "om ``agg_cost`` skiljer sig mellan en eller flera instanser av kant `(u, v)``" -msgid ":ref:`from_toposort`" -msgstr ":ref:`from_toposort`" +msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" +msgstr "Det lägsta värdet av ``agg_cost`` för alla instanser av kanten `(u, v)`` kommer att betraktas som ``agg_cost`` för kanten `(u, v)``" -msgid "``pgr_transitiveClosure``" -msgstr "``pgr_transitiveClosure``" +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgstr "Vissa (eller alla) resekostnader på kanter kommer kanske ändå inte att följa triangelolikheten." -msgid ":ref:`from_old_closure`" -msgstr ":ref:`from_old_closure`" +msgid "When the data does not come from an undirected graph or its not fully connected:" +msgstr "När data inte kommer från en odelad graf eller om den inte är helt sammanhängande:" -msgid "Migration from |result-old-closure|" -msgstr "Migrering från |result-old-closure|" +msgid "Missing values will be calculated with dijkstra algorithm." +msgstr "Saknade värden kommer att beräknas med dijkstra-algoritmen." -msgid "Migration to: |result-old-closure|" -msgstr "Migrering till: |result-old-closure|" +msgid "When the graph has more than one component:" +msgstr "När grafen har mer än en komponent:" -msgid "After update:" -msgstr "Efter uppdatering:" +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgstr "``start_vid`` eller ``slut_vid`` är definierade och finns på samma komponent: TSP-turen kommer att äga rum på den komponenten." -msgid "Remove column ``seq``" -msgstr "Ta bort kolumnen ``seq``" +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." +msgstr "``start_vid`` eller ``slut_vid`` definieras och inte finns på samma komponent: TSP-turen kommer att föreslå en tur som har båda komponenterna där anslutningskostnaderna beräknas." -msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" -msgstr "Byt namn på ``vid`` till ``node`` och ``target_array`` till ``targets``" +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +msgstr "``start_vid`` eller ``end_vid`` är inte definierade: startpunkten kan vara på vilken komponent som helst och kommer endast att innehålla data från den komponenten." -msgid "Migration from |result-toposort|" -msgstr "Migrering från |result-toposort|" +msgid "One cycle attempt to remove crossing edges is done to the TSP results." +msgstr "Ett cykelförsök för att ta bort korsande kanter görs på TSP-resultaten." -msgid "Migration to: |result_node_order|" -msgstr "Migrering till: |result_node_order|" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgid "Rename ``sorted_v`` to ``node``" -msgstr "Byt namn på ``sorted_v`` till ``node``" +msgid "Returns set of |tsp-result|" +msgstr "Returnerar uppsättning av |tsp-result|" -msgid "Migration from |old-edge-color|" -msgstr "Migrering från |old-edge-color|" +msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgstr "Använd :doc:`pgr_dijkstraCostMatrix` för att generera matrisinformationen" -msgid "Migration to: |result_edge_color|" -msgstr "Migration till: |result_edge_color|" +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgstr "**Linje 4** Punkterna :math:`{\\{2, 4, 13, 14\\\\}` är inte inkluderade eftersom de inte är anslutna." -msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." -msgstr "Byt namn på ``edge_id`` till ``edge`` och ``color_id`` till ``color``." +msgid "`Matrix SQL`_ as described below" +msgstr "`Matrix SQL`_ enligt beskrivningen nedan" -msgid "Migration from |old-node-color|" -msgstr "Migrering från |old-node-color|" +msgid "``ANY-INTEGER``" +msgstr "``ANY-INTEGER``" -msgid "Migration to: |result_node_color|" -msgstr "Migration till: |result_node_color|" +msgid "``ANY-NUMERICAL``" +msgstr "``ANY-NUMERICAL``" -msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." -msgstr "Byt namn på ``vertex_id`` till ``node`` och ``color_id`` till ``color``." +msgid "Cost for going from start_vid to end_vid" +msgstr "Kostnad för att gå från start_vid till slut_vid" -msgid "Migration of deleted functions" -msgstr "Migrering av borttagna funktioner" +msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" +msgstr "Returnerar SET OF ``(seq, nod, kostnad, agg_cost)``" -msgid "Functions no longer on pgRouting" -msgstr "Funktionerna finns inte längre på pgRouting" +msgid "Row sequence." +msgstr "Radsekvens." -msgid "Migration of ``pgr_alphaShape``" -msgstr "Migrering av ``pgr_alphaShape``" +msgid "**node**" +msgstr "**node**" -msgid "Deprecated" -msgstr "Föråldrat" +msgid "Identifier of the node/coordinate/point." +msgstr "Identifierare av nod/koordinat/punkt." -msgid "`v3.8.0 `__" -msgstr "`v3.8.0 `__" +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgstr "Kostnad för att gå från aktuell ``nod`` till nästa ``nod`` i sökvägssekvensen." -msgid "Removed" -msgstr "Borttagen" +msgid "``0`` for the last row in the tour sequence." +msgstr "``0`` för den sista raden i turordningssekvensen." -msgid "`v4.0.0 `__" -msgstr "`v4.0.0 `__" +msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." +msgstr "Sammanlagd kostnad från ``noden`` vid ``seq = 1`` till den aktuella noden." -msgid "**Before Deprecation:** The following was calculated:" -msgstr "**För Deprecation:** Följande beräknades:" +msgid "``0`` for the first row in the tour sequence." +msgstr "``0`` för den första raden i turordningen." -msgid "An alphaShape was calculated" -msgstr "En alphaShape beräknades" +msgid "Start from vertex :math:`1`" +msgstr "Start från toppunkten :math:`1`" -msgid "**After Deprecation:**" -msgstr "**After Deprecation:**" +msgid "**Line 6** ``start_vid => 1``" +msgstr "**Linje 6** ``start_vid => 1``" -msgid "PostGIS has two ways of generating alphaShape." -msgstr "PostGIS har två sätt att generera alphaShape." +msgid "Using points of interest to generate an asymmetric matrix." +msgstr "Använda intressepunkter för att generera en asymmetrisk matris." -msgid "If you have SFCGAL, which you can install using" -msgstr "Om du har SFCGAL, som du kan installera med hjälp av" +msgid "To generate an asymmetric matrix:" +msgstr "För att generera en asymmetrisk matris:" -msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" -msgstr "Sedan PostGIS 3.5+ används `CG_AlphaShape `__" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgstr "**Linje 4** Informationen om ``sidan`` av ``pointsOfInterset`` ignoreras genom att inte inkludera den i frågan" -msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" -msgstr "För PostGIS 3.5+ använd det gamla namnet ``ST_AlphaShape``" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" +msgstr "**Linje 6** Generering av en asymmetrisk matris med ``directed => true``" -msgid "Other PostGIS options are" -msgstr "Andra PostGIS-alternativ är" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" -msgid "`ST_ConvexHull `__" -msgstr "`ST_ConvevexHull `__" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgstr "Lösningen som kan vara större än *dubbelt så lång som den optimala turen* eftersom:" -msgid "`ST_ConcaveHull `__" -msgstr "`ST_ConcaveHull `__" +msgid "Triangle inequality might not be satisfied." +msgstr "Triangelns ojämlikhet kanske inte uppfylls." -msgid "Migration of ``pgr_nodeNetwork``" -msgstr "Migrering av ``pgr_nodeNetwork``" +msgid "``start_id != 0 AND end_id != 0``" +msgstr "``start_id != 0 AND end_id != 0``" -msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." -msgstr "**Before Deprecation:** En tabell med `_nodded` skapades. med delade kanter." +msgid "Connected incomplete data" +msgstr "Anslutna ofullständiga data" -msgid "**Migration**" -msgstr "**Migration**" +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgstr "Med hjälp av valda kanter :math:`\\{2, 4, 5, 8, 9, 15\\}` är matrisen inte komplett." -msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" -msgstr "Använd :doc:`pgr_separateTouching` och/eller använd :doc:`pgr_separateCrossing`" +msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." +msgstr "Kostnadsvärdet för :math:`17 \\rightarrow 10` finns inte i matrisen, men det värde som används hämtas från :math:`10 \\rightarrow 17`." -msgid "Migration of ``pgr_createTopology``" -msgstr "Migrering av ``pgr_createTopology``" +msgid "``pgr_TSPeuclidean``" +msgstr "``pgr_TSPeuclidean``" -msgid "A table with `_vertices_pgr` was created." -msgstr "En tabell med `_vertices_pgr` skapades." +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSPeuclidean`` - Approximation med hjälp av *metrisk* algoritm." -msgid "**After Deprecation:** The user is responsible to create the complete topology." -msgstr "**Efter Deprecation:** Användaren är ansvarig för att skapa den kompletta topologin." +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" -msgid "Build a routing topology" -msgstr "Bygga upp en routingtopologi" +msgid "Using `Boost: metric TSP approx `__" +msgstr "Använda `Boost: metrisk TSP ca `__" -msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." -msgstr "Den grundläggande informationen för att använda de flesta av pgRouting-funktionerna ``id, source, target, cost, [reverse_cost]`` är vad som i pgRouting kallas routingtopologin." +msgid "Version 3.0.0" +msgstr "Version 3.0.0" -msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." -msgstr "``reverse_cost`` är valfritt men rekommenderas starkt för att minska databasens storlek på grund av storleken på geometrikolumnerna. I den här dokumentationen används dock ``reverse_cost`` i den här dokumentationen." +msgid "Name change from pgr_eucledianTSP" +msgstr "Namnändring från pgr_eucledianTSP" -msgid "When the data comes with geometries and there is no routing topology, then this step is needed." -msgstr "När data levereras med geometrier och det inte finns någon routningstopologi behövs det här steget." +msgid "New official function." +msgstr "Ny officiell funktion." -msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." -msgstr "Alla geometriernas start- och slutpunkter behöver en identifierare som ska lagras i kolumnerna ``källa`` och ``mål`` i datatabellen. På samma sätt måste ``cost`` och ``reverse_cost`` ha värdet för att korsa kanten i båda riktningarna." +msgid "Results change depending on input order of the `Coordinates SQL`_" +msgstr "Resultaten ändras beroende på inmatningsordningen för `Koordinater SQL`_" -msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" -msgstr "Om kolumnerna inte finns måste de läggas till i tabellen i fråga. (se `ALTER TABLE `__)" +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgstr "Alla duplicerade identifierare kommer att ignoreras. De koordinater som kommer att behållas är godtyckliga." -msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." -msgstr "Funktionen :doc:`pgr_extractVertices` används för att skapa en vertices-tabell baserad på kantidentifieraren och geometrin för kanten i grafen." +msgid "The coordinates are quite similar for the same identifier, for example ::" +msgstr "Koordinaterna är ganska lika för samma identifierare, till exempel ::" -msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." -msgstr "Slutligen fylls ``källan`` och ``målet`` på med hjälp av de data som finns lagrade i topparnas tabeller." +msgid "The coordinates are quite different for the same identifier, for example ::" +msgstr "Koordinaterna är helt olika för samma identifierare, till exempel ::" -msgid "Migration of ``pgr_createVerticesTable``" -msgstr "Migrering av ``pgr_createVerticesTable``" +msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSPeuclidean(`koordinater SQL`_, ``[start_id, end_id]``)" -msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." -msgstr "**Efter deprecation:** Användaren är ansvarig för att skapa vertices-tabellen, index, etc. De kan använda :doc:`pgr_extractVertices` för det ändamålet." +msgid "With default values" +msgstr "Med standardvärden" -msgid "Migration of ``pgr_analyzeOneWay``" -msgstr "Migrering av ``pgr_analyzeOneWay``" +msgid "`Coordinates SQL`_" +msgstr "`Koordinater SQL`_" -msgid "Number of potential problems in directionality" -msgstr "Antal potentiella problem med riktverkan" +msgid "`Coordinates SQL`_ as described below" +msgstr "`Koordinater SQL`_ enligt beskrivningen nedan" -msgid "WHERE" -msgstr "VAR" +msgid "Coordinates SQL" +msgstr "Koordinater SQL" -msgid "Directionality problems were calculated based on codes." -msgstr "Riktningsproblem beräknades baserat på koder." +msgid "``x``" +msgstr "``x``" -msgid "Dead ends." -msgstr "Dödlägen." +msgid "X value of the coordinate." +msgstr "X-värde för koordinaten." -msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" -msgstr "Ett routingproblem kan uppstå när det från ett toppunkt bara finns en väg in eller en väg ut, men inte båda:" +msgid "``y``" +msgstr "``y``" -msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." -msgstr "Antingen genom att spara eller direkt använda :doc:`pgr_extractVertices` får du information om återvändsgränder och avgör om den intilliggande kanten är enkelriktad eller inte." +msgid "Y value of the coordinate." +msgstr "Y-värde för koordinaten." -msgid "In this example :doc:`pgr_extractVertices` has already been applied." -msgstr "I detta exempel har :doc:`pgr_extractVertices` redan tillämpats." +msgid "Test 29 cities of Western Sahara" +msgstr "Test 29 städer i Västsahara" -msgid "Bridges." -msgstr "Broar." +msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgstr "I det här exemplet visas hur man gör prestandatester med hjälp av University of Waterloos \"exempeldata\" `__ med hjälp av de 29 städerna i \"Västsaharas dataset\" `__" -msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." -msgstr "Ett annat routningsproblem kan uppstå när det finns en kant i en odelad graf vars borttagning ökar antalet anslutna komponenter, och bron bara går åt ett håll." +msgid "Creating a table for the data and storing the data" +msgstr "Skapa en tabell för data och lagra data" -msgid "To determine if the bridges are or not one way." -msgstr "För att avgöra om broarna är enkelriktade eller inte." +msgid "Adding a geometry (for visual purposes)" +msgstr "Lägga till en geometri (för visuella ändamål)" -msgid "Migration of ``pgr_analyzeGraph``" -msgstr "Migrering av ``pgr_analyzeGraph``" +msgid "Total tour cost" +msgstr "Total kostnad för resan" -msgid "Number of isolated segments." -msgstr "Antal isolerade segment." +msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" +msgstr "Få en total kostnad för turnén, jämför värdet med längden på en optimal turné är 27603, givet på datasetet" -msgid "Number of dead ends." -msgstr "Antal återvändsgränder." +msgid "Getting a geometry of the tour" +msgstr "Att få en geometri av turen" -msgid "Number of potential gaps found near dead ends." -msgstr "Antal potentiella luckor som hittats nära återvändsgränder." +msgid "Visual results" +msgstr "Visuella resultat" -msgid "Number of intersections. (between 2 edges)" -msgstr "Antal skärningspunkter. (mellan 2 kanter)" +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgstr "Visuellt, Den första bilden är den `optimala lösningen `__ och den andra bilden är den lösning som erhållits med ``pgr_TSPeuclidean``." -msgid "Graph component" -msgstr "Grafkomponent" +msgid "``pgr_aStar`` — Shortest path using the A* algorithm." +msgstr "``pgr_aStar`` - Kortaste vägen med hjälp av A*-algoritmen." -msgid "A connected subgraph that is not part of any larger connected subgraph." -msgstr "En sammanhängande delgraf som inte är en del av någon större sammanhängande delgraf." +msgid "Combinations signature promoted to official." +msgstr "Kombinationer signatur befordrad till tjänsteman." -msgid "Isolated segment" -msgstr "Isolerat segment" +msgid "Standardizing output columns to |short-generic-result|" +msgstr "Standardisering av utdatakolumner till |short-generic-result|" -msgid "A graph component with only one segment." -msgstr "En grafkomponent med endast ett segment." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgid "Dead ends" -msgstr "Döda ändar" +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "pgr_aStar(One to Many) added ``end_vid`` column." -msgid "A vertex that participates in only one edge." -msgstr "En vertex som bara deltar i en kant." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgstr "pgr_aStar(Many to One) added ``start_vid`` column." -msgid "gaps" -msgstr "luckor" +msgid "Version 3.2.0" +msgstr "Version 3.2.0" -msgid "Space between two geometries." -msgstr "Utrymme mellan två geometrier." +msgid "New proposed signature:" +msgstr "Nytt förslag till signatur:" -msgid "Intersection" -msgstr "Korsningar" +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(Combinations)" -msgid "Is a topological relationship between two geometries." -msgstr "Är ett topologiskt förhållande mellan två geometrier." +msgid "Function promoted to official." +msgstr "Funktion befordrad till tjänsteman." -msgid "Migration." -msgstr "Migration." +msgid "Version 2.4.0" +msgstr "Version 2.4.0" -msgid "Components." -msgstr "Komponenter." +msgid "pgr_aStar(One to Many)" +msgstr "pgr_aStar(One to Many)" -msgid "Instead of counting only isolated segments, determine all the components of the graph." -msgstr "Istället för att bara räkna isolerade segment kan du bestämma alla komponenter i grafen." +msgid "pgr_aStar(Many to One)" +msgstr "pgr_aStar(Many to One)" -msgid "Depending of the final application requirements use:" -msgstr "Beroende på de slutliga kraven för applikationen:" +msgid "pgr_aStar(Many to Many)" +msgstr "pgr_aStar(Many to Many)" -msgid ":doc:`pgr_connectedComponents`" -msgstr ":doc:`pgr_connectedComponents`" +msgid "Signature change on pgr_aStar(One to One)" +msgstr "Ändring av signatur på pgr_aStar(One to One)" -msgid ":doc:`pgr_strongComponents`" -msgstr ":doc:`pgr_strongComponents`" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten från `pgr_aStar(` `One to One`_ `)` på :" -msgid ":doc:`pgr_biconnectedComponents`" -msgstr ":doc:`pgr_biconnectedComponents`" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" -msgid "For example:" -msgstr "Till exempel:" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." -msgstr "I stället för att räkna återvändsgränderna kan du bestämma alla återvändsgränder i grafen med hjälp av :doc:`pgr_degree`." +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "Potential gaps near dead ends." -msgstr "Potentiella luckor nära återvändsgränder." +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" -msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." -msgstr "Istället för att räkna potentiella mellanrum mellan geometrier, bestäm de geometriska mellanrummen i grafen med hjälp av :doc:`pgr_findCloseEdges`." +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStar(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid "Topological relationships." -msgstr "Topologiska relationer." +msgid "**options:** ``[directed, heuristic, factor, epsilon]``" +msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" -msgid "Instead of counting intersections, determine topological relationships between geometries." -msgstr "Istället för att räkna korsningar, bestäm topologiska relationer mellan geometrier." +msgid "Returns set of |short-generic-result|" +msgstr "Returnerar uppsättning av |short-generic-result|" -msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgstr "Flera PostGIS-funktioner kan användas: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Optional parameters are `named parameters` and have a default value." +msgstr "Valfria parametrar är \"namngivna parametrar\" och har ett standardvärde." -msgid "Migration of ``pgr_trsp`` (Vertices)" -msgstr "Migrering av ``pgr_trsp`` (toppar)" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" +msgstr "Från toppunkt :math:`6` till toppunkt :math:`12` på en **riktad** graf med heuristik :math:`2`" -msgid "Signature:" -msgstr "Underskrift:" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 12\\}` på en **riktad** graf med heuristiken :math:`3` och faktorn :math:`3.5`" -msgid "`v3.4.0 `__" -msgstr "`v3.4.0 `__" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgstr "Från topparna :math:`\\{6, 8\\}` till topp :math:`10` på en **omdirigerad** graf med heuristiken :math:`4`" -msgid ":doc:`pgr_trsp`" -msgstr ":doc:`pgr_trsp`" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgstr "Från topparna :math:`\\{6, 8\\}` till topparna :math:`\\{10, 12\\}` på en **riktad** graf med faktorn :math:`0.5`" -msgid "`Migration of restrictions`_" -msgstr "`Flyttning av restriktioner`_" +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgstr "Använda en kombinationstabell på en **riktad** graf med faktor :math:`0.5`." -msgid "Use ``pgr_dijkstra`` when there are no restrictions." -msgstr "Använd ``pgr_dijkstra`` när det inte finns några begränsningar." +msgid "Example 1" +msgstr "Exempel 1" -msgid "Use :doc:`pgr_dijkstra` instead." -msgstr "Använd :doc:`pgr_dijkstra` istället." +msgid "Demonstration of repeated values are ignored, and result is sorted." +msgstr "Demonstration av upprepade värden ignoreras och resultatet sorteras." -msgid "To get the original column names:" -msgstr "För att få de ursprungliga kolumnnamnen:" +msgid "Example 2" +msgstr "Exempel 2" -msgid "``id1`` is the node" -msgstr "``id1`` är noden" +msgid "Making **start vids** the same as **end vids**." +msgstr "Att göra **start vids** samma som **slut vids**." -msgid "``id2`` is the edge" -msgstr "``id2`` är kanten" +msgid "Example 3" +msgstr "Exempel 3" -msgid "Use ``pgr_trsp`` when there are restrictions." -msgstr "Använd ``pgr_trsp`` när det finns begränsningar." +msgid "Manually assigned vertex combinations." +msgstr "Manuellt tilldelade toppunktskombinationer." -msgid "Use :doc:`pgr_trsp` (One to One) instead." -msgstr "Använd :doc:`pgr_trsp` (One to One) istället." +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" -msgid "Migration of ``pgr_trsp`` (Edges)" -msgstr "Migrering av ``pgr_trsp`` (kanter)" +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr "``pgr_aStarCost`` - Totalkostnad för den kortaste vägen med A*-algoritmen." -msgid ":doc:`pgr_trsp_withPoints`" -msgstr ":doc:`pgr_trsp_withPoints`" +msgid "pgr_aStarCost(Combinations)" +msgstr "pgr_aStarCost(Combinations)" -msgid "Migration of ``pgr_trspViaVertices``" -msgstr "Migrering av ``pgr_trspViaVertices``" +msgid "New proposed function." +msgstr "Ny föreslagen funktion." -msgid ":doc:`pgr_dijkstraVia`" -msgstr ":doc:`pgr_dijkstraVia`" +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." +msgstr "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av A*-algoritmen." -msgid ":doc:`pgr_trspVia`" -msgstr ":doc:`pgr_trspVia`" +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" +msgstr "Låt oss anta att de returnerade värdena lagras i en tabell, så det unika indexet skulle vara paret: `(start_vid, end_vid)`" -msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" -msgstr "Använd ``pgr_dijkstraVia`` när det inte finns några begränsningar" +msgid "For undirected graphs, the results are symmetric." +msgstr "För oriktade grafer är resultaten symmetriska." -msgid "Use :doc:`pgr_dijkstraVia` instead." -msgstr "Använd :doc:`pgr_dijkstraVia` istället." +msgid "The returned values are ordered in ascending order:" +msgstr "De returnerade värdena sorteras i stigande ordning:" -msgid "``id1`` is the path identifier" -msgstr "``id1`` är identifieraren för sökvägen" +msgid "`start_vid` ascending" +msgstr "`start_vid` stigande" -msgid "``id2`` is the node" -msgstr "``id2`` är noden" +msgid "`end_vid` ascending" +msgstr "`end_vid` stigande" -msgid "``id3`` is the edge" -msgstr "``id3`` är kanten" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" -msgid "Use ``pgr_trspVia`` when there are restrictions" -msgstr "Använd ``pgr_trspVia`` när det finns begränsningar" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Use :doc:`pgr_trspVia` instead." -msgstr "Använd :doc:`pgr_trspVia` istället." +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "Migration of ``pgr_trspViaEdges``" -msgstr "Migrering av ``pgr_trspViaEdges``" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" -msgid ":doc:`pgr_withPointsVia`" -msgstr ":doc:`pgr_withPointsVia`" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid "Returns set of |matrix-result|" +msgstr "Returnerar uppsättning av |matrix-result|" -msgid "Use ``pgr_withPointsVia`` when there are no restrictions" -msgstr "Använd ``pgr_withPointsVia`` när det inte finns några begränsningar" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [options])" -msgid "Use :doc:`pgr_withPointsVia` instead." -msgstr "Använd :doc:`pgr_withPointsVia` istället." +msgid "``pgr_aStarCostMatrix``" +msgstr "``pgr_aStarCostMatrix``" -msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" -msgstr "Använd ``pgr_trspVia_withPoints`` när det finns begränsningar" +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgstr "``pgr_aStarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_aStar`." -msgid "Use :doc:`pgr_trspVia_withPoints` instead." -msgstr "Använd :doc:`pgr_trspVia_withPoints` istället." +msgid "Using internally the :doc:`pgr_aStar` algorithm" +msgstr "Intern användning av :doc:`pgr_aStar`-algoritmen" -msgid "Not yet classified migrations" -msgstr "Ännu ej klassificerade migrationer" +msgid "Returns a cost matrix." +msgstr "Returnerar en kostnadsmatris." -msgid "Migration of ``pgr_withPointsKSP``" -msgstr "Migrering av ``pgr_withPointsKSP``" +msgid "No ordering is performed" +msgstr "Ingen beställning utförs" -msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." -msgstr "Från och med `v3.6.0 `__ :doc:`pgr_withPointsKSP` standardiseras resultatkolumnerna." +msgid "let `v` and `u` are nodes on the graph:" +msgstr "låt `v` och `u` vara noder i grafen:" -msgid "|ksp-result|" -msgstr "|ksp-result|" +msgid "when there is no path from `v` to `u`:" +msgstr "när det inte finns någon väg från `v` till `u`:" -msgid "|generic-result|" -msgstr "|generic-result|" +msgid "cost from `v` to `u` is :math:`\\inf`" +msgstr "kostnaden från `v` till `u` är :math:`\\inf`" -msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." -msgstr "Och parametern ``driving side`` ändrades från namngiven valfri till icke namngiven **driving side** och dess giltighet skiljer sig åt för riktade och oriktade grafer." +msgid "when :math:`v = u` then" +msgstr "när :math:`v = u` då" -msgid "``pgr_withPointsKSP`` (`One to One`)" -msgstr "``pgr_withPointsKSP`` (`En till en`)" +msgid "cost from `v` to `u` is :math:`0`" +msgstr "kostnaden från `v` till `u` är :math:`0`" -msgid "Before Migration" -msgstr "Före migration" +msgid "When the graph is **undirected** the cost matrix is symmetric" +msgstr "När grafen är **icke-riktad** är kostnadsmatrisen symmetrisk" -msgid "Output columns were |old-pid-result|" -msgstr "Utgångskolumnerna var |old-pid-result|" +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_aStarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" -msgid "the columns ``start_vid`` and ``end_vid`` do not exist." -msgstr "kolumnerna ``start_vid`` och ``end_vid`` finns inte." +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgstr "Symmetrisk kostnadsmatris för topparna :math:`\\{5, 6, 10, 15\\}` på en **omdirigerad** graf med heuristiken :math:`2`" -msgid "Migration" -msgstr "Migrering" +msgid "Use with :doc:`pgr_TSP`" +msgstr "Använd med :doc:`pgr_TSP`" -msgid "Be aware of the existence of the additional result Columns." -msgstr "Var medveten om att det finns ytterligare resultat Kolumner." +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" -msgid "New output columns are |generic-result|" -msgstr "Nya utdatakolumner är |generic-result|" +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgstr "``pgr_articulationPoints`` - Returnerar artikulationspunkterna i en odränerad graf." -msgid "Using `this `__ example." -msgstr "Använda `det här `__ exemplet." +msgid "Result columns change: ``seq`` is removed" +msgstr "Ändring av resultatkolumner: ``seq`` tas bort" -msgid "``start_vid`` contains the **start vid** parameter value." -msgstr "``start_vid`` innehåller parametervärdet **start vid**." +msgid "Version 2.5.0" +msgstr "Version 2.5.0" -msgid "``end_vid`` contains the **end vid** parameter value." -msgstr "``end_vid`` innehåller parametervärdet **end vid**." +msgid "New experimental function." +msgstr "Ny experimentell funktion." -msgid "If needed filter out the additional columns, for example, to return the original columns:" -msgstr "Vid behov kan du filtrera bort de extra kolumnerna, t.ex. för att få tillbaka de ursprungliga kolumnerna:" +msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." +msgstr "De hörn som tillhör mer än en biconnected komponent kallas artikulationspunkter eller, på motsvarande sätt, cut vertices. Artikulationspunkter är hörn vars borttagning skulle öka antalet anslutna komponenter i grafen. Denna implementation kan endast användas med en odelad graf." -msgid "Use ``pgr_withPoints`` when there are no restrictions." -msgstr "Använd ``pgr_withPoints`` när det inte finns några begränsningar." +msgid "Works for **undirected** graphs." +msgstr "Fungerar för **undirected** grafer." -msgid "Use :doc:`pgr_withPoints` (One to One) instead." -msgstr "Använd :doc:`pgr_withPoints` (One to One) istället." +msgid "``node`` ascending" +msgstr "``nod`` stigande" -msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." -msgstr "Använd ``pgr_trsp_withPoints`` när det finns begränsningar." +msgid "Running time: :math:`O(V + E)`" +msgstr "Speltid: :math:`O(V + E)`" -msgid "Use :doc:`pgr_trsp_withPoints` instead." -msgstr "Använd :doc:`pgr_trsp_withPoints` istället." +msgid "pgr_articulationPoints(`Edges SQL`_)" +msgstr "pgr_articulationPoints(`Kanter SQL`_)" -msgid "Migration of ``pgr_maxCardinalityMatch``" -msgstr "Migrering av ``pgr_maxCardinalityMatch``" +msgid "Returns set of |result-node|" +msgstr "Returnerar uppsättning av |result-node|" -msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." -msgstr ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgid "The articulation points of the graph" +msgstr "Diagrammets artikulationspunkter" -msgid "Starting from `v3.4.0 `__" -msgstr "Startar från `v3.4.0 `__" +msgid "Nodes in red are the articulation points." +msgstr "Rödmarkerade noder är artikulationspunkterna." -msgid "Signature to be migrated:" -msgstr "Signatur som ska migreras:" +msgid "Identifier of the vertex." +msgstr "Identifierare för toppunkten." -msgid "Migration is needed, because:" -msgstr "Migration behövs, eftersom:" +msgid "`Boost: Biconnected components & articulation points `__" +msgstr "`Boost: Biconnected komponenter & ledpunkter `__" -msgid "Use ``cost`` and ``reverse_cost`` on the inner query" -msgstr "Använd ``cost`` och ``reverse_cost`` på den inre frågan" +msgid "wikipedia: `Biconnected component `__" +msgstr "wikipedia: `Sammankopplad komponent `__" -msgid "Results are ordered" -msgstr "Resultaten är ordnade" +msgid "``pgr_bandwidth`` - Experimental" +msgstr "``pgr_bandbredd`` - Experimentell" -msgid "Works for undirected graphs." -msgstr "Fungerar för oledade grafer." +msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" +msgstr "``pgr_bandwidth`` - Beräknar grafens bandbredd" -msgid "New signature" -msgstr "Ny signatur" +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgstr "Bandbredden mäter hur \"utspridda\" kopplingarna är i en graf när hörnen är ordnade i en linjär ordning (som att numrera dem 1, 2, 3 osv.)." -msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." -msgstr "``pgr_maxCardinalityMatch(text)`` returnerar endast ``kant`` kolumnen." +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" +msgstr "För varje kant i grafen, beräkna avståndet mellan de toppunktsnummer som den ansluter till" -msgid "The optional flag ``directed`` is removed." -msgstr "Den valfria flaggan ``directed`` tas bort." +msgid "The bandwidth is the maximum of all these distances" +msgstr "Bandbredden är den maximala av alla dessa avstånd" -msgid "Before migration" -msgstr "Före migration" +msgid "The implementation is for undirected graphs" +msgstr "Implementationen är för undirected grafer" -msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." -msgstr "Kolumner som används är \"utgående\" och \"kommande\" för att representera existensen av en kant." +msgid "Run time is 0.160789 seconds" +msgstr "Körtiden är 0,160789 sekunder" -msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." -msgstr "Flaggan ``directed`` användes för att ange om det var för en **directed** eller **undirected** graf." +msgid "pgr_bandwidth(`Edges SQL`_)" +msgstr "pgr_bandbredd(`Edges SQL`_)" -msgid "The flag ``directed`` is ignored." -msgstr "Flaggan ``directed`` ignoreras." +msgid "Returns ``BIGINT``" +msgstr "Returnerar ``BIGINT``" -msgid "Regardless of it's value it gives the result considering the graph as **undirected**." -msgstr "Oavsett dess värde ger det resultatet med tanke på grafen som **undirected**." +msgid "For an undirected graph with edges." +msgstr "För en enkelriktad graf med kanter." -msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." -msgstr "Använd kolumnerna ``cost`` och ``reverse_cost`` för att representera existensen av en kant." +msgid "Returns a bigint ``(pgr_bandwidth)``" +msgstr "Returnerar en bigint ``(pgr_bandwidth)``" -msgid "Do not use the flag ``directed``." -msgstr "Använd inte flaggan ``directed``." +msgid "``pgr_bandwidth``" +msgstr "``pgr_bandwidth``" -msgid "In the query returns only ``edge`` column." -msgstr "I frågan returneras endast kolumnen ``edge``." +msgid "gives the bandwidth of the graph." +msgstr "ger grafens bandbredd." -msgid "Migration of restrictions" -msgstr "Överföring av restriktioner" +msgid "Undirected graph with edges before optimization." +msgstr "Oriktad graf med kanter före optimering." -msgid "The structure of the restrictions have changed:" -msgstr "Strukturen på restriktionerna har förändrats:" +msgid "Undirected graph with edges after optimization." +msgstr "Oriktad graf med kanter efter optimering." -msgid "Old restrictions structure" -msgstr "Gammal begränsningsstruktur" +msgid "`Boost: bandwidth `_" +msgstr "`Boost: bandbredd `_" -msgid "On the deprecated signatures:" -msgstr "På de föråldrade signaturerna:" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" -msgid "Column ``rid`` is ignored" -msgstr "Kolumnen ``rid`` ignoreras" +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstar`` - Kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." -msgid "``via_path``" -msgstr "``via_path``" +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgid "Must be in reverse order." -msgstr "Måste vara i omvänd ordning." +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgstr "pgr_bdAstar(One to Many) added ``end_vid`` column." -msgid "Is of type ``TEXT``." -msgstr "Är av typen ``TEXT``." +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgstr "pgr_bdAstar(Many to One) added ``start_vid`` column." -msgid "When more than one via edge must be separated with ``,``." -msgstr "När mer än en via edge måste separeras med ``,``." +msgid "pgr_bdAstar(Combinations)" +msgstr "pgr_bdAstar(Combinations)" -msgid "``target_id``" -msgstr "``target_id``" +msgid "pgr_bdAstar(One to Many)" +msgstr "pgr_bdAstar(One to Many)" -msgid "Is the last edge of the forbidden path." -msgstr "Är den sista kanten av den förbjudna vägen." +msgid "pgr_bdAstar(Many to One)" +msgstr "pgr_bdAstar(Many to One)" -msgid "Is of type ``INTEGER``." -msgstr "Är av typen ``INTEGER``." +msgid "pgr_bdAstar(Many to Many)" +msgstr "pgr_bdAstar(Many to Many)" -msgid "``to_cost``" -msgstr "``to_cost``" +msgid "Signature change on pgr_bdAstar(One to One)" +msgstr "Ändring av signatur på pgr_bdAstar(One to One)" -msgid "Is of type ``FLOAT``." -msgstr "Är av typen ``FLOAT``." +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" +msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten av pgr_bdAStar(One to One) på:" -msgid "Creation of the old restrictions table" -msgstr "Skapande av den gamla restriktionstabellen" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" -msgid "Old restrictions fill up" -msgstr "Gamla restriktioner fylls på" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Old restrictions contents" -msgstr "Gamla restriktioner innehåll" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" -msgstr "Begränsningen med ``rid = 2`` representerar :math:`3 \\rightarrow 5 \\rightarrow9``" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" -msgid ":math:`3\\rightarrow5`" -msgstr ":math:`3\\rightarrow5`" +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstar(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid "is on column ``via_path`` in reverse order" -msgstr "är på kolumn ``via_path`` i omvänd ordning" +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" -msgid "is of type ``TEXT``" -msgstr "är av typen ``TEXT``" +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` - Totalkostnad för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." -msgid ":math:`9`" -msgstr ":math:`9`" +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(Combinations)" -msgid "is on column ``target_id``" -msgstr "är på kolumn ``target_id``" +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." +msgstr "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." -msgid "is of type ``INTEGER``" -msgstr "är av typen ``INTEGER``" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" -msgid "New restrictions structure" -msgstr "Ny struktur för restriktioner" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Column ``id`` is ignored" -msgstr "Kolumnen ``id`` ignoreras" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "Column ``path``" -msgstr "Kolumn \"sökväg" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" -msgid "Is of type ``ARRAY[ANY-INTEGER]``." -msgstr "Är av typen ``ARRAY[ANY-INTEGER]``." +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid "Contains all the edges involved on the restriction." -msgstr "Innehåller alla kanter som är involverade i begränsningen." +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" -msgid "The array has the ordered edges of the restriction." -msgstr "Arrayen har restriktionens ordnade kanter." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." +msgstr "``pgr_bdAstarCostMatrix`` - Beräknar kostnadsmatrisen med hjälp av :doc:`pgr_bdAstar`." -msgid "Column ``cost``" -msgstr "Kolumn ``kostnad``" +msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." +msgstr "Internt används algoritmen :doc:`pgr_bdAstar`." -msgid "Is of type ``ANY-NUMERICAL``" -msgstr "Är av typen ``ANY-NUMERICAL``" +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_bdAstarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" -msgid "The creation of the restrictions table" -msgstr "Skapandet av begränsningstabellen" +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstra`` - Returnerar den kortaste vägen med hjälp av Bidirectional Dijkstra-algoritmen." -msgid "Adding the restrictions" -msgstr "Lägga till begränsningar" +msgid "Output columns standardized to |short-generic-result|" +msgstr "Utdatakolumner standardiserade till |short-generic-result|" -msgid "Restrictions data" -msgstr "Begränsningar data" +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(Combinations)" -msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." -msgstr "Restriktionen med ``rid = 2`` representerar sökvägen :math:`3 \\rightarrow5 \\rightarrow9``." +msgid "pgr_bdDijkstra(One to Many)" +msgstr "pgr_bdDijkstra(One to Many)" -msgid "By inspection the path is clear." -msgstr "Vid inspektion är vägen tydlig." +msgid "pgr_bdDijkstra(Many to One)" +msgstr "pgr_bdDijkstra(Many to One)" -msgid "To transform the old restrictions table to the new restrictions structure," -msgstr "Att omvandla den gamla begränsningstabellen till den nya begränsningsstrukturen," +msgid "pgr_bdDijkstra(Many to Many)" +msgstr "pgr_bdDijkstra(Many to Many)" -msgid "Create a new table with the new restrictions structure." -msgstr "Skapa en ny tabell med den nya begränsningsstrukturen." +msgid "Signature change on pgr_bdDijkstra(One to One)" +msgstr "Ändring av signatur på pgr_bdDijkstra(One to One)" -msgid "In this migration guide ``new_restrictions`` is been used." -msgstr "I den här migreringsguiden används ``new_restrictions``." +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." -msgstr "För denna migrering tillhandahåller pgRouting en hjälpfunktion för reversering av en array ``_pgr_array_reverse`` som behövs för migreringen." +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "``_pgr_array_reverse``:" -msgstr "``_pgr_array_reverse``:" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "Was created temporally for this migration" -msgstr "Skapades temporärt för denna migration" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "Is not documented." -msgstr "Är inte dokumenterad." +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid "Will be removed on the next mayor version 4.0.0" -msgstr "Kommer att tas bort i nästa borgmästarversion 4.0.0" +msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgstr "Från toppunkten :math:`6` till toppunkten :math:`10` på en **riktad** graf" -msgid "The migrated table contents:" -msgstr "Det migrerade tabellinnehållet:" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en **riktad** graf" -msgid ":doc:`pgRouting-concepts`" -msgstr ":doc:`pgRouting-concepts`" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgstr "Från topparna :math:`\\{6, 1\\}` till topp :math:`17` på en **riktad** graf" -msgid "Ordering - Family of functions" -msgstr "Beställning - Familj av funktioner" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgstr "Från topparna :math:`{6, 1\\}` till topparna :math:`{10, 17\\}` på en **omdirigerad** graf" -msgid "pgRouting Concepts" -msgstr "pgRouting-koncept" +msgid "Using a combinations table on an **undirected** graph" +msgstr "Använda en kombinationstabell i en **icke-riktad** graf" -msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" -msgstr "Det här är en enkel guide som går igenom några av stegen för att komma igång med pgRouting. Den här guiden täcker:" +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" -msgid "Graphs" -msgstr "Diagram" +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" -msgstr "En graf är ett ordnat par :math:`G = (V ,E)` där:" +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstraCost`` - Returnerar den kortaste vägens kostnad med hjälp av Bidirectional Dijkstra-algoritmen." -msgid ":math:`V` is a set of vertices, also called nodes." -msgstr ":math:`V` is a set of vertices, also called nodes." +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(Combinations)" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgstr "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade Dijkstra-algoritmen." -msgid "There are different kinds of graphs:" -msgstr "Det finns olika typer av grafer:" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vid** , [``directed``])" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "Undirected simple graph" -msgstr "Ogirigerad enkel graf" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vid** , [``directed``])" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [ ``directed``])" -msgid "Directed simple graph" -msgstr "Riktad enkel graf" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "Graphs:" -msgstr "Diagram:" +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgstr "``pgr_bdDijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_bdDijkstra`." -msgid "Do not have geometries." -msgstr "Har inte geometrier." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgstr "Beräkna och returnera en kostnadsmatris med hjälp av den dubbelriktade Dijkstra-algoritmen." -msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." -msgstr "Vissa grafteoretiska problem kräver att graferna har vikter, som kallas **kostnad** i pgRouting." +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_bdDijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" -msgid "In pgRouting there are several ways to represent a graph on the database:" -msgstr "I pgRouting finns det flera sätt att representera en graf i databasen:" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgstr "Symmetrisk kostnadsmatris för toppar :math:`{\\5, 6, 10, 15\\}` på en **omdirigerad** graf" -msgid "With ``cost``" -msgstr "Med ``kostnad``" +msgid "Use with :doc:`pgr_TSP`." +msgstr "Använd med :doc:`pgr_TSP`." -msgid "(``id``, ``source``, ``target``, ``cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``)" +msgid "``pgr_bellmanFord`` - Experimental" +msgstr "``pgr_bellmanFord`` - Experimentell" -msgid "With ``cost`` and ``reverse_cost``" -msgstr "Med ``kostnad`` och ``omvänd_kostnad``" +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgstr "``pgr_bellmanFord`` - Kortaste vägen med Bellman-Ford algoritm." -msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgid "New experimental signature:" +msgstr "Ny experimentell signatur:" -msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." -msgstr "Identifierare av kanten. Krav på att använda databasen på ett konsekvent sätt." +msgid "pgr_bellmanFord(Combinations)" +msgstr "pgr_bellmanFord(Combinations)" -msgid "Identifier of a vertex." -msgstr "Identifierare för en vertex." +msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." +msgstr "Bellman-Fords algoritm är uppkallad efter Richard Bellman och Lester Ford, som först publicerade den 1958 respektive 1956. Det är en algoritm för grafsökning som beräknar kortaste vägar från en startpunkt (``start_vid``) till en slutpunkt (``end_vid``) i en graf där vissa av kantvikterna kan vara negativa. Även om den är mer mångsidig är den långsammare än Dijkstras algoritm. Den här implementeringen kan användas med en riktad graf och en oriktad graf." -msgid "Weight of the edge (``source``, ``target``):" -msgstr "Kantvikt (``källa``, ``mål``):" +msgid "Process is valid for edges with both positive and negative edge weights." +msgstr "Processen är giltig för kanter med både positiva och negativa kantvikter." -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." -msgstr "När den är negativ finns inte kanten (``källa``, ``mål``) i grafen." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgstr "När startvertex och slutvertex är desamma finns det ingen väg. Agg_cost skulle vara :math:`0`." -msgid "``cost`` must exist in the query." -msgstr "``cost`` måste finnas i frågan." +msgid "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." +msgstr "När startvertex och slutvertex är olika, och det finns en väg mellan dem utan att ha en *negativ cykel*. Agg_cost skulle vara ett ändligt värde som anger det kortaste avståndet mellan dem." -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." -msgstr "När den är negativ finns inte kanten (``mål``, ``källa``) i grafen." +msgid "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." +msgstr "När startpunkten och slutpunkten är olika, och det finns en väg mellan dem, men den innehåller en *negativ cykel*. I sådana fall fortsätter agg_cost för dessa toppar att minska och därför kan agg_cost inte definieras för dem." -msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." -msgstr "Beslutet om grafen ska vara **directed** eller **undirected** fattas när en pgRouting-algoritm körs." +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgstr "När startvertex och slutvertex är olika och det inte finns någon väg. Agg_cost är :math:`\\infty`." -msgid "Graph with ``cost``" -msgstr "Graf med ``kostnad``" +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start_vids` eller `end_vids`." -msgid "The weighted directed graph, :math:`G_d(V,E)`:" -msgstr "Den viktade riktade grafen, :math:`G_d(V,E)`:" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +msgstr "Speltid: :math:`O(| start\\_vids | * ( V * E))`" -msgid "Graph data is obtained with a query" -msgstr "Grafdata erhålls med en fråga" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "``SELECT id, source, target, cost FROM edges``" -msgstr "``Välj id, källa, mål, kostnad från kanter``" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" -msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "Edges where ``cost`` is non negative are part of the graph." -msgstr "Kanter där ``kostnad`` inte är negativ är en del av grafen." +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" -msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid "All vertices in ``source`` and ``target`` are part of the graph." -msgstr "Alla hörn i ``källa`` och ``mål`` är en del av grafen." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf" -msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "I en riktad graf har kanten :math:`(source_{id}, target_{id}, cost_{id})` riktning: :math:`source_{id} \\rightarrow target_{id}`" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`17` i en riktad graf" -msgid "For the following data:" -msgstr "För följande uppgifter:" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" +msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 17\\}` på en odelad graf" -msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." -msgstr "Edge :math:`2` (:math:`1 \\rightarrow 3`) är inte en del av grafen." +msgid "Using a combinations table on an undirected graph" +msgstr "Använda en kombinationstabell på en ostyrd graf" -msgid "The data is representing the following graph:" -msgstr "Uppgifterna representeras av följande graf:" +msgid "`Boost: Bellman Ford `__" +msgstr "`Boost: Bellman Ford `__" -msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "I en ostyrd graf har kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` inte riktning: :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" -msgstr "I termer av en riktad graf är det som att ha två kanter: :math:`source_{id} \\leftrightarrow target_{id}`" +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "``pgr_betweennessCentrality`` - Experimentell" -msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." -msgstr "Kanten :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) är inte en del av grafen." +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgstr "``pgr_betweennessCentrality`` - Beräknar den relativa betweenness-centraliteten med hjälp av Brandes-algoritmen" -msgid "Graph with ``cost`` and ``reverse_cost``" -msgstr "Graf med ``kostnad`` och ``omvända_kostnader``" +msgid "Version 3.7.0" +msgstr "Version 3.7.0" -msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" -msgstr "``SELECT id, källa, mål, kostnad, omvänd_kostnad FROM kanter``" +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgstr "Brandes-algoritmen utnyttjar de glesa graferna för att utvärdera betweenness centrality-punkten för alla hörn." -msgid "The set of edges :math:`E`:" -msgstr "Mängden kanter :math:`E`:" +msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." +msgstr "Betweenness centrality mäter i vilken utsträckning en toppunkt ligger på de kortaste vägarna mellan alla andra par av toppunkter. Toppar med en hög betweenness centrality-punkt kan ha ett betydande inflytande i ett nätverk genom att de kontrollerar de kortaste vägarna mellan dem." -msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." +msgstr "Om dessa toppar tas bort påverkas nätverket genom att det störs, eftersom de flesta av de kortaste vägarna mellan topparna passerar genom dem." -msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." -msgstr "Edges :math:`(source \\rightarrow target)` där ``cost`` är icke-negativ är en del av grafen." +msgid "This implementation work for both directed and undirected graphs." +msgstr "Denna implementering fungerar för både riktade och oriktade grafer." -msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." -msgstr "Edges :math:`(target \\rightarrow source)` där ``reverse_cost`` är icke-negativ är en del av grafen." +msgid "Running time: :math:`\\Theta(VE)`" +msgstr "Speltid: :math:`\\Theta(VE)`" -msgid "The set of vertices :math:`V`:" -msgstr "Mängden hörn :math:`V`:" +msgid "Running space: :math:`\\Theta(VE)`" +msgstr "Driftutrymme: :math:`\\Theta(VE)``" -msgid "In a directed graph both edges have directionality" -msgstr "I en riktad graf har båda kanterna riktning" +msgid "Throws when there are no edges in the graph" +msgstr "Kastar när det inte finns några kanter i grafen" -msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` har riktning: :math:`källa_{id} \\rightarrow mål_{id}`" +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgstr "pgr_betweennessCentrality(`Kanter SQL`_, [``directed``])" -msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" -msgstr "kanten :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` har riktning: :math:`target_{id} \\rightarrow source_{id}`" +msgid "Returns set of ``(vid, centrality)``" +msgstr "Returnerar uppsättning av ``(vid, centralitet)``" -msgid "Edges not part of the graph:" -msgstr "Kanter som inte är en del av grafen:" +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "För en riktad graf med kanter :math:`\\{1, 2, 3, 4\\}`." -msgid ":math:`2` (:math:`1 \\rightarrow 3`)" -msgstr ":math:`2` (:math:`1 \\rightarrow 3`)" +msgid "Explanation" +msgstr "Förklaring" -msgid ":math:`3` (:math:`3 \\rightarrow 2`)" -msgstr ":math:`3` (:math:`3 \\rightarrow 2`)" +msgid "The betweenness centrality are between parenthesis." +msgstr "Betweenness Centrality anges inom parentes." -msgid "In a directed graph both edges do not have directionality" -msgstr "I en riktad graf har inte båda kanterna riktning" +msgid "The leaf vertices have betweenness centrality :math:`0`." +msgstr "Bladkärnorna har betweenness centrality :math:`0`." -msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "Kant :math:`(källa_{id}, mål_{id}, kostnad_{id})` är :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +msgstr "Betweenness centrality för toppunkten :math:`6` är högre än för toppunkten :math:`10`." -msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgstr "Kant :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` är :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Removing vertex :math:`6` will create three graph components." +msgstr "Om du tar bort toppunkten :math:`6` skapas tre grafkomponenter." -msgid "In terms of a directed graph is like having four edges:" -msgstr "I termer av en riktad graf är det som att ha fyra kanter:" +msgid "Removing vertex :math:`10` will create two graph components." +msgstr "Om du tar bort toppunkten :math:`10` skapas två grafkomponenter." -msgid ":math:`source_i \\leftrightarrow target_i`" -msgstr ":math:`source_i \\leftrightarrow target_i`" +msgid "``vid``" +msgstr "``vid``" -msgid ":math:`target_i \\leftrightarrow source_i`" -msgstr ":math:`target_i \\leftrightarrow source_i`" +msgid "``centrality``" +msgstr "``centrality``" -msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" -msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgstr "Relativ betweenness centrality-punkt för vertexet (kommer att ligga inom intervallet [0,1])" -msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" -msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgid "`Boost: betweenness centrality `_" +msgstr "`Boost: betweenness centrality `_" -msgid "Graphs without geometries" -msgstr "Grafer utan geometrier" +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" -msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." -msgstr "Problem med personliga relationer, släktforskning och filberoende kan lösas med hjälp av pgRouting. Dessa problem har normalt inte geometrier som är kopplade till grafen." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +msgstr "``pgr_biconnectedComponents`` - Biconnected-komponenter i en odränerad graf." -msgid "Wiki example" -msgstr "Wiki-exempel" +msgid "Result columns change:" +msgstr "Resultatkolumnerna ändras:" -msgid "Solve the example problem taken from `wikipedia `__):" -msgstr "Lös exempelproblemet hämtat från `wikipedia `__):" +msgid "``n_seq`` is removed" +msgstr "``n_seq`` tas bort" -msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." -msgstr "Problemet är att hitta den kortaste vägen från :math:`1` till :math:`5`." +msgid "``seq`` changed type to ``BIGINT``" +msgstr "``seq`` har ändrat typ till ``BIGINT``" -msgid "Is an undirected graph." -msgstr "Är en odelad graf." +msgid "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." +msgstr "De biconnected komponenterna i en odelad graf är de maximala delmängderna av hörnpunkter så att borttagandet av en hörnpunkt från en viss komponent inte kommer att koppla bort komponenten. Till skillnad från anslutna komponenter kan toppar tillhöra flera biconnected components. Toppar kan förekomma i flera biconnected components, men varje kant kan bara ingå i en enda biconnected component." -msgid "Although visually looks like to have geometries, the drawing is not to scale." -msgstr "Även om det visuellt ser ut att finnas geometrier är ritningen inte skalenlig." +msgid "Components are described by edges." +msgstr "Komponenterna beskrivs med kanter." -msgid "No geometries associated to the vertices or edges" -msgstr "Inga geometrier associerade till hörn eller kanter" +msgid "``component`` ascending." +msgstr "``komponent`` stigande." -msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" -msgstr "Har 6 hörn :math:`\\{1,2,3,4,5,6\\}`" +msgid "``edge`` ascending." +msgstr "``edge`` stigande." -msgid "Has 9 edges:" -msgstr "Har 9 kanter:" +msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgstr "pgr_biconnectedComponents(`Kanter SQL`_)" -msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" -msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgid "Returns set of |result-component-E|" +msgstr "Returnerar uppsättning av |result-component-E|" -msgid "The graph can be represented in many ways for example:" -msgstr "Grafen kan representeras på många olika sätt, t.ex:" +msgid "The biconnected components of the graph" +msgstr "De biconnected komponenterna i grafen" -msgid "Prepare the database" -msgstr "Förbereda databasen" +msgid "``component``" +msgstr "``component``" -msgid "Create a database for the example, access the database and install pgRouting: ::" -msgstr "Skapa en databas för exemplet, gå in i databasen och installera pgRouting: ::" +msgid "Component identifier." +msgstr "Komponentens identifierare." -msgid "Create a table" -msgstr "Skapa en tabell" +msgid "Has the value of the minimum edge identifier in the component." +msgstr "Har värdet för den minsta kantidentifieraren i komponenten." -msgid "The basic elements needed to perform basic routing on an undirected graph are:" -msgstr "De grundläggande element som behövs för att utföra grundläggande routing på en odelad graf är:" +msgid "Identifier of the edge that belongs to the ``component``." +msgstr "Identifierare av den kant som tillhör ``komponenten``." -msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgstr "``pgr_binaryBreadthFirstSearch`` - Experimentell" -msgid "Using this table design for this example:" -msgstr "Använd denna bordsdesign för detta exempel:" +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgstr "``pgr_binaryBreadthFirstSearch`` - Returnerar den kortaste vägen i en binär graf." -msgid "Insert the data" -msgstr "Infoga data" +msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." +msgstr "En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal, kallas för en \"binär graf\"." -msgid "Find the shortest path" -msgstr "Hitta den kortaste vägen" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgstr "pgr_binaryBreadthFirstSearch(Combinations)" -msgid "To solve this example :doc:`pgr_dijkstra` is used:" -msgstr "För att lösa detta exempel används :doc:`pgr_dijkstra`:" +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +msgstr "Det är välkänt att de kortaste vägarna mellan en enda källa och alla andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som du behöver korsa från källan till en annan topp. Vi kan också tolka en sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om inte alla kanter i grafen har samma vikt behövs en mer generell algoritm, som Dijkstras algoritm som går på :math:`O(|E|log|V|)` tid." -msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" -msgstr "För att gå från :math:`1` till :math:`5` går vägen genom följande hörn: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." +msgstr "Men om vikterna är mer begränsade kan vi använda en snabbare algoritm. Den här algoritmen, som kallas \"Binary Breadth First Search\" eller \"0-1 BFS\", är en variant av standardproblemet Breadth First Search för att lösa SSSP-problemet (kortaste vägen med en källa) på :math:`O(|E|)`, om vikterna för varje kant tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal." -msgid "Vertex information" -msgstr "Information om toppunkt" +msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" +msgstr "Processen görs endast på \"binära grafer\". ('Binär graf': En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt reellt heltal)" -msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" -msgstr "För att få information om topparna, använd :doc:`pgr_extractVertices`" +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" +msgstr "Speltid: :math:`O(| start\\_vids | * |E|)``" -msgid "Graphs with geometries" -msgstr "Grafer med geometrier" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])" -msgid "Create a routing Database" -msgstr "Skapa en routningsdatabas" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])" -msgid "The first step is to create a database and load pgRouting in the database." -msgstr "Det första steget är att skapa en databas och ladda pgRouting i databasen." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])" -msgid "Typically create a database for each project." -msgstr "Vanligtvis skapas en databas för varje projekt." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" -msgid "Once having the database to work in, load your data and build the routing application in that database." -msgstr "När du väl har en databas att arbeta i laddar du dina data och bygger routingapplikationen i den databasen." +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "Load Data" -msgstr "Ladda data" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgstr "**Anmärkning:** Använda :doc:`sampledata` Network eftersom alla vikter är desamma (dvs :math:`1``)" -msgid "There are several ways to load your data into pgRouting." -msgstr "Det finns flera sätt att ladda dina data i pgRouting." +msgid "`Boost: Breadth First Search `__" +msgstr "`Boost: Bredd först Sök `__" -msgid "Manually creating a database." -msgstr "Skapa en databas manuellt." +msgid "https://cp-algorithms.com/graph/01_bfs.html" +msgstr "https://cp-algorithms.com/graph/01_bfs.html" -msgid "`Graphs without geometries`_" -msgstr "`Grafer utan geometrier`_" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgid ":doc:`sampledata`: a small graph used in the documentation examples" -msgstr ":doc:`sampledata`: a small graph used in the documentation examples" +msgid "``pgr_bipartite`` - Experimental" +msgstr "``pgr_bipartite`` - Experimentell" -msgid "Using `osm2pgrouting `__" -msgstr "Använda `osm2pgrouting `__" +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +msgstr "``pgr_bipartite`` - Disjunkta uppsättningar av hörnpunkter så att inga två hörnpunkter inom samma uppsättning är angränsande." -msgid "There are various open source tools that can help, like:" -msgstr "Det finns olika verktyg med öppen källkod som kan hjälpa till, t.ex:" +msgid "Output columns standardized to |result_node_color|" +msgstr "Utdatakolumner standardiserade till |result_node_color|" -msgid "shp2pgsql" -msgstr "shp2pgsql" +msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgstr "En bipartitisk graf är en graf med två uppsättningar av hörn som är kopplade till varandra, men inte inom sig själva. En bipartitisk graf är möjlig om grafen kan färgläggas med två färger så att topparna i en uppsättning färgas med samma färg." -msgid "postgresql shapefile loader" -msgstr "postgresql shapefile-laddare" +msgid "The algorithm works in undirected graph only." +msgstr "Algoritmen fungerar endast i ostyrda grafer." -msgid "ogr2ogr" -msgstr "ogr2ogr" +msgid "The returned values are not ordered." +msgstr "De returnerade värdena är inte ordnade." -msgid "vector data conversion utility" -msgstr "verktyg för konvertering av vektordata" +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgstr "Algoritmen kontrollerar om grafen är tvådelad eller inte. Om den är bipartite returnerar den noden tillsammans med två färger `0` och `1` som representerar två olika uppsättningar." -msgid "osm2pgsql" -msgstr "osm2pgsql" +msgid "If graph is not bipartite then algorithm returns empty set." +msgstr "Om grafen inte är bipartitisk returnerar algoritmen en tom uppsättning." -msgid "load OSM data into postgresql" -msgstr "ladda OSM-data till postgresql" +msgid "pgr_bipartite(`Edges SQL`_)" +msgstr "pgr_bipartite(`Kanter SQL`_)" -msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." -msgstr "Observera att dessa verktyg **inte** kommer att importera data i en struktur som är kompatibel med pgRouting och när detta händer måste topologin justeras." +msgid "When the graph is bipartite" +msgstr "När grafen är tvådelad" -msgid "Breakup a segments on each segment-segment intersection" -msgstr "Dela upp ett segment på varje segment-segment intersektion" +msgid "Additional Example" +msgstr "Ytterligare exempel" -msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." -msgstr "Om de saknas, lägg till kolumner och tilldela värden för ``källa``, ``mål``, ``kostnad``, ``omvänd kostnad``." +msgid "The odd length cyclic graph can not be bipartite." +msgstr "Den cykliska grafen med udda längd kan inte vara bipartit." -msgid "Connect a disconnected graph." -msgstr "Anslut en frånkopplad graf." +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgstr "Kanten :math:`5 \\rightarrow 1` kommer att göra undergrafen med hörn :math:`\\{1, 3, 7, 6, 5\\}` till en cyklisk graf med udda längd, eftersom cykeln har 5 hörn." -msgid "Create the complete graph topology" -msgstr "Skapa den fullständiga grafens topologi" +msgid "Edges in blue represent odd length cycle subgraph." +msgstr "Kanter i blått representerar cykelundergraf med udda längd." -msgid "Create one or more graphs based on the application to be developed." -msgstr "Skapa en eller flera grafer baserat på den applikation som ska utvecklas." +msgid "`Boost: is_bipartite `__" +msgstr "`Boost: is_bipartite `__" -msgid "Create a contracted graph for the high speed roads" -msgstr "Skapa ett sammandraget diagram för höghastighetsvägarna" +msgid "`Wikipedia: bipartite graph `__" +msgstr "`Wikipedia: bipartitgraf `__" -msgid "Create graphs per state/country" -msgstr "Skapa grafer per stat/land" +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" -msgid "In few words:" -msgstr "Med några få ord:" +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgstr "``pgr_boykovKolmogorov`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Boykov Kolmogorov-algoritmen." -msgid "Prepare the graph" -msgstr "Förbered grafen" +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov(Combinations)" -msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." -msgstr "Vad och hur du ska förbereda grafen beror på applikationen och/eller på datakvaliteten och/eller på hur nära informationen är en topologi som kan användas av pgRouting och/eller på andra faktorer som inte nämns." +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgstr "Borttagen från ``pgr_maxFlowBoykovKolmogorov``" -msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." -msgstr "Stegen för att förbereda grafen involverar geometriska operationer med hjälp av `PostGIS `__ och vissa andra involverar grafoperationer som :doc:`pgr_contraction` för att dra ihop en graf." +msgid "Function promoted to proposed." +msgstr "Funktion befordrad till föreslagen." -msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." -msgstr "I workshopen `__ finns en steg-för-stegbeskrivning av hur man skapar en graf med hjälp av Open Street Map-data för en liten applikation." +msgid "Running time: Polynomial" +msgstr "Drifttid: Polynom" -msgid "The use of indexes on the database design in general:" -msgstr "Användningen av index på databasdesignen i allmänhet:" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vid**, **end vid**)" -msgid "Have the geometries indexed." -msgstr "Låt geometrierna vara indexerade." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vid**, **end vids**)" -msgid "Have the identifiers columns indexed." -msgstr "Låt kolumnerna med identifierare indexeras." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vids**, **end vid**)" -msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." -msgstr "Vänligen se dokumentationen för `PostgreSQL `__ och dokumentationen för `PostGIS `__." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vids**, **end vids**)" -msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." -msgstr "Data som kommer från OSM och använder `osm2pgrouting `__ som ett importverktyg, kommer med routingtopologin. Se ett exempel på användning av ``osm2pgrouting`` på `workshop `__." +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, `Combinations SQL`_)" -msgid "Adjust costs" -msgstr "Justera kostnader" +msgid "Returns set of |result-flow|" +msgstr "Returnerar uppsättning av |result-flow|" -msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." -msgstr "I det här exemplet kommer värdena ``cost`` och ``reverse_cost`` att vara det dubbla av geometrins längd." +msgid "From vertex :math:`11` to vertex :math:`12`" +msgstr "Från toppunkten :math:`11` till toppunkten :math:`12`" -msgid "Update costs to length of geometry" -msgstr "Uppdatera kostnaderna till geometrins längd" +msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "Från toppunkten :math:`11` till toppunkterna :math:`{\\5, 10, 12\\}`" -msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" -msgstr "Antag att kolumnerna ``kostnad`` och ``omvända_kostnader`` i urvalsdata representerar:" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" +msgstr "Från topparna :math:`\\{11, 3, 17\\}` till topp :math:`12`" -msgid ":math:`1` when the edge exists in the graph" -msgstr ":math:`1` when the edge exists in the graph" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "Från topparna :math:`{11, 3, 17\\}` till topparna :math:`{5, 10, 12\\}`" -msgid ":math:`-1` when the edge does not exist in the graph" -msgstr ":math:`-1` when the edge does not exist in the graph" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}`." -msgid "Using that information updating to the length of the geometries:" -msgstr "Med hjälp av den informationen uppdateras geometriernas längd:" +msgid "`Boost: Boykov Kolmogorov max flow `__" +msgstr "`Boost: Boykov Kolmogorov maxflöde `__" -msgid "Which gives the following results:" -msgstr "Vilket ger följande resultat:" +msgid "``pgr_breadthFirstSearch`` - Experimental" +msgstr "``pgr_breadthFirstSearch`` - Experimentell" -msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." -msgstr "Observera att för att kunna följa dokumentationsexemplen är allt baserat på den ursprungliga grafen." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgstr "``pgr_breadthFirstSearch`` - Returnerar traverseringsordning(ar) med algoritmen Breadth First Search." -msgid "Returning to the original data:" -msgstr "Återgå till de ursprungliga uppgifterna:" +msgid "Version 4.0.0:" +msgstr "Version 4.0.0:" -msgid "Update costs based on codes" -msgstr "Uppdatera kostnader baserat på koder" +msgid "Standardizing output columns to |result-spantree|" +msgstr "Standardisering av utdatakolumner till |result-spantree|" -msgid "Other datasets, can have a column with values like" -msgstr "Andra dataset kan ha en kolumn med värden som" +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgstr "Ger genomgångsordningen Breadth First Search från en rotvertex till ett visst djup." -msgid "``FT`` vehicle flow on the direction of the geometry" -msgstr "``FT`` fordonsflöde i geometrins riktning" +msgid "The implementation will work on any type of graph." +msgstr "Implementeringen kommer att fungera på alla typer av grafer." -msgid "``TF`` vehicle flow opposite of the direction of the geometry" -msgstr "``TF`` fordonsflöde motsatt geometrins riktning" +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgstr "Ger traverseringsordningen Breadth First Search från en källnod till en måldjupnivå." -msgid "``B`` vehicle flow on both directions" -msgstr "``B`` fordonsflöde i båda riktningarna" +msgid "Running time: :math:`O(E + V)`" +msgstr "Speltid: :math:`O(E + V)`" -msgid "Preparing a code column for the example:" -msgstr "Förbereda en kodkolumn för exemplet:" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Kanter SQL`_, **root vid**, [**options**])" -msgid "Adjusting the costs based on the codes:" -msgstr "Justering av kostnaderna baserat på koderna:" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Kanter SQL`_, **root vids**, [**options**])" -msgid "Check the Routing Topology" -msgstr "Kontrollera routingtopologin" +msgid "**options:** ``[max_depth, directed]``" +msgstr "**options:** ``[max_depth, directed]``" -msgid "There are lots of possible problems in a graph." -msgstr "Det finns många möjliga problem i en graf." +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgstr "Från rotpunkten :math:`6` på en **riktad** graf med kanter i stigande ordning efter ``id``" -msgid "The data used may not have been designed with routing in mind." -msgstr "De data som används kanske inte har utformats med tanke på routing." +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgstr "Från rotkärnor :math:`{12, 6\\}` på en **omdirigerad** graf med **djup** :math:`<= 2` och kanter i stigande ordning efter `id``" -msgid "A graph has some very specific requirements." -msgstr "En graf har några mycket specifika krav." +msgid "DFS optional parameters" +msgstr "DFS valfria parametrar" -msgid "The graph is disconnected." -msgstr "Grafen är frånkopplad." +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." +msgstr "Samma som `Single vertex`_ med kanter i stigande ordning efter ``id``." -msgid "There are unwanted intersections." -msgstr "Det finns oönskade korsningar." +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgstr "Samma som `Single vertex`_ med kanter i fallande ordning efter ``id``." -msgid "The graph is too large and needs to be contracted." -msgstr "Grafen är för stor och behöver krympas." +msgid "The resulting traversal is different." +msgstr "Den resulterande traversalen är annorlunda." -msgid "A sub graph is needed for the application." -msgstr "En subgraf behövs för applikationen." +msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." +msgstr "Den vänstra bilden visar resultatet med stigande ordning av id:n och den högra bilden visar med fallande ordning av kantidentifierarna." -msgid "and many other problems that the pgRouting user, that is the application developer might encounter." -msgstr "och många andra problem som pgRouting-användaren, det vill säga applikationsutvecklaren, kan stöta på." +msgid "|ascending| |descending|" +msgstr "|ascending| |descending|" -msgid "Crossing edges" -msgstr "Korsande kanter" +msgid "ascending" +msgstr "stigande" -msgid "To get the crossing edges:" -msgstr "För att få de korsande kanterna:" +msgid "descending" +msgstr "fallande" -msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." -msgstr "Den informationen är korrekt, till exempel när det gäller fordon, är det en tunnel eller bro som korsar en annan väg." +msgid "`Wikipedia: Breadth First Search algorithm `__" +msgstr "`Wikipedia: Algoritmen för bred första sökning `__" -msgid "It might be incorrect, for example:" -msgstr "Det kan till exempel vara felaktigt:" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "When it is actually an intersection of roads, where vehicles can make turns." -msgstr "När det faktiskt är en korsning av vägar, där fordon kan svänga." +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +msgstr "``pgr_bridges`` - Returnerar broarna i en odränerad graf." -msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." -msgstr "När det gäller elektriska ledningar kan den elektriska ledningen byta väg även i en tunnel eller på en bro." +msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." +msgstr "En bro är en kant i en odelad graf vars borttagning ökar dess antal anslutna komponenter. Denna implementation kan endast användas med en odelad graf." -msgid "When it is incorrect, it needs fixing:" -msgstr "När den är felaktig behöver den åtgärdas:" +msgid "``edge`` ascending" +msgstr "``edge`` stigande" -msgid "For vehicles and pedestrians" -msgstr "För fordon och fotgängare" +msgid "Running time: :math:`O(E * (V + E))`" +msgstr "Speltid: :math:`O(E * (V + E))`" -msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." -msgstr "Om data kommer från OSM och importerades till databasen med hjälp av ``osm2pgrouting``, måste korrigeringen göras i `OSM-portalen `__ och data importeras igen." +msgid "pgr_bridges(`Edges SQL`_)" +msgstr "pgr_bridges(`Kanter SQL`_)" -msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" -msgstr "I allmänhet när data kommer från en leverantör som har förberett data för routing av fordon och det finns ett problem, ska data åtgärdas från leverantören" +msgid "Returns set of |result-edge|" +msgstr "Returnerar uppsättning av |result-edge|" -msgid "For very specific applications" -msgstr "För mycket specifika tillämpningar" +msgid "The bridges of the graph" +msgstr "Bryggorna i grafen" -msgid "The data is correct when from the point of view of routing vehicles or pedestrians." -msgstr "Uppgifterna är korrekta om de ses ur de dirigerande fordonens eller fotgängarnas synvinkel." +msgid "Identifier of the edge that is a bridge." +msgstr "Identifierar den kant som är en bro." -msgid "The data needs a local fix for the specific application." -msgstr "Uppgifterna behöver en lokal fix för den specifika applikationen." +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." -msgstr "När korsningarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas `__." +msgid "`Boost: Connected components `__" +msgstr "`Boost: Anslutna komponenter `__" -msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." -msgstr "De nya kanterna måste läggas till i kanttabellen, resten av attributen måste uppdateras i de nya kanterna, de gamla kanterna måste tas bort och routingtopologin måste uppdateras." +msgid "``pgr_chinesePostman`` - Experimental" +msgstr "``pgr_chinesePostman`` - Experimentell" -msgid "Fixing an intersection" -msgstr "Fixa en korsning" +msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostman`` - Beräknar den kortaste kretsvägen som innehåller varje kant i en riktad graf och som börjar och slutar på samma toppunkt." -msgid "In this example the original edge table will be used to store the additional geometries." -msgstr "I detta exempel kommer den ursprungliga kanttabellen att användas för att lagra de extra geometrierna." +msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgstr "Returnerar ``EMPTY SET`` på en frånkopplad graf" -msgid "An example use without results" -msgstr "Ett exempel på användning utan resultat" +msgid "pgr_chinesePostman(`Edges SQL`_)" +msgstr "pgr_chinesePostman(`Kanter SQL`_)" -msgid "Routing from :math:`1` to :math:`18` gives no solution." -msgstr "Routning från :math:`1` till :math:`18` ger ingen lösning." +msgid "Returns set of |result-1-1-no-seq|" +msgstr "Returnerar uppsättning av |result-1-1-no-seq|" -msgid "Analyze the network for intersections." -msgstr "Analysera nätverket för korsningar." +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgstr "Returnerar uppsättning av ``(seq, nod, kant, kostnad, agg_cost)``" -msgid "The analysis tell us that the network has an intersection." -msgstr "Analysen visar att nätverket har en korsning." +msgid "Sequential value starting from ``1``" +msgstr "Sekventiellt värde med början från ``1``" -msgid "Prepare tables" -msgstr "Förbereda tabeller" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgstr "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen. ``-1`` för den sista noden i sökvägen." -msgid "Additional columns to control the origin of the segments." -msgstr "Ytterligare kolumner för att styra segmentens ursprung." +msgid "Aggregate cost from ``start_v`` to ``node``." +msgstr "Sammanlagd kostnad från ``start_v`` till ``node``." -msgid "Adding new segments." -msgstr "Lägga till nya segment." +msgid "``pgr_chinesePostmanCost`` - Experimental" +msgstr "``pgr_chinesePostmanCost`` - Experimentell" -msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." -msgstr "Anropar :doc:`pgr_separateCrossing` och lägger till de nya segmenten i tabellen över kanter." +msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostmanCost`` - Beräknar minimikostnaderna för en kretsbana som innehåller varje kant i en riktad graf och som börjar och slutar på samma vertex." -msgid "Update other values" -msgstr "Uppdatera andra värden" +msgid "Return value when the graph if disconnected" +msgstr "Returvärde när grafen är frånkopplad" -msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." -msgstr "I det här exemplet uppdateras endast ``cost`` och ``reverse_cost``, där de baseras på geometrins längd och riktningen bibehålls med hjälp av funktionen ``sign``." +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgstr "pgr_chinesePostmanCost(`Kanter SQL`_)" -msgid "Update the topology" -msgstr "Uppdatera topologin" +msgid "RETURNS ``FLOAT``" +msgstr "RETURNERAR ``FLÖDE``" -msgid "Insert the new vertices if any." -msgstr "Infoga eventuella nya hörn." +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" -msgid "Update source and target information on the edges table." -msgstr "Uppdatera käll- och målinformationen i kanttabellen." +msgid "Minimum costs of a circuit path." +msgstr "Minimikostnader för en kretsbana." -msgid "The example has results" -msgstr "Exemplet har resultat" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" -msgid "Routing from :math:`1` to :math:`18` gives a solution." -msgstr "Routning från :math:`1` till :math:`18` ger en lösning." +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgstr "``pgr_connectedComponents`` - Anslutna komponenter i en odelad graf med hjälp av en DFS-baserad metod." -msgid "Touching edges" -msgstr "Beröring av kanter" +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgstr "En kopplad komponent i en odelad graf är en uppsättning hörn som alla är nåbara från varandra." -msgid "Visually the edges seem to be connected, but internally they are not." -msgstr "Visuellt verkar kanterna vara sammankopplade, men internt är de inte det." +msgid "Components are described by vertices" +msgstr "Komponenterna beskrivs av hörn" -msgid "The validity of the information is application dependent." -msgstr "Informationens giltighet är applikationsberoende." +msgid "``component`` ascending" +msgstr "``komponent`` stigande" -msgid "Maybe there is a small barrier for vehicles but not for pedestrians." -msgstr "Kanske finns det en liten barriär för fordon men inte för fotgängare." +msgid "pgr_connectedComponents(`Edges SQL`_)" +msgstr "pgr_connectedComponents(`Kanter SQL`_)" -msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." -msgstr "När beröringarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas `__." +msgid "Returns set of |result-component-V|" +msgstr "Returnerar uppsättning av |result-component-V|" -msgid "Fixing a gap" -msgstr "Åtgärda en lucka" +msgid "The connected components of the graph" +msgstr "De anslutna komponenterna i grafen" -msgid "Routing from :math:`1` to :math:`2` gives no solution." -msgstr "Routning från :math:`1` till :math:`2` ger ingen lösning." +msgid "Has the value of the minimum node identifier in the component." +msgstr "Har värdet för den minsta nodidentifieraren i komponenten." -msgid "Analyze the network for gaps." -msgstr "Analysera nätverket för att hitta luckor." +msgid "Identifier of the vertex that belongs to the ``component``." +msgstr "Identifierare av den toppunkt som tillhör ``komponenten``." -msgid "The analysis tell us that the network has a gap." -msgstr "Analysen visar att det finns en lucka i nätverket." +msgid "Connecting disconnected components" +msgstr "Anslutning av frånkopplade komponenter" -msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." -msgstr "Anropar :doc:`pgr_separateTouching` och lägger till de nya segmenten i tabellen över kanter." +msgid "wikipedia: `Connected component `__" +msgstr "wikipedia: `sammanhängande komponent `__" -msgid "Routing from :math:`1` to :math:`2` gives a solution." -msgstr "En routning från :math:`1` till :math:`2` ger en lösning." +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" -msgid "Connecting components" -msgstr "Anslutning av komponenter" +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contraction`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." -msgid "To get the graph connectivity:" -msgstr "För att få grafens anslutningsmöjligheter:" +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "There are three basic ways to connect components:" -msgstr "Det finns tre grundläggande sätt att ansluta komponenter:" +msgid "Version 3.8.0" +msgstr "Version 3.8.0" -msgid "From the vertex to the starting point of the edge" -msgstr "Från toppunkten till startpunkten för kanten" +msgid "New signature:" +msgstr "Ny signatur:" -msgid "From the vertex to the ending point of the edge" -msgstr "Från toppunkten till slutpunkten för kanten" +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgstr "Den tidigare obligatoriska parametern **Contraction order** är nu valfri med namnet ``methods``." -msgid "From the vertex to the closest vertex on the edge" -msgstr "Från toppunkten till den närmaste toppunkten på kanten" +msgid "New name and order of optional parameters." +msgstr "Nytt namn och ordning på valfria parametrar." -msgid "This solution requires the edge to be split." -msgstr "Denna lösning kräver att kanten delas." +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "Föråldrad signatur pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." -msgstr "I detta exempel kommer :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` att användas." +msgid "Name change from ``pgr_contractGraph``" +msgstr "Namnändring från ``pgr_contractGraph``" -msgid "Get the connectivity" -msgstr "Få anslutningsmöjligheterna" +msgid "Bug fixes" +msgstr "Buggfixar" -msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." -msgstr "I det här exemplet behöver tabellen edges en extra kolumn och tabellen vertex byggs om helt och hållet." +msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." +msgstr "Kontraktion minskar storleken på grafen genom att ta bort några av topparna och kanterna och till exempel lägga till kanter som representerar en sekvens av ursprungliga kanter, vilket minskar den totala tid och det utrymme som används i grafalgoritmer." -msgid "Insert new edges" -msgstr "Infoga nya kanter" +msgid "Does not return the full contracted graph." +msgstr "Returnerar inte hela den kontraherade grafen." -msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." -msgstr "Använd :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` för att infoga resultaten i tabellen över kanter." +msgid "Only changes on the graph are returned." +msgstr "Endast ändringar i diagrammet returneras." -msgid "Create the vertices table" -msgstr "Skapa en tabell över hörnpunkter" +msgid "The returned values include:" +msgstr "De returnerade värdena inkluderar:" -msgid "Using :doc:`pgr_extractVertices` create the table." -msgstr "Skapa tabellen med hjälp av :doc:`pgr_extractVertices`." +msgid "The new edges generated by linear contraction." +msgstr "De nya kanterna som genereras av linjär sammandragning." -msgid "Contraction of a graph" -msgstr "Sammandragning av en graf" +msgid "The modified vertices generated by dead end contraction." +msgstr "De modifierade topparna som genereras av sammandragning av återvändsgränder." -msgid "The graph can be reduced in size using :doc:`contraction-family`" -msgstr "Grafen kan minskas i storlek med hjälp av :doc:`contraction-family`" +msgid "The returned values are ordered as follows:" +msgstr "De returnerade värdena är ordnade enligt följande:" -msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." -msgstr "När kontrakt ska ingås beror på grafens storlek, behandlingstider, uppgifternas riktighet, den slutliga applikationen eller någon annan faktor som inte nämns." +msgid "column ``id`` ascending when its a modified vertex." +msgstr "kolumn ``id`` stigande när det är en modifierad vertex." -msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." -msgstr "En ganska bra metod för att ta reda på om sammandragning kan vara användbart är på grund av antalet återvändsgränder och/eller antalet linjära kanter." +msgid "column ``id`` with negative numbers descending when its a new edge." +msgstr "kolumn ``id`` med negativa tal fallande när det är en ny kant." -msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" -msgstr "En fullständig metod för hur man kontraherar och hur man använder den kontraherade grafen beskrivs på :doc:`contraction-family`" +msgid "Currently there are two types of contraction methods included in this function:" +msgstr "För närvarande finns det två typer av sammandragningsmetoder som ingår i denna funktion:" -msgid "To get the dead ends:" -msgstr "För att få bort återvändsgränderna:" +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgstr "Kontraktion för återvändsgränd. Se :doc:`pgr_contractionDeadEnd`." -msgid "A dead end happens when" -msgstr "En återvändsgränd uppstår när" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgstr "Linjär sammandragning. Se :doc:`pgr_contractionLinear`." -msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." -msgstr "Toppunkten är gränsen för en återvändsgränd, en väg med genomfartsförbud eller en väg med utfartsförbud." +msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgstr "pgr_contraction(`Kanter SQL`_, [**options**])" -msgid "The vertex is on the limit of the imported graph." -msgstr "Toppunkten ligger på gränsen för den importerade grafen." +msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgstr "**options:** ``[directed, methods, cycles, forbidden]``" -msgid "If a larger graph is imported then the vertex might not be a dead end" -msgstr "Om en större graf importeras är det inte säkert att toppunkten är en återvändsgränd" +msgid "Returns set of |result-contract|" +msgstr "Returnerar uppsättning av |result-contract|" -msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." -msgstr "Noden :math:`4`, är en återvändsgränd i frågan, även om den visuellt ser ut som en slutpunkt för 3 kanter." +msgid "Dead end and linear contraction in that order on an undirected graph." +msgstr "Dead end och linjär sammandragning i den ordningen på en odelad graf." -msgid "Is node :math:`4` a dead end or not?" -msgstr "Är noden :math:`4` en återvändsgränd eller inte?" +msgid "Contraction optional parameters" +msgstr "Sammandragning valfria parametrar" -msgid "The answer to that question will depend on the application." -msgstr "Svaret på den frågan beror på vilken applikation det gäller." +msgid "``methods``" +msgstr "``methods``" -msgid "Is there such a small curb:" -msgstr "Finns det en sådan liten trottoarkant:" +msgid "``INTEGER[]``" +msgstr "``INTEGER[]``" -msgid "That does not allow a vehicle to use that visual intersection?" -msgstr "Som inte tillåter ett fordon att använda den visuella korsningen?" +msgid "``ARRAY[1,2]``" +msgstr "``ARRAY[1,2]``" -msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" -msgstr "Är applikationen för fotgängare och därför kan fotgängaren enkelt gå på den lilla trottoaren?" +msgid "Ordered contraction operations." +msgstr "Beställde sammandragningsoperationer." -msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" -msgstr "Gäller applikationen el och elledningar som enkelt kan förlängas ovanpå den lilla trottoarkanten?" +msgid "1 = Dead end contraction" +msgstr "1 = Kontraktion i återvändsgränd" -msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" -msgstr "Finns det en stor klippa och från örnens utsikt ser det ut som att återvändsgränden ligger nära segmentet?" +msgid "2 = Linear contraction" +msgstr "2 = Linjär sammandragning" -msgid "Depending on the answer, modification of the data might be needed." -msgstr "Beroende på svaret kan det bli nödvändigt att ändra uppgifterna." +msgid "``cycles``" +msgstr "``cycles``" -msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." -msgstr "När det finns många återvändsgränder kan funktionerna :doc:`contraction-family` användas för att dra ihop grafen för att påskynda bearbetningen." +msgid ":math:`1`" +msgstr ":math:`1`" -msgid "Linear edges" -msgstr "Linjära kanter" +msgid "Number of times the contraction methods will be performed." +msgstr "Antal gånger som sammandragningsmetoderna ska utföras." -msgid "To get the linear edges:" -msgstr "För att få de linjära kanterna:" +msgid "``forbidden``" +msgstr "``forbidden``" -msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." -msgstr "Dessa linjära hörn är korrekta, till exempel när de hörnen är farthinder, stoppsignaler och applikationen tar hänsyn till dem." +msgid "``BIGINT[]``" +msgstr "``BIGINT[]``" -msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." -msgstr "När det finns många linjära toppar, som inte behöver beaktas, för att påskynda bearbetningen, kan funktionerna :doc:`contraction-family` användas för att kontrahera problemet." +msgid "``ARRAY[]::BIGINT[]``" +msgstr "``ARRAY[]::BIGINT[]```" -msgid "Function's structure" -msgstr "Funktionens struktur" +msgid "Identifiers of vertices forbidden for contraction." +msgstr "Identifierare av hörn som är förbjudna för sammandragning." -msgid "Once the graph preparation work has been done above, it is time to use a" -msgstr "När förberedelserna för grafen har gjorts ovan är det dags att använda en" +msgid "The function returns a single row. The columns of the row are:" +msgstr "Funktionen returnerar en enda rad. Kolumnerna i raden är:" -msgid "The general form of a pgRouting function call is:" -msgstr "Den allmänna formen för ett pgRouting-funktionsanrop är:" +msgid "``type``" +msgstr "``type``" -msgid "\\ \\" -msgstr "\\ \\" +msgid "Type of the row." +msgstr "Typ av rad." -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgstr "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgid "``v`` when the row is a vertex." +msgstr "``v`` när raden är en vertex." -msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." -msgstr "`Innerfrågor`_: Är obligatoriska parametrar som är ``TEXT``-strängar som innehåller SQL-frågor." +msgid "Column ``id`` has a positive value." +msgstr "Kolumnen ``id`` har ett positivt värde." -msgid "**parameters**: Additional compulsory parameters needed by the function." -msgstr "**parametrar**: Ytterligare obligatoriska parametrar som behövs för funktionen." +msgid "``e`` when the row is an edge." +msgstr "``e`` när raden är en kant." -msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." -msgstr "``Optionella parametrar``: Är icke obligatoriska **namngivna** parametrar som har ett standardvärde när de utelämnas." +msgid "Column ``id`` has a negative value." +msgstr "Kolumnen ``id`` har ett negativt värde." -msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." -msgstr "De obligatoriska parametrarna är positionsparametrar och de valfria parametrarna är namnparametrar." +msgid "All numbers on this column are ``DISTINCT``" +msgstr "Alla siffror i denna kolumn är ``DISTINCT``" -msgid "For example, for this :doc:`pgr_dijkstra` signature:" -msgstr "Till exempel, för denna :doc:`pgr_dijkstra` signatur:" +msgid "When ``type`` = **'v'**." +msgstr "När ``typ`` = **'v'**." -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" +msgid "Identifier of the modified vertex." +msgstr "Identifierare för det modifierade toppunktet." -msgid "`Edges SQL`_:" -msgstr "`Kanter SQL`_:" +msgid "When ``type`` = **'e'**." +msgstr "När ``typ`` = **'e'**." -msgid "Is the first parameter." -msgstr "Är den första parametern." +msgid "Decreasing sequence starting from **-1**." +msgstr "Minskande sekvens med början från **-1**." -msgid "It is compulsory." -msgstr "Det är obligatoriskt." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgstr "Representerar ett pseudo-id som inte ingår i uppsättningen av ursprungliga kanter." -msgid "It is an inner query." -msgstr "Det är en inre frågeställning." +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" -msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" -msgstr "Den har inget namn, så **Edges SQL** ger en uppfattning om vilken typ av inre fråga som måste användas" +msgid "Array of contracted vertex identifiers." +msgstr "Array med identifierare för kontrakterade vertex." -msgid "**start vid**:" -msgstr "**start vid**:" +msgid "When ``type`` = **'v'**: :math:`-1`" +msgstr "När ``typ`` = **'v'**: :math:`-1`" -msgid "Is the second parameter." -msgstr "Är den andra parametern." +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgstr "När ``typ`` = **'e'**: Identifierare av källvertexen för den aktuella kanten (``källa``, ``mål``)." -msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." -msgstr "Den har inget namn, så **start vid** ger en uppfattning om vad den andra parameterns värde ska innehålla." +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgstr "När ``typ`` = **'e'**: Identifierare av målvertexen för den aktuella kanten (``källa``, ``mål``)." -msgid "Is the third parameter." -msgstr "Är den tredje parametern." +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgstr "När ``typ`` = **'e'**: Vikt för den aktuella kanten (``källa``, ``mål``)." -msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" -msgstr "Den har inget namn, så **slut vid** ger en uppfattning om vad den tredje parameterns värde ska innehålla" +msgid "Only dead end contraction" +msgstr "Endast återvändsgränd kontraktion" -msgid "Is the fourth parameter." -msgstr "Är den fjärde parametern." +msgid "Only linear contraction" +msgstr "Endast linjär sammandragning" -msgid "It is optional." -msgstr "Det är valfritt." +msgid "The cycle" +msgstr "Cykeln" -msgid "It has a name." -msgstr "Den har ett namn." +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgstr "Kontrahering av en graf kan göras med mer än en operation. Ordningen på operationerna påverkar den resulterande kontraherade grafen, efter att ha tillämpat en operation ändras uppsättningen toppar som kan kontraheras med en annan operation." -msgid "The full description of the parameters are found on the `Parameters`_ section of each function." -msgstr "En fullständig beskrivning av parametrarna finns i avsnittet `Parametrar`_ för varje funktion." +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgstr "Denna implementation cyklar ``cyklar`` gånger genom ``metoderna`` ." -msgid "Function's overloads" -msgstr "Funktionens överbelastningar" +msgid "Contracting sample data" +msgstr "Upphandling av provdata" -msgid "A function might have different overloads. The most common are called:" -msgstr "En funktion kan ha olika överbelastningar. De vanligaste kallas:" +msgid "In this section, building and using a contracted graph will be shown by example." +msgstr "I det här avsnittet visas exempel på hur man bygger upp och använder en kontraherad graf." -msgid "`One to One`_" -msgstr "`En till en`_" +msgid "The :doc:`sampledata` for an undirected graph is used" +msgstr ":doc:`sampledata` för en enkelriktad graf används" -msgid "`One to Many`_" -msgstr "`En till många`_" +msgid "a dead end operation first followed by a linear operation." +msgstr "först en operation i en återvändsgränd och därefter en linjär operation." -msgid "`Many to One`_" -msgstr "`Många till en`_" +msgid "Construction of the graph in the database" +msgstr "Konstruktion av grafen i databasen" -msgid "`Many to Many`_" -msgstr "`Många till många`_" +msgid "The original graph:" +msgstr "Den ursprungliga grafen:" -msgid "`Combinations`_" -msgstr "`Kombinationer`_" +msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." +msgstr "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som måste göras i grafen efter att man har tillämpat sammandragningsmetoderna." -msgid "Depending on the overload the parameters types change." -msgstr "Beroende på överbelastningen ändras parametertyperna." +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgstr "Observera att toppar, till exempel :math:`6`, inte visas i resultaten eftersom de inte påverkades av sammandragningsalgoritmen." -msgid "**One**: **ANY-INTEGER**" -msgstr "**One**: **ANY-INTEGER**" +msgid "After doing the dead end contraction operation:" +msgstr "Efter att ha gjort den återvändsgränd sammandragning operation:" -msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" -msgstr "**Många**: ``ARRAY`` [**ANY-INTEGER**]" +msgid "After doing the linear contraction operation to the graph above:" +msgstr "Efter att ha gjort den linjära sammandragningsoperationen på grafen ovan:" -msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." -msgstr "Beroende på funktion kan överbelastningarna variera. Men konceptet med ändring av parametertyp förblir detsamma." +msgid "The process to create the contraction graph on the database:" +msgstr "Processen för att skapa sammandragningsgrafen i databasen:" -msgid "When routing from:" -msgstr "När du dirigerar från:" +msgid "Add additional columns" +msgstr "Lägg till ytterligare kolumner" -msgid "From **one** starting vertex" -msgstr "Från **en** startpunkt" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" +msgstr "Lägga till extra kolumner i tabellerna edges och vertices. I denna dokumentation kommer följande att användas:" -msgid "to **one** ending vertex" -msgstr "till **en** avslutande toppunkt" +msgid "Column." +msgstr "Kolumn." -msgid "to **many** ending vertices" -msgstr "till **många** avslutande hörn" +msgid "The vertices set belonging to the vertex/edge" +msgstr "Uppsättningen av toppar som hör till toppen/kanten" -msgid "From **many** starting vertices" -msgstr "Från **många** startpunkter" +msgid "``is_contracted``" +msgstr "``is_contracted``" -msgid "From **many** different starting vertices" -msgstr "Från **många** olika startpunkter" +msgid "On the vertex table" +msgstr "På toppunktstabellen" -msgid "to **many** different ending vertices" -msgstr "till **många** olika slutpunkter" +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgstr "när ``true`` vertexen är kontraherad, är den inte en del av den kontraherade grafen." -msgid "Every tuple specifies a pair of a start vertex and an end vertex" -msgstr "Varje tupel specificerar ett par av en startvertex och en slutvertex" +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgstr "när ``false`` är vertexen inte kontraherad, den är en del av den kontraherade grafen." -msgid "Users can define the combinations as desired." -msgstr "Användarna kan definiera kombinationerna som de vill." +msgid "``is_new``" +msgstr "``is_new``" -msgid "Needs a `Combinations SQL`_" -msgstr "Behöver en `Combinations SQL`_" +msgid "On the edge table" +msgstr "På kanten av bordet" -msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." -msgstr "Det finns flera olika typer av giltiga inre frågor och de kolumner som returneras beror också på funktionen. Vilken typ av inner query som används beror på funktionens krav. För att förenkla de många olika typerna används **ANY-INTEGER** och **ANY-NUMERICAL**." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgstr "när ``true`` kanten genererades av sammandragningsalgoritmen. dess del av den sammandragna grafen." -msgid "Edges SQL for" -msgstr "Edges SQL för" +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgstr "när ``false`` är kanten en originalkant, som kan vara eller inte vara en del av den kontraherade grafen." -msgid "Some uncategorised functions" -msgstr "Vissa okategoriserade funktioner" +msgid "Store contraction information" +msgstr "Lagra information om sammandragning" -msgid "General without ``id``" -msgstr "Allmänt utan ``id``" +msgid "Store the contraction results in a table." +msgstr "Spara sammandragningsresultaten i en tabell." -msgid "General with (X,Y)" -msgstr "Allmänt med (X,Y)" +msgid "Update the edges and vertices tables" +msgstr "Uppdatera tabellerna för kanter och toppar" -msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." -msgstr "När den är negativ: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgstr "Använd kolumnen ``is_contracted`` för att ange de toppar som är kontraherade." -msgid "Weight of the edge (``target``, ``source``)," -msgstr "Kantvikt (``mål``, ``källa``)," +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgstr "Fyll i ``contracted_vertices`` med informationen från de resultat som hör till topparna." -msgid "``x1``" -msgstr "``x1``" +msgid "Insert the new edges generated by pgr_contraction." +msgstr "Infoga de nya kanterna som genererats av pgr_contraction." -msgid "X coordinate of ``source`` vertex." -msgstr "X-koordinat för ``källans`` toppunkt." +msgid "The contracted graph" +msgstr "Den kontraherade grafen" -msgid "``y1``" -msgstr "``y1``" +msgid "Vertices that belong to the contracted graph." +msgstr "Punkter som hör till den kontraherade grafen." -msgid "Y coordinate of ``source`` vertex." -msgstr "Y-koordinat för ``källans`` toppunkt." +msgid "Edges that belong to the contracted graph." +msgstr "Kanter som hör till den kontraherade grafen." -msgid "``x2``" -msgstr "``x2``" +msgid "Visually:" +msgstr "Visuellt:" -msgid "X coordinate of ``target`` vertex." -msgstr "X-koordinat för ``mål`` vertex." +msgid "Using the contracted graph" +msgstr "Använda den kontraherade grafen" -msgid "``y2``" -msgstr "``y2``" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgstr "Beroende på den slutliga tillämpningen ska grafen förberedas. I detta exempel kommer den slutliga tillämpningen att vara att beräkna kostnaden från två toppar i originalgrafen genom att använda den kontraherade grafen med ``pgr_dijkstraCost``" -msgid "Y coordinate of ``target`` vertex." -msgstr "Y-koordinat för \"målets\" toppunkt." +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgstr "Det finns tre fall när man beräknar den kortaste vägen mellan en given källa och ett givet mål i en kontrakterad graf:" -msgid "Flow" -msgstr "Flöde" +msgid "Case 1: Both source and target belong to the contracted graph." +msgstr "Fall 1: Både källan och målet hör till den kontrakterade grafen." -msgid "Edges SQL for :doc:`flow-family`" -msgstr "Edges SQL för :doc:`flow-family`" +msgid "Case 2: Source and/or target belong to an edge subgraph." +msgstr "Fall 2: Källa och/eller mål tillhör en edge-subgraf." -msgid "Edges SQL for the following functions of :doc:`flow-family`" -msgstr "Edges SQL för följande funktioner i :doc:`flow-family`" +msgid "Case 3: Source and/or target belong to a vertex." +msgstr "Fall 3: Källa och/eller mål hör till en vertex." -msgid "Used in combination signatures" -msgstr "Används i kombinationssignaturer" +msgid "The final application should consider all of those cases." +msgstr "Den slutliga applikationen bör ta hänsyn till alla dessa fall." -msgid "Points SQL for" -msgstr "Punkt SQL för" +msgid "Create a view (or table) of the contracted graph:" +msgstr "Skapa en vy (eller tabell) av den kontraherade grafen:" -msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." -msgstr "Huvudparametern för de flesta pgRouting-funktioner är en fråga som väljer ut kanterna i grafen." +msgid "Create the function that will use the contracted graph." +msgstr "Skapa den funktion som ska använda den kontraherade grafen." -msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." -msgstr "Beroende på vilken familj eller kategori en funktion tillhör kommer den att ha ytterligare parametrar, varav vissa är obligatoriska och andra valfria." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgstr "Fall 2: Källa och/eller mål hör till en kant som har kontraherade toppar." -msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." -msgstr "De obligatoriska parametrarna är namnlösa och måste anges i den ordning som krävs. De valfria parametrarna är namngivna parametrar och kommer att ha ett standardvärde." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgstr "Fall 3: Källa och/eller mål hör till en vertex som har kontrakterats." -msgid "Parameters for the Via functions" -msgstr "Parametrar för Via-funktionerna" +msgid "``pgr_contractionDeadEnd`` - Proposed" +msgstr "``pgr_contractionDeadEnd`` - Förslag" -msgid "SQL query as described." -msgstr "SQL-fråga enligt beskrivning." +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionDeadEnd`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." -msgid "When ``true`` Graph is considered `Directed`" -msgstr "När en \"sann\" graf anses vara \"riktad" +msgid "A node is considered a dead end node when:" +msgstr "En nod anses vara en återvändsgrändsnod när:" -msgid "When ``false`` the graph is considered as Undirected." -msgstr "När ``false`` betraktas grafen som Undirected." +msgid "On undirected graphs:" +msgstr "Om odelade grafer:" -msgid "``strict``" -msgstr "``strict``" +msgid "The number of adjacent vertices is 1." +msgstr "Antalet angränsande hörn är 1." -msgid "``false``" -msgstr "``false``" +msgid "On directed graphs:" +msgstr "Om riktade grafer:" -msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" -msgstr "När ``true`` om en sökväg saknas stoppar och returnerar **EMPTY SET**" +msgid "When there is only one adjacent vertex or" +msgstr "När det bara finns en angränsande toppunkt eller" -msgid "When ``false`` ignores missing paths returning all paths found" -msgstr "När ``false`` ignorerar saknade sökvägar returneras alla sökvägar som hittats" +msgid "When all edges are incoming regardless of the number of adjacent vertices." +msgstr "När alla kanter är inkommande oavsett antalet angränsande toppar." -msgid "``U_turn_on_edge``" -msgstr "``U_turn_on_edge``" +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionDeadEnd(`Kanter SQL`_, [**options**])" -msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." -msgstr "När ``true`` avgår från ett besökt toppunkt kommer inte att försöka undvika att använda den kant som användes för att nå det. Med andra ord är det tillåtet att använda kanten med samma identifierare i U-svängen." +msgid "**options:** ``[directed, forbidden]``" +msgstr "**options:** ``[directed, forbidden]``" -msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." -msgstr "När ``false`` när en avgång från en besökt topp försöker undvika att använda den kant som användes för att nå den. Med andra ord, U-sväng med kanten med samma identifierare används när ingen annan väg hittas." +msgid "Dead end contraction on an undirected graph." +msgstr "Sammandragning av återvändsgränder i en odelad graf." -msgid "For the TRSP functions" -msgstr "För TRSP-funktionerna" +msgid "The green nodes are dead end nodes." +msgstr "De gröna noderna är återvändsgrändsnoder." -msgid "Array of identifiers of destination vertices." -msgstr "Array med identifierare för målpunkter." +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgstr "Noden :math:`3` är en återvändsgränd efter att noden :math:`1` har dragits in." -msgid "There are several kinds of columns returned are depending of the function." -msgstr "Det finns flera olika typer av kolonner som returneras beroende på funktion." +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` |ANY-INTEGER| ``]`` ``" -msgid "Result columns for single path functions" -msgstr "Resultatkolumner för funktioner med enkel sökväg" +msgid "**Empty**" +msgstr "**Empty**" -msgid "Used in functions that return one path solution per departure and destination." -msgstr "Används i funktioner som returnerar en lösning per avgång och destination." +msgid "Value = ``e`` indicating the row is an edge." +msgstr "Värde = ``e`` som anger att raden är en kant." -msgid ":doc:`pgr_dijkstraNear`" -msgstr ":doc:`pgr_dijkstraNear`" +msgid "A pseudo `id` of the edge." +msgstr "Ett pseudo \"id\" för kanten." -msgid "Returns |short-generic-result|" -msgstr "Returnerar |short-generic-result|" +msgid "Identifier of the source vertex of the current edge." +msgstr "Identifierar källvertexen för den aktuella kanten." -msgid "``path_seq``" -msgstr "``path_seq``" +msgid "Identifier of the target vertex of the current edge." +msgstr "Identifierare av målvertexen för den aktuella kanten." -msgid "Relative position in the path. Has value **1** for the beginning of a path." -msgstr "Relativ position i tågläget. Har värdet **1** för början av ett tågläge." +msgid "Weight of the current edge." +msgstr "Vikt för den aktuella kanten." -msgid "Identifier of the starting vertex of the current path." -msgstr "Identifierar startpunkten för den aktuella banan." +msgid "Dead end vertex on undirected graph" +msgstr "Dead end-knutpunkt på odelad graf" -msgid "Identifier of the ending vertex of the current path." -msgstr "Identifierare för den aktuella banans slutpunkt." +msgid "They have only one adjacent node." +msgstr "De har bara en angränsande nod." -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." -msgstr "Identifierare av noden i sökvägen från ``start_vid`` till ``slut_vid``." +msgid "Dead end vertex on directed graph" +msgstr "Dead end-knutpunkt på riktad graf" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." -msgstr "Identifierare av den kant som används för att gå från ``node`` till nästa nod i sökvägssekvensen. **-1** för den sista noden i sökvägen." +msgid "The green nodes are dead end nodes" +msgstr "De gröna noderna är återvändsgrändsnoder" -msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." -msgstr "Kostnad för att gå från ``nod`` med hjälp av ``edge`` till nästa nod i vägsekvensen." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgstr "De blå noderna har ett obegränsat antal inkommande och/eller utgående kanter." -msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." -msgstr "När kolumnerna ``start_vid`` eller ``end_vid`` har negativa värden är identifieraren för en Point." +msgid "Node" +msgstr "Nod" -msgid "Result columns for multiple paths functions" -msgstr "Resultatkolumner för funktioner med flera sökvägar" +msgid "Adjacent nodes" +msgstr "Angränsande noder" -msgid "Used in functions that return many paths solutions per departure and destination." -msgstr "Används i funktioner som returnerar många banlösningar per avgång och destination." +msgid "Dead end" +msgstr "Död återvändsgränd" -msgid ":doc:`pgr_KSP`" -msgstr ":doc:`pgr_KSP`" +msgid "Reason" +msgstr "Orsak" -msgid ":doc:`pgr_withPointsKSP`" -msgstr ":doc:`pgr_withPointsKSP`" +msgid ":math:`6`" +msgstr ":math:`6`" -msgid "Returns set of |generic-result|" -msgstr "Returnerar uppsättning av |generic-result|" +msgid ":math:`\\{1\\}`" +msgstr ":math:`\\{1\\}`" -msgid "``path_id``" -msgstr "``path_id``" +msgid "Yes" +msgstr "Ja" -msgid "Path identifier." -msgstr "Identifierare för sökväg." +msgid "Has only one adjacent node." +msgstr "Har endast en angränsande nod." -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." -msgstr "Har värdet **1** för den första i en sökväg från ``start_vid`` till ``slut_vid``." +msgid ":math:`7`" +msgstr ":math:`7`" -msgid "Result columns for cost functions" -msgstr "Resultatkolumner för kostnadsfunktioner" +msgid ":math:`\\{2\\}`" +msgstr ":math:`\\{2\\}`" -msgid "Used by:" -msgstr "Används av:" +msgid ":math:`8`" +msgstr ":math:`8`" -msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." -msgstr "När kolumnerna start_vid eller end_vid har negativa värden är identifieraren för en Point." +msgid ":math:`\\{2, 3\\}`" +msgstr ":math:`\\{2, 3\\}`" -msgid "Result columns for flow functions" -msgstr "Resultatkolumner för flödesfunktioner" +msgid "Has more than one adjacent node and all edges are incoming." +msgstr "Har mer än en angränsande nod och alla kanter är inkommande." -msgid "Result columns for spanning tree functions" -msgstr "Resultatkolumner för funktioner för spännträd" +msgid ":math:`\\{4\\}`" +msgstr ":math:`\\{4\\}`" -msgid "Used in functions that return a tree solution per departure." -msgstr "Används i funktioner som returnerar en trädlösning per avgång." +msgid ":math:`10`" +msgstr ":math:`10`" -msgid "Result columns for simple spanning tree functions" -msgstr "Resultatkolumner för funktioner för enkla spännträd" +msgid ":math:`\\{4, 5\\}`" +msgstr ":math:`\\{4, 5\\}`" -msgid "Returns set of ``(edge, cost)``" -msgstr "Returnerar uppsättning av ``(kant, kostnad)``" +msgid "No" +msgstr "Nej" -msgid "Cost to traverse the edge." -msgstr "Kostnad för att korsa kanten." +msgid "Has more than one adjacent node and all edges are outgoing." +msgstr "Har mer än en angränsande nod och alla kanter är utgående." -msgid "Performance Tips" -msgstr "Tips om prestanda" +msgid ":math:`1,2,3,4,5`" +msgstr ":math:`1,2,3,4,5`" -msgid "For the Routing functions" -msgstr "För Routing-funktionerna" +msgid "Many adjacent nodes." +msgstr "Många angränsande noder." -msgid "To get faster results bound the queries to an area of interest of routing." -msgstr "För att få snabbare resultat avgränsar du frågorna till ett intresseområde för routning." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." +msgstr "Har mer än en angränsande nod och vissa kanter är inkommande och vissa är utgående." -msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." -msgstr "I det här exemplet Använd en inre fråga SQL som inte innehåller några kanter i routningsfunktionen och som ligger inom resultatområdet." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgstr "Ovan är noderna :math:`\\{6, 7, 9\\}` återvändsgränder eftersom det totala antalet angränsande hörn är ett." -msgid "Given this area:" -msgstr "Med tanke på detta område:" +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." +msgstr "När det finns mer än ett angränsande toppunkt måste alla kanter vara alla inkommande kanter, annars är det inte en återvändsgränd." -msgid "Calculate a route:" -msgstr "Beräkna en rutt:" +msgid "Step by step dead end contraction" +msgstr "Steg för steg återvändsgränd sammandragning" -msgid "How to contribute" -msgstr "Hur du bidrar" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgstr "Sammandragningen av återvändsgränder kommer att upphöra tills det inte finns några fler återvändsgrändsnoder. Till exempel, från följande graf där :math:`3` är återvändsgränden:" -msgid "Wiki" -msgstr "Wiki" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgstr "Efter kontrakteringen av :math:`3` är noden :math:`2` nu en återvändsgränd och kontrakteras:" -msgid "Edit an existing `pgRouting Wiki `__ page." -msgstr "Redigera en befintlig sida i `pgRouting Wiki `__." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgstr "Efter att ha dragit in :math:`2`, sluta. Noden :math:`1` har information om de noder som kontrakterades." -msgid "Or create a new Wiki page" -msgstr "Eller skapa en ny Wiki-sida" +msgid "Creating the contracted graph" +msgstr "Skapa den kontraherade grafen" -msgid "Create a page on the `pgRouting Wiki `__" -msgstr "Skapa en sida på `pgRouting Wiki `__" +msgid "Steps for the creation of the contracted graph" +msgstr "Steg för att skapa den avtalade grafen" -msgid "Give the title an appropriate name" -msgstr "Ge titeln ett lämpligt namn" +msgid "Add additional columns." +msgstr "Lägg till ytterligare kolumner." -msgid "`Example `__" -msgstr "exempel `__" +msgid "Save results into a table." +msgstr "Spara resultaten i en tabell." -msgid "Adding Functionality to pgRouting" -msgstr "Lägga till funktionalitet i pgRouting" +msgid "The contracted vertices are not part of the contracted graph." +msgstr "De kontraherade topparna är inte en del av den kontraherade grafen." -msgid "Consult the `developer's documentation `__" -msgstr "Se dokumentationen för utvecklare `__" +msgid "Using when departure and destination are in the contracted graph" +msgstr "Används när avgång och destination ligger i den kontrakterade grafen" -msgid "Installation" -msgstr "Installation" +msgid "Using when departure/destination is not in the contracted graph" +msgstr "Används när avgång/destination inte finns i den avtalade grafen" -msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" -msgstr "Instruktioner för nedladdning och installation av binärfiler för olika operativsystem, ytterligare anmärkningar och korrigeringar som inte ingår i denna dokumentation finns i `Installation wiki `__" +msgid "Using when departure and destination are not in the contracted graph" +msgstr "Används när avgång och destination inte finns i den avtalade grafen" -msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" -msgstr "För att använda pgRouting måste PostGIS vara installerat, läs informationen om installation i denna installationsguide `__" +msgid "``pgr_contractionHierarchies`` - Experimental" +msgstr "``pgr_contractionHierarchies`` - Experimentell" -msgid "Short Version" -msgstr "Kort version" +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgstr "``pgr_contractionHierarchies`` - Utför grafkontraktion enligt metoden contraction hierarchies och returnerar de kontraherade topparna och de skapade genvägskanterna." -msgid "Extracting the tar ball" -msgstr "Extrahera tar-bollen" +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgstr "Contraction Hierarchies-metoden bygger, från en initial ordning av topparna, en hierarkisk ordning som prioriterar vissa toppar under bearbetningen av kortaste vägar-algoritmernas etikettfixering. Dessutom lägger algoritmen för sammandragningshierarkier till genvägskanter i grafen, vilket hjälper algoritmen för kortaste vägar att följa den skapade hierarkiska grafstrukturen." -msgid "To compile assuming you have all the dependencies in your search path:" -msgstr "För att kompilera förutsatt att du har alla beroenden i din sökväg:" +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgstr "Tanken med hierarkin är att ge hög prioritet åt toppar som tillhör det långväga nätet (t.ex. motorvägar i ett vägnät) och låg prioritet åt noder som tillhör det kortväga nätet (t.ex. artärer eller sekundära vägar i ett vägnät)." -msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." -msgstr "När pgRouting har installerats måste det aktiveras i varje enskild databas som du vill använda det i." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgstr "Algoritmen för sammandragningshierarkier förutsätter att det redan finns en värdefull nodordning som används för att initiera sammandragningsprocessen. Eftersom det i de flesta fall inte finns någon värdefull initial nodordning använder vi den ordning som ges av vertices ID. Sedan görs sammandragningsprocessen på grundval av denna första ordning för att ge den slutliga hierarkin." -msgid "Get the sources" -msgstr "Hämta källorna" +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgstr "Grundidén är att hålla topparna i en prioritetskö sorterade efter någon uppskattning av hur attraktiv deras sammandragning är. I det implementerade fallet används ett mått som kallas *edge difference*, vilket motsvarar skillnaden mellan antalet genvägar som produceras av en vertexkontraktion och antalet infallande kanter i grafen före kontraktionen (``#shortcuts - #incident edges``)." -msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" -msgstr "Den senaste versionen av pgRouting finns på https://github.com/pgRouting/pgrouting/releases/latest" +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgstr "Slutligen är målet att minska den utforskade delen av grafen när man använder en dubbelriktad Dijkstra-liknande algoritm. Topparnas ordning används för att mata den orienterade sökningen. Sökningen görs utan att förlora optimalitet." -msgid "To download this release:" -msgstr "För att ladda ner denna release:" +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgstr "Det är ett svårt problem att hitta en optimal ordning på topparna för sammandragning. Ändå fungerar mycket enkla lokala heuristiker ganska bra, enligt Geisberger et al [2]. Principen här är att på förhand uppskatta värdet på *kantskillnaden* och att dra ihop noden högst upp i kön endast om det nya värdet på metriken håller den kvar högst upp i kön. I annat fall återinsätts den i kön på sin rätta plats som motsvarar det nya metriska värdet." -msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." -msgstr "Gå till :ref:`install-short` för mer instruktioner om hur du extraherar tar ball och kompilerar pgRouting." +msgid "The process is done on graphs having only edges with positive costs." +msgstr "Processen görs på grafer som bara har kanter med positiva kostnader." -msgid "git" -msgstr "git" +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgstr "Det är nödvändigt att komma ihåg att det inte finns några borttagna toppar med denna funktion. I slutet behåller grafen alla toppar den hade, men har några extra kanter som motsvarar genvägar. De toppar som har dragits ihop för att bygga upp genvägskanterna behålls och ordnas hierarkiskt." -msgid "To download the repository" -msgstr "Så här laddar du ner arkivet" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgstr "När det gäller de andra kontraktionsmetoderna returneras inte hela den kontraherade grafen, utan endast förändringarna. De är här av två typer:" -msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." -msgstr "Gå till :ref:`install-short` för mer instruktioner om hur du kompilerar pgRouting (det finns ingen tarball inblandad när du laddar ner pgRouting-arkivet från GitHub)." +msgid "added shortcut edges, with negative identifiers;" +msgstr "lagt till genvägskanter, med negativa identifierare;" -msgid "Enabling and upgrading in the database" -msgstr "Aktivering och uppgradering i databasen" +msgid "contracted nodes with an order." +msgstr "kontrakterade noder med en order." -msgid "Enabling the database" -msgstr "Aktivering av databasen" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" +msgstr "Funktionen ``pgr_contractionHierarchies`` har följande signatur:" -msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." -msgstr "pgRouting är en PostgreSQL-förlängning och beror på PostGIS för att tillhandahålla funktioner till slutanvändaren. Nedanstående kod demonstrerar aktivering av PostGIS och pgRouting i databasen." +msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionHierarchies(`Kanter SQL`_, [**options**])" -msgid "Checking PostGIS and pgRouting version after enabling them in the database." -msgstr "Kontroll av PostGIS- och pgRouting-version efter att de har aktiverats i databasen." +msgid "Returns set of |result-contraction-hierarchies|" +msgstr "Returnerar uppsättning av |result-contraction-hierarchies|" -msgid "Upgrading the database" -msgstr "Uppgradering av databasen" +msgid "Contraction hierarchies optional parameters" +msgstr "Sammandragningshierarkier valfria parametrar" -msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" -msgstr "Använd följande kommando för att uppgradera pgRouting i databasen till version 4.1.0:" +msgid "True if the graph is directed, False otherwise." +msgstr "True om grafen är riktad, False annars." -msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" -msgstr "Mer information finns på https://www.postgresql.org/docs/current/sql-createextension.html" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" +msgstr "Funktionen returnerar många rader (en per toppunkt och en per skapad genvägskant). Kolumnerna i raderna är:" -msgid "Dependencies" -msgstr "Beroenden" +msgid "Type of the ``id``." +msgstr "Typ av ``id``." -msgid "Compilation Dependencies" -msgstr "Beroenden för kompilering" +msgid "Column ``id`` has a positive value" +msgstr "Kolumnen ``id`` har ett positivt värde" -msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" -msgstr "För att kunna kompilera pgRouting måste du se till att följande beroenden är uppfyllda:" +msgid "Column ``id`` has a negative value" +msgstr "Kolumnen ``id`` har ett negativt värde" -msgid "C and C++0x compilers" -msgstr "C- och C++0x-kompilatorer" +msgid "``metric``" +msgstr "``metric``" -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" -msgstr "Kompilering med Boost 1.56 upp till Boost 1.74 kräver C++-kompilator med standardstöd för C++03 eller C++11" +msgid "``vertex_order``" +msgstr "``vertex_order``" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" -msgstr "Kompilering med Boost 1.75 kräver C++-kompilator med stöd för C++14-standarden" +msgid "On an undirected graph" +msgstr "På en odelad graf" -msgid "Postgresql version >= 13" -msgstr "Postgresql-version >= 13" +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." +msgstr "Följande fråga visar de ursprungliga data som är involverade i sammandragningsoperationen på en oriktad graf." -msgid "The Boost Graph Library (BGL) >= 1.56.0" -msgstr "Boost Graph Library (BGL) >= 1.56.0" +msgid "building contraction hierarchies on the whole graph" +msgstr "bygga sammandragningshierarkier på hela grafen" -msgid "CMake >= 3.12" -msgstr "CMake >= 3.12" +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgstr "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som gjorts i grafen efter tillämpning av sammandragningsalgoritmen och ger den vertexordning som algoritmen bygger upp genom att ordna vertex enligt *edge difference*-metriken. Som en följd av detta finns alla toppar representerade i resultatet (utom naturligtvis förbjudna). Endast genvägar som byggts av algoritmen finns representerade i resultatet." -msgid "For user's documentation" -msgstr "För användardokumentation" +msgid "After computing the contraction hierarchies, an order is now given to the vertices," +msgstr "Efter att ha beräknat sammandragningshierarkierna ges nu en ordning till topparna," -msgid "Sphinx >= 4.0" -msgstr "Sphinx >= 4.0" +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgstr "för att kunna användas med en specifik Dijkstra-algoritm (implementering kommer i en framtida version), som snabbar upp sökningen." -msgid "For developer's documentation" -msgstr "För dokumentation för utvecklare" +msgid "We obtain the contracted graph above:" +msgstr "Vi får den kontraherade grafen ovan:" -msgid "Doxygen >= 1.7" -msgstr "Doxygen >= 1.7" +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." +msgstr "Vi kan utan överraskning se att de toppar som tillhör genvägarna har en tendens att ha en hög prioritetsnivå i den resulterande topparnas ordning." -msgid "For testing" -msgstr "För testning" +msgid "On an undirected graph with forbidden vertices" +msgstr "På en odelad graf med förbjudna toppar" -msgid "pgtap" -msgstr "pgtap" +msgid "building contraction with a set of forbidden vertices" +msgstr "bygga sammandragning med en uppsättning förbjudna toppar" -msgid "pg_prove" -msgstr "pg_prove" +msgid "Contraction process steps details" +msgstr "Detaljer för sammandragningsprocessens steg" -msgid "For using:" -msgstr "För användning:" +msgid "Shortcut building process" +msgstr "Genväg till byggprocessen" -msgid "PostGIS version >= 3.0.0" -msgstr "PostGIS version >= 3.0.0" +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgstr "En topp ``v`` dras samman genom att lägga till genvägar som ersätter tidigare vägar av formen ``(u, v, w)`` med en kant ``(u, w)``. Genvägen ``(u, w)`` behövs bara när ``(u, v, w)`` är den enda kortaste vägen mellan ``u`` och ``w``." -msgid "Example: Installing dependencies on linux" -msgstr "Exempel: Installera beroenden på Linux" +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgstr "När alla genvägar har lagts till för ett givet toppunkt ``v`` tas de infallande kanterna för ``v`` bort och ett nytt toppunkt dras samman med den återstående grafen." -msgid "Installing the compilation dependencies" -msgstr "Installera kompileringsberoendena" +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgstr "Förfarandet är destruktivt för grafen och en kopia görs för att kunna manipulera den igen som en helhet. Kontraktionsprocessen lägger till alla upptäckta genvägar till kantuppsättningen ``E`` och tilldelar en metrik till varje kontraherad vertex. Denna metrik ger det som kallas *kontraktionshierarkin*." -msgid "Build dependencies" -msgstr "Bygg beroenden" +msgid "Initialize the queue with a first vertices order" +msgstr "Initiera kön med en ordning för första toppar" -msgid "Optional dependencies" -msgstr "Valfria beroenden" +msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" +msgstr "För varje topp ``v`` i grafen byggs en sammandragning av ``v``:" -msgid "For documentation" -msgstr "För dokumentation" +msgid ":math:`v`" +msgstr ":math:`v`" -msgid "Configuring" -msgstr "Konfigurering" +msgid ":math:`\\{p, r, u\\}`" +msgstr ":math:`\\{p, r, u\\}`" -msgid "pgRouting uses the `cmake` system to do the configuration." -msgstr "pgRouting använder `cmake`-systemet för att göra konfigurationen." +msgid ":math:`p`" +msgstr ":math:`p`" -msgid "Configurable variables" -msgstr "Konfigurerbara variabler" +msgid ":math:`\\{u, v\\}`" +msgstr ":math:`\\{u, v\\}`" -msgid "To see the variables that can be configured" -msgstr "För att se vilka variabler som kan konfigureras" +msgid ":math:`u`" +msgstr ":math:`u`" -msgid "The build directory is different from the source directory" -msgstr "Byggkatalogen skiljer sig från källkatalogen" +msgid ":math:`\\{p, v, w\\}`" +msgstr ":math:`\\{p, v, w\\}`" -msgid "Configuring The Documentation" -msgstr "Konfigurera dokumentationen" +msgid ":math:`r`" +msgstr ":math:`r`" -msgid "User and developers documentation are not build if prerequisites are not found." -msgstr "Användar- och utvecklardokumentation byggs inte om förutsättningarna inte hittas." +msgid ":math:`\\{v, w\\}`" +msgstr ":math:`\\{v, w\\}`" -msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" -msgstr "Det mesta av arbetet med dokumentationen har lagts på HTML-filerna. Några variabler för att bygga dokumentation:" +msgid ":math:`w`" +msgstr ":math:`w`" -msgid "Variable" -msgstr "Variabel" +msgid ":math:`\\{r, u\\}`" +msgstr ":math:`\\{r, u\\}`" -msgid "Comment" -msgstr "Kommentar" +msgid "Adjacent edges are removed." +msgstr "Intilliggande kanter tas bort." -msgid "BUILD_HTML" -msgstr "BUILD_HTML" +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgstr "Genvägar byggs från föregångare till ``v`` till efterföljare till ``v`` om och endast om vägen genom ``v`` motsvarar den enda kortaste vägen mellan föregångaren och efterföljaren till ``v`` i grafen. Måttet *kantskillnad* antar här värdet -2." -msgid "BOOL=ON" -msgstr "BOOL=ON" +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgstr "Därefter kontraheras följande toppunkt. Processen fortsätter tills varje nod i grafen har dragits samman. I slutet finns det inte längre några kanter i grafen, som har förstörts av processen." -msgid "If ON, turn on/off building HTML for user's documentation" -msgstr "Om ON, aktivera/avaktivera HTML-skapande för användardokumentation" +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgstr "Denna första sammandragning ger en vertices-ordning, som ges genom att ordna dem i stigande ordning på metriken (kantskillnaden). En total vertices-ordning byggs upp. Om ``u < v``, så är ``u`` mindre viktig än ``v``. Algoritmen håller topparna i en kö i denna ordning." -msgid "BUILD_DOXY" -msgstr "BYGG_DOXY" +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." +msgstr "En hierarki kommer nu att konstrueras genom att åter kontrahera topparna i denna ordning." -msgid "If ON, turn on/off building HTML for developer's documentation" -msgstr "Om ON, aktivera/avaktivera HTML-skapande för utvecklarens dokumentation" +msgid "Build the final vertex order" +msgstr "Bygg den slutliga toppunktsordningen" -msgid "BUILD_LATEX" -msgstr "BUILD_LATEX" +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgstr "När den första ordern har byggts använder algoritmen den för att bläddra igenom grafen igen. För varje toppunkt som tas upp i kön simulerar algoritmen sammandragning och beräknar dess kantskillnad. Om det beräknade värdet är större än värdet för nästa toppunkt som ska dras ihop, lägger algoritmen tillbaka den i kön (heuristisk metod). I annat fall dras den in permanent." -msgid "BOOL=OFF" -msgstr "BOOL=OFF" +msgid "Add shortcuts to the initial graph" +msgstr "Lägga till genvägar till den initiala grafen" -msgid "If ON, turn on/off building PDF" -msgstr "Om ON, slå på/av byggnad PDF" +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgstr "I slutet tar algoritmen den ursprungliga grafen (före borttagning av kanter) och lägger till genvägskanterna till den. På så sätt får man en sammandragen graf, redo att användas med en specialiserad Dijkstra-algoritm, som tar hänsyn till nodernas ordning i hierarkin." -msgid "BUILD_MAN" -msgstr "BYGGHANDLARE" +msgid "Use the contraction" +msgstr "Använd sammandragning" -msgid "If ON, turn on/off building MAN pages" -msgstr "Om ON, aktivera/avaktivera byggnadens MAN-sidor" +msgid "Build the contraction" +msgstr "Bygg sammandragningen" -msgid "DOC_USE_BOOTSTRAP" -msgstr "DOC_ANVÄNDA_BOOTSTRAP" +msgid "Add shortcuts and hierarchy in the existing tables" +msgstr "Lägg till genvägar och hierarki i befintliga tabeller" -msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" -msgstr "Om PÅ, använd sphinx-bootstrap för HTML-sidor i användardokumentationen" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" +msgstr "Lägg till nya kolumner i tabellerna `vertices` och `edges` för att lagra resultaten:" -msgid "EN" -msgstr "EN" +msgid "Update and insert the results in the two tables." +msgstr "Uppdatera och infoga resultaten i de två tabellerna." -msgid "if OFF the English documentation will no be built" -msgstr "om OFF den engelska dokumentationen kommer inte att byggas" +msgid "Use a Dijkstra shortest path algorithm on it" +msgstr "Använd en Dijkstra-algoritm för kortaste vägen på den" -msgid "ES" -msgstr "ES" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgstr "Sedan kan du använda vilken Dijkstra-liknande algoritm som helst och vänta på den anpassade algoritmen som tar hänsyn till den uppbyggda toppunktshierarkin. Till exempel:" -msgid "if OFF the Spanish documentation will no be built" -msgstr "om OFF den spanska dokumentationen kommer inte att byggas" +msgid "``pgr_contractionLinear`` - Proposed" +msgstr "``pgr_contractionLinear`` - Föreslagen" -msgid "SV" -msgstr "SV" +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionLinear`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." -msgid "if OFF the Swedish documentation will no be built" -msgstr "om OFF kommer den svenska dokumentationen inte att byggas" +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionLinear(`Kanter SQL`_, [**options**])" -msgid "ZH_HANS" -msgstr "ZH_HANS" +msgid "Linear contraction on an undirected graph." +msgstr "Linjär sammandragning på en odelad graf." -msgid "if OFF the Chinese simplified documentation will no be built" -msgstr "om OFF den kinesiska förenklade dokumentationen kommer inte att byggas" +msgid "The green nodes are linear nodes and will not be part of the contracted graph." +msgstr "De gröna noderna är linjära noder och kommer inte att vara en del av den kontrakterade grafen." -msgid "Building" -msgstr "Byggnad" +msgid "All edges adjacent will not be part of the contracted graph." +msgstr "Alla angränsande kanter kommer inte att vara en del av den kontraherade grafen." -msgid "Using ``make`` to build the code and the documentation" -msgstr "Använda ``make`` för att bygga koden och dokumentationen" +msgid "The red lines will be new edges of the contracted graph." +msgstr "De röda linjerna kommer att vara nya kanter i den kontraherade grafen." -msgid "The following instructions start from ``path/to/pgrouting/build``" -msgstr "Följande instruktioner startar från ``stigen/till/pgrouting/build``" +msgid "**contraction Order**" +msgstr "**contraction Order**" -msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." -msgstr "Vi har testat på flera plattformar, För installation eller ominstallation behövs alla steg." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgstr "Antal gånger som sammandragningsoperationerna på ``contraction_order`` kommer att utföras." -msgid "Linux" -msgstr "Linux" +msgid "A node connects two (or more) `linear` edges when" +msgstr "En nod förbinder två (eller fler) `linjära` kanter när" -msgid "The following instructions start from ``path/to/pgrouting``" -msgstr "Följande instruktioner börjar från ``path/to/pgrouting``" +msgid "The number of adjacent vertices is 2." +msgstr "Antalet angränsande hörn är 2." -msgid "Testing" -msgstr "Testar" +msgid "In case of a directed graph, a node is considered a `linear` node when" +msgstr "I en riktad graf anses en nod vara en \"linjär\" nod när" -msgid "Currently there is no :code:`make test` and testing is done as follows" -msgstr "För närvarande finns det ingen :code:`make test` och testning görs på följande sätt" +msgid "Linearity is symmetrical." +msgstr "Linjäriteten är symmetrisk." -msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." -msgstr "pgRouting är en förlängning av `PostGIS `__ och `PostgreSQL `__ geospatial databas och lägger till routing och annan nätverksanalysfunktionalitet. En föregångare till pgRouting - pgDijkstra, skriven av Sylvain Pasche från `Camptocamp `__, utökades senare av Orkney och döptes om till pgRouting. Projektet stöds och underhålls nu av `Georepublic `__, `Paragon Corporation `__ och en bred användargrupp." +msgid "Linearity is not symmetrical" +msgstr "Linjäriteten är inte symmetrisk" -msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." -msgstr "pgRouting är en del av `OSGeo Community Projects `__ från `OSGeo Foundation `__ och ingår i `OSGeoLive `__." +msgid "Graph where linearity is not symmetrical." +msgstr "Graf där linjäriteten inte är symmetrisk." -msgid "Licensing" -msgstr "Licens" +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." +msgstr "När grafen bearbetas som en riktad graf är linjäriteten inte symmetrisk, och grafen kan därför inte dras ihop." -msgid "The following licenses can be found in pgRouting:" -msgstr "Följande licenser finns i pgRouting:" +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." +msgstr "När samma graf behandlas som en odelad graf är linjäriteten symmetrisk och grafen kan därför krympas." -msgid "**License**" -msgstr "**Licens**" +msgid "The three edges can be replaced by one undirected edge" +msgstr "De tre kanterna kan ersättas med en ostyrd kant" -msgid "GNU General Public License v2.0 or later" -msgstr "GNU General Public License v2.0 eller senare" +msgid "Edge :math:`1 - 3`." +msgstr "Kant :math:`1 - 3`." -msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." -msgstr "De flesta funktioner i pgRouting är tillgängliga under `GNU General Public License v2.0 eller senare `_." +msgid "With cost: :math:`4`." +msgstr "Med kostnad: :math:`4`." -msgid "Boost Software License - Version 1.0" -msgstr "Licens för Boost-programvara - Version 1.0" +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgstr "Sammandragna hörn i kanten: :math:`\\{2\\}`." -msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." -msgstr "Vissa Boost-tillägg är tillgängliga under `Boost Software License - Version 1.0 `_." +msgid "Linearity is symmetrical" +msgstr "Linjäriteten är symmetrisk" -msgid "MIT-X License" -msgstr "MIT-X-licens" +msgid "Graph where linearity is symmetrical." +msgstr "Graf där linjäriteten är symmetrisk." -msgid "Some code contributed by iMaptools.com is available under MIT-X license." -msgstr "Viss kod som tillhandahålls av iMaptools.com är tillgänglig under MIT-X-licens." +msgid "The four edges can be replaced by two directed edges." +msgstr "De fyra kanterna kan ersättas av två riktade kanter." -msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." -msgstr "Manualen för pgRouting är licensierad under en `Creative Commons Attribution-Share Alike 3.0 License `_." +msgid "Edge :math:`3 - 1`." +msgstr "Kant :math:`3 - 1`." -msgid "In general license information should be included in the header of each source file." -msgstr "I allmänhet bör licensinformation inkluderas i sidhuvudet för varje källfil." +msgid "With cost: :math:`6`." +msgstr "Med kostnad: :math:`6`." -msgid "Contributors" -msgstr "Medverkande" +msgid "The four edges can be replaced by one undirected edge." +msgstr "De fyra kanterna kan ersättas med en ostyrd kant." -msgid "This Release Contributors" -msgstr "Medverkande i denna utgåva" +msgid "Step by step linear contraction" +msgstr "Steg för steg linjär sammandragning" -msgid "Individuals in this release v4.0.0 (in alphabetical order)" -msgstr "Personer i denna utgåva v4.0.0 (i alfabetisk ordning)" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgstr "Den linjära sammandragningen upphör när det inte längre finns några linjära kanter. Till exempel från följande graf finns det linjära kanter" -msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" -msgstr "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" +msgid "Contracting vertex :math:`3`," +msgstr "Contracting vertex :math:`3`," -msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgstr "Och alla de människor som ger oss lite av sin tid genom att kommentera, hitta problem, göra pull requests etc. i någon av våra produkter: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgid "The vertex :math:`3` is removed from the graph" +msgstr "Toppunkten :math:`3` tas bort från grafen" -msgid "Translators (in alphabetical order)" -msgstr "Översättare (i alfabetisk ordning)" +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "Kanterna :math:`2 \\rightarrow 3` och :math:`w \\rightarrow z` tas bort från grafen." -msgid "Chinese:" -msgstr "Kinesiska:" +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgstr "En ny kant :math:`2 \\rightarrow 4` infogas representerad med röd färg." -msgid "Dapeng Wang" -msgstr "Dapeng Wang" +msgid "Contracting vertex :math:`2`:" +msgstr "Kontraherande vertex :math:`2`:" -msgid "Spanish:" -msgstr "Spanska:" +msgid "The vertex :math:`2` is removed from the graph" +msgstr "Toppunkten :math:`2` tas bort från grafen" -msgid "Vicky Vergara" -msgstr "Vicky Vergara" +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgstr "Kanterna :math:`1 \\rightarrow 2` och :math:`2 \\rightarrow 3` tas bort från grafen." -msgid "Swedish:" -msgstr "Svenska:" +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgstr "En ny kant :math:`1 \\rightarrow 3` infogas representerad med röd färg." -msgid "Daniel Nylander" -msgstr "Daniel Nylander" +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." +msgstr "Edge :math:`1 \\rightarrow 3` har information om kostnad och de noder som kontrakterades." -msgid "Corporate Sponsors in this release (in alphabetical order)" -msgstr "Företagssponsorer i denna utgåva (i alfabetisk ordning)" +msgid "Create the contracted graph." +msgstr "Skapa den kontraherade grafen." -msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" -msgstr "Dessa är företagsenheter som har bidragit med utvecklingstid, hosting eller direkt monetär finansiering till pgRouting-projektet:" +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "``pgr_cuthillMckeeOrdering`` - Experimentell" -msgid "`OSGeo `__" -msgstr "`OSGeo `__" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf" -msgid "`OSGeo UK `__" -msgstr "oSGeo Storbritannien `__" +msgid "Version 3.4.0" +msgstr "Version 3.4.0" -msgid "`Google Summer of Code `__" -msgstr "googles sommarprogram för kodning `__" +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgstr "Inom numerisk linjär algebra är Cuthill-McKee-algoritmen (CM), uppkallad efter Elizabeth Cuthill och James McKee, en algoritm för att permutera en gles matris som har ett symmetriskt gleshetsmönster till en bandmatrisform med liten bandbredd." -msgid "`HighGo Software `__" -msgstr "`HighGo-programvara `__" +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgstr "Topparna tilldelas i princip en bredd-första sökordning, förutom att de intilliggande topparna i varje steg placeras i kön i stigande grad." -msgid "`Paragon Corporation `__" -msgstr "`Paragon Corporation `__" +msgid "The implementation is for **undirected** graphs." +msgstr "Implementationen är för **undirected** grafer." -msgid "Contributors Past & Present:" -msgstr "Tidigare och nuvarande bidragsgivare:" +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "Problemen med att minimera bandbredden anses vara NP-kompletta problem." -msgid "Individuals (in alphabetical order)" -msgstr "Enskilda personer (i alfabetisk ordning)" +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "Körtidskomplexiteten är: :math:`O(m log(m)|V|)`" -msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "where :math:`|V|` is the number of vertices," +msgstr "där :math:`|V|` är antalet toppar," -msgid "Corporate Sponsors (in alphabetical order)" -msgstr "Företagssponsorer (i alfabetisk ordning)" +msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgstr ":math:`m` is the maximum degree of the vertices in the graph." -msgid "Camptocamp" -msgstr "Camptocamp" +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "pgr_cuthillMckeeOrdering(`Kanter SQL`_)" -msgid "CSIS (University of Tokyo)" -msgstr "CSIS (Universitetet i Tokyo)" +msgid "Returns set of |result_node_order|" +msgstr "Returnerar uppsättning av |result_node_order|" -msgid "Georepublic" -msgstr "Georepublik" +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "Grafisk ordning av pgRouting :doc:`sampledata`" -msgid "Google Summer of Code" -msgstr "Google Summer of Code" +msgid "Returns set of ``(seq, node)``" +msgstr "Returnerar uppsättning av ``(seq, node)``" -msgid "HighGo Software" -msgstr "HighGo programvara" +msgid "Sequence of the order starting from 1." +msgstr "Ordningsföljd med början från 1." -msgid "iMaptools" -msgstr "iMaptools" +msgid "New ordering in reverse order." +msgstr "Ny beställning i omvänd ordning." -msgid "Leopark" -msgstr "Leopark" +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Cuthill-McKee Beställning `__" -msgid "Orkney" -msgstr "Orkney" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Cuthill-McKee-ordning `__" -msgid "OSGeo" -msgstr "OSGeo" +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimentell" -msgid "OSGeo UK" -msgstr "OSGeo Storbritannien" +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgstr "``pgr_dagShortestPath`` - Returnerar den kortaste vägen för viktade riktade acykliska grafer (DAG). I synnerhet är DAG-algoritmen för kortaste vägar implementerad av Boost.Graph." -msgid "Paragon Corporation" -msgstr "Paragon Corporation" +msgid "pgr_dagShortestPath(Combinations)" +msgstr "pgr_dagShortestPath(Combinations)" -msgid "Versaterm Inc." -msgstr "Versaterm Inc." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgstr "Shortest Path for Directed Acyclic Graph(DAG) är en grafsökningsalgoritm som löser problemet med kortaste vägen för viktad riktad acyklisk graf, vilket ger en kortaste väg från ett startvertex (``start_vid``) till ett slutvertex (``end_vid``)." -msgid "More Information" -msgstr "Mer information" +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgstr "Denna implementation kan endast användas med en **riktad** graf utan cykler, dvs. en riktad acyklisk graf." -msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." -msgstr "Den senaste programvaran, dokumentationen och nyheter finns tillgängliga på pgRoutings webbplats https://pgrouting.org." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgstr "Algoritmen förlitar sig på topologisk sortering av DAG för att införa en linjär ordning på topparna och är därmed effektivare för DAG än både Dijkstra- och Bellman-Ford-algoritmen." -msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." -msgstr "PostgreSQL-databasserver på PostgreSQL-huvudwebbplatsen https://www.postgresql.org." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgstr "Processen är endast giltig för viktade riktade acykliska grafer. annars kommer den att ge varningar." -msgid "PostGIS extension at the PostGIS project web site https://postgis.net." -msgstr "PostGIS-tillägg på PostGIS-projektets webbplats https://postgis.net." +msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgstr "Den `agg_cost` de icke inkluderade värdena `(v, v)` är `0`" -msgid "Boost C++ source libraries at https://www.boost.org." -msgstr "Boost C++-källbibliotek på https://www.boost.org." +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgstr "Den `agg_cost` de icke inkluderade värdena `(u, v)` är :math:`\\infty`" -msgid ":doc:`migration`" -msgstr ":doc:`migration`" +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "Drifttid: :math:`O(| start\\_vids | * (V + E))`" -msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "``pgr_KSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra." +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vid**)" -msgid "Availability" -msgstr "Tillgänglighet" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vids**)" -msgid "Version 4.0.0" -msgstr "Version 4.0.0" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vid**)" -msgid "Version 3.6.0" -msgstr "Version 3.6.0" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vids**)" -msgid "Standardizing output columns to |nksp-result|" -msgstr "Standardisering av utdatakolumner till |nksp-result|" +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, `Combinations SQL`_)" -msgid "pgr_ksp(One to One)" -msgstr "pgr_ksp(One to One)" +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgstr "Från toppunkten :math:`5` till toppunkten :math:`11` på en **riktad** graf" -msgid "Added ``start_vid`` and ``end_vid`` result columns." -msgstr "Lagt till resultatkolumnerna ``start_vid`` och ``end_vid``." +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "Från toppunkten :math:`5` till toppunkterna :math:`{7, 11\\}`" -msgid "New proposed signatures:" -msgstr "Nya föreslagna signaturer:" +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgstr "Från topparna :math:`\\{5, 10\\}` till topp :math:`11`" -msgid "pgr_ksp(One to Many)" -msgstr "pgr_ksp(One to Many)" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "Från topparna :math:`\\{5, 15\\}` till topparna :math:`\\{11, 17\\}` i en **omdirigerad** graf" -msgid "pgr_ksp(Many to One)" -msgstr "pgr_ksp(Many to One)" +msgid "Return columns" +msgstr "Returnera kolumner" -msgid "pgr_ksp(Many to Many)" -msgstr "pgr_ksp(Many to Many)" +msgid "Making **start_vids** the same as **end_vids**" +msgstr "Gör **start_vids** till samma sak som **end_vids**" -msgid "pgr_ksp(Combinations)" -msgstr "pgr_ksp(Combinations)" +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: DAG kortaste vägar `__" -msgid "Version 2.1.0" -msgstr "Version 2.1.0" +msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgstr "https://en.wikipedia.org/wiki/Topological_sorting" -msgid "Signature change" -msgstr "Ändring av signatur" +msgid "``pgr_degree``" +msgstr "``pgr_degree``" -msgid "Old signature no longer supported" -msgstr "Gammal signatur stöds inte längre" +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgstr "``pgr_degree`` - För varje toppunkt i en odelad graf, returnera antalet kanter som är kopplade till toppunktet." -msgid "Version 2.0.0" -msgstr "Version 2.0.0" +msgid "Error messages adjustment." +msgstr "Justering av felmeddelanden." -msgid "Official function." -msgstr "Officiell funktion." +msgid "New signature with only Edges SQL." +msgstr "Ny signatur med endast Edges SQL." -msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." -msgstr "Algoritmen K för kortaste vägen baseras på Yens algoritm. \"K\" är antalet önskade kortaste vägar." +msgid "Calculates the degree of the vertices of an undirected graph" +msgstr "Beräknar graden för topparna i en odelad graf" -msgid "|Boost| Boost Graph Inside" -msgstr "|Boost| Boost-graf inuti" +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgstr "Graden (eller valensen) för ett toppunkt i en graf är antalet kanter som är angränsande till toppunktet." -msgid "Boost Graph inside" -msgstr "Öka grafen inuti" +msgid "A loop contributes 2 to a vertex's degree." +msgstr "En loop bidrar med 2 till en topps grad." -msgid "Signatures" -msgstr "Underskrifter" +msgid "A vertex with degree 0 is called an isolated vertex." +msgstr "Ett toppunkt med grad 0 kallas ett isolerat toppunkt." -msgid "Summary" -msgstr "Sammanfattning" +msgid "Isolated vertex is not part of the result" +msgstr "Isolerad toppunkt är inte en del av resultatet" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgstr "Vertex som inte deltar i undergrafen betraktas som en isolerad vertex." -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgstr "Det kan finnas en ``dryrun`` exekvering och koden som används för att få svaret kommer att visas i en PostgreSQL ``NOTICE``." -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "The code can be used as base code for the particular application requirements." +msgstr "Koden kan användas som baskod för de specifika applikationskraven." -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "No ordering is performed." +msgstr "Ingen beställning utförs." -msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgstr "pgr_KSP(`Kanter SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgstr "pgr_degree(`Kanter SQL`_ , [``dryrun``])" -msgid "**options:** ``[directed, heap_paths]``" -msgstr "**options:** ``[directed, heap_paths]``" +msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgstr "pgr_degree(`Kanter SQL`_ , `Vertex SQL`_, [``dryrun``])" -msgid "Returns set of |nksp-result|" -msgstr "Returnerar uppsättning av |nksp-result|" +msgid "RETURNS SETOF |result-degree|" +msgstr "RETURNERAR SETOF |result-degree|" -msgid "OR EMPTY SET" -msgstr "ELLER TOM UPPSÄTTNING" +msgid "Edges" +msgstr "Kanter" -msgid "Example" -msgstr "Exempel" +msgid "example" +msgstr "exempel" -msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." -msgstr "Hämta 2 vägar från :math:`6` till :math:`17` på en riktad graf." +msgid "Get the degree of the vertices defined on the edges table" +msgstr "Hämta graden för de toppar som definieras i tabellen edges" -msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." -msgstr "Hämta 2 vägar från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf." +msgid "Edges and Vertices" +msgstr "Kanter och toppar" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." -msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en riktad graf." +msgid "Extracting the vertex information" +msgstr "Extrahera information om toppunkt" -msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." -msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till topparna :math:`\\{10, 17\\}` i en riktad graf." +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgstr "``pgr_degree`` kan använda :doc:`pgr_extractVertices` inbäddad i anropet." -msgid "Using a combinations table on an directed graph" -msgstr "Använda en kombinationstabell på en riktad graf" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgstr "För nätverk av anständig storlek är det bäst att förbereda vertex-tabellen i förväg och använda den vid anrop av ``pgr_degree``. (Se `Användning av en vertex-tabell`_)" -msgid "The combinations table:" -msgstr "Kombinationsbordet:" +msgid "Calculate the degree of the nodes:" +msgstr "Beräkna nodernas grad:" -msgid "The query:" -msgstr "Frågeställningen:" +msgid "`Vertex SQL`_" +msgstr "`Vertex SQL`_" -msgid "Identifier of the destination vertex." -msgstr "Identifierare för målvertexen." +msgid "`Vertex SQL`_ as described below" +msgstr "`Vertex SQL`_ enligt beskrivningen nedan" -msgid "**K**" -msgstr "**K**" +msgid "``dryrun``" +msgstr "``dryrun``" -msgid "Number of required paths." -msgstr "Antal nödvändiga sökvägar." +msgid "When true do not process and get in a NOTICE the resulting query." +msgstr "När det är sant bearbeta inte och få i ett NÄRVARO den resulterande frågan." -msgid "KSP Optional parameters" -msgstr "KSP Valfria parametrar" +msgid "For the `Edges and Vertices`_ signature:" +msgstr "För signaturen `Edges and Vertices`_:" -msgid "``heap_paths``" -msgstr "``heap_paths``" +msgid "For the `Edges`_ signature:" +msgstr "För signaturen `Edges`_:" -msgid "When ``false`` Returns at most K paths." -msgstr "När ``false`` Returnerar högst K sökvägar." +msgid "Vertex SQL" +msgstr "Vertex SQL" -msgid "When ``true`` all the calculated paths while processing are returned." -msgstr "När ``true`` returneras alla beräknade banor under bearbetningen." +msgid "``in_edges``" +msgstr "``in_edges``" -msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." -msgstr "Grovt sett, när den kortaste vägen har ``N`` kanter, kommer högen att innehålla ungefär än ``N * K`` vägar för litet värde av ``K`` och ``K > 5``." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *första slutpunkt*." -msgid "Additional Examples" -msgstr "Ytterligare exempel" +msgid "When missing, ``out_edges`` must exist." +msgstr "När den saknas måste ``out_edges`` finnas." -msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" -msgstr "Hämta 2 vägar från :math:`6` till :math:`17` på en odelad graf" +msgid "``out_edges``" +msgstr "``out_edges``" -msgid "Also get the paths in the heap." -msgstr "Hämta även sökvägarna i högen." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *andra slutpunkt*." -msgid "Get 2 paths using combinations table on an undirected graph" -msgstr "Få 2 vägar med hjälp av kombinationstabell på en oriktad graf" +msgid "When missing, ``in_edges`` must exist." +msgstr "När den saknas måste ``in_edges`` finnas." -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." -msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en odelad graf." +msgid "Vertex identifier" +msgstr "Identifierare för toppunkt" -msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgid "``degree``" +msgstr "``degree``" -msgid "``pgr_TSP``" -msgstr "``pgr_TSP``" +msgid "Number of edges that are incident to the vertex ``id``" +msgstr "Antal kanter som är angränsande till toppunkten ``id``" -msgid "``pgr_TSP`` - Approximation using *metric* algorithm." -msgstr "``pgr_TSP`` - Approximation med hjälp av *metrisk* algoritm." +msgid "Degree of a loop" +msgstr "Grad av en slinga" -msgid "Availability:" -msgstr "Tillgänglighet:" +msgid "Using the `Edges`_ signature." +msgstr "Använda signaturen `Edges`_." -msgid "Version 3.2.1" -msgstr "Version 3.2.1" +msgid "Using the `Edges and Vertices`_ signature." +msgstr "Använda signaturen `Edges and Vertices`_." -msgid "Metric Algorithm from `Boost library `__" -msgstr "Metrisk algoritm från `Boost-biblioteket `__" +msgid "Degree of a sub graph" +msgstr "Grad av en undergraf" -msgid "Simulated Annealing Algorithm no longer supported" -msgstr "Simulated Annealing Algorithm stöds inte längre" +msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgstr "För följande är en delgraf av :doc:`sampledata`:" -msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgstr "Parametrar relaterade till Simulated Annealing Algorithm ignoreras: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" -msgid "Version 2.3.0" -msgstr "Version 2.3.0" +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgstr ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" -msgid "Results change depending on input order of the `Matrix SQL`_" -msgstr "Resultaten ändras beroende på inmatningsordningen för `Matrix SQL`_" +msgid "The vertices not participating on the edge are considered isolated" +msgstr "De hörn som inte deltar i kanten betraktas som isolerade" -msgid "Negative costs are ignored." -msgstr "Negativa kostnader ignoreras." +msgid "their degree is 0 in the subgraph and" +msgstr "deras grad är 0 i undergrafen och" -msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." -msgstr "Kan användas med :doc:`costMatrix-category` funktioner helst med `directed => false`." +msgid "their degree is not shown in the output." +msgstr "deras examen visas inte i utdata." -msgid "With ``directed => false``" -msgstr "Med ``riktad => falsk``" +msgid "Using a vertex table" +msgstr "Använda en toppunktstabell" -msgid "Will generate a graph that:" -msgstr "Kommer att generera en graf som:" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgstr "För nätverk av anständig storlek är det bäst att förbereda vertices-tabellen i förväg och använda den vid anrop av ``pgr_degree``." -msgid "is undirected" -msgstr "är ostyrd" +msgid "Extract the vertex information and save into a table:" +msgstr "Extrahera toppunktsinformationen och spara i en tabell:" -msgid "is fully connected (As long as the graph has one component)" -msgstr "är helt sammanhängande (så länge grafen har en komponent)" +msgid "Dry run execution" +msgstr "Utförande av provkörning" -msgid "all traveling costs on edges obey the triangle inequality." -msgstr "alla resekostnader på kanter följer triangelolikheten." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgstr "Använd ``dryrun => true`` för att få den fråga som genereras för att få fram toppunktsinformationen." -msgid "When ``start_vid = 0 OR end_vid = 0``" -msgstr "När ``start_vid = 0 OR end_vid = 0``" +msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgstr "Resultaten kan användas som baskod för att göra en förfining baserad på behoven för backend-utvecklingen." -msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" -msgstr "De lösningar som genereras är garanterat * dubbelt så långa som den optimala turen i värsta fall*" +msgid "Finding dead ends" +msgstr "Att hitta återvändsgränder" -msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgstr "När ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgstr "Om det redan finns en toppunktstabell som byggts med hjälp av ``pgr_extractVertices`` och man vill ha graden för hela grafen i stället för en delmängd, kan man avstå från att använda ``pgr_degree`` och arbeta med kolumnerna ``in_edges`` och ``out_edges`` direkt." -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." -msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen, eftersom `end_vid` tvingas vara i en fast position." +msgid "The degree of a dead end is 1." +msgstr "Graden av en återvändsgränd är 1." -msgid "With ``directed => true``" -msgstr "Med ``riktad => sann``" +msgid "Finding linear vertices" +msgstr "Hitta linjära hörn" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" -msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen" +msgid "The degree of a linear vertex is 2." +msgstr "Graden för ett linjärt toppunkt är 2." -msgid "is directed" -msgstr "är riktad" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "Om det redan finns en toppunktstabell som byggts upp med hjälp av ``pgr_extractVertices``" -msgid "some (or all) traveling costs on edges might not obey the triangle inequality." -msgstr "vissa (eller alla) resekostnader på kanter kanske inte följer triangelolikheten." +msgid ":doc:`pgr_extractVertices`" +msgstr ":doc:`pgr_extractVertices`" -msgid "As an undirected graph is required, the directed graph is transformed as follows:" -msgstr "Eftersom det krävs en oriktad graf, omvandlas den riktade grafen enligt följande:" +msgid "``pgr_depthFirstSearch`` - Proposed" +msgstr "``pgr_depthFirstSearch`` - Föreslagen" -msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" -msgstr "kanterna `(u, v)` och `(v, u)` anses vara samma kant (betecknas `(u, v)`)" +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "``pgr_depthFirstSearch`` - Returnerar en genomgång av grafen med första sökdjupet. Grafen kan vara riktad eller oriktad." -msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" -msgstr "om ``agg_cost`` skiljer sig mellan en eller flera instanser av kant `(u, v)``" +msgid "Version 3.3.0" +msgstr "Version 3.3.0" -msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" -msgstr "Det lägsta värdet av ``agg_cost`` för alla instanser av kanten `(u, v)`` kommer att betraktas som ``agg_cost`` för kanten `(u, v)``" +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "Depth First Search-algoritmen är en traverseringsalgoritm som startar från en rotvertex, går så djupt som möjligt och backar när en vertex nås utan några intilliggande vertex eller med alla besökta intilliggande vertex. Traversieringen fortsätter tills alla toppar som kan nås från rotvertexen har besökts." -msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." -msgstr "Vissa (eller alla) resekostnader på kanter kommer kanske ändå inte att följa triangelolikheten." +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "Implementationen fungerar för både **directed** och **undirected** grafer." -msgid "When the data does not come from an undirected graph or its not fully connected:" -msgstr "När data inte kommer från en odelad graf eller om den inte är helt sammanhängande:" +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgstr "Ger traversieringsordningen Depth First Search från en rotvertex eller från en uppsättning rotvertex." -msgid "Missing values will be calculated with dijkstra algorithm." -msgstr "Saknade värden kommer att beräknas med dijkstra-algoritmen." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgstr "En valfri icke-negativ parameter för maximalt djup för att begränsa resultaten till ett visst djup." -msgid "When the graph has more than one component:" -msgstr "När grafen har mer än en komponent:" +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `Root vids`." -msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." -msgstr "``start_vid`` eller ``slut_vid`` är definierade och finns på samma komponent: TSP-turen kommer att äga rum på den komponenten." +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "Den producerar inte den kortaste vägen från en rotvertex till en målvertex." -msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." -msgstr "``start_vid`` eller ``slut_vid`` definieras och inte finns på samma komponent: TSP-turen kommer att föreslå en tur som har båda komponenterna där anslutningskostnaderna beräknas." +msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgstr "Det är inte säkert att den sammanlagda kostnaden för traverseringen är minimal." -msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." -msgstr "``start_vid`` eller ``end_vid`` är inte definierade: startpunkten kan vara på vilken komponent som helst och kommer endast att innehålla data från den komponenten." +msgid "The returned values are ordered in ascending order of `start_vid`." +msgstr "De returnerade värdena är ordnade i stigande ordning efter `start_vid`." -msgid "One cycle attempt to remove crossing edges is done to the TSP results." -msgstr "Ett cykelförsök för att ta bort korsande kanter görs på TSP-resultaten." +msgid "Depth First Search Running time: :math:`O(E + V)`" +msgstr "Djup Första sökning Löptid: :math:`O(E + V)`" -msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_depthFirstSearch(`Kanter SQL`_, **root vid**, [**options**])" -msgid "Returns set of |tsp-result|" -msgstr "Returnerar uppsättning av |tsp-result|" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_depthFirstSearch(`Kanter SQL`_, **root vids**, [**options**])" -msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" -msgstr "Använd :doc:`pgr_dijkstraCostMatrix` för att generera matrisinformationen" +msgid "**options:** ``[directed, max_depth]``" +msgstr "**options:** ``[directed, max_depth]``" -msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." -msgstr "**Linje 4** Punkterna :math:`{\\{2, 4, 13, 14\\\\}` är inte inkluderade eftersom de inte är anslutna." +msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgstr "Samma som `Single vertex`_ men med kanter i fallande ordning efter ``id``." -msgid "`Matrix SQL`_ as described below" -msgstr "`Matrix SQL`_ enligt beskrivningen nedan" +msgid "`Boost: Depth First Search `__" +msgstr "`Boost: Djup första sökning `__" -msgid "``ANY-INTEGER``" -msgstr "``ANY-INTEGER``" +msgid "`Boost: Undirected DFS `__" +msgstr "`Boost: Oriktad DFS `__" -msgid "``ANY-NUMERICAL``" -msgstr "``ANY-NUMERICAL``" +msgid "`Wikipedia: Depth First Search algorithm `__" +msgstr "`Wikipedia: Djup först-sökalgoritm `__" -msgid "Cost for going from start_vid to end_vid" -msgstr "Kostnad för att gå från start_vid till slut_vid" +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgstr "``pgr_dijkstra`` - Kortaste vägen med Dijkstra-algoritmen." -msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" -msgstr "Returnerar SET OF ``(seq, nod, kostnad, agg_cost)``" +msgid "Version 3.5.0" +msgstr "Version 3.5.0" -msgid "Row sequence." -msgstr "Radsekvens." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." -msgid "**node**" -msgstr "**node**" +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgstr "pgr_dijkstra(One to Many) added ``end_vid`` column." -msgid "Identifier of the node/coordinate/point." -msgstr "Identifierare av nod/koordinat/punkt." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgstr "pgr_dijkstra(Many to One) added ``start_vid`` column." -msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." -msgstr "Kostnad för att gå från aktuell ``nod`` till nästa ``nod`` i sökvägssekvensen." +msgid "Version 3.1.0" +msgstr "Version 3.1.0" -msgid "``0`` for the last row in the tour sequence." -msgstr "``0`` för den sista raden i turordningssekvensen." +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(Combinations)" -msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." -msgstr "Sammanlagd kostnad från ``noden`` vid ``seq = 1`` till den aktuella noden." +msgid "Version 2.2.0" +msgstr "Version 2.2.0" -msgid "``0`` for the first row in the tour sequence." -msgstr "``0`` för den första raden i turordningen." +msgid "pgr_dijkstra(One to Many)" +msgstr "pgr_dijkstra(One to Many)" -msgid "Start from vertex :math:`1`" -msgstr "Start från toppunkten :math:`1`" +msgid "pgr_dijkstra(Many to One)" +msgstr "pgr_dijkstra(Many to One)" -msgid "**Line 6** ``start_vid => 1``" -msgstr "**Linje 6** ``start_vid => 1``" +msgid "pgr_dijkstra(Many to Many)" +msgstr "pgr_dijkstra(Many to Many)" -msgid "Using points of interest to generate an asymmetric matrix." -msgstr "Använda intressepunkter för att generera en asymmetrisk matris." +msgid "Signature change on pgr_dijkstra(One to One)" +msgstr "Ändring av signatur på pgr_dijkstra(One to One)" -msgid "To generate an asymmetric matrix:" -msgstr "För att generera en asymmetrisk matris:" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" -msgstr "**Linje 4** Informationen om ``sidan`` av ``pointsOfInterset`` ignoreras genom att inte inkludera den i frågan" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" -msgstr "**Linje 6** Generering av en asymmetrisk matris med ``directed => true``" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" -msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_dijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid "The solution that can be larger than *twice as long as the optimal tour* because:" -msgstr "Lösningen som kan vara större än *dubbelt så lång som den optimala turen* eftersom:" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` på en **riktad**" -msgid "Triangle inequality might not be satisfied." -msgstr "Triangelns ojämlikhet kanske inte uppfylls." +msgid "The examples of this section are based on the :doc:`sampledata` network." +msgstr "Exemplen i detta avsnitt är baserade på :doc:`sampledata`-nätverket." -msgid "``start_id != 0 AND end_id != 0``" -msgstr "``start_id != 0 AND end_id != 0``" +msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" +msgstr "För **riktade** grafer med kolumnerna ``kostnad`` och ``omvända_kostnader``" -msgid "Connected incomplete data" -msgstr "Anslutna ofullständiga data" +msgid "Directed graph with cost and reverse cost columns" +msgstr "Riktad graf med kolumner för kostnad och omvänd kostnad" -msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." -msgstr "Med hjälp av valda kanter :math:`\\{2, 4, 5, 8, 9, 15\\}` är matrisen inte komplett." +msgid "1) Path from :math:`6` to :math:`10`" +msgstr "1) Väg från :math:`6` till :math:`10`" -msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." -msgstr "Kostnadsvärdet för :math:`17 \\rightarrow 10` finns inte i matrisen, men det värde som används hämtas från :math:`10 \\rightarrow 17`." +msgid "2) Path from :math:`6` to :math:`7`" +msgstr "2) Väg från :math:`6` till :math:`7`" -msgid "``pgr_TSPeuclidean``" -msgstr "``pgr_TSPeuclidean``" +msgid "3) Path from :math:`12` to :math:`10`" +msgstr "3) Väg från :math:`12` till :math:`10`" -msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." -msgstr "``pgr_TSPeuclidean`` - Approximation med hjälp av *metrisk* algoritm." +msgid "4) Path from :math:`12` to :math:`7`" +msgstr "4) Väg från :math:`12` till :math:`7`" -msgid "Using `Boost: metric TSP approx `__" -msgstr "Använda `Boost: metrisk TSP ca `__" +msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" +msgstr "5) Använda `En till många`_ för att få lösningen på exempel 1 och 2" -msgid "Name change from pgr_eucledianTSP" -msgstr "Namnändring från pgr_eucledianTSP" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgstr "Banor :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" -msgid "New official function." -msgstr "Ny officiell funktion." +msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" +msgstr "6) Använda `Många till en`_ för att få lösningen på exempel 2 och 4" -msgid "Results change depending on input order of the `Coordinates SQL`_" -msgstr "Resultaten ändras beroende på inmatningsordningen för `Koordinater SQL`_" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{7\\}` `" -msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." -msgstr "Alla duplicerade identifierare kommer att ignoreras. De koordinater som kommer att behållas är godtyckliga." +msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" +msgstr "7) Använda `Många till många`_ för att få lösningen på exempel 1 till 4" -msgid "The coordinates are quite similar for the same identifier, for example ::" -msgstr "Koordinaterna är ganska lika för samma identifierare, till exempel ::" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" -msgid "The coordinates are quite different for the same identifier, for example ::" -msgstr "Koordinaterna är helt olika för samma identifierare, till exempel ::" +msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" +msgstr "8) Använda `Kombinationer`_ för att få lösningen på exempel 1 till 3" -msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSPeuclidean(`koordinater SQL`_, ``[start_id, end_id]``)" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgstr "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgid "With default values" -msgstr "Med standardvärden" +msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" +msgstr "För **omdirigerade** grafer med kolumnerna ``kostnad`` och ``omvända kostnader``" -msgid "`Coordinates SQL`_" -msgstr "`Koordinater SQL`_" +msgid "Undirected graph with cost and reverse cost columns" +msgstr "Oriktad graf med kostnads- och omvända kostnadskolumner" -msgid "`Coordinates SQL`_ as described below" -msgstr "`Koordinater SQL`_ enligt beskrivningen nedan" +msgid "9) Path from :math:`6` to :math:`10`" +msgstr "9) Stigen från :math:`6` till :math:`10`" -msgid "Coordinates SQL" -msgstr "Koordinater SQL" +msgid "10) Path from :math:`6` to :math:`7`" +msgstr "10) Väg från :math:`6` till :math:`7`" -msgid "``x``" -msgstr "``x``" +msgid "11) Path from :math:`12` to :math:`10`" +msgstr "11) Stigen från :math:`12` till :math:`10`" -msgid "X value of the coordinate." -msgstr "X-värde för koordinaten." +msgid "12) Path from :math:`12` to :math:`7`" +msgstr "12) Väg från :math:`12` till :math:`7`" -msgid "``y``" -msgstr "``y``" +msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" +msgstr "13) Använda `En till många`_ för att få lösningen till exempel 9 och 10" -msgid "Y value of the coordinate." -msgstr "Y-värde för koordinaten." +msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" +msgstr "14) Använda `Många till en`_ för att få lösningen på exempel 10 och 12" -msgid "Test 29 cities of Western Sahara" -msgstr "Test 29 städer i Västsahara" +msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" +msgstr "15) Använda `Många till många`_ för att få lösningen på exempel 9 till 12" -msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" -msgstr "I det här exemplet visas hur man gör prestandatester med hjälp av University of Waterloos \"exempeldata\" `__ med hjälp av de 29 städerna i \"Västsaharas dataset\" `__" +msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" +msgstr "16) Använda `Kombinationer`_ för att få lösningen på exempel 9 till 11" -msgid "Creating a table for the data and storing the data" -msgstr "Skapa en tabell för data och lagra data" +msgid "For **directed** graphs only with ``cost`` column" +msgstr "För **riktade** grafer endast med kolumn ``kostnad``" -msgid "Adding a geometry (for visual purposes)" -msgstr "Lägga till en geometri (för visuella ändamål)" +msgid "Directed graph only with cost column" +msgstr "Riktad graf endast med kostnadskolumn" -msgid "Total tour cost" -msgstr "Total kostnad för resan" +msgid "17) Path from :math:`6` to :math:`10`" +msgstr "17) Väg från :math:`6` till :math:`10`" -msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" -msgstr "Få en total kostnad för turnén, jämför värdet med längden på en optimal turné är 27603, givet på datasetet" +msgid "18) Path from :math:`6` to :math:`7`" +msgstr "18) Väg från :math:`6` till :math:`7`" -msgid "Getting a geometry of the tour" -msgstr "Att få en geometri av turen" +msgid "19) Path from :math:`12` to :math:`10`" +msgstr "19) Väg från :math:`12` till :math:`10`" -msgid "Visual results" -msgstr "Visuella resultat" +msgid "20) Path from :math:`12` to :math:`7`" +msgstr "20) Väg från :math:`12` till :math:`7`" -msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." -msgstr "Visuellt, Den första bilden är den `optimala lösningen `__ och den andra bilden är den lösning som erhållits med ``pgr_TSPeuclidean``." +msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" +msgstr "21) Använda `En till många`_ för att få lösningen på exempel 17 och 18" -msgid "``pgr_aStar`` — Shortest path using the A* algorithm." -msgstr "``pgr_aStar`` - Kortaste vägen med hjälp av A*-algoritmen." +msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" +msgstr "22) Använda `Många till en`_ för att få lösningen på exempel 18 och 20" -msgid "Standardizing output columns to |short-generic-result|" -msgstr "Standardisering av utdatakolumner till |short-generic-result|" +msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" +msgstr "23) Använda `Många till många`_ för att få lösningen på exempel 17 till 20" -msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" +msgstr "24) Använda `Kombinationer`_ för att få lösningen på exempel 17 till 19" -msgid "pgr_aStar(One to Many) added ``end_vid`` column." -msgstr "pgr_aStar(One to Many) added ``end_vid`` column." +msgid "For **undirected** graphs only with ``cost`` column" +msgstr "För **ej riktade** grafer endast med kolumn ``kostnad``" -msgid "pgr_aStar(Many to One) added ``start_vid`` column." -msgstr "pgr_aStar(Many to One) added ``start_vid`` column." +msgid "Undirected graph only with cost column" +msgstr "Ostyrd graf endast med kostnadskolumn" -msgid "New proposed signature:" -msgstr "Nytt förslag till signatur:" +msgid "25) Path from :math:`6` to :math:`10`" +msgstr "25) Väg från :math:`6` till :math:`10`" -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(Combinations)" +msgid "26) Path from :math:`6` to :math:`7`" +msgstr "26) Väg från :math:`6` till :math:`7`" -msgid "Version 2.4.0" -msgstr "Version 2.4.0" +msgid "27) Path from :math:`12` to :math:`10`" +msgstr "27) Väg från :math:`12` till :math:`10`" -msgid "pgr_aStar(One to Many)" -msgstr "pgr_aStar(One to Many)" +msgid "28) Path from :math:`12` to :math:`7`" +msgstr "28) Väg från :math:`12` till :math:`7`" -msgid "pgr_aStar(Many to One)" -msgstr "pgr_aStar(Many to One)" +msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" +msgstr "29) Använda `En till många`_ för att få lösningen på exempel 25 och 26" -msgid "pgr_aStar(Many to Many)" -msgstr "pgr_aStar(Many to Many)" +msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" +msgstr "30) Använda `Många till en`_ för att få lösningen på exempel 26 och 28" -msgid "Signature change on pgr_aStar(One to One)" -msgstr "Ändring av signatur på pgr_aStar(One to One)" +msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" +msgstr "31) Använda `Många till många`_ för att få lösningen på exempel 25 till 28" -msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" -msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten från `pgr_aStar(` `One to One`_ `)` på :" +msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" +msgstr "32) Använda `Kombinationer`_ för att få lösningen på exempel 25 till 27" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" +msgid "Equvalences between signatures" +msgstr "Utjämningar mellan signaturer" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgstr "Följande exempel visar sökvägen för :math:`\\{6\\}\\rightarrow\\{10\\}`" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +msgid "33) Using `One to One`_" +msgstr "33) Använda `En till en`_" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgid "34) Using `One to Many`_" +msgstr "34) Använda `En till många`_" -msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStar(`Kanter SQL`_, `Combinations SQL`_, [**options**])" +msgid "35) Using `Many to One`_" +msgstr "35) Använda `Många till en`_" -msgid "**options:** ``[directed, heuristic, factor, epsilon]``" -msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" +msgid "36) Using `Many to Many`_" +msgstr "36) Använda `Många till många`_" -msgid "Returns set of |short-generic-result|" -msgstr "Returnerar uppsättning av |short-generic-result|" +msgid "37) Using `Combinations`_" +msgstr "37) Använda `Kombinationer`_" -msgid "Optional parameters are `named parameters` and have a default value." -msgstr "Valfria parametrar är \"namngivna parametrar\" och har ett standardvärde." +msgid "`Boost: Dijkstra shortest paths `__" +msgstr "`Boost: Dijkstra kortaste vägar `__" -msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" -msgstr "Från toppunkt :math:`6` till toppunkt :math:`12` på en **riktad** graf med heuristik :math:`2`" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" -msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 12\\}` på en **riktad** graf med heuristiken :math:`3` och faktorn :math:`3.5`" +msgid "``pgr_dijkstraCost``" +msgstr "``pgr_dijkstraCost``" -msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" -msgstr "Från topparna :math:`\\{6, 8\\}` till topp :math:`10` på en **omdirigerad** graf med heuristiken :math:`4`" +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgstr "``pgr_dijkstraCost`` - Totalkostnad för den kortaste vägen med Dijkstra-algoritmen." -msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" -msgstr "Från topparna :math:`\\{6, 8\\}` till topparna :math:`\\{10, 12\\}` på en **riktad** graf med faktorn :math:`0.5`" +msgid "pgr_dijkstraCost(Combinations)" +msgstr "pgr_dijkstraCost(Combinations)" -msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." -msgstr "Använda en kombinationstabell på en **riktad** graf med faktor :math:`0.5`." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr "Funktionen ``pgr_dijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av Dijkstra-algoritmen." -msgid "Example 1" -msgstr "Exempel 1" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "Demonstration of repeated values are ignored, and result is sorted." -msgstr "Demonstration av upprepade värden ignoreras och resultatet sorteras." +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "Example 2" -msgstr "Exempel 2" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "Making **start vids** the same as **end vids**." -msgstr "Att göra **start vids** samma som **slut vids**." +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "Example 3" -msgstr "Exempel 3" +msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid "Manually assigned vertex combinations." -msgstr "Manuellt tilldelade toppunktskombinationer." +msgid "``pgr_dijkstraCostMatrix``" +msgstr "``pgr_dijkstraCostMatrix``" -msgid "``pgr_aStarCost``" -msgstr "``pgr_aStarCost``" +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgstr "``pgr_dijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_dijkstra`." -msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr "``pgr_aStarCost`` - Totalkostnad för den kortaste vägen med A*-algoritmen." +msgid "Using Dijkstra algorithm, calculate and return a cost matrix." +msgstr "Beräkna och returnera en kostnadsmatris med hjälp av Dijkstra-algoritmen." -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(Combinations)" +msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_dijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" -msgid "New proposed function." -msgstr "Ny föreslagen funktion." +msgid "``pgr_dijkstraNear``" +msgstr "``pgr_dijkstraNear``" -msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." -msgstr "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av A*-algoritmen." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNear`` - Med hjälp av Dijkstras algoritm hittar du den rutt som leder till närmaste toppunkt." -msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" -msgstr "Låt oss anta att de returnerade värdena lagras i en tabell, så det unika indexet skulle vara paret: `(start_vid, end_vid)`" +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgstr "Givet en graf, en startpunkt och en uppsättning slutpunkter, hittar den här funktionen den kortaste vägen från startpunkten till närmaste slutpunkt." -msgid "For undirected graphs, the results are symmetric." -msgstr "För oriktade grafer är resultaten symmetriska." +msgid "Uses Dijkstra algorithm." +msgstr "Använder Dijkstra-algoritmen." -msgid "The returned values are ordered in ascending order:" -msgstr "De returnerade värdena sorteras i stigande ordning:" +msgid "Works for **directed** and **undirected** graphs." +msgstr "Fungerar för **directed** och **undirected** grafer." -msgid "`start_vid` ascending" -msgstr "`start_vid` stigande" +msgid "When there are more than one path to the same vertex with same cost:" +msgstr "När det finns mer än en väg till samma toppunkt med samma kostnad:" -msgid "`end_vid` ascending" -msgstr "`end_vid` stigande" +msgid "The algorithm will return just one path" +msgstr "Algoritmen kommer bara att returnera en väg" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" +msgid "Optionally allows to find more than one path." +msgstr "Det går även att hitta mer än en sökväg." -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "When more than one path is to be returned:" +msgstr "När mer än ett tågläge ska returneras:" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +msgid "Results are sorted in increasing order of:" +msgstr "Resultaten sorteras i stigande ordning efter:" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgid "aggregate cost" +msgstr "sammanlagd kostnad" -msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" +msgid "Within the same value of aggregate costs:" +msgstr "Inom samma värde för de sammanlagda kostnaderna:" -msgid "Returns set of |matrix-result|" -msgstr "Returnerar uppsättning av |matrix-result|" +msgid "results are sorted by (source, target)" +msgstr "resultaten sorteras efter (källa, mål)" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [options])" +msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" +msgstr "Körtid: Dijkstra-löptid: :math:`drt = O((|E| + |V|)log|V|)`" -msgid "``pgr_aStarCostMatrix``" -msgstr "``pgr_aStarCostMatrix``" +msgid "One to Many; :math:`drt`" +msgstr "En till många; :math:`drt`" -msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." -msgstr "``pgr_aStarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_aStar`." +msgid "Many to One: :math:`drt`" +msgstr "Många till en: :math:`drt`" -msgid "Using internally the :doc:`pgr_aStar` algorithm" -msgstr "Intern användning av :doc:`pgr_aStar`-algoritmen" +msgid "Many to Many: :math:`drt * |Starting vids|`" +msgstr "Många till många: :math:`drt * |Startande vids|`" -msgid "Returns a cost matrix." -msgstr "Returnerar en kostnadsmatris." +msgid "Combinations: :math:`drt * |Starting vids|`" +msgstr "Kombinationer: :math:`drt * |Starting vids|`" -msgid "No ordering is performed" -msgstr "Ingen beställning utförs" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "let `v` and `u` are nodes on the graph:" -msgstr "låt `v` och `u` vara noder i grafen:" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "when there is no path from `v` to `u`:" -msgstr "när det inte finns någon väg från `v` till `u`:" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])" -msgid "cost from `v` to `u` is :math:`\\inf`" -msgstr "kostnaden från `v` till `u` är :math:`\\inf`" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options B**])" -msgid "when :math:`v = u` then" -msgstr "när :math:`v = u` då" +msgid "**options A:** ``[directed, cap]``" +msgstr "**options A:** ``[directed, cap]``" -msgid "cost from `v` to `u` is :math:`0`" -msgstr "kostnaden från `v` till `u` är :math:`0`" +msgid "**options B:** ``[directed, cap, global]``" +msgstr "**options B:** ``[directed, cap, global]``" -msgid "When the graph is **undirected** the cost matrix is symmetric" -msgstr "När grafen är **icke-riktad** är kostnadsmatrisen symmetrisk" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_aStarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" +msgid "**options:** ``[directed, cap]``" +msgstr "**options:** ``[directed, cap]``" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" -msgstr "Symmetrisk kostnadsmatris för topparna :math:`\\{5, 6, 10, 15\\}` på en **omdirigerad** graf med heuristiken :math:`2`" +msgid "Departing on car from vertex :math:`6` find the nearest subway station." +msgstr "Avgår med bil från toppunkt :math:`6` hitta närmaste tunnelbanestation." -msgid "Use with :doc:`pgr_TSP`" -msgstr "Använd med :doc:`pgr_TSP`" +msgid "Using a **directed** graph for car routing." +msgstr "Använda en **riktad** graf för bildirigering." -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgstr "Tunnelbanestationerna ligger på följande hörn :math:`\\{1, 10, 11\\}`" -msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." -msgstr "``pgr_articulationPoints`` - Returnerar artikulationspunkterna i en odränerad graf." +msgid "The defaults used:" +msgstr "De standardvärden som används:" -msgid "Result columns change: ``seq`` is removed" -msgstr "Ändring av resultatkolumner: ``seq`` tas bort" +msgid "`directed => true`" +msgstr "`riktad => sann`" -msgid "Version 2.5.0" -msgstr "Version 2.5.0" +msgid "`cap => 1`" +msgstr "`kap => 1`" -msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." -msgstr "De hörn som tillhör mer än en biconnected komponent kallas artikulationspunkter eller, på motsvarande sätt, cut vertices. Artikulationspunkter är hörn vars borttagning skulle öka antalet anslutna komponenter i grafen. Denna implementation kan endast användas med en odelad graf." +msgid "The result shows that station at vertex :math:`11` is the nearest." +msgstr "Resultatet visar att stationen vid toppunktet :math:`11` är den närmaste." -msgid "Works for **undirected** graphs." -msgstr "Fungerar för **undirected** grafer." +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vid**, [**options**])" -msgid "``node`` ascending" -msgstr "``nod`` stigande" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" +msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`2`" -msgid "Running time: :math:`O(V + E)`" -msgstr "Speltid: :math:`O(V + E)`" +msgid "On line `4`: using the positional parameter: `directed` set to ``true``" +msgstr "På rad `4`: använder den positionella parametern: `directed` satt till ``true``" -msgid "pgr_articulationPoints(`Edges SQL`_)" -msgstr "pgr_articulationPoints(`Kanter SQL`_)" +msgid "In line `5`: using named parameter `cap => 2`" +msgstr "I rad `5`: använder namngiven parameter `cap => 2`" -msgid "Returns set of |result-node|" -msgstr "Returnerar uppsättning av |result-node|" +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgstr "Resultatet visar att stationen vid toppunktet :math:`10` är den närmaste och den näst bästa är :math:`11`." -msgid "The articulation points of the graph" -msgstr "Diagrammets artikulationspunkter" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vids**, [**options**])" -msgid "Nodes in red are the articulation points." -msgstr "Rödmarkerade noder är artikulationspunkterna." +msgid "**options:** ``[directed, cap, global]``" +msgstr "**options:** ``[directed, cap, global]``" -msgid "Identifier of the vertex." -msgstr "Identifierare för toppunkten." +msgid "Find the best pedestrian connection between two lines of buses" +msgstr "Hitta den bästa förbindelsen för fotgängare mellan två busslinjer" -msgid "`Boost: Biconnected components & articulation points `__" -msgstr "`Boost: Biconnected komponenter & ledpunkter `__" +msgid "Using an **undirected** graph for pedestrian routing" +msgstr "Använda en **omdirigerad** graf för att leda fotgängare" -msgid "wikipedia: `Biconnected component `__" -msgstr "wikipedia: `Sammankopplad komponent `__" +msgid "The first subway line stations are at :math:`\\{15, 16\\}`" +msgstr "De första tunnelbanestationerna ligger vid :math:`\\{15, 16\\}`" -msgid "``pgr_bandwidth`` - Experimental" -msgstr "``pgr_bandbredd`` - Experimentell" +msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgstr "Den andra tunnelbanelinjen stannar vid :math:`\\{1, 10, 11\\}`" -msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" -msgstr "``pgr_bandwidth`` - Beräknar grafens bandbredd" +msgid "On line `4`: using the named parameter: `directed => false`" +msgstr "På rad `4`: använder den namngivna parametern: `directed => false`" -msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." -msgstr "Bandbredden mäter hur \"utspridda\" kopplingarna är i en graf när hörnen är ordnade i en linjär ordning (som att numrera dem 1, 2, 3 osv.)." +msgid "`global => true`" +msgstr "`global => sant`" -msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" -msgstr "För varje kant i grafen, beräkna avståndet mellan de toppunktsnummer som den ansluter till" +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgstr "För en fotgängare är den bästa anslutningen att gå av och på vid toppunkten :math:`15` på den första tunnelbanelinjen och vid toppunkten :math:`10` på den andra tunnelbanelinjen." -msgid "The bandwidth is the maximum of all these distances" -msgstr "Bandbredden är den maximala av alla dessa avstånd" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgstr "Endast `en` rutt returneras eftersom `global` är ``true`` och `cap` är ``1``" -msgid "The implementation is for undirected graphs" -msgstr "Implementationen är för undirected grafer" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid "Run time is 0.160789 seconds" -msgstr "Körtiden är 0,160789 sekunder" +msgid "Find the best car connection between all the stations of two subway lines" +msgstr "Hitta den bästa bilförbindelsen mellan alla stationer på två tunnelbanelinjer" -msgid "pgr_bandwidth(`Edges SQL`_)" -msgstr "pgr_bandbredd(`Edges SQL`_)" +msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgstr "Den första tunnelbanelinjen stannar vid :math:`\\{1, 10, 11\\}`" -msgid "Returns ``BIGINT``" -msgstr "Returnerar ``BIGINT``" +msgid "The second subway line stations are at :math:`\\{15, 16\\}`" +msgstr "Den andra tunnelbanelinjens stationer ligger vid :math:`\\{15, 16\\}`" -msgid "For an undirected graph with edges." -msgstr "För en enkelriktad graf med kanter." +msgid "The combinations contents:" +msgstr "Kombinationernas innehåll:" -msgid "Returns a bigint ``(pgr_bandwidth)``" -msgstr "Returnerar en bigint ``(pgr_bandwidth)``" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgstr "linjerna `3~4` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den andra tunnelbanelinjen" -msgid "``pgr_bandwidth``" -msgstr "``pgr_bandwidth``" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgstr "linjerna `6~7` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den första tunnelbanelinjen" -msgid "gives the bandwidth of the graph." -msgstr "ger grafens bandbredd." +msgid "On line `8`: using the named parameter is `global => false`" +msgstr "På rad `8`: att använda den namngivna parametern är `global => false`" -msgid "Undirected graph with edges before optimization." -msgstr "Oriktad graf med kanter före optimering." +msgid "From the results:" +msgstr "Från resultaten:" -msgid "Undirected graph with edges after optimization." -msgstr "Oriktad graf med kanter efter optimering." +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgstr "skapa en förbindelse från den första tunnelbanelinjen :math:`\\{1, 10, 11\\\\}` till den andra :math:`\\{15, 16\\\\}`:" -msgid "`Boost: bandwidth `_" -msgstr "`Boost: bandbredd `_" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgstr "De bästa förbindelserna från alla stationer från den första linjen är: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad på :math:`1` (rader: `11` och `12`)" -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstar`` - Kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgstr "skapa en förbindelse från den andra tunnelbanelinjen :math:`\\{15, 16\\\\}` till den första :math:`\\{1, 10, 11\\\\}`:" -msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgstr "De bästa förbindelserna från alla stationer från den andra linjen är: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." -msgstr "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `13` och `14` och rader: `15` och `16`)" -msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." -msgstr "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgid "Dijkstra optional parameters" +msgstr "Dijkstra valfria parametrar" -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(Combinations)" +msgid "Near optional parameters" +msgstr "Nära valfria parametrar" -msgid "pgr_bdAstar(One to Many)" -msgstr "pgr_bdAstar(One to Many)" +msgid "``cap``" +msgstr "``cap``" -msgid "pgr_bdAstar(Many to One)" -msgstr "pgr_bdAstar(Many to One)" +msgid "Find at most ``cap`` number of nearest shortest paths" +msgstr "Hitta högst ``cap`` antal närmaste kortaste vägar" -msgid "pgr_bdAstar(Many to Many)" -msgstr "pgr_bdAstar(Many to Many)" +msgid "``global``" +msgstr "``global``" -msgid "Signature change on pgr_bdAstar(One to One)" -msgstr "Ändring av signatur på pgr_bdAstar(One to One)" +msgid "When ``true``: only ``cap`` limit results will be returned" +msgstr "När ``true``: endast ``cap`` gränsresultat kommer att returneras" -msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" -msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten av pgr_bdAStar(One to One) på:" +msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" +msgstr "När ``false``: ``cap`` gräns per ``Start vid`` kommer att returneras" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" +msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "``pgr_dijkstraNearCost``" +msgstr "``pgr_dijkstraNearCost``" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNearCost`` - Med hjälp av dijkstra-algoritmen hittar du den rutt som leder till närmaste toppunkt." -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstar(`Kanter SQL`_, `Combinations SQL`_, [**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "``pgr_bdAstarCost``" -msgstr "``pgr_bdAstarCost``" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])" -msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstarCost`` - Totalkostnad för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options B**])" -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(Combinations)" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." -msgstr "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" +msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`6``" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad av :math:`1` (rader: `1`)" -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `12` och `13`)" -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +msgid "``pgr_dijkstraVia``" +msgstr "``pgr_dijkstraVia``" -msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." -msgstr "``pgr_bdAstarCostMatrix`` - Beräknar kostnadsmatrisen med hjälp av :doc:`pgr_bdAstar`." +msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." +msgstr "``pgr_dijkstraVia`` - Rutt som går genom en lista med toppar." -msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." -msgstr "Internt används algoritmen :doc:`pgr_bdAstar`." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "Med en lista över hörnpunkter och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;hörnpunkter)`." -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_bdAstarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" +msgid "Route" +msgstr "Rutt" -msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." -msgstr "``pgr_bdDijkstra`` - Returnerar den kortaste vägen med hjälp av Bidirectional Dijkstra-algoritmen." +msgid "is a sequence of paths." +msgstr "är en sekvens av banor." -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(Combinations)" +msgid "Path" +msgstr "Sökväg" -msgid "pgr_bdDijkstra(One to Many)" -msgstr "pgr_bdDijkstra(One to Many)" +msgid "is a section of the route." +msgstr "är en del av rutten." -msgid "pgr_bdDijkstra(Many to One)" -msgstr "pgr_bdDijkstra(Many to One)" +msgid "One Via" +msgstr "En Via" -msgid "pgr_bdDijkstra(Many to Many)" -msgstr "pgr_bdDijkstra(Many to Many)" +msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgstr "pgr_dijkstraVia(`Kanter SQL`_, **via vertices**, [**options**])" -msgid "Signature change on pgr_bdDijkstra(One to One)" -msgstr "Ändring av signatur på pgr_bdDijkstra(One to One)" +msgid "**options:** ``[directed, strict, U_turn_on_edge]``" +msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Returns set of |via-result|" +msgstr "Returnerar uppsättning av |via-result|" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgstr "Hitta den rutt som besöker topparna :math:`\\{5, 1, 8\\}` i den ordningen i en riktad graf." -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Via optional parameters" +msgstr "Via valfria parametrar" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "When ``true`` departing from a visited vertex will not try to avoid" +msgstr "När ``true`` avgår från en besökt vertex kommer inte att försöka undvika" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Identifier of a path. Has value **1** for the first path." +msgstr "Identifierare för ett led. Har värdet **1** för det första tågläget." -msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" -msgstr "Från toppunkten :math:`6` till toppunkten :math:`10` på en **riktad** graf" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgstr "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen." -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" -msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en **riktad** graf" +msgid "-1 for the last node of the path." +msgstr "-1 för den sista noden på vägen." -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" -msgstr "Från topparna :math:`\\{6, 1\\}` till topp :math:`17` på en **riktad** graf" +msgid "-2 for the last node of the route." +msgstr "-2 för den sista noden i rutten." -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" -msgstr "Från topparna :math:`{6, 1\\}` till topparna :math:`{10, 17\\}` på en **omdirigerad** graf" +msgid "``route_agg_cost``" +msgstr "``route_agg_cost``" -msgid "Using a combinations table on an **undirected** graph" -msgstr "Använda en kombinationstabell i en **icke-riktad** graf" +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgstr "Total kostnad från ``start_vid`` av ``seq = 1`` till ``slut_vid`` av den aktuella ``seq``." -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" -msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen på en **riktad** graf." -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +msgid "The main query" +msgstr "Den huvudsakliga frågeställningen" -msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." -msgstr "``pgr_bdDijkstraCost`` - Returnerar den kortaste vägens kostnad med hjälp av Bidirectional Dijkstra-algoritmen." +msgid "Aggregate cost of the third path." +msgstr "Sammanlagd kostnad för det tredje tågläget." -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(Combinations)" +msgid "Route's aggregate cost of the route at the end of the third path." +msgstr "Ruttens sammanlagda kostnad för rutten vid slutet av den tredje vägen." -msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." -msgstr "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade Dijkstra-algoritmen." +msgid "Nodes visited in the route." +msgstr "Noder som besökts i rutten." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "The aggregate costs of the route when the visited vertices are reached." +msgstr "De sammanlagda kostnaderna för rutten när de besökta topparna nås." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgstr "Status för \"passeringar framför\" eller \"besök\" av noderna." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" -msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vid** , [``directed``])" +msgid ":doc:`via-category`." +msgstr ":doc:`via-category`." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid ":doc:`dijkstra-family`." +msgstr ":doc:`dijkstra-family`." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [ ``directed``])" +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgstr "``pgr_drivingDistance`` - Returnerar köravståndet från en startnod." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance(Single vertex)" -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "Added ``depth`` and ``start_vid`` result columns." +msgstr "Lagt till resultatkolumnerna ``depth`` och ``start_vid``." -msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." -msgstr "``pgr_bdDijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_bdDijkstra`." +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance(Multiple vertices)" -msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." -msgstr "Beräkna och returnera en kostnadsmatris med hjälp av den dubbelriktade Dijkstra-algoritmen." +msgid "Result column name change: ``from_v`` to ``start_vid``." +msgstr "Namnbyte på resultatkolumnen: ``from_v`` till ``start_vid``." -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_bdDijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" +msgid "Added ``depth`` and ``pred`` result columns." +msgstr "Lagt till resultatkolumnerna ``depth`` och ``pred``." -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" -msgstr "Symmetrisk kostnadsmatris för toppar :math:`{\\5, 6, 10, 15\\}` på en **omdirigerad** graf" +msgid "Signature change:" +msgstr "Ändring av signatur:" -msgid "Use with :doc:`pgr_TSP`." -msgstr "Använd med :doc:`pgr_TSP`." +msgid "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance(single vertex)" -msgid "``pgr_bellmanFord`` - Experimental" -msgstr "``pgr_bellmanFord`` - Experimentell" +msgid "New official signature:" +msgstr "Ny officiell signatur:" -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." -msgstr "``pgr_bellmanFord`` - Kortaste vägen med Bellman-Ford algoritm." +msgid "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance(multiple vertices)" -msgid "pgr_bellmanFord(Combinations)" -msgstr "pgr_bellmanFord(Combinations)" +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgstr "Med hjälp av Dijkstra-algoritmen extraheras alla noder som har kostnader som är mindre än eller lika med värdet ``distance``. De kanter som extraheras kommer att överensstämma med motsvarande spännträd." -msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." -msgstr "Bellman-Fords algoritm är uppkallad efter Richard Bellman och Lester Ford, som först publicerade den 1958 respektive 1956. Det är en algoritm för grafsökning som beräknar kortaste vägar från en startpunkt (``start_vid``) till en slutpunkt (``end_vid``) i en graf där vissa av kantvikterna kan vara negativa. Även om den är mer mångsidig är den långsammare än Dijkstras algoritm. Den här implementeringen kan användas med en riktad graf och en oriktad graf." +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgid "Process is valid for edges with both positive and negative edge weights." -msgstr "Processen är giltig för kanter med både positiva och negativa kantvikter." +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" -msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." -msgstr "När startvertex och slutvertex är desamma finns det ingen väg. Agg_cost skulle vara :math:`0`." +msgid "**options:** [directed, equicost]" +msgstr "**options:** [directed, equicost]" -msgid "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." -msgstr "När startvertex och slutvertex är olika, och det finns en väg mellan dem utan att ha en *negativ cykel*. Agg_cost skulle vara ett ändligt värde som anger det kortaste avståndet mellan dem." +msgid "Single Vertex" +msgstr "Enstaka toppunkt" -msgid "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." -msgstr "När startpunkten och slutpunkten är olika, och det finns en väg mellan dem, men den innehåller en *negativ cykel*. I sådana fall fortsätter agg_cost för dessa toppar att minska och därför kan agg_cost inte definieras för dem." +msgid "From vertex :math:`11` for a distance of :math:`3.0`" +msgstr "Från toppunkten :math:`11` för ett avstånd av :math:`3.0`" -msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." -msgstr "När startvertex och slutvertex är olika och det inte finns någon väg. Agg_cost är :math:`\\infty`." +msgid "Multiple Vertices" +msgstr "Flera vertikaler" -msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." -msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start_vids` eller `end_vids`." +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgstr "Från topparna :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` med equi-cost på en riktad graf" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" -msgstr "Speltid: :math:`O(| start\\_vids | * ( V * E))`" +msgid "Driving distance optional parameters" +msgstr "Valfria parametrar för körsträcka" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "``equicost``" +msgstr "``equicost``" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgstr "När ``true`` kommer noden endast att visas i den närmaste ``start_vid``-listan. Bindningsbromsar är godtyckliga." -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "When ``false`` which resembles several calls using the single vertex signature." +msgstr "När ``false`` vilket liknar flera anrop som använder signaturen med en enda vertex." -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "end-before" +msgstr "slut-innan" -msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bellmanFord(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgstr "Från hörnen :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` på en odelad graf" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" -msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf" +msgid "``pgr_edgeColoring`` - Experimental" +msgstr "``pgr_edgeColoring`` - Experimentell" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" -msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`17` i en riktad graf" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgstr "``pgr_edgeColoring`` - Returnerar kantfärgning av oledade och loopfria grafer" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" -msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 17\\}` på en odelad graf" +msgid "Output columns standardized to |result_edge_color|" +msgstr "Utgångskolumner standardiserade till |result_edge_color|" -msgid "Using a combinations table on an undirected graph" -msgstr "Använda en kombinationstabell på en ostyrd graf" +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgstr "Edge Coloring är en algoritm som används för att färglägga kanterna för topparna i grafen. Det är en tilldelning av färger till kanterna i grafen så att inga två intilliggande kanter har samma färg." -msgid "`Boost: Bellman Ford `__" -msgstr "`Boost: Bellman Ford `__" +msgid "The implementation is for **undirected** and **loop-free** graphs" +msgstr "Implementeringen är för **undirected** och **loop-free** grafer" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "loop free" +msgstr "slinga fri" -msgid "``pgr_betweennessCentrality`` - Experimental" -msgstr "``pgr_betweennessCentrality`` - Experimentell" +msgid "no self-loops and no parallel edges." +msgstr "inga självslingor och inga parallella kanter." -msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" -msgstr "``pgr_betweennessCentrality`` - Beräknar den relativa betweenness-centraliteten med hjälp av Brandes-algoritmen" +msgid "Provides the color to be assigned to all the edges present in the graph." +msgstr "Ger den färg som ska tilldelas alla kanter som finns i grafen." -msgid "Version 3.7.0" -msgstr "Version 3.7.0" +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +msgstr "Högst :math:`\\Delta + 1` färger används, där :math:`\\Delta` är grafens grad." -msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." -msgstr "Brandes-algoritmen utnyttjar de glesa graferna för att utvärdera betweenness centrality-punkten för alla hörn." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgstr "Detta är optimalt för vissa grafer och enligt Vizings teorem används högst en färg mer än vad som är optimalt för alla andra." -msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." -msgstr "Betweenness centrality mäter i vilken utsträckning en toppunkt ligger på de kortaste vägarna mellan alla andra par av toppunkter. Toppar med en hög betweenness centrality-punkt kan ha ett betydande inflytande i ett nätverk genom att de kontrollerar de kortaste vägarna mellan dem." +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgstr "det kromatiska talet :math:`x'(G)` (minsta antal färger som behövs för korrekt kantfärgning av grafen) är lika med graden :math:`\\Delta + 1` av grafen, (:math:`x'(G) = \\Delta`)" -msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." -msgstr "Om dessa toppar tas bort påverkas nätverket genom att det störs, eftersom de flesta av de kortaste vägarna mellan topparna passerar genom dem." +msgid "The algorithm tries to assign the least possible color to every edge." +msgstr "Algoritmen försöker tilldela varje kant minsta möjliga färg." -msgid "This implementation work for both directed and undirected graphs." -msgstr "Denna implementering fungerar för både riktade och oriktade grafer." +msgid "Does not always produce optimal coloring." +msgstr "Ger inte alltid optimal färgsättning." -msgid "Running time: :math:`\\Theta(VE)`" -msgstr "Speltid: :math:`\\Theta(VE)`" +msgid "The returned rows are ordered in ascending order of the edge identifier." +msgstr "De returnerade raderna är ordnade i stigande ordning efter kantidentifieraren." -msgid "Running space: :math:`\\Theta(VE)`" -msgstr "Driftutrymme: :math:`\\Theta(VE)``" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" +msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem och därför:" -msgid "Throws when there are no edges in the graph" -msgstr "Kastar när det inte finns några kanter i grafen" +msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" +msgstr "I den här implementeringen är körtiden: :math:`O(|E|*|V|)`" -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgstr "pgr_betweennessCentrality(`Kanter SQL`_, [``directed``])" +msgid "where :math:`|E|` is the number of edges in the graph," +msgstr "där :math:`|E|` är antalet kanter i grafen," -msgid "Returns set of ``(vid, centrality)``" -msgstr "Returnerar uppsättning av ``(vid, centralitet)``" +msgid ":math:`|V|` is the number of vertices in the graph." +msgstr ":math:`|V|` is the number of vertices in the graph." -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "För en riktad graf med kanter :math:`\\{1, 2, 3, 4\\}`." +msgid "pgr_edgeColoring(`Edges SQL`_)" +msgstr "pgr_edgeColoring(`Kanter SQL`_)" -msgid "Explanation" -msgstr "Förklaring" +msgid "Graph coloring of pgRouting :doc:`sampledata`" +msgstr "Grafisk färgläggning av pgRouting :doc:`sampledata`" -msgid "The betweenness centrality are between parenthesis." -msgstr "Betweenness Centrality anges inom parentes." +msgid "`Boost: Edge Coloring `__" +msgstr "`Boost: Färgläggning av kanter `__" -msgid "The leaf vertices have betweenness centrality :math:`0`." -msgstr "Bladkärnorna har betweenness centrality :math:`0`." +msgid "`Wikipedia: Graph coloring `__" +msgstr "`Wikipedia: Färgläggning av grafer `__" -msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." -msgstr "Betweenness centrality för toppunkten :math:`6` är högre än för toppunkten :math:`10`." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgstr "``pgr_edgeDisjointPaths`` - Beräknar kantdisjunkta vägar mellan två grupper av toppar." -msgid "Removing vertex :math:`6` will create three graph components." -msgstr "Om du tar bort toppunkten :math:`6` skapas tre grafkomponenter." +msgid "Output columns standardized to |generic-result|" +msgstr "Utdatakolumner standardiserade till |generic-result|" -msgid "Removing vertex :math:`10` will create two graph components." -msgstr "Om du tar bort toppunkten :math:`10` skapas två grafkomponenter." +msgid "pgr_edgeDisjointPaths(Combinations)" +msgstr "pgr_edgeDisjointPaths(Combinations)" -msgid "``vid``" -msgstr "``vid``" +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgstr "Beräknar de kantdisjunkta vägarna mellan två grupper av hörnpunkter. Använder underliggande algoritmer för maximalt flöde för att beräkna vägarna." -msgid "``centrality``" -msgstr "``centrality``" +msgid "The main characterics are:" +msgstr "De viktigaste egenskaperna är:" -msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" -msgstr "Relativ betweenness centrality-punkt för vertexet (kommer att ligga inom intervallet [0,1])" +msgid "Calculates the edge disjoint paths between any two groups of vertices." +msgstr "Beräknar de kantskiljande vägarna mellan två valfria grupper av hörnpunkter." -msgid "`Boost: betweenness centrality `_" -msgstr "`Boost: betweenness centrality `_" +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgstr "Returnerar EMPTY SET när källan och destinationen är desamma eller inte kan nås." -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +msgid "The graph can be directed or undirected." +msgstr "Grafen kan vara riktad eller oriktad." -msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." -msgstr "``pgr_biconnectedComponents`` - Biconnected-komponenter i en odränerad graf." +msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." +msgstr "Använder :doc:`pgr_boykovKolmogorov` för att beräkna banorna." -msgid "Result columns change:" -msgstr "Resultatkolumnerna ändras:" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])" -msgid "``n_seq`` is removed" -msgstr "``n_seq`` tas bort" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])" -msgid "``seq`` changed type to ``BIGINT``" -msgstr "``seq`` har ändrat typ till ``BIGINT``" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])" -msgid "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." -msgstr "De biconnected komponenterna i en odelad graf är de maximala delmängderna av hörnpunkter så att borttagandet av en hörnpunkt från en viss komponent inte kommer att koppla bort komponenten. Till skillnad från anslutna komponenter kan toppar tillhöra flera biconnected components. Toppar kan förekomma i flera biconnected components, men varje kant kan bara ingå i en enda biconnected component." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" -msgid "Components are described by edges." -msgstr "Komponenterna beskrivs med kanter." +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "``component`` ascending." -msgstr "``komponent`` stigande." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}` i en ostyrd graf." -msgid "``edge`` ascending." -msgstr "``edge`` stigande." +msgid "Manually assigned vertex combinations on an undirected graph." +msgstr "Manuellt tilldelade toppunktskombinationer på en odelad graf." -msgid "pgr_biconnectedComponents(`Edges SQL`_)" -msgstr "pgr_biconnectedComponents(`Kanter SQL`_)" +msgid "``pgr_edmondsKarp``" +msgstr "``pgr_edmondsKarp``" -msgid "Returns set of |result-component-E|" -msgstr "Returnerar uppsättning av |result-component-E|" +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgstr "``pgr_edmondsKarp`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Edmonds Karps algoritm." -msgid "The biconnected components of the graph" -msgstr "De biconnected komponenterna i grafen" +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(Combinations)" -msgid "``component``" -msgstr "``component``" +msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" +msgstr "Borttagen från ``pgr_maxFlowEdmondsKarp``" -msgid "Component identifier." -msgstr "Komponentens identifierare." +msgid "Running time: :math:`O( V * E ^ 2)`" +msgstr "Speltid: :math:`O( V * E ^ 2)`" -msgid "Has the value of the minimum edge identifier in the component." -msgstr "Har värdet för den minsta kantidentifieraren i komponenten." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vid**, **end vid**)" -msgid "Identifier of the edge that belongs to the ``component``." -msgstr "Identifierare av den kant som tillhör ``komponenten``." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vid**, **end vids**)" -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgstr "``pgr_binaryBreadthFirstSearch`` - Experimentell" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vids**, **end vid**)" -msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." -msgstr "``pgr_binaryBreadthFirstSearch`` - Returnerar den kortaste vägen i en binär graf." +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vids**, **end vids**)" -msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." -msgstr "En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal, kallas för en \"binär graf\"." +msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_edmondsKarp(`Kanter SQL`_, `Combinations SQL`_)" -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "pgr_binaryBreadthFirstSearch(Combinations)" +msgid "`Boost: Edmonds Karp max flow `__" +msgstr "`Boost: Edmonds Karp maxflöde `__" -msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." -msgstr "Det är välkänt att de kortaste vägarna mellan en enda källa och alla andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som du behöver korsa från källan till en annan topp. Vi kan också tolka en sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om inte alla kanter i grafen har samma vikt behövs en mer generell algoritm, som Dijkstras algoritm som går på :math:`O(|E|log|V|)` tid." +msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." -msgstr "Men om vikterna är mer begränsade kan vi använda en snabbare algoritm. Den här algoritmen, som kallas \"Binary Breadth First Search\" eller \"0-1 BFS\", är en variant av standardproblemet Breadth First Search för att lösa SSSP-problemet (kortaste vägen med en källa) på :math:`O(|E|)`, om vikterna för varje kant tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal." +msgid "``pgr_edwardMoore`` - Experimental" +msgstr "``pgr_edwardMoore`` - Experimentell" -msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" -msgstr "Processen görs endast på \"binära grafer\". ('Binär graf': En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt reellt heltal)" +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgstr "``pgr_edwardMoore`` - Returnerar den kortaste vägen med Edward-Moore-algoritmen." -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" -msgstr "Speltid: :math:`O(| start\\_vids | * |E|)``" +msgid "pgr_edwardMoore(Combinations)" +msgstr "pgr_edwardMoore(Combinations)" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])" +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgstr "Edward Moores algoritm är en förbättring av Bellman-Ford-algoritmen. Den kan beräkna de kortaste vägarna från ett enda källvertex till alla andra vertex i en viktad riktad graf. Den största skillnaden mellan Edward Moores algoritm och Bellman Fords algoritm ligger i körtiden." -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])" +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgstr "I värsta fall är algoritmens körtid :math:`O(| V | * | E |)`, vilket liknar tidskomplexiteten för Bellman-Ford-algoritmen. Experiment tyder dock på att denna algoritm har en genomsnittlig komplexitet på :math:`O( | E | )` för slumpmässiga grafer. Detta är betydligt snabbare när det gäller beräkningshastighet." -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgstr "Algoritmen är alltså i bästa fall betydligt snabbare än Bellman-Ford-algoritmen och i sämsta fall lika bra som Bellman-Ford-algoritmen" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" +msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" +msgstr "`agg_cost` de icke inkluderade värdena `(v, v)` är :math:`0`" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start vids` eller `end vids`." -msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" -msgstr "**Anmärkning:** Använda :doc:`sampledata` Network eftersom alla vikter är desamma (dvs :math:`1``)" +msgid "Running time:" +msgstr "Löptid:" -msgid "`Boost: Breadth First Search `__" -msgstr "`Boost: Bredd först Sök `__" +msgid "Worst case: :math:`O(| V | * | E |)`" +msgstr "Sämsta fall: :math:`O(| V | * | E |)`" -msgid "https://cp-algorithms.com/graph/01_bfs.html" -msgstr "https://cp-algorithms.com/graph/01_bfs.html" +msgid "Average case: :math:`O( | E | )`" +msgstr "Genomsnittligt fall: :math:`O( | E | )`" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "``pgr_bipartite`` - Experimental" -msgstr "``pgr_bipartite`` - Experimentell" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." -msgstr "``pgr_bipartite`` - Disjunkta uppsättningar av hörnpunkter så att inga två hörnpunkter inom samma uppsättning är angränsande." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." -msgstr "En bipartitisk graf är en graf med två uppsättningar av hörn som är kopplade till varandra, men inte inom sig själva. En bipartitisk graf är möjlig om grafen kan färgläggas med två färger så att topparna i en uppsättning färgas med samma färg." +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "The algorithm works in undirected graph only." -msgstr "Algoritmen fungerar endast i ostyrda grafer." +msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid "The returned values are not ordered." -msgstr "De returnerade värdena är inte ordnade." +msgid "Using a combinations table on an **undirected** graph." +msgstr "Använda en kombinationstabell i en **icke-riktad** graf." -msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." -msgstr "Algoritmen kontrollerar om grafen är tvådelad eller inte. Om den är bipartite returnerar den noden tillsammans med två färger `0` och `1` som representerar två olika uppsättningar." +msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgid "If graph is not bipartite then algorithm returns empty set." -msgstr "Om grafen inte är bipartitisk returnerar algoritmen en tom uppsättning." +msgid "``pgr_extractVertices``" +msgstr "``pgr_extractVertices``" -msgid "pgr_bipartite(`Edges SQL`_)" -msgstr "pgr_bipartite(`Kanter SQL`_)" +msgid "``pgr_extractVertices`` — Extracts the vertices information" +msgstr "``pgr_extractVertices`` - Extraherar information om hörnpunkter" -msgid "When the graph is bipartite" -msgstr "När grafen är tvådelad" +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgstr "Detta är en hjälpfunktion för att extrahera toppunktsinformationen för en grafs uppsättning kanter." -msgid "Additional Example" -msgstr "Ytterligare exempel" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgstr "När kantidentifieraren anges kommer den också att beräkna in- och utkanterna" -msgid "The odd length cyclic graph can not be bipartite." -msgstr "Den cykliska grafen med udda längd kan inte vara bipartit." +msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgstr "pgr_extractVertices(`Kanter SQL`_, [``dryrun``])" -msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." -msgstr "Kanten :math:`5 \\rightarrow 1` kommer att göra undergrafen med hörn :math:`\\{1, 3, 7, 6, 5\\}` till en cyklisk graf med udda längd, eftersom cykeln har 5 hörn." +msgid "RETURNS SETOF |result-extract|" +msgstr "RETURNS SETOF |result-extract|" -msgid "Edges in blue represent odd length cycle subgraph." -msgstr "Kanter i blått representerar cykelundergraf med udda längd." +msgid "When line geometry is known" +msgstr "När linjegeometrin är känd" -msgid "`Boost: is_bipartite `__" -msgstr "`Boost: is_bipartite `__" +msgid "(Optional) identifier of the edge." +msgstr "(Valfritt) identifierare för kanten." -msgid "`Wikipedia: bipartite graph `__" -msgstr "`Wikipedia: bipartitgraf `__" +msgid "``geom``" +msgstr "``geom``" -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +msgid "``LINESTRING``" +msgstr "``LINESTRING``" -msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." -msgstr "``pgr_boykovKolmogorov`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Boykov Kolmogorov-algoritmen." +msgid "Geometry of the edge." +msgstr "Geometri för kanten." -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov(Combinations)" +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgstr "Denna inre fråga har företräde framför de två följande inre frågorna, och därför ignoreras andra kolumner när kolumnen ``geom`` visas." -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" -msgstr "Borttagen från ``pgr_maxFlowBoykovKolmogorov``" +msgid "Ignored columns:" +msgstr "Ignorerade kolumner:" -msgid "Function promoted to proposed." -msgstr "Funktion befordrad till föreslagen." +msgid "``startpoint``" +msgstr "``startpoint``" -msgid "Running time: Polynomial" -msgstr "Drifttid: Polynom" +msgid "``endpoint``" +msgstr "``endpoint``" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "When vertex geometry is known" +msgstr "När toppunktsgeometrin är känd" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgstr "För att använda den här inre frågan får kolumnen ``geom`` inte ingå i kolumnuppsättningen." -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "``POINT``" +msgstr "``POINT``" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "POINT geometry of the starting vertex." +msgstr "POINT Geometri för startvertexen." -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, `Combinations SQL`_)" +msgid "POINT geometry of the ending vertex." +msgstr "POINT Geometri för den avslutande vertexen." -msgid "Returns set of |result-flow|" -msgstr "Returnerar uppsättning av |result-flow|" +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgstr "Denna inre fråga har företräde framför nästa inre fråga, och därför ignoreras andra kolumner när kolumnerna ``startpunkt`` och ``slutpunkt`` visas." -msgid "From vertex :math:`11` to vertex :math:`12`" -msgstr "Från toppunkten :math:`11` till toppunkten :math:`12`" +msgid "When identifiers of vertices are known" +msgstr "När identifierare av toppar är kända" -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "Från toppunkten :math:`11` till toppunkterna :math:`{\\5, 10, 12\\}`" +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgstr "För att kunna använda den här inre frågan får kolumnerna ``geom``, ``startpoint`` och ``endpoint`` inte ingå i kolumnuppsättningen." -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" -msgstr "Från topparna :math:`\\{11, 3, 17\\}` till topp :math:`12`" +msgid "``NULL`` When the ``id`` is not part of the inner query" +msgstr "``NULL`` När ``id`` inte är en del av den inre frågan" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "Från topparna :math:`{11, 3, 17\\}` till topparna :math:`{5, 10, 12\\}`" +msgid "X value of the point geometry" +msgstr "X-värde för punktgeometrin" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." -msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}`." +msgid "``NULL`` When no geometry is provided" +msgstr "``NULL`` När ingen geometri anges" -msgid "`Boost: Boykov Kolmogorov max flow `__" -msgstr "`Boost: Boykov Kolmogorov maxflöde `__" +msgid "Geometry of the point" +msgstr "Geometri för punkten" -msgid "``pgr_breadthFirstSearch`` - Experimental" -msgstr "``pgr_breadthFirstSearch`` - Experimentell" +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgstr "Använd ``dryrun := true`` för att få den fråga som genereras för att få fram toppunktsinformationen." -msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." -msgstr "``pgr_breadthFirstSearch`` - Returnerar traverseringsordning(ar) med algoritmen Breadth First Search." +msgid "Create a routing topology" +msgstr "Skapa en routningstopologi" -msgid "Version 4.0.0:" -msgstr "Version 4.0.0:" +msgid "Make sure the database does not have the ``vertices_table``" +msgstr "Kontrollera att databasen inte har ``vertices_table``" -msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." -msgstr "Ger genomgångsordningen Breadth First Search från en rotvertex till ett visst djup." +msgid "Clean up the columns of the routing topology to be created" +msgstr "Rensa upp kolumnerna i den routningstopologi som ska skapas" -msgid "The implementation will work on any type of graph." -msgstr "Implementeringen kommer att fungera på alla typer av grafer." +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgstr "När ``LINESTRING`` har en SRID används ``geom::geometry(POINT, )``" -msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." -msgstr "Ger traverseringsordningen Breadth First Search från en källnod till en måldjupnivå." +msgid "For big edge tables that are been prepared," +msgstr "För bord med stor kant som är förberedda," -msgid "Running time: :math:`O(E + V)`" -msgstr "Speltid: :math:`O(E + V)`" +msgid "Create it as ``UNLOGGED`` and" +msgstr "Skapa den som ``UNLOGGED`` och" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Kanter SQL`_, **root vid**, [**options**])" +msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" +msgstr "Efter att tabellen har skapats ``ALTER TABLE .. SET LOGGED``" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Kanter SQL`_, **root vids**, [**options**])" +msgid "Inspect the vertices table" +msgstr "Inspektera tabellen med hörnpunkter" -msgid "**options:** ``[max_depth, directed]``" -msgstr "**options:** ``[max_depth, directed]``" +msgid "Create the routing topology on the edge table" +msgstr "Skapa routningstopologin på edge-tabellen" -msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" -msgstr "Från rotpunkten :math:`6` på en **riktad** graf med kanter i stigande ordning efter ``id``" +msgid "Updating the ``source`` information" +msgstr "Uppdatering av informationen om ``källan``" -msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" -msgstr "Från rotkärnor :math:`{12, 6\\}` på en **omdirigerad** graf med **djup** :math:`<= 2` och kanter i stigande ordning efter `id``" +msgid "Updating the ``target`` information" +msgstr "Uppdatering av informationen om \"målet" -msgid "DFS optional parameters" -msgstr "DFS valfria parametrar" +msgid "Inspect the routing topology" +msgstr "Inspektera routingtopologin" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." -msgstr "Samma som `Single vertex`_ med kanter i stigande ordning efter ``id``." +msgid "**Generated topology**" +msgstr "**Genererad topologi**" -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." -msgstr "Samma som `Single vertex`_ med kanter i fallande ordning efter ``id``." +msgid "``pgr_findCloseEdges``" +msgstr "``pgr_findCloseEdges``" -msgid "The resulting traversal is different." -msgstr "Den resulterande traversalen är annorlunda." +msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." +msgstr "``pgr_findCloseEdges`` - Hittar de närmaste kanterna till en punktgeometri." -msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." -msgstr "Den vänstra bilden visar resultatet med stigande ordning av id:n och den högra bilden visar med fallande ordning av kantidentifierarna." +msgid "``partial`` option is removed." +msgstr "``partial`` alternativet är borttaget." -msgid "|ascending| |descending|" -msgstr "|ascending| |descending|" +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgstr "``pgr_findCloseEdges`` - En verktygsfunktion som hittar den närmaste kanten till en punktgeometri." -msgid "ascending" -msgstr "stigande" +msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgstr "Geometrierna måste ligga i samma koordinatsystem (ha samma SRID)." -msgid "descending" -msgstr "fallande" +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgstr "Koden för att göra beräkningarna kan erhållas för ytterligare specifika justeringar som krävs av applikationen." -msgid "`Wikipedia: Breadth First Search algorithm `__" -msgstr "`Wikipedia: Algoritmen för bred första sökning `__" +msgid "``EMPTY SET`` is returned on dryrun executions" +msgstr "``EMPTY SET`` returneras vid dryrun-körningar" -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." -msgstr "``pgr_bridges`` - Returnerar broarna i en odränerad graf." +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **punkter**, **tolerans**, [**alternativ**])" -msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." -msgstr "En bro är en kant i en odelad graf vars borttagning ökar dess antal anslutna komponenter. Denna implementation kan endast användas med en odelad graf." +msgid "**options:** ``[cap, dryrun]``" +msgstr "**options:** ``[cap, dryrun]``" -msgid "``edge`` ascending" -msgstr "``edge`` stigande" +msgid "Returns set of |result-find|" +msgstr "Returnerar uppsättning av |result-find|" -msgid "Running time: :math:`O(E * (V + E))`" -msgstr "Speltid: :math:`O(E * (V + E))`" +msgid "One point" +msgstr "En punkt" -msgid "pgr_bridges(`Edges SQL`_)" -msgstr "pgr_bridges(`Kanter SQL`_)" +msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgstr "Få två nära kanter till intressanta platser med :math:`pid = 5`" -msgid "Returns set of |result-edge|" -msgstr "Returnerar uppsättning av |result-edge|" +msgid "``cap => 2``" +msgstr "``cap => 2``" -msgid "The bridges of the graph" -msgstr "Bryggorna i grafen" +msgid "Many points" +msgstr "Många punkt" -msgid "Identifier of the edge that is a bridge." -msgstr "Identifierar den kant som är en bro." +msgid "For each points of interests, find the closest edge." +msgstr "För varje intressepunkt, hitta den närmaste kanten." -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "**point**" +msgstr "**punkt**" -msgid "`Boost: Connected components `__" -msgstr "`Boost: Anslutna komponenter `__" +msgid "The point geometry" +msgstr "Punktgeometri" -msgid "``pgr_chinesePostman`` - Experimental" -msgstr "``pgr_chinesePostman`` - Experimentell" +msgid "**points**" +msgstr "**punkter**" -msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." -msgstr "``pgr_chinesePostman`` - Beräknar den kortaste kretsvägen som innehåller varje kant i en riktad graf och som börjar och slutar på samma toppunkt." +msgid "``POINT[]``" +msgstr "``POINT[]```" -msgid "Returns ``EMPTY SET`` on a disconnected graph" -msgstr "Returnerar ``EMPTY SET`` på en frånkopplad graf" +msgid "An array of point geometries" +msgstr "En array av punktgeometrier" -msgid "pgr_chinesePostman(`Edges SQL`_)" -msgstr "pgr_chinesePostman(`Kanter SQL`_)" +msgid "**tolerance**" +msgstr "**tolerans**" -msgid "Returns set of |result-1-1-no-seq|" -msgstr "Returnerar uppsättning av |result-1-1-no-seq|" +msgid "Max distance between geometries" +msgstr "Max avstånd mellan geometrier" -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" -msgstr "Returnerar uppsättning av ``(seq, nod, kant, kostnad, agg_cost)``" +msgid "Limit output rows" +msgstr "Begränsa utmatningsraderna" -msgid "Sequential value starting from ``1``" -msgstr "Sekventiellt värde med början från ``1``" +msgid "When ``false`` calculations are performed." +msgstr "När ``falska`` beräkningar utförs." -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." -msgstr "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen. ``-1`` för den sista noden i sökvägen." +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgstr "När `` sanna`` beräkningar inte utförs och frågan för att göra beräkningarna exponeras i en PostgreSQL ``NOTICE``." -msgid "Aggregate cost from ``start_v`` to ``node``." -msgstr "Sammanlagd kostnad från ``start_v`` till ``node``." +msgid "``geometry``" +msgstr "``geometry``" -msgid "``pgr_chinesePostmanCost`` - Experimental" -msgstr "``pgr_chinesePostmanCost`` - Experimentell" +msgid "The ``LINESTRING`` geometry of the edge." +msgstr "Geometri för ``LINESTRING`` på kanten." -msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." -msgstr "``pgr_chinesePostmanCost`` - Beräknar minimikostnaderna för en kretsbana som innehåller varje kant i en riktad graf och som börjar och slutar på samma vertex." +msgid "When :math:`cap = 1`, it is the closest edge." +msgstr "När :math:`cap = 1` är det den närmaste kanten." -msgid "Return value when the graph if disconnected" -msgstr "Returvärde när grafen är frånkopplad" +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgstr "Värde i <0,1> som anger den relativa positionen från den första ändpunkten på kanten." -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" -msgstr "pgr_chinesePostmanCost(`Kanter SQL`_)" +msgid "Value in ``[r, l]`` indicating if the point is:" +msgstr "Värde i ``[r, l]`` som indikerar om punkten är:" -msgid "RETURNS ``FLOAT``" -msgstr "RETURNERAR ``FLÖDE``" +msgid "At the right ``r`` of the segment." +msgstr "På höger sida av segmentet." -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" +msgid "When the point is on the line it is considered to be on the right." +msgstr "När punkten ligger på linjen anses den ligga till höger." -msgid "Minimum costs of a circuit path." -msgstr "Minimikostnader för en kretsbana." +msgid "At the left ``l`` of the segment." +msgstr "På vänster sida av segmentet." -msgid "``pgr_connectedComponents``" -msgstr "``pgr_connectedComponents``" +msgid "``distance``" +msgstr "``distance``" -msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." -msgstr "``pgr_connectedComponents`` - Anslutna komponenter i en odelad graf med hjälp av en DFS-baserad metod." +msgid "Distance from the point to the edge." +msgstr "Avstånd från punkten till kanten." -msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." -msgstr "En kopplad komponent i en odelad graf är en uppsättning hörn som alla är nåbara från varandra." +msgid "Original ``POINT`` geometry." +msgstr "Ursprunglig ``POINT`` geometri." -msgid "Components are described by vertices" -msgstr "Komponenterna beskrivs av hörn" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgstr "``LINESTRING`` geometri som förbinder den ursprungliga **punkten** med den närmaste punkten på kanten med identifieraren ``edge_id``" -msgid "``component`` ascending" -msgstr "``komponent`` stigande" +msgid "One point in an edge" +msgstr "En punkt i en kant" -msgid "pgr_connectedComponents(`Edges SQL`_)" -msgstr "pgr_connectedComponents(`Kanter SQL`_)" +msgid "The green node is the original point." +msgstr "Den gröna noden är den ursprungliga punkten." -msgid "Returns set of |result-component-V|" -msgstr "Returnerar uppsättning av |result-component-V|" +msgid "``geom`` has the value of the original point." +msgstr "``geom`` har värdet av den ursprungliga punkten." -msgid "The connected components of the graph" -msgstr "De anslutna komponenterna i grafen" +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgstr "Geometrin ``kant`` är en linje som förbinder den ursprungliga punkten med kanten :math:`sp \\rightarrow ep` kant." -msgid "Has the value of the minimum node identifier in the component." -msgstr "Har värdet för den minsta nodidentifieraren i komponenten." +msgid "The point is located at the left of the edge." +msgstr "Punkten är placerad till vänster om kanten." -msgid "Identifier of the vertex that belongs to the ``component``." -msgstr "Identifierare av den toppunkt som tillhör ``komponenten``." +msgid "One point dry run execution" +msgstr "En punkts provkörning" -msgid "Connecting disconnected components" -msgstr "Anslutning av frånkopplade komponenter" +msgid "Using the query from the previous example:" +msgstr "Använd frågan från föregående exempel:" -msgid "wikipedia: `Connected component `__" -msgstr "wikipedia: `sammanhängande komponent `__" +msgid "Returns ``EMPTY SET``." +msgstr "Returnerar ``EMPTY SET``." -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" +msgid "``dryrun => true``" +msgstr "``dryrun => true``" -msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contraction`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." +msgstr "Genererar en PostgreSQL ``NOTICE`` med den använda koden." -msgid "Version 3.8.0" -msgstr "Version 3.8.0" +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." +msgstr "Den genererade koden kan användas som en baskod för ytterligare krav, t.ex. för att ta hänsyn till SRID." -msgid "New signature:" -msgstr "Ny signatur:" +msgid "Many points in an edge" +msgstr "Många punkter i en kant" -msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." -msgstr "Den tidigare obligatoriska parametern **Contraction order** är nu valfri med namnet ``methods``." +msgid "The green nodes are the **original points**" +msgstr "De gröna noderna är **originalpunkterna**" -msgid "New name and order of optional parameters." -msgstr "Nytt namn och ordning på valfria parametrar." +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgstr "Geometrin ``geom``, markerad som **g1** och **g2** är de **originalpunkter**" -msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "Föråldrad signatur pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgstr "Geometrin ``kant``, markerad som **kant1** och **kant2** är en linje som förbinder **originalpunkten** med den närmaste punkten på :math:`sp \\rightarrow ep`-kanten." -msgid "Name change from ``pgr_contractGraph``" -msgstr "Namnändring från ``pgr_contractGraph``" +msgid "Many points dry run execution" +msgstr "Utförande av torrkörning på många punkter" -msgid "Bug fixes" -msgstr "Buggfixar" +msgid "Do not process query" +msgstr "Bearbeta inte förfrågan" -msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." -msgstr "Kontraktion minskar storleken på grafen genom att ta bort några av topparna och kanterna och till exempel lägga till kanter som representerar en sekvens av ursprungliga kanter, vilket minskar den totala tid och det utrymme som används i grafalgoritmer." +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgstr "Generera en PostgreSQL ``NOTICE`` med koden som används för att beräkna alla kolumner" -msgid "Does not return the full contracted graph." -msgstr "Returnerar inte hela den kontraherade grafen." +msgid "Find at most two routes to a given point" +msgstr "Hitta högst två vägar till en given punkt" -msgid "Only changes on the graph are returned." -msgstr "Endast ändringar i diagrammet returneras." +msgid "Using :doc:`pgr_withPoints`" +msgstr "Använda :doc:`pgr_withPoints`" -msgid "The returned values include:" -msgstr "De returnerade värdena inkluderar:" +msgid "A point of interest table" +msgstr "Ett bord för intressepunkter" -msgid "The new edges generated by linear contraction." -msgstr "De nya kanterna som genereras av linjär sammandragning." +msgid "Handling points outside the graph." +msgstr "Hantering av punkter utanför grafen." -msgid "The modified vertices generated by dead end contraction." -msgstr "De modifierade topparna som genereras av sammandragning av återvändsgränder." +msgid "Points of interest" +msgstr "Attraktioner" -msgid "The returned values are ordered as follows:" -msgstr "De returnerade värdena är ordnade enligt följande:" +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgstr "Ibland fungerar applikationerna \"on the fly\" med utgångspunkt från en plats som inte är ett vertex i grafen. Dessa platser kallas i pgRrouting för intressepunkter." -msgid "column ``id`` ascending when its a modified vertex." -msgstr "kolumn ``id`` stigande när det är en modifierad vertex." +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." +msgstr "Den information som behövs i intressepunkterna är ``pid``, ``edge_id``, ``side``, ``fraction``." -msgid "column ``id`` with negative numbers descending when its a new edge." -msgstr "kolumn ``id`` med negativa tal fallande när det är en ny kant." +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgstr "På denna dokumentation kommer det att finnas cirka 6 fasta punkter av intresse och de kommer att lagras på ett bord." -msgid "Currently there are two types of contraction methods included in this function:" -msgstr "För närvarande finns det två typer av sammandragningsmetoder som ingår i denna funktion:" +msgid "A unique identifier." +msgstr "En unik identifierare." -msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." -msgstr "Kontraktion för återvändsgränd. Se :doc:`pgr_contractionDeadEnd`." +msgid "Identifier of the nearest segment." +msgstr "Identifierare för det närmaste segmentet." -msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." -msgstr "Linjär sammandragning. Se :doc:`pgr_contractionLinear`." +msgid "Is it on the left, right or both sides of the segment ``edge_id``." +msgstr "Är det på vänster, höger eller båda sidor av segmentet ``edge_id``." -msgid "pgr_contraction(`Edges SQL`_, [**options**])" -msgstr "pgr_contraction(`Kanter SQL`_, [**options**])" +msgid "Where in the segment is the point located." +msgstr "Var i segmentet är punkten belägen." -msgid "**options:** ``[directed, methods, cycles, forbidden]``" -msgstr "**options:** ``[directed, methods, cycles, forbidden]``" +msgid "The geometry of the points." +msgstr "Punkternas geometri." -msgid "Returns set of |result-contract|" -msgstr "Returnerar uppsättning av |result-contract|" +msgid "The distance between ``geom`` and the segment ``edge_id``." +msgstr "Avståndet mellan ``geom`` och segmentet ``edge_id``." -msgid "Dead end and linear contraction in that order on an undirected graph." -msgstr "Dead end och linjär sammandragning i den ordningen på en odelad graf." +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." +msgstr "Ett segment som förbinder punktens ``geom`` med den närmaste punkten på segmentet ``edge_id``." -msgid "Contraction optional parameters" -msgstr "Sammandragning valfria parametrar" +msgid "``newPoint``" +msgstr "``newPoint``" -msgid "``methods``" -msgstr "``methods``" +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgstr "En punkt på segmentet ``edge_id`` som ligger närmast ``geom``." -msgid "``INTEGER[]``" -msgstr "``INTEGER[]``" +msgid "Points of interest fill up" +msgstr "Intressanta platser fylls upp" -msgid "``ARRAY[1,2]``" -msgstr "``ARRAY[1,2]``" +msgid "Inserting the points of interest." +msgstr "Infoga intressepunkterna." -msgid "Ordered contraction operations." -msgstr "Beställde sammandragningsoperationer." +msgid "Filling the rest of the table." +msgstr "Fyller resten av bordet." -msgid "1 = Dead end contraction" -msgstr "1 = Kontraktion i återvändsgränd" +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." +msgstr "Någon annan ytterligare modifiering: I denna manual kan punkten :math:`6` nås från båda sidor." -msgid "2 = Linear contraction" -msgstr "2 = Linjär sammandragning" +msgid "The points of interest:" +msgstr "De intressanta platserna:" -msgid "``cycles``" -msgstr "``cycles``" +msgid "``pgr_floydWarshall``" +msgstr "``pgr_floydWarshall``" -msgid ":math:`1`" -msgstr ":math:`1`" +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgstr "``pgr_floydWarshall`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen." -msgid "Number of times the contraction methods will be performed." -msgstr "Antal gånger som sammandragningsmetoderna ska utföras." +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgstr "Floyd-Warshall-algoritmen, även känd som Floyds algoritm, är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *täta grafer*. Vi använder Boosts implementation som körs på :math:`\\Theta(V^3)`-tid," -msgid "``forbidden``" -msgstr "``forbidden``" +msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgstr "pgr_floydWarshall(`Kanter SQL`_, [``directed``])" -msgid "``BIGINT[]``" -msgstr "``BIGINT[]``" +msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "För en riktad delgraf med kanter :math:`\\{1, 2, 3, 4\\}`." -msgid "``ARRAY[]::BIGINT[]``" -msgstr "``ARRAY[]::BIGINT[]```" +msgid "Boost `Floyd-Warshall `_" +msgstr "Boost `Floyd-Warshall `_" -msgid "Identifiers of vertices forbidden for contraction." -msgstr "Identifierare av hörn som är förbjudna för sammandragning." +msgid "``pgr_full_version``" +msgstr "``pgr_full_version``" -msgid "The function returns a single row. The columns of the row are:" -msgstr "Funktionen returnerar en enda rad. Kolumnerna i raden är:" +msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgstr "``pgr_full_version`` - Hämta detaljerna i versionsinformationen för pgRouting." -msgid "``type``" -msgstr "``type``" +msgid "Get complete details of pgRouting version information" +msgstr "Få fullständig information om pgRouting version information" -msgid "Type of the row." -msgstr "Typ av rad." +msgid "pgr_full_version()" +msgstr "pgr_full_version()" -msgid "``v`` when the row is a vertex." -msgstr "``v`` när raden är en vertex." +msgid "RETURNS |result-version|" +msgstr "RETURNS |result-version|" -msgid "Column ``id`` has a positive value." -msgstr "Kolumnen ``id`` har ett positivt värde." +msgid "Information about when this documentation was built" +msgstr "Information om när denna dokumentation skapades" -msgid "``e`` when the row is an edge." -msgstr "``e`` när raden är en kant." +msgid "``version``" +msgstr "``version``" -msgid "Column ``id`` has a negative value." -msgstr "Kolumnen ``id`` har ett negativt värde." +msgid "pgRouting version" +msgstr "pgRouting-version" -msgid "All numbers on this column are ``DISTINCT``" -msgstr "Alla siffror i denna kolumn är ``DISTINCT``" +msgid "``build_type``" +msgstr "``build_type``" -msgid "When ``type`` = **'v'**." -msgstr "När ``typ`` = **'v'**." +msgid "The Build type" +msgstr "Typ av byggnad" -msgid "Identifier of the modified vertex." -msgstr "Identifierare för det modifierade toppunktet." +msgid "``compile_date``" +msgstr "``compile_date``" -msgid "When ``type`` = **'e'**." -msgstr "När ``typ`` = **'e'**." +msgid "Compilation date" +msgstr "Datum för sammanställning" -msgid "Decreasing sequence starting from **-1**." -msgstr "Minskande sekvens med början från **-1**." +msgid "``library``" +msgstr "``library``" -msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." -msgstr "Representerar ett pseudo-id som inte ingår i uppsättningen av ursprungliga kanter." +msgid "Library name and version" +msgstr "Bibliotekets namn och version" -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" +msgid "``system``" +msgstr "``system``" -msgid "Array of contracted vertex identifiers." -msgstr "Array med identifierare för kontrakterade vertex." +msgid "Operative system" +msgstr "Operativt system" -msgid "When ``type`` = **'v'**: :math:`-1`" -msgstr "När ``typ`` = **'v'**: :math:`-1`" +msgid "``postgreSQL``" +msgstr "``postgreSQL``" -msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." -msgstr "När ``typ`` = **'e'**: Identifierare av källvertexen för den aktuella kanten (``källa``, ``mål``)." +msgid "pgsql used" +msgstr "pgsql används" -msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." -msgstr "När ``typ`` = **'e'**: Identifierare av målvertexen för den aktuella kanten (``källa``, ``mål``)." +msgid "``compiler``" +msgstr "``compiler``" -msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." -msgstr "När ``typ`` = **'e'**: Vikt för den aktuella kanten (``källa``, ``mål``)." +msgid "Compiler and version" +msgstr "Kompilator och version" -msgid "Only dead end contraction" -msgstr "Endast återvändsgränd kontraktion" +msgid "``boost``" +msgstr "``boost``" -msgid "Only linear contraction" -msgstr "Endast linjär sammandragning" +msgid "Boost version" +msgstr "Boost-version" -msgid "The cycle" -msgstr "Cykeln" +msgid "``hash``" +msgstr "``hash``" -msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." -msgstr "Kontrahering av en graf kan göras med mer än en operation. Ordningen på operationerna påverkar den resulterande kontraherade grafen, efter att ha tillämpat en operation ändras uppsättningen toppar som kan kontraheras med en annan operation." +msgid "Git hash of pgRouting build" +msgstr "Git-hash av pgRouting-byggnaden" -msgid "This implementation cycles ``cycles`` times through the ``methods`` ." -msgstr "Denna implementation cyklar ``cyklar`` gånger genom ``metoderna`` ." +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr "``pgr_hawickCircuits`` - Experimentell" -msgid "Contracting sample data" -msgstr "Upphandling av provdata" +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgstr "``pgr_hawickCircuits`` - Returnerar listan över kretsar som använder Hawick-kretsalgoritmen." -msgid "In this section, building and using a contracted graph will be shown by example." -msgstr "I det här avsnittet visas exempel på hur man bygger upp och använder en kontraherad graf." +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgstr "Hawick Circuit algorithm, publicerades 2008 av Ken Hawick och Health A. James. Algoritmen löser problemet med att upptäcka och räkna upp kretsar i grafer. Den kan räkna upp kretsar i grafer med riktade arcs, multipla arcs och self-arcs med en minneseffektiv och högpresterande implementering. Den är en utvidgning av Johnsons algoritm för att hitta alla elementära kretsar i en riktad graf." -msgid "The :doc:`sampledata` for an undirected graph is used" -msgstr ":doc:`sampledata` för en enkelriktad graf används" +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgstr "Det finns 2 varianter definierade i Boost Graph Library. Här har vi bara implementerat den andra eftersom den är det mest lämpliga och praktiska användningsfallet. I den här varianten får vi kretsarna efter att ha filtrerat bort de kretsar som orsakas av parallella kanter. Parallella kantkretsar har fler användningsfall när du vill räkna antalet kretsar. Kanske i framtiden kommer vi också att implementera denna variation." -msgid "a dead end operation first followed by a linear operation." -msgstr "först en operation i en återvändsgränd och därefter en linjär operation." +msgid "The algorithm implementation works only for directed graph" +msgstr "Implementeringen av algoritmen fungerar endast för riktade grafer" -msgid "Construction of the graph in the database" -msgstr "Konstruktion av grafen i databasen" +msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgstr "Det är en variant av Johnsons algoritm för kretsuppräkning." -msgid "The original graph:" -msgstr "Den ursprungliga grafen:" +msgid "The algorithm outputs the distinct circuits present in the graph." +msgstr "Algoritmen matar ut de olika kretsar som finns i grafen." -msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." -msgstr "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som måste göras i grafen efter att man har tillämpat sammandragningsmetoderna." +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgstr "Tidskomplexitet: :math:`O((V + E) (c + 1))`" -msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." -msgstr "Observera att toppar, till exempel :math:`6`, inte visas i resultaten eftersom de inte påverkades av sammandragningsalgoritmen." +msgid ":math:`|c|` is the number of circuits in the graph." +msgstr ":math:`|c|` is the number of circuits in the graph." -msgid "After doing the dead end contraction operation:" -msgstr "Efter att ha gjort den återvändsgränd sammandragning operation:" +msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgstr "pgr_hawickCircuits(`Kanter SQL`_)" -msgid "After doing the linear contraction operation to the graph above:" -msgstr "Efter att ha gjort den linjära sammandragningsoperationen på grafen ovan:" +msgid "Circuits present in the pgRouting :doc:`sampledata`" +msgstr "Kretsar som finns i pgRouting :doc:`sampledata`" -msgid "The process to create the contraction graph on the database:" -msgstr "Processen för att skapa sammandragningsgrafen i databasen:" +msgid "Id of the circuit starting from ``1``" +msgstr "Id för kretsen med början från ``1``" -msgid "Add additional columns" -msgstr "Lägg till ytterligare kolumner" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgstr "Relativ position i banan. Har värdet ``0`` för början av banan" -msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" -msgstr "Lägga till extra kolumner i tabellerna edges och vertices. I denna dokumentation kommer följande att användas:" +msgid "Identifier of the starting vertex of the circuit." +msgstr "Identifierare av kretsens startvertex." -msgid "Column." -msgstr "Kolumn." +msgid "Identifier of the ending vertex of the circuit." +msgstr "Identifierare för kretsens slutpunkt." -msgid "The vertices set belonging to the vertex/edge" -msgstr "Uppsättningen av toppar som hör till toppen/kanten" +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "Identifierare av noden i sökvägen från en vid till nästa vid." -msgid "``is_contracted``" -msgstr "``is_contracted``" +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost: Hawick Circuit Algorithm `__" -msgid "On the vertex table" -msgstr "På toppunktstabellen" +msgid "``pgr_isPlanar`` - Experimental" +msgstr "``pgr_isPlanar`` - Experimentell" -msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." -msgstr "när ``true`` vertexen är kontraherad, är den inte en del av den kontraherade grafen." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgstr "``pgr_isPlanar`` - Returnerar ett boolean beroende på grafens planaritet." -msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." -msgstr "när ``false`` är vertexen inte kontraherad, den är en del av den kontraherade grafen." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgstr "En graf är plan om den kan ritas i ett tvådimensionellt rum utan att två av dess kanter korsar varandra. En sådan ritning av en plan graf kallas för en plan ritning. Varje plan graf kan också ritas med en rak linje, vilket är en plan ritning där varje kant representeras av ett linjesegment. När en graf har :math:`K_5` eller :math:`K_{3, 3}` som undergraf är grafen inte plan." -msgid "``is_new``" -msgstr "``is_new``" +msgid "This implementation use the Boyer-Myrvold Planarity Testing." +msgstr "Denna implementering använder Boyer-Myrvolds planaritetstest." -msgid "On the edge table" -msgstr "På kanten av bordet" +msgid "It will return a boolean value depending upon the planarity of the graph." +msgstr "Den returnerar ett booleskt värde som beror på grafens planhet." -msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." -msgstr "när ``true`` kanten genererades av sammandragningsalgoritmen. dess del av den sammandragna grafen." +msgid "Applicable only for **undirected** graphs." +msgstr "Gäller endast för **undirected** grafer." -msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." -msgstr "när ``false`` är kanten en originalkant, som kan vara eller inte vara en del av den kontraherade grafen." +msgid "The algorithm does not considers traversal costs in the calculations." +msgstr "Algoritmen tar inte hänsyn till traversalkostnader i beräkningarna." -msgid "Store contraction information" -msgstr "Lagra information om sammandragning" +msgid "Running time: :math:`O(|V|)`" +msgstr "Speltid: :math:`O(|V|)`" -msgid "Store the contraction results in a table." -msgstr "Spara sammandragningsresultaten i en tabell." +msgid "pgr_isPlanar(`Edges SQL`)" +msgstr "pgr_isPlanar(`Kanter SQL`)" -msgid "Update the edges and vertices tables" -msgstr "Uppdatera tabellerna för kanter och toppar" +msgid "RETURNS ``BOOLEAN``" +msgstr "RETURNERAR ``BOOLEAN``" -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "Använd kolumnen ``is_contracted`` för att ange de toppar som är kontraherade." +msgid "Returns a boolean ``(pgr_isplanar)``" +msgstr "Returnerar en boolean ``(pgr_isplanar)```" -msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." -msgstr "Fyll i ``contracted_vertices`` med informationen från de resultat som hör till topparna." +msgid "``pgr_isplanar``" +msgstr "``pgr_isplanar``" -msgid "Insert the new edges generated by pgr_contraction." -msgstr "Infoga de nya kanterna som genererats av pgr_contraction." +msgid "`true` when the graph is planar." +msgstr "`true` när grafen är planar." -msgid "The contracted graph" -msgstr "Den kontraherade grafen" +msgid "`false` when the graph is not planar." +msgstr "`false` när grafen inte är planar." -msgid "Vertices that belong to the contracted graph." -msgstr "Punkter som hör till den kontraherade grafen." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgstr "Följande kanter kommer att göra undergrafen med topparna {10, 15, 11, 16, 13} till en :math:`K_1`-graf." -msgid "Edges that belong to the contracted graph." -msgstr "Kanter som hör till den kontraherade grafen." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgstr "Den nya grafen är inte plan eftersom den har en :math:`K_5`-undergraf. Kanter i blått representerar :math:`K_5` subgraf." -msgid "Visually:" -msgstr "Visuellt:" +msgid "`Boost: Boyer Myrvold `__" +msgstr "`Boost: Boyer Myrvold `__" -msgid "Using the contracted graph" -msgstr "Använda den kontraherade grafen" +msgid "``pgr_johnson``" +msgstr "``pgr_johnson``" -msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" -msgstr "Beroende på den slutliga tillämpningen ska grafen förberedas. I detta exempel kommer den slutliga tillämpningen att vara att beräkna kostnaden från två toppar i originalgrafen genom att använda den kontraherade grafen med ``pgr_dijkstraCost``" +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgstr "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par noder i grafen med hjälp av Johnson-algoritmen." -msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" -msgstr "Det finns tre fall när man beräknar den kortaste vägen mellan en given källa och ett givet mål i en kontrakterad graf:" +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgstr "Johnson-algoritmen är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *glesa grafer*. Den använder Boosts implementation som körs på :math:`O(V E \\log V)` tid," -msgid "Case 1: Both source and target belong to the contracted graph." -msgstr "Fall 1: Både källan och målet hör till den kontrakterade grafen." +msgid "pgr johnson(`Edges SQL`_, [``directed``])" +msgstr "pgr johnson(`Kanter SQL`_, [``directed``])" -msgid "Case 2: Source and/or target belong to an edge subgraph." -msgstr "Fall 2: Källa och/eller mål tillhör en edge-subgraf." +msgid "Boost `Johnson `_" +msgstr "Boost `Johnson `_" -msgid "Case 3: Source and/or target belong to a vertex." -msgstr "Fall 3: Källa och/eller mål hör till en vertex." +msgid "``pgr_kingOrdering`` - Experimental" +msgstr "``pgr_kingOrdering`` - Experimentell" -msgid "The final application should consider all of those cases." -msgstr "Den slutliga applikationen bör ta hänsyn till alla dessa fall." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgstr "``pgr_kingOrdering`` - Returnerar King-ordningen för en odelad graf." -msgid "Create a view (or table) of the contracted graph:" -msgstr "Skapa en vy (eller tabell) av den kontraherade grafen:" +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." +msgstr "Inom numerisk linjär algebra och grafteori är King Ordering Algorithm en heuristisk metod för att omordna topparna i en graf så att bandbredden minskar." -msgid "Create the function that will use the contracted graph." -msgstr "Skapa den funktion som ska använda den kontraherade grafen." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." +msgstr "Metoden följer en BFS-traversering (breadth-first search), men med en förfining: i varje steg infogas de obesökta grannarna till det aktuella toppunktet i kön i stigande ordning efter deras pseudograd, där pseudograden för ett toppunkt är antalet kanter som ansluter det till ännu obesökta toppunkter. Den här prioriteringen ger ofta en mindre bandbredd jämfört med enklare BFS-ordning." -msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." -msgstr "Fall 2: Källa och/eller mål hör till en kant som har kontraherade toppar." +msgid "The implementation targets undirected graphs." +msgstr "Implementationen är inriktad på oledade grafer." -msgid "Case 3: Source and/or target belong to a vertex that has been contracted." -msgstr "Fall 3: Källa och/eller mål hör till en vertex som har kontrakterats." +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." +msgstr "Minimering av bandbredd är ett NP-komplett problem; King Ordering ger en praktisk lokal minimeringsmetod." -msgid "``pgr_contractionDeadEnd`` - Proposed" -msgstr "``pgr_contractionDeadEnd`` - Förslag" +msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" +msgstr "Tidskomplexiteten är: :math:`O(m^2 \\log(m)|E|)`" -msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contractionDeadEnd`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." +msgid "where :math:`|E|` is the number of edges," +msgstr "där :math:`|E|` är antalet kanter," -msgid "A node is considered a dead end node when:" -msgstr "En nod anses vara en återvändsgrändsnod när:" +msgid ":math:`m` is the maximum degree among all vertices." +msgstr ":math:`m` är den högsta graden bland alla toppar." -msgid "On undirected graphs:" -msgstr "Om odelade grafer:" +msgid "pgr_kingOrdering(`Edges SQL`_)" +msgstr "pgr_kingOrdering(`Edges SQL`_)" -msgid "The number of adjacent vertices is 1." -msgstr "Antalet angränsande hörn är 1." +msgid "`Boost: King Ordering `__" +msgstr "`Boost: Kungens beställning `__" -msgid "On directed graphs:" -msgstr "Om riktade grafer:" +msgid "``pgr_kruskal``" +msgstr "``pgr_kruskal``" -msgid "When there is only one adjacent vertex or" -msgstr "När det bara finns en angränsande toppunkt eller" +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgstr "``pgr_kruskal`` - Minsta spännviddsträd för en graf med Kruskals algoritm." -msgid "When all edges are incoming regardless of the number of adjacent vertices." -msgstr "När alla kanter är inkommande oavsett antalet angränsande toppar." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgstr "Denna algoritm hittar den minsta spännvidden i en eventuellt frånkopplad graf med hjälp av Kruskals algoritm." -msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionDeadEnd(`Kanter SQL`_, [**options**])" +msgid "EMPTY SET is returned when there are no edges in the graph." +msgstr "EMPTY SET returneras när det inte finns några kanter i grafen." -msgid "**options:** ``[directed, forbidden]``" -msgstr "**options:** ``[directed, forbidden]``" +msgid "pgr_kruskal(`Edges SQL`_)" +msgstr "pgr_kruskal(`Kanter SQL`_)" -msgid "Dead end contraction on an undirected graph." -msgstr "Sammandragning av återvändsgränder i en odelad graf." +msgid "Returns set of |result-mst|" +msgstr "Returnerar uppsättning av |result-mst|" -msgid "The green nodes are dead end nodes." -msgstr "De gröna noderna är återvändsgrändsnoder." +msgid "Minimum spanning forest" +msgstr "Skog med minsta spann" -msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." -msgstr "Noden :math:`3` är en återvändsgränd efter att noden :math:`1` har dragits in." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgstr "``pgr_kruskalBFS`` - Kruskals algoritm för minsta spännviddsträd med bredd först sökordning." -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "``ARRAY[`` |ANY-INTEGER| ``]`` ``" +msgid "Added ``pred`` result columns." +msgstr "Lagt till ``pred`` resultatkolumner." -msgid "**Empty**" -msgstr "**Empty**" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Kruskals algoritm." -msgid "Value = ``e`` indicating the row is an edge." -msgstr "Värde = ``e`` som anger att raden är en kant." +msgid "Returned tree nodes from a root vertex are on Breath First Search order" +msgstr "Returnerade trädnoder från en rotvertex är på Breath First Search-ordning" -msgid "A pseudo `id` of the edge." -msgstr "Ett pseudo \"id\" för kanten." +msgid "Breath First Search Running time: :math:`O(E + V)`" +msgstr "Breath First Search Speltid: :math:`O(E + V)`" -msgid "Identifier of the source vertex of the current edge." -msgstr "Identifierar källvertexen för den aktuella kanten." +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_kruskalBFS(`Kanter SQL`_, **root vid**, [``max_depth``])" -msgid "Identifier of the target vertex of the current edge." -msgstr "Identifierare av målvertexen för den aktuella kanten." +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_kruskalBFS(`Kanter SQL`_, **root vids**, [``max_depth``])" -msgid "Weight of the current edge." -msgstr "Vikt för den aktuella kanten." +msgid "The Minimum Spanning Tree having as root vertex :math:`6`" +msgstr "Det minsta spännviddsträdet som har som rotvertex :math:`6``" -msgid "Dead end vertex on undirected graph" -msgstr "Dead end-knutpunkt på odelad graf" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`djup \\leq 3`" -msgid "They have only one adjacent node." -msgstr "De har bara en angränsande nod." +msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." +msgstr "``pgr_kruskalDD`` - Fångar upp noder med hjälp av Kruskals algoritm." -msgid "Dead end vertex on directed graph" -msgstr "Dead end-knutpunkt på riktad graf" +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgstr "Använd Kruskals algoritm för att extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett **avstånd** från en **rot**-vertex (eller vertex) inom det beräknade minsta spännvidden i trädet." -msgid "The green nodes are dead end nodes" -msgstr "De gröna noderna är återvändsgrändsnoder" +msgid "Returned tree nodes from a root vertex are on Depth First Search order." +msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning." -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." -msgstr "De blå noderna har ett obegränsat antal inkommande och/eller utgående kanter." +msgid "Depth First Search running time: :math:`O(E + V)`" +msgstr "Djup Första sökning Löptid: :math:`O(E + V)`" -msgid "Node" -msgstr "Nod" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" +msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vid**, **distance**)" -msgid "Adjacent nodes" -msgstr "Angränsande noder" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" +msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vids**, **distance**)" -msgid "Dead end" -msgstr "Död återvändsgränd" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgstr "Det minsta spännviddsträdet som börjar på toppunkten :math:`6` med :math:`avstånd \\leq 3.5`" -msgid "Reason" -msgstr "Orsak" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`avstånd \\leq 3.5`" -msgid ":math:`6`" -msgstr ":math:`6`" +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_kruskalDFS`` - Kruskals algoritm för minsta spännviddsträd med djup första sökordning." -msgid ":math:`\\{1\\}`" -msgstr ":math:`\\{1\\}`" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Kruskals algoritm." -msgid "Yes" -msgstr "Ja" +msgid "Returned tree nodes from a root vertex are on Depth First Search order" +msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning" -msgid "Has only one adjacent node." -msgstr "Har endast en angränsande nod." +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_kruskalDFS(`Kanter SQL`_, **root vid**, [``max_depth``])" -msgid ":math:`7`" -msgstr ":math:`7`" +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_kruskalDFS(`Kanter SQL`_, **root vids**, [``max_depth``])" -msgid ":math:`\\{2\\}`" -msgstr ":math:`\\{2\\}`" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimentell" -msgid ":math:`8`" -msgstr ":math:`8`" +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgstr "``pgr_lengauerTarjanDominatorTree`` - Returnerar den omedelbara dominatorn för alla toppar." -msgid ":math:`\\{2, 3\\}`" -msgstr ":math:`\\{2, 3\\}`" +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgstr "Algoritmen beräknar den * omedelbara dominatorn * för varje toppunkt som kallas **idom**, när **idom** för varje toppunkt har beräknats genom att göra varje **idom** för varje toppunkt som dess förälder, kan dominatorträdet byggas." -msgid "Has more than one adjacent node and all edges are incoming." -msgstr "Har mer än en angränsande nod och alla kanter är inkommande." +msgid "The algorithm works in directed graph only." +msgstr "Algoritmen fungerar endast i riktade grafer." -msgid ":math:`\\{4\\}`" -msgstr ":math:`\\{4\\}`" +msgid "The algorithm returns *idom* of each vertex." +msgstr "Algoritmen returnerar *idom* för varje toppunkt." -msgid ":math:`10`" -msgstr ":math:`10`" +msgid "If the *root vertex* not present in the graph then it returns empty set." +msgstr "Om *rotvertexet* inte finns i grafen returneras en tom uppsättning." -msgid ":math:`\\{4, 5\\}`" -msgstr ":math:`\\{4, 5\\}`" +msgid "Running time: :math:`O((V+E)log(V+E))`" +msgstr "Drifttid: :math:`O((V+E)log(V+E))`" -msgid "No" -msgstr "Nej" +msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" +msgstr "pgr_lengauerTarjanDominatorTree(`Kanter SQL`_, **root vertex**)" -msgid "Has more than one adjacent node and all edges are outgoing." -msgstr "Har mer än en angränsande nod och alla kanter är utgående." +msgid "Returns set of |result-idom|" +msgstr "Returnerar uppsättning av |result-idom|" -msgid ":math:`1,2,3,4,5`" -msgstr ":math:`1,2,3,4,5`" +msgid "The dominator tree with root vertex :math:`5`" +msgstr "Dominatorträdet med rotvertex :math:`5`" -msgid "Many adjacent nodes." -msgstr "Många angränsande noder." +msgid "SQL query as described above." +msgstr "SQL-fråga enligt beskrivningen ovan." -msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." -msgstr "Har mer än en angränsande nod och vissa kanter är inkommande och vissa är utgående." +msgid "**root vertex**" +msgstr "**Rot toppunkt**" -msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." -msgstr "Ovan är noderna :math:`\\{6, 7, 9\\}` återvändsgränder eftersom det totala antalet angränsande hörn är ett." +msgid "Returns set of ``(seq, vertex_id, idom)``" +msgstr "Returnerar uppsättning av ``(seq, vertex_id, idom)``" -msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." -msgstr "När det finns mer än ett angränsande toppunkt måste alla kanter vara alla inkommande kanter, annars är det inte en återvändsgränd." +msgid "``vertex_id``" +msgstr "``vertex_id``" -msgid "Step by step dead end contraction" -msgstr "Steg för steg återvändsgränd sammandragning" +msgid "Identifier of vertex ." +msgstr "Identifierare för toppunkt ." -msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" -msgstr "Sammandragningen av återvändsgränder kommer att upphöra tills det inte finns några fler återvändsgrändsnoder. Till exempel, från följande graf där :math:`3` är återvändsgränden:" +msgid "``idom``" +msgstr "``idom``" -msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" -msgstr "Efter kontrakteringen av :math:`3` är noden :math:`2` nu en återvändsgränd och kontrakteras:" +msgid "Immediate dominator of vertex." +msgstr "Omedelbar dominator av toppunkt." -msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." -msgstr "Efter att ha dragit in :math:`2`, sluta. Noden :math:`1` har information om de noder som kontrakterades." +msgid "Dominator tree of another component." +msgstr "Dominant träd av en annan komponent." -msgid "Creating the contracted graph" -msgstr "Skapa den kontraherade grafen" +msgid "`Boost: Lengauer-Tarjan dominator `__" +msgstr "`Boost: Lengauer-Tarjan dominator `__" -msgid "Steps for the creation of the contracted graph" -msgstr "Steg för att skapa den avtalade grafen" +msgid "`Wikipedia: dominator tree `__" +msgstr "`Wikipedia: dominatorträd `__" -msgid "Add additional columns." -msgstr "Lägg till ytterligare kolumner." +msgid "``pgr_lineGraph`` - Proposed" +msgstr "``pgr_lineGraph`` - Föreslagen" -msgid "Save results into a table." -msgstr "Spara resultaten i en tabell." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgstr "``pgr_lineGraph`` - Transformerar den givna grafen till dess motsvarande kantbaserade graf." -msgid "The contracted vertices are not part of the contracted graph." -msgstr "De kontraherade topparna är inte en del av den kontraherade grafen." +msgid "Works for directed and undirected graphs." +msgstr "Fungerar för riktade och oriktade grafer." -msgid "Using when departure and destination are in the contracted graph" -msgstr "Används när avgång och destination ligger i den kontrakterade grafen" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgstr "Givet en graf :math:`G`, är dess linjegraf :math:`L(G)` en sådan graf att:" -msgid "Using when departure/destination is not in the contracted graph" -msgstr "Används när avgång/destination inte finns i den avtalade grafen" +msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." +msgstr "Varje toppunkt i :math:`L(G)` representerar en kant i :math:`G`." -msgid "Using when departure and destination are not in the contracted graph" -msgstr "Används när avgång och destination inte finns i den avtalade grafen" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgstr "Två hörn i :math:`L(G)` är angränsande om och endast om deras motsvarande kanter har en gemensam ändpunkt i :math:`G`" -msgid "``pgr_contractionHierarchies`` - Experimental" -msgstr "``pgr_contractionHierarchies`` - Experimentell" +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgstr "Kolumnerna ``cost`` och ``reverse_cost`` i resultatet representerar existensen av kanten." -msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." -msgstr "``pgr_contractionHierarchies`` - Utför grafkontraktion enligt metoden contraction hierarchies och returnerar de kontraherade topparna och de skapade genvägskanterna." +msgid "When the graph is directed the result is directed." +msgstr "När grafen är riktad är resultatet riktat." -msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." -msgstr "Contraction Hierarchies-metoden bygger, från en initial ordning av topparna, en hierarkisk ordning som prioriterar vissa toppar under bearbetningen av kortaste vägar-algoritmernas etikettfixering. Dessutom lägger algoritmen för sammandragningshierarkier till genvägskanter i grafen, vilket hjälper algoritmen för kortaste vägar att följa den skapade hierarkiska grafstrukturen." +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." +msgstr "För att få en komplett linjediagram används unika identifierare på dubbelvägskanterna (se `Ytterligare exempel`_)." -msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." -msgstr "Tanken med hierarkin är att ge hög prioritet åt toppar som tillhör det långväga nätet (t.ex. motorvägar i ett vägnät) och låg prioritet åt noder som tillhör det kortväga nätet (t.ex. artärer eller sekundära vägar i ett vägnät)." +msgid "When the graph is undirected the result is undirected." +msgstr "När grafen är odränerad är resultatet odränerat." -msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." -msgstr "Algoritmen för sammandragningshierarkier förutsätter att det redan finns en värdefull nodordning som används för att initiera sammandragningsprocessen. Eftersom det i de flesta fall inte finns någon värdefull initial nodordning använder vi den ordning som ges av vertices ID. Sedan görs sammandragningsprocessen på grundval av denna första ordning för att ge den slutliga hierarkin." +msgid "The ``reverse_cost`` is always :math:`-1`." +msgstr "Den ``omvända_kostnaden`` är alltid :math:`-1`." -msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." -msgstr "Grundidén är att hålla topparna i en prioritetskö sorterade efter någon uppskattning av hur attraktiv deras sammandragning är. I det implementerade fallet används ett mått som kallas *edge difference*, vilket motsvarar skillnaden mellan antalet genvägar som produceras av en vertexkontraktion och antalet infallande kanter i grafen före kontraktionen (``#shortcuts - #incident edges``)." +msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" +msgstr "pgr_lineGraph(`Kanter SQL`_, [``directed``])" -msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." -msgstr "Slutligen är målet att minska den utforskade delen av grafen när man använder en dubbelriktad Dijkstra-liknande algoritm. Topparnas ordning används för att mata den orienterade sökningen. Sökningen görs utan att förlora optimalitet." +msgid "Returns set of |result-lineg|" +msgstr "Returnerar uppsättning av |result-lineg|" -msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." -msgstr "Det är ett svårt problem att hitta en optimal ordning på topparna för sammandragning. Ändå fungerar mycket enkla lokala heuristiker ganska bra, enligt Geisberger et al [2]. Principen här är att på förhand uppskatta värdet på *kantskillnaden* och att dra ihop noden högst upp i kön endast om det nya värdet på metriken håller den kvar högst upp i kön. I annat fall återinsätts den i kön på sin rätta plats som motsvarar det nya metriska värdet." +msgid "For an undirected graph with edges :math:'{2,4,5,8}'" +msgstr "För en enkelriktad graf med kanter :math:'{2,4,5,8}'" -msgid "The process is done on graphs having only edges with positive costs." -msgstr "Processen görs på grafer som bara har kanter med positiva kostnader." +msgid "Gives a local identifier for the edge" +msgstr "Ger en lokal identifierare för kanten" -msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." -msgstr "Det är nödvändigt att komma ihåg att det inte finns några borttagna toppar med denna funktion. I slutet behåller grafen alla toppar den hade, men har några extra kanter som motsvarar genvägar. De toppar som har dragits ihop för att bygga upp genvägskanterna behålls och ordnas hierarkiskt." +msgid "When `negative`: the source is the reverse edge in the original graph." +msgstr "När `negativ`: källan är den omvända kanten i den ursprungliga grafen." -msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" -msgstr "När det gäller de andra kontraktionsmetoderna returneras inte hela den kontraherade grafen, utan endast förändringarna. De är här av två typer:" +msgid "When `negative`: the target is the reverse edge in the original graph." +msgstr "När `negativ`: målet är den omvända kanten i den ursprungliga grafen." -msgid "added shortcut edges, with negative identifiers;" -msgstr "lagt till genvägskanter, med negativa identifierare;" +msgid "Weight of the edge (``source``, ``target``)." +msgstr "Kantvikt (``källa``, ``mål``)." -msgid "contracted nodes with an order." -msgstr "kontrakterade noder med en order." +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." +msgstr "När `negativ`: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen." -msgid "The ``pgr_contractionHierarchies`` function has the following signature:" -msgstr "Funktionen ``pgr_contractionHierarchies`` har följande signatur:" +msgid "Weight of the edge (``target``, ``source``)." +msgstr "Kantvikt (``mål``, ``källa``)." -msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionHierarchies(`Kanter SQL`_, [**options**])" +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgstr "När `negativ`: kant (``mål``, ``källa``) finns inte, därför är den inte en del av grafen." -msgid "Returns set of |result-contraction-hierarchies|" -msgstr "Returnerar uppsättning av |result-contraction-hierarchies|" +msgid "Given the following directed graph" +msgstr "Givet följande riktade graf" -msgid "Contraction hierarchies optional parameters" -msgstr "Sammandragningshierarkier valfria parametrar" +msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" -msgid "True if the graph is directed, False otherwise." -msgstr "True om grafen är riktad, False annars." +msgid "Representation as directed with shared edge identifiers" +msgstr "Representation som riktad med delade kantidentifierare" -msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" -msgstr "Funktionen returnerar många rader (en per toppunkt och en per skapad genvägskant). Kolumnerna i raderna är:" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" +msgstr "För enkelhetens skull har utformningen av kanttabellen i databasen, att kanternas identifierare representeras med 3 siffror:" -msgid "Type of the ``id``." -msgstr "Typ av ``id``." +msgid "hundreds" +msgstr "hundratals" -msgid "Column ``id`` has a positive value" -msgstr "Kolumnen ``id`` har ett positivt värde" +msgid "the source vertex" +msgstr "källvertexen" -msgid "Column ``id`` has a negative value" -msgstr "Kolumnen ``id`` har ett negativt värde" +msgid "tens" +msgstr "tiotals" -msgid "``metric``" -msgstr "``metric``" +msgid "always 0, acts as a separator" +msgstr "alltid 0, fungerar som en separator" -msgid "``vertex_order``" -msgstr "``vertex_order``" +msgid "units" +msgstr "enheter" -msgid "On an undirected graph" -msgstr "På en odelad graf" +msgid "the target vertex" +msgstr "målvertexen" -msgid "The following query shows the original data involved in the contraction operation on an undirected graph." -msgstr "Följande fråga visar de ursprungliga data som är involverade i sammandragningsoperationen på en oriktad graf." +msgid "In this image," +msgstr "I den här bilden," -msgid "building contraction hierarchies on the whole graph" -msgstr "bygga sammandragningshierarkier på hela grafen" +msgid "Single or double head arrows represent one edge (row) on the edges table." +msgstr "Pilarna med enkelt eller dubbelt huvud representerar en kant (rad) på kanttabellen." -msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." -msgstr "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som gjorts i grafen efter tillämpning av sammandragningsalgoritmen och ger den vertexordning som algoritmen bygger upp genom att ordna vertex enligt *edge difference*-metriken. Som en följd av detta finns alla toppar representerade i resultatet (utom naturligtvis förbjudna). Endast genvägar som byggts av algoritmen finns representerade i resultatet." +msgid "The numbers in the yellow shadow are the edge identifiers." +msgstr "Siffrorna i den gula skuggan är kantidentifierare." -msgid "After computing the contraction hierarchies, an order is now given to the vertices," -msgstr "Efter att ha beräknat sammandragningshierarkierna ges nu en ordning till topparna," +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgstr "Två par kanter delar samma identifierare när kolumnen ``reverse_cost`` används." -msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." -msgstr "för att kunna användas med en specifik Dijkstra-algoritm (implementering kommer i en framtida version), som snabbar upp sökningen." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras av en kantrad med :math:`id=203`." -msgid "We obtain the contracted graph above:" -msgstr "Vi får den kontraherade grafen ovan:" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras av en kantrad med :math:`id=304`." -msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." -msgstr "Vi kan utan överraskning se att de toppar som tillhör genvägarna har en tendens att ha en hög prioritetsnivå i den resulterande topparnas ordning." +msgid "The graph can be created as follows:" +msgstr "Grafen kan skapas på följande sätt:" -msgid "On an undirected graph with forbidden vertices" -msgstr "På en odelad graf med förbjudna toppar" +msgid "Line Graph of a directed graph represented with shared edges" +msgstr "Linjediagram över en riktad graf som representeras med delade kanter" -msgid "building contraction with a set of forbidden vertices" -msgstr "bygga sammandragning med en uppsättning förbjudna toppar" +msgid "The result is a directed graph." +msgstr "Resultatet är en riktad graf." -msgid "Contraction process steps details" -msgstr "Detaljer för sammandragningsprocessens steg" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgstr "För :math:`seq=4` från :math:`203 \\vänster höger pil 304` representerar två kanter" -msgid "Shortcut building process" -msgstr "Genväg till byggprocessen" +msgid "For all the other values of ``seq`` represent one edge." +msgstr "För alla andra värden av ``seq`` representerar en kant." -msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." -msgstr "En topp ``v`` dras samman genom att lägga till genvägar som ersätter tidigare vägar av formen ``(u, v, w)`` med en kant ``(u, w)``. Genvägen ``(u, w)`` behövs bara när ``(u, v, w)`` är den enda kortaste vägen mellan ``u`` och ``w``." +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgstr "Värdena ``cost`` och ``reverse_cost`` anger om kanten existerar." -msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." -msgstr "När alla genvägar har lagts till för ett givet toppunkt ``v`` tas de infallande kanterna för ``v`` bort och ett nytt toppunkt dras samman med den återstående grafen." +msgid "When positive: the edge exists." +msgstr "När den är positiv: kanten finns." -msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." -msgstr "Förfarandet är destruktivt för grafen och en kopia görs för att kunna manipulera den igen som en helhet. Kontraktionsprocessen lägger till alla upptäckta genvägar till kantuppsättningen ``E`` och tilldelar en metrik till varje kontraherad vertex. Denna metrik ger det som kallas *kontraktionshierarkin*." +msgid "When negative: the edge does not exist." +msgstr "När den är negativ: kanten existerar inte." -msgid "Initialize the queue with a first vertices order" -msgstr "Initiera kön med en ordning för första toppar" +msgid "Representation as directed with unique edge identifiers" +msgstr "Representation som riktad med unika kantidentifierare" -msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" -msgstr "För varje topp ``v`` i grafen byggs en sammandragning av ``v``:" +msgid "Single head arrows represent one edge (row) on the edges table." +msgstr "Pilarna med ett huvud representerar en kant (rad) i tabellen över kanter." -msgid ":math:`v`" -msgstr ":math:`v`" +msgid "There are no double head arrows" +msgstr "Det finns inga pilar med dubbla huvuden" -msgid ":math:`\\{p, r, u\\}`" -msgstr ":math:`\\{p, r, u\\}`" +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgstr "Två par kanter har samma slutnoder och kolumnen ``reverse_cost`` används inte." -msgid ":math:`p`" -msgstr ":math:`p`" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras med två kanter :math:`id=203` respektive :math:`id=302`." -msgid ":math:`\\{u, v\\}`" -msgstr ":math:`\\{u, v\\}`" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras med två kanter :math:`id=304` respektive :math:`id=403`." -msgid ":math:`u`" -msgstr ":math:`u`" +msgid "Line Graph of a directed graph represented with unique edges" +msgstr "Linjediagram över en riktad graf som representeras med unika kanter" -msgid ":math:`\\{p, v, w\\}`" -msgstr ":math:`\\{p, v, w\\}`" +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgstr "För :math:`seq=7` från :math:`203 \\leftrightarrow 302` representerar två kanter." -msgid ":math:`r`" -msgstr ":math:`r`" +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgstr "För :math:`seq=8` från :math:`304 \\vänster höger pil 403` representerar två kanter." -msgid ":math:`\\{v, w\\}`" -msgstr ":math:`\\{v, w\\}`" +msgid "wikipedia: `Line Graph `__" +msgstr "wikipedia: `Linjediagram `__" -msgid ":math:`w`" -msgstr ":math:`w`" +msgid "mathworld: `Line Graph `__" +msgstr "mathworld: `Linjegraf `__" -msgid ":math:`\\{r, u\\}`" -msgstr ":math:`\\{r, u\\}`" +msgid "``pgr_lineGraphFull`` - Experimental" +msgstr "``pgr_lineGraphFull`` - Experimentell" -msgid "Adjacent edges are removed." -msgstr "Intilliggande kanter tas bort." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgstr "``pgr_lineGraphFull`` - Transformerar en given graf till en ny graf där alla hörn från den ursprungliga grafen konverteras till linjegrafer." -msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." -msgstr "Genvägar byggs från föregångare till ``v`` till efterföljare till ``v`` om och endast om vägen genom ``v`` motsvarar den enda kortaste vägen mellan föregångaren och efterföljaren till ``v`` i grafen. Måttet *kantskillnad* antar här värdet -2." +msgid "Version 2.6.0" +msgstr "Version 2.6.0" -msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." -msgstr "Därefter kontraheras följande toppunkt. Processen fortsätter tills varje nod i grafen har dragits samman. I slutet finns det inte längre några kanter i grafen, som har förstörts av processen." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgstr "``pgr_lineGraphFull``, konverterar en ursprunglig riktad graf till en riktad linjegraf genom att konvertera varje vertex till en komplett graf och behålla alla ursprungliga kanter. De nya anslutande kanterna har en kostnad på 0 och går mellan de intilliggande ursprungliga kanterna, med respekt för riktningen." -msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." -msgstr "Denna första sammandragning ger en vertices-ordning, som ges genom att ordna dem i stigande ordning på metriken (kantskillnaden). En total vertices-ordning byggs upp. Om ``u < v``, så är ``u`` mindre viktig än ``v``. Algoritmen håller topparna i en kö i denna ordning." +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgstr "En möjlig tillämpning av den resulterande grafen är **\"routing med två kantbegränsningar\"**:" -msgid "A hierarchy will now be constructed by contracting again the vertices in this order." -msgstr "En hierarki kommer nu att konstrueras genom att åter kontrahera topparna i denna ordning." +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgstr "Ställer in en kostnad för att använda vertexen vid routing mellan kanter på den anslutande kanten" -msgid "Build the final vertex order" -msgstr "Bygg den slutliga toppunktsordningen" +msgid "Forbid the routing between two edges by removing the connecting edge" +msgstr "Förbjud routing mellan två kanter genom att ta bort den anslutande kanten" -msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." -msgstr "När den första ordern har byggts använder algoritmen den för att bläddra igenom grafen igen. För varje toppunkt som tas upp i kön simulerar algoritmen sammandragning och beräknar dess kantskillnad. Om det beräknade värdet är större än värdet för nästa toppunkt som ska dras ihop, lägger algoritmen tillbaka den i kön (heuristisk metod). I annat fall dras den in permanent." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgstr "Detta är möjligt eftersom alla korsningar (hörnpunkter) i den ursprungliga grafen nu är kompletta grafer som har en ny kant för varje möjlig sväng över korsningen." -msgid "Add shortcuts to the initial graph" -msgstr "Lägga till genvägar till den initiala grafen" +msgid "This function is for **directed** graphs." +msgstr "Denna funktion är avsedd för **riktade** grafer." -msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." -msgstr "I slutet tar algoritmen den ursprungliga grafen (före borttagning av kanter) och lägger till genvägskanterna till den. På så sätt får man en sammandragen graf, redo att användas med en specialiserad Dijkstra-algoritm, som tar hänsyn till nodernas ordning i hierarkin." +msgid "Results are undefined when a negative vertex id is used in the input graph." +msgstr "Resultaten är odefinierade när ett negativt vertex-id används i indatagrafen." -msgid "Use the contraction" -msgstr "Använd sammandragning" +msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgstr "Resultaten är odefinierade när ett duplicerat kant-ID används i indatagrafen." -msgid "Build the contraction" -msgstr "Bygg sammandragningen" +msgid "Running time: TBD" +msgstr "Löptid: TBD" -msgid "Add shortcuts and hierarchy in the existing tables" -msgstr "Lägg till genvägar och hierarki i befintliga tabeller" +msgid "pgr_lineGraphFull(`Edges SQL`_)" +msgstr "pgr_lineGraphFull(`Kanter SQL`_)" -msgid "Add new columns in the `vertices` and `edges` tables to store the results:" -msgstr "Lägg till nya kolumner i tabellerna `vertices` och `edges` för att lagra resultaten:" +msgid "Returns set of |result-linegf|" +msgstr "Returnerar uppsättning av |result-linegf|" -msgid "Update and insert the results in the two tables." -msgstr "Uppdatera och infoga resultaten i de två tabellerna." +msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" +msgstr "Fullständig linjegraf av delgraf av kanter :math:`{\\4, 7, 8, 10\\}`" -msgid "Use a Dijkstra shortest path algorithm on it" -msgstr "Använd en Dijkstra-algoritm för kortaste vägen på den" +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgstr "Exemplen inkluderar delgrafen som innehåller kanterna 4, 7, 8 och 10 med ``reverse_cost``." -msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" -msgstr "Sedan kan du använda vilken Dijkstra-liknande algoritm som helst och vänta på den anpassade algoritmen som tar hänsyn till den uppbyggda toppunktshierarkin. Till exempel:" +msgid "The data" +msgstr "Uppgifterna" -msgid "``pgr_contractionLinear`` - Proposed" -msgstr "``pgr_contractionLinear`` - Föreslagen" +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgstr "Detta exempel visar hur denna grafomvandling fungerar för att skapa ytterligare kanter för varje möjlig vändning i en graf." -msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contractionLinear`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." +msgid "|first|" +msgstr "|first|" -msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionLinear(`Kanter SQL`_, [**options**])" +msgid "first" +msgstr "första" -msgid "Linear contraction on an undirected graph." -msgstr "Linjär sammandragning på en odelad graf." +msgid "The transformation" +msgstr "Omvandlingen" -msgid "The green nodes are linear nodes and will not be part of the contracted graph." -msgstr "De gröna noderna är linjära noder och kommer inte att vara en del av den kontrakterade grafen." +msgid "|second|" +msgstr "|second|" -msgid "All edges adjacent will not be part of the contracted graph." -msgstr "Alla angränsande kanter kommer inte att vara en del av den kontraherade grafen." +msgid "second" +msgstr "sekund" -msgid "The red lines will be new edges of the contracted graph." -msgstr "De röda linjerna kommer att vara nya kanter i den kontraherade grafen." +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgstr "I den transformerade grafen finns alla kanter från den ursprungliga grafen kvar (gult), men vi har nu ytterligare kanter för varje sväng som skulle kunna göras över toppunkt 7 (orange)." -msgid "**contraction Order**" -msgstr "**contraction Order**" +msgid "Creating table that identifies transformed vertices" +msgstr "Skapa tabell som identifierar transformerade toppar" -msgid "Number of times the contraction operations on ``contraction_order`` will be performed." -msgstr "Antal gånger som sammandragningsoperationerna på ``contraction_order`` kommer att utföras." +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgstr "Varje toppunkt i den transformerade grafen skapas genom att dela upp toppunkterna i den ursprungliga grafen. Om inte en vertex i den ursprungliga grafen är en bladvertex kommer den att generera mer än en vertex i den transformerade grafen. Ett av de nyskapade vertexen i den transformerade grafen får samma vertexidentifierare som det vertex som det skapades från i den ursprungliga grafen, men resten av de nyskapade vertexen får negativa vertexidentifierare." -msgid "A node connects two (or more) `linear` edges when" -msgstr "En nod förbinder två (eller fler) `linjära` kanter när" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgstr "Här följer ett exempel på hur man genererar en tabell som mappar id:n för de nyskapade topparna med den ursprungliga topp som de skapades från" -msgid "The number of adjacent vertices is 2." -msgstr "Antalet angränsande hörn är 2." +msgid "Store edge results" +msgstr "Förvara kantresultat" -msgid "In case of a directed graph, a node is considered a `linear` node when" -msgstr "I en riktad graf anses en nod vara en \"linjär\" nod när" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" +msgstr "Det första steget är att lagra resultatet av anropet ``pgr_lineGraphFull`` i en tabell" -msgid "Linearity is symmetrical." -msgstr "Linjäriteten är symmetrisk." +msgid "Create the mapping table" +msgstr "Skapa mappningstabellen" -msgid "Linearity is not symmetrical" -msgstr "Linjäriteten är inte symmetrisk" +msgid "From the original graph's vertex information" +msgstr "Från den ursprungliga grafens toppunktsinformation" -msgid "Graph where linearity is not symmetrical." -msgstr "Graf där linjäriteten inte är symmetrisk." +msgid "Add the new vertices" +msgstr "Lägg till de nya hörnen" -msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." -msgstr "När grafen bearbetas som en riktad graf är linjäriteten inte symmetrisk, och grafen kan därför inte dras ihop." +msgid "Filling the mapping table" +msgstr "Fylla kartläggningstabellen" -msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." -msgstr "När samma graf behandlas som en odelad graf är linjäriteten symmetrisk och grafen kan därför krympas." +msgid "The positive vertex identifiers are the original identifiers" +msgstr "De positiva vertexidentifierarna är de ursprungliga identifierarna" -msgid "The three edges can be replaced by one undirected edge" -msgstr "De tre kanterna kan ersättas med en ostyrd kant" +msgid "Inspecting the vertices map" +msgstr "Inspektion av kartan över hörnpunkter" -msgid "Edge :math:`1 - 3`." -msgstr "Kant :math:`1 - 3`." +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgstr "Självslingorna uppstår när det inte kostar något att resa till \"målet\" och källan har ett ursprungligt värde." -msgid "With cost: :math:`4`." -msgstr "Med kostnad: :math:`4`." +msgid "Updating values from self loops" +msgstr "Uppdatering av värden från självloopar" -msgid "Contracted vertices in the edge: :math:`\\{2\\}`." -msgstr "Sammandragna hörn i kanten: :math:`\\{2\\}`." +msgid "Inspecting the vertices table" +msgstr "Inspektera tabellen över hörnpunkter" -msgid "Linearity is symmetrical" -msgstr "Linjäriteten är symmetrisk" +msgid "Updating from inner self loops" +msgstr "Uppdatering från inre självloopar" -msgid "Graph where linearity is symmetrical." -msgstr "Graf där linjäriteten är symmetrisk." +msgid "Adding a soft restriction" +msgstr "Lägga till en mjuk begränsning" -msgid "The four edges can be replaced by two directed edges." -msgstr "De fyra kanterna kan ersättas av två riktade kanter." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." +msgstr "En mjuk begränsning som går från toppunkt 6 till toppunkt 3 med hjälp av kanterna 4 -> 7 önskas." -msgid "Edge :math:`3 - 1`." -msgstr "Kant :math:`3 - 1`." +msgid "Identifying the restriction" +msgstr "Identifiering av begränsningen" -msgid "With cost: :math:`6`." -msgstr "Med kostnad: :math:`6`." +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgstr "Kör en :doc:`pgr_dijkstraNear` kanten med kostnad 0, kant 8, är där kostnaden kommer att ökas" -msgid "The four edges can be replaced by one undirected edge." -msgstr "De fyra kanterna kan ersättas med en ostyrd kant." +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgstr "Kanten som ska ändras är ``WHERE cost = 0 AND seq != 1 AND edge != -1`` från den föregående frågan:" -msgid "Step by step linear contraction" -msgstr "Steg för steg linjär sammandragning" +msgid "Adding a value to the restriction" +msgstr "Lägga till ett värde till begränsningen" -msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" -msgstr "Den linjära sammandragningen upphör när det inte längre finns några linjära kanter. Till exempel från följande graf finns det linjära kanter" +msgid "Updating the cost to the edge:" +msgstr "Uppdatering av kostnaden till kanten:" -msgid "Contracting vertex :math:`3`," -msgstr "Contracting vertex :math:`3`," +msgid "Routing from :math:`6` to :math:`3`" +msgstr "Omdirigering från :math:`6` till :math:`3`" -msgid "The vertex :math:`3` is removed from the graph" -msgstr "Toppunkten :math:`3` tas bort från grafen" +msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." +msgstr "Nu använder rutten inte kant 8 och gör en U-sväng på en bladvertex." -msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." -msgstr "Kanterna :math:`2 \\rightarrow 3` och :math:`w \\rightarrow z` tas bort från grafen." +msgid "Simplifying leaf vertices" +msgstr "Förenkling av bladhörnpunkter" -msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." -msgstr "En ny kant :math:`2 \\rightarrow 4` infogas representerad med röd färg." +msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgstr "I det här exemplet tillkommer ingen extra kostnad för att passera en bladvertex." -msgid "Contracting vertex :math:`2`:" -msgstr "Kontraherande vertex :math:`2`:" +msgid "Using the vertex map give the leaf verices their original value." +msgstr "Med hjälp av vertexkartan ger du bladvertices deras ursprungliga värde." -msgid "The vertex :math:`2` is removed from the graph" -msgstr "Toppunkten :math:`2` tas bort från grafen" +msgid "On the source column" +msgstr "På källkolumnen" -msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." -msgstr "Kanterna :math:`1 \\rightarrow 2` och :math:`2 \\rightarrow 3` tas bort från grafen." +msgid "On the target column" +msgstr "På målkolumnen" -msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." -msgstr "En ny kant :math:`1 \\rightarrow 3` infogas representerad med röd färg." +msgid "Removing self loops on leaf nodes" +msgstr "Ta bort självloopar på bladnoder" -msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." -msgstr "Edge :math:`1 \\rightarrow 3` har information om kostnad och de noder som kontrakterades." +msgid "The self loops of the leaf nodes are" +msgstr "Bladnodernas självslingor är" -msgid "Create the contracted graph." -msgstr "Skapa den kontraherade grafen." +msgid "Which can be removed" +msgstr "Som kan tas bort" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "``pgr_cuthillMckeeOrdering`` - Experimentell" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgstr "Routing kan nu göras med hjälp av originalvertices id med :doc:`pgr_dijkstra`" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" -msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf" +msgid "Complete routing graph" +msgstr "Komplett routningsgraf" -msgid "Version 3.4.0" -msgstr "Version 3.4.0" +msgid "Add edges from the original graph" +msgstr "Lägg till kanter från den ursprungliga grafen" -msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." -msgstr "Inom numerisk linjär algebra är Cuthill-McKee-algoritmen (CM), uppkallad efter Elizabeth Cuthill och James McKee, en algoritm för att permutera en gles matris som har ett symmetriskt gleshetsmönster till en bandmatrisform med liten bandbredd." +msgid "Add all the edges that are not involved in the line graph process to the new table" +msgstr "Lägg till alla kanter som inte är involverade i linjediagramprocessen i den nya tabellen" -msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." -msgstr "Topparna tilldelas i princip en bredd-första sökordning, förutom att de intilliggande topparna i varje steg placeras i kön i stigande grad." +msgid "Some administrative tasks to get new identifiers for the edges" +msgstr "Vissa administrativa uppgifter för att få nya identifierare för kanterna" -msgid "The implementation is for **undirected** graphs." -msgstr "Implementationen är för **undirected** grafer." +msgid "Add the newly calculated edges" +msgstr "Lägg till de nyligen beräknade kanterna" -msgid "The bandwidth minimization problems are considered NP-complete problems." -msgstr "Problemen med att minimera bandbredden anses vara NP-kompletta problem." +msgid "Using the routing graph" +msgstr "Använda routningsgrafen" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" -msgstr "Körtidskomplexiteten är: :math:`O(m log(m)|V|)`" +msgid "When using this method for routing with soft restrictions there will be uturns" +msgstr "När du använder den här metoden för routning med mjuka begränsningar kommer det att finnas uturns" -msgid "where :math:`|V|` is the number of vertices," -msgstr "där :math:`|V|` är antalet toppar," +msgid "Routing from :math:`5` to :math:`1`" +msgstr "Routning från :math:`5` till :math:`1`" -msgid ":math:`m` is the maximum degree of the vertices in the graph." -msgstr ":math:`m` is the maximum degree of the vertices in the graph." +msgid "https://en.wikipedia.org/wiki/Line_graph" +msgstr "https://en.wikipedia.org/wiki/Line_graph" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" -msgstr "pgr_cuthillMckeeOrdering(`Kanter SQL`_)" +msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgstr "https://en.wikipedia.org/wiki/Complete_graph" -msgid "Returns set of |result_node_order|" -msgstr "Returnerar uppsättning av |result_node_order|" +msgid "``pgr_makeConnected`` - Experimental" +msgstr "``pgr_makeConnected`` - Experimentell" -msgid "Graph ordering of pgRouting :doc:`sampledata`" -msgstr "Grafisk ordning av pgRouting :doc:`sampledata`" +msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." +msgstr "``pgr_makeConnected`` - Uppsättning kanter som kommer att ansluta grafen." -msgid "Returns set of ``(seq, node)``" -msgstr "Returnerar uppsättning av ``(seq, node)``" +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgstr "Lägger till det minsta antal kanter som behövs för att göra indatagrafen ansluten. Algoritmen identifierar först alla anslutna komponenter i grafen och lägger sedan till kanter för att ansluta dessa komponenter till varandra i en väg. Om en graf t.ex. innehåller tre anslutna komponenter A, B och C lägger make_connected till två kanter. De två kanterna som läggs till kan bestå av en som förbinder ett toppunkt i A med ett toppunkt i B och en som förbinder ett toppunkt i B med ett toppunkt i C." -msgid "Sequence of the order starting from 1." -msgstr "Ordningsföljd med början från 1." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgstr "Det kommer att ge en minimilista över alla kanter som behövs i grafen för att ansluta den." -msgid "New ordering in reverse order." -msgstr "Ny beställning i omvänd ordning." +msgid "The algorithm does not considers geometric topology in the calculations." +msgstr "Algoritmen tar inte hänsyn till geometrisk topologi i beräkningarna." -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "`Boost: Cuthill-McKee Beställning `__" +msgid "pgr_makeConnected(`Edges SQL`_)" +msgstr "pgr_makeConnected(`Kanter SQL`_)" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "`Wikipedia: Cuthill-McKee-ordning `__" +msgid "Returns set of |result-component-make|" +msgstr "Returnerar uppsättning av |result-component-make|" -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr "``pgr_dagShortestPath`` - Experimentell" +msgid "List of edges that are needed to connect the graph." +msgstr "Lista över kanter som behövs för att koppla ihop grafen." -msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." -msgstr "``pgr_dagShortestPath`` - Returnerar den kortaste vägen för viktade riktade acykliska grafer (DAG). I synnerhet är DAG-algoritmen för kortaste vägar implementerad av Boost.Graph." +msgid "`Boost: make connected `__" +msgstr "`Boost: skapa anslutning `__" -msgid "pgr_dagShortestPath(Combinations)" -msgstr "pgr_dagShortestPath(Combinations)" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" -msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." -msgstr "Shortest Path for Directed Acyclic Graph(DAG) är en grafsökningsalgoritm som löser problemet med kortaste vägen för viktad riktad acyklisk graf, vilket ger en kortaste väg från ett startvertex (``start_vid``) till ett slutvertex (``end_vid``)." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` - Beräknar en matchning med maximal kardinalitet i en graf." -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." -msgstr "Denna implementation kan endast användas med en **riktad** graf utan cykler, dvs. en riktad acyklisk graf." +msgid "pgr_maxCardinalityMatch(text,boolean)" +msgstr "pgr_maxCardinalityMatch(text,boolean)" -msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." -msgstr "Algoritmen förlitar sig på topologisk sortering av DAG för att införa en linjär ordning på topparna och är därmed effektivare för DAG än både Dijkstra- och Bellman-Ford-algoritmen." +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "pgr_maxCardinalityMatch(text) returns only ``edge`` column." -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." -msgstr "Processen är endast giltig för viktade riktade acykliska grafer. annars kommer den att ge varningar." +msgid "Deprecated signature" +msgstr "Föråldrad signatur" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" -msgstr "Den `agg_cost` de icke inkluderade värdena `(v, v)` är `0`" +msgid "directed => ``false`` when used." +msgstr "riktad => ``false`` när den används." -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" -msgstr "Den `agg_cost` de icke inkluderade värdena `(u, v)` är :math:`\\infty`" +msgid "Renamed from ``pgr_maximumCardinalityMatching``" +msgstr "Omdöpta från ``pgr_maximumCardinalityMatching``" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" -msgstr "Drifttid: :math:`O(| start\\_vids | * (V + E))`" +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgstr "En matchande eller oberoende kantuppsättning i en graf är en uppsättning kanter utan gemensamma toppar." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgstr "En maximal matchning är en matchning som innehåller största möjliga antal kanter." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "There may be many maximum matchings." +msgstr "Det kan finnas många maximala matchningar." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "Calculates one possible maximum cardinality matching in a graph." +msgstr "Beräknar en möjlig matchning med maximal kardinalitet i en graf." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" +msgstr "Speltid: :math:`O( E*V * \\alpha(E,V))`" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, `Combinations SQL`_)" +msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." +msgstr ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" -msgstr "Från toppunkten :math:`5` till toppunkten :math:`11` på en **riktad** graf" +msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" +msgstr "pgr_maxCardinalityMatch(`Kanter SQL`_)" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" -msgstr "Från toppunkten :math:`5` till toppunkterna :math:`{7, 11\\}`" +msgid "Using all edges." +msgstr "Använd alla kanter." -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" -msgstr "Från topparna :math:`\\{5, 10\\}` till topp :math:`11`" +msgid "SQL query, which should return a set of rows with the following columns:" +msgstr "SQL-fråga, som ska returnera en uppsättning rader med följande kolumner:" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" -msgstr "Från topparna :math:`\\{5, 15\\}` till topparna :math:`\\{11, 17\\}` i en **omdirigerad** graf" +msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgstr "Ett positivt värde representerar existensen av kanten (``källa``, ``mål``)." -msgid "Return columns" -msgstr "Returnera kolumner" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgstr "Ett positivt värde representerar existensen av kanten (``target``, ``source``)" -msgid "Making **start_vids** the same as **end_vids**" -msgstr "Gör **start_vids** till samma sak som **end_vids**" +msgid "Identifier of the edge in the original query." +msgstr "Identifierare av kanten i den ursprungliga frågan." -msgid "`Boost: DAG shortest paths `__" -msgstr "`Boost: DAG kortaste vägar `__" +msgid "`Boost: maximum_matching `__" +msgstr "`Boost: maximum_matching `__" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" -msgstr "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +msgid "https://en.wikipedia.org/wiki/Ackermann_function" +msgstr "https://en.wikipedia.org/wiki/Ackermann_function" -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." -msgstr "``pgr_degree`` - För varje toppunkt i en odelad graf, returnera antalet kanter som är kopplade till toppunktet." +msgid "``pgr_maxFlow``" +msgstr "``pgr_maxFlow``" -msgid "Error messages adjustment." -msgstr "Justering av felmeddelanden." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgstr "``pgr_maxFlow`` - Beräknar det maximala flödet i en riktad graf från källorna till målen med hjälp av Push Relabel-algoritmen." -msgid "New signature with only Edges SQL." -msgstr "Ny signatur med endast Edges SQL." +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(Combinations)" -msgid "Calculates the degree of the vertices of an undirected graph" -msgstr "Beräknar graden för topparna i en odelad graf" +msgid "Calculates the maximum flow from the sources to the targets." +msgstr "Beräknar det maximala flödet från källorna till målen." -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." -msgstr "Graden (eller valensen) för ett toppunkt i en graf är antalet kanter som är angränsande till toppunktet." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgstr "När det maximala flödet är **0** finns det inget flöde och **0** returneras." -msgid "A loop contributes 2 to a vertex's degree." -msgstr "En loop bidrar med 2 till en topps grad." +msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." +msgstr "Använder algoritmen :doc:`pgr_pushRelabel `." -msgid "A vertex with degree 0 is called an isolated vertex." -msgstr "Ett toppunkt med grad 0 kallas ett isolerat toppunkt." +msgid "Running time: :math:`O( V ^ 3)`" +msgstr "Speltid: :math:`O( V ^ 3)`" -msgid "Isolated vertex is not part of the result" -msgstr "Isolerad toppunkt är inte en del av resultatet" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlow(`Kanter SQL`_, **start vid**, **end vid**)" -msgid "Vertex not participating on the subgraph is considered and isolated vertex." -msgstr "Vertex som inte deltar i undergrafen betraktas som en isolerad vertex." +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlow(`Kanter SQL`_, **start vid**, **end vids**)" -msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." -msgstr "Det kan finnas en ``dryrun`` exekvering och koden som används för att få svaret kommer att visas i en PostgreSQL ``NOTICE``." +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlow(`Kanter SQL`_, **start vids**, **end vid**)" -msgid "The code can be used as base code for the particular application requirements." -msgstr "Koden kan användas som baskod för de specifika applikationskraven." +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlow(`Kanter SQL`_, **start vids**, **end vids**)" -msgid "No ordering is performed." -msgstr "Ingen beställning utförs." +msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlow(`Kanter SQL`_, `Combinations SQL`_)" -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" -msgstr "pgr_degree(`Kanter SQL`_ , [``dryrun``])" +msgid "RETURNS ``BIGINT``" +msgstr "RETURNERAR ``BIGINT``" -msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" -msgstr "pgr_degree(`Kanter SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgid "Maximum flow possible from the source(s) to the target(s)" +msgstr "Högsta möjliga flöde från källan/källorna till målet/målen" -msgid "RETURNS SETOF |result-degree|" -msgstr "RETURNERAR SETOF |result-degree|" +msgid "`Boost: push relabel max flow `__" +msgstr "`Boost: push relabel max flöde `__" -msgid "Edges" -msgstr "Kanter" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgid "example" -msgstr "exempel" +msgid "``pgr_maxFlowMinCost`` - Experimental" +msgstr "``pgr_maxFlowMinCost`` - Experimentell" -msgid "Get the degree of the vertices defined on the edges table" -msgstr "Hämta graden för de toppar som definieras i tabellen edges" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost`` - Beräknar de kanter som minimerar den totala kostnaden för det maximala flödet i en graf" -msgid "Edges and Vertices" -msgstr "Kanter och toppar" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "pgr_maxFlowMinCost(Combinations)" -msgid "Extracting the vertex information" -msgstr "Extrahera information om toppunkt" +msgid "|Boost| Boost Graph Inside." +msgstr "|Boost| Boost Graph Inside." -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." -msgstr "``pgr_degree`` kan använda :doc:`pgr_extractVertices` inbäddad i anropet." +msgid "**TODO** check which statement is true:" +msgstr "**TODO** kontrollera vilket påstående som är sant:" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" -msgstr "För nätverk av anständig storlek är det bäst att förbereda vertex-tabellen i förväg och använda den vid anrop av ``pgr_degree``. (Se `Användning av en vertex-tabell`_)" +msgid "The cost value of all input edges must be nonnegative." +msgstr "Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt." -msgid "Calculate the degree of the nodes:" -msgstr "Beräkna nodernas grad:" +msgid "Process is done when the cost value of all input edges is nonnegative." +msgstr "Processen är klar när kostnadsvärdet för alla inmatade kanter är icke-negativt." -msgid "`Vertex SQL`_" -msgstr "`Vertex SQL`_" +msgid "Process is done on edges with nonnegative cost." +msgstr "Processen görs på kanter med icke-negativ kostnad." -msgid "`Vertex SQL`_ as described below" -msgstr "`Vertex SQL`_ enligt beskrivningen nedan" +msgid "Running time: :math:`O(U * (E + V * logV))`" +msgstr "Drifttid: :math:`O(U * (E + V * logV))`" -msgid "``dryrun``" -msgstr "``dryrun``" +msgid "where :math:`U` is the value of the max flow." +msgstr "där :math:`U` är värdet på maxflödet." -msgid "When true do not process and get in a NOTICE the resulting query." -msgstr "När det är sant bearbeta inte och få i ett NÄRVARO den resulterande frågan." +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." -msgid "For the `Edges and Vertices`_ signature:" -msgstr "För signaturen `Edges and Vertices`_:" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vid**)" -msgid "For the `Edges`_ signature:" -msgstr "För signaturen `Edges`_:" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vids**)" -msgid "Vertex SQL" -msgstr "Vertex SQL" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vids**, **end vid**)" -msgid "``in_edges``" -msgstr "``in_edges``" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vids**, **end vids**)" -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." -msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *första slutpunkt*." +msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, `Combinations SQL`_)" -msgid "When missing, ``out_edges`` must exist." -msgstr "När den saknas måste ``out_edges`` finnas." +msgid "Returns set of |result-flow-mincost|" +msgstr "Returnerar uppsättning av |result-flow-mincost|" -msgid "``out_edges``" -msgstr "``out_edges``" +msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" +msgstr "``pgr_maxFlowMinCost_Cost`` - Experimentell" -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." -msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *andra slutpunkt*." +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost_Cost`` - Beräknar den lägsta totala kostnaden för det maximala flödet i en graf" -msgid "When missing, ``in_edges`` must exist." -msgstr "När den saknas måste ``in_edges`` finnas." +msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgstr "pgr_maxFlowMinCost_Cost(Combinations)" -msgid "Vertex identifier" -msgstr "Identifierare för toppunkt" +msgid "**The cost value of all input edges must be nonnegative.**" +msgstr "**Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt.**" -msgid "``degree``" -msgstr "``degree``" +msgid "When the maximum flow is 0 then there is no flow and **0** is returned." +msgstr "När det maximala flödet är 0 finns det inget flöde och **0** returneras." -msgid "Number of edges that are incident to the vertex ``id``" -msgstr "Antal kanter som är angränsande till toppunkten ``id``" +msgid "Uses :doc:`pgr_maxFlowMinCost`." +msgstr "Använder :doc:`pgr_maxFlowMinCost`." -msgid "Degree of a loop" -msgstr "Grad av en slinga" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vid**, **end vid**)" -msgid "Using the `Edges`_ signature." -msgstr "Använda signaturen `Edges`_." +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vid**, **end vids**)" -msgid "Using the `Edges and Vertices`_ signature." -msgstr "Använda signaturen `Edges and Vertices`_." +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vids**, **end vid**)" -msgid "Degree of a sub graph" -msgstr "Grad av en undergraf" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vids**, **end vids**)" -msgid "For the following is a subgraph of the :doc:`sampledata`:" -msgstr "För följande är en delgraf av :doc:`sampledata`:" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, `Combinations SQL`_)" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" -msgstr ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgid "RETURNS FLOAT" +msgstr "RETURNS FLOAT" -msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" -msgstr ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" +msgstr "Minsta kostnad Högsta möjliga flöde från källa(n) till mål(en)" -msgid "The vertices not participating on the edge are considered isolated" -msgstr "De hörn som inte deltar i kanten betraktas som isolerade" +msgid "``pgr_pickDeliver`` - Experimental" +msgstr "``pgr_pickDeliver`` - Experimentell" -msgid "their degree is 0 in the subgraph and" -msgstr "deras grad är 0 i undergrafen och" +msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliver`` - Problem med ruttplanering för hämtning och leverans av fordon" -msgid "their degree is not shown in the output." -msgstr "deras examen visas inte i utdata." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgstr "Problem: Fördela och optimera upphämtnings- och leveranspar i en fordonsflotta." -msgid "Using a vertex table" -msgstr "Använda en toppunktstabell" +msgid "Optimization problem is NP-hard." +msgstr "Optimeringsproblemet är NP-svårt." -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." -msgstr "För nätverk av anständig storlek är det bäst att förbereda vertices-tabellen i förväg och använda den vid anrop av ``pgr_degree``." +msgid "pickup and Delivery with time windows." +msgstr "upphämtning och leverans med tidsfönster." -msgid "Extract the vertex information and save into a table:" -msgstr "Extrahera toppunktsinformationen och spara i en tabell:" +msgid "All vehicles are equal." +msgstr "Alla fordon är likvärdiga." -msgid "Dry run execution" -msgstr "Utförande av provkörning" +msgid "Same Starting location." +msgstr "Samma Startplats." -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." -msgstr "Använd ``dryrun => true`` för att få den fråga som genereras för att få fram toppunktsinformationen." +msgid "Same Ending location which is the same as Starting location." +msgstr "Samma slutplacering som är densamma som startplaceringen." -msgid "The results can be used as base code to make a refinement based on the backend development needs." -msgstr "Resultaten kan användas som baskod för att göra en förfining baserad på behoven för backend-utvecklingen." +msgid "All vehicles travel at the same speed." +msgstr "Alla fordon färdas med samma hastighet." -msgid "Finding dead ends" -msgstr "Att hitta återvändsgränder" +msgid "A customer is for doing a pickup or doing a deliver." +msgstr "En kund är för att göra en upphämtning eller göra en leverans." -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." -msgstr "Om det redan finns en toppunktstabell som byggts med hjälp av ``pgr_extractVertices`` och man vill ha graden för hela grafen i stället för en delmängd, kan man avstå från att använda ``pgr_degree`` och arbeta med kolumnerna ``in_edges`` och ``out_edges`` direkt." +msgid "has an open time." +msgstr "har en öppen tid." -msgid "The degree of a dead end is 1." -msgstr "Graden av en återvändsgränd är 1." +msgid "has a closing time." +msgstr "har en stängningstid." -msgid "Finding linear vertices" -msgstr "Hitta linjära hörn" +msgid "has a service time." +msgstr "har en servicetid." -msgid "The degree of a linear vertex is 2." -msgstr "Graden för ett linjärt toppunkt är 2." +msgid "has an (x, y) location." +msgstr "har en (x, y)-placering." -msgid "If there is a vertices table already built using the ``pgr_extractVertices``" -msgstr "Om det redan finns en toppunktstabell som byggts upp med hjälp av ``pgr_extractVertices``" +msgid "There is a customer where to deliver a pickup." +msgstr "Det finns en kund där man ska leverera en pickup." -msgid ":doc:`pgr_extractVertices`" -msgstr ":doc:`pgr_extractVertices`" +msgid "travel time between customers is distance / speed" +msgstr "restid mellan kunder är avstånd / hastighet" -msgid "``pgr_depthFirstSearch`` - Proposed" -msgstr "``pgr_depthFirstSearch`` - Föreslagen" +msgid "pickup and delivery pair is done with the same vehicle." +msgstr "hämtning och leverans sker med samma fordon." -msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." -msgstr "``pgr_depthFirstSearch`` - Returnerar en genomgång av grafen med första sökdjupet. Grafen kan vara riktad eller oriktad." +msgid "All trucks depart at time 0." +msgstr "Alla lastbilar avgår vid tidpunkt 0." -msgid "Version 3.3.0" -msgstr "Version 3.3.0" +msgid "the algorithm will raise an exception when" +msgstr "algoritmen kommer att ge upphov till ett undantag när" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." -msgstr "Depth First Search-algoritmen är en traverseringsalgoritm som startar från en rotvertex, går så djupt som möjligt och backar när en vertex nås utan några intilliggande vertex eller med alla besökta intilliggande vertex. Traversieringen fortsätter tills alla toppar som kan nås från rotvertexen har besökts." +msgid "If there is a pickup-deliver pair than violates time window" +msgstr "Om det finns ett upphämtnings-/leveranspar som bryter mot tidsfönstret" -msgid "The implementation works for both **directed** and **undirected** graphs." -msgstr "Implementationen fungerar för både **directed** och **undirected** grafer." +msgid "The speed, max_cycles, ma_capacity have illegal values" +msgstr "Hastigheten, max_cycles, ma_capacity har olagliga värden" -msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." -msgstr "Ger traversieringsordningen Depth First Search från en rotvertex eller från en uppsättning rotvertex." +msgid "Six different initial will be optimized - the best solution found will be result" +msgstr "Sex olika initialer kommer att optimeras - den bästa lösningen som hittas blir resultatet" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." -msgstr "En valfri icke-negativ parameter för maximalt djup för att begränsa resultaten till ett visst djup." +msgid "Signature" +msgstr "Underskrift" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." -msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `Root vids`." +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgstr "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" -msgid "It does not produce the shortest path from a root vertex to a target vertex." -msgstr "Den producerar inte den kortaste vägen från en rotvertex till en målvertex." +msgid "**options:** ``[factor, max_cycles, initial_sol]``" +msgstr "**options:** ``[factor, max_cycles, initial_sol]``" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." -msgstr "Det är inte säkert att den sammanlagda kostnaden för traverseringen är minimal." +msgid "Returns set of |result-pickdrop|" +msgstr "Returnerar uppsättning av |result-pickdrop|" -msgid "The returned values are ordered in ascending order of `start_vid`." -msgstr "De returnerade värdena är ordnade i stigande ordning efter `start_vid`." +msgid "Solve the following problem" +msgstr "Lös följande problem" -msgid "Depth First Search Running time: :math:`O(E + V)`" -msgstr "Djup Första sökning Löptid: :math:`O(E + V)`" +msgid "Given the vehicles:" +msgstr "Med tanke på fordonen:" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_depthFirstSearch(`Kanter SQL`_, **root vid**, [**options**])" +msgid "and the orders:" +msgstr "och order:" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_depthFirstSearch(`Kanter SQL`_, **root vids**, [**options**])" +msgid "The parameters are:" +msgstr "Parametrarna är:" -msgid "**options:** ``[directed, max_depth]``" -msgstr "**options:** ``[directed, max_depth]``" +msgid "A `SELECT` statement that returns the following columns:" +msgstr "En `SELECT`-sats som returnerar följande kolumner:" -msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." -msgstr "Samma som `Single vertex`_ men med kanter i fallande ordning efter ``id``." +msgid "id, demand" +msgstr "id, efterfrågan" -msgid "`Boost: Depth First Search `__" -msgstr "`Boost: Djup första sökning `__" +msgid "p_node_id, p_open, p_close, [p_service,]" +msgstr "p_node_id, p_open, p_close, [p_service,]" -msgid "`Boost: Undirected DFS `__" -msgstr "`Boost: Oriktad DFS `__" +msgid "d_node_id, d_open, d_close, [d_service,]" +msgstr "d_node_id, d_open, d_close, [d_service,]" -msgid "`Wikipedia: Depth First Search algorithm `__" -msgstr "`Wikipedia: Djup först-sökalgoritm `__" +msgid "id, capacity" +msgstr "id, kapacitet" -msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." -msgstr "``pgr_dijkstra`` - Kortaste vägen med Dijkstra-algoritmen." +msgid "start_node_id, start_open, start_close [, start_service,]" +msgstr "start_node_id, start_open, start_close [, start_service,]" -msgid "Version 3.5.0" -msgstr "Version 3.5.0" +msgid "[end_node_id, end_open, end_close, end_service]" +msgstr "[end_node_id, end_open, end_close, end_service]" -msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgid "``pgr_pickDeliverEuclidean`` - Experimental" +msgstr "``pgr_pickDeliverEuclidean`` - Experimentell" -msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." -msgstr "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliverEuclidean`` - Problem med ruttplanering för hämtning och leverans av fordon" -msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." -msgstr "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgid "Replaces ``pgr_gsoc_vrppdtw``" +msgstr "Ersätter ``pgr_gsoc_vrppdtw``" -msgid "Version 3.1.0" -msgstr "Version 3.1.0" +msgid "Pickup and Delivery:" +msgstr "Upphämtning och leverans:" -msgid "pgr_dijkstra(Combinations)" -msgstr "pgr_dijkstra(Combinations)" +msgid "capacitated" +msgstr "kapaciterad" -msgid "Version 2.2.0" -msgstr "Version 2.2.0" +msgid "with time windows." +msgstr "med tidsfönster." -msgid "pgr_dijkstra(One to Many)" -msgstr "pgr_dijkstra(One to Many)" +msgid "have (x, y) start and ending locations." +msgstr "har (x, y) start- och slutpositioner." -msgid "pgr_dijkstra(Many to One)" -msgstr "pgr_dijkstra(Many to One)" +msgid "have a start and ending service times." +msgstr "har en start- och sluttid för tjänsten." -msgid "pgr_dijkstra(Many to Many)" -msgstr "pgr_dijkstra(Many to Many)" +msgid "An order is for doing a pickup and a a deliver." +msgstr "En order är till för att göra en upphämtning och en leverans." -msgid "Signature change on pgr_dijkstra(One to One)" -msgstr "Ändring av signatur på pgr_dijkstra(One to One)" +msgid "has (x, y) pickup and delivery locations." +msgstr "har (x, y) upphämtnings- och leveransplatser." -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "has opening and closing times for the pickup and delivery locations." +msgstr "har öppnings- och stängningstider för upphämtnings- och leveransplatserna." -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "has a pickup and deliver service times." +msgstr "har en upphämtning och leverera servicetider." -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Six different optional different initial solutions" +msgstr "Sex olika valfria olika ursprungliga lösningar" -msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" +msgid "the best solution found will be result" +msgstr "den bästa lösningen som hittas blir resultatet" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" -msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` på en **riktad**" +msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgstr "pgr_pickDeliverEuclidean(`Orders SQL`_, `Fordon SQL`_, [**options**])" -msgid "The examples of this section are based on the :doc:`sampledata` network." -msgstr "Exemplen i detta avsnitt är baserade på :doc:`sampledata`-nätverket." +msgid "p_x, p_y, p_open, p_close, [p_service,]" +msgstr "p_x, p_y, p_open, p_close, [p_service,]" -msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "För **riktade** grafer med kolumnerna ``kostnad`` och ``omvända_kostnader``" +msgid "d_x, d_y, d_open, d_close, [d_service]" +msgstr "d_x, d_y, d_open, d_close, [d_service]" -msgid "Directed graph with cost and reverse cost columns" -msgstr "Riktad graf med kolumner för kostnad och omvänd kostnad" +msgid "start_x, start_y, start_open, start_close [, start_service, ]" +msgstr "start_x, start_y, start_open, start_close [, start_service, ]" -msgid "1) Path from :math:`6` to :math:`10`" -msgstr "1) Väg från :math:`6` till :math:`10`" +msgid "[ end_x, end_y, end_open, end_close, end_service ]" +msgstr "[ end_x, end_y, end_open, end_close, end_service ]" -msgid "2) Path from :math:`6` to :math:`7`" -msgstr "2) Väg från :math:`6` till :math:`7`" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgstr "Detta dataexempel **lc101** är hämtat från data som publicerats på https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" -msgid "3) Path from :math:`12` to :math:`10`" -msgstr "3) Väg från :math:`12` till :math:`10`" +msgid "There are 25 vehicles in the problem all with the same characteristics." +msgstr "Det finns 25 fordon i problemet som alla har samma egenskaper." -msgid "4) Path from :math:`12` to :math:`7`" -msgstr "4) Väg från :math:`12` till :math:`7`" +msgid "The original orders" +msgstr "De ursprungliga beställningarna" -msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" -msgstr "5) Använda `En till många`_ för att få lösningen på exempel 1 och 2" +msgid "The data comes in different rows for the pickup and the delivery of the same order." +msgstr "Uppgifterna kommer i olika rader för upphämtning och leverans av samma order." -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" -msgstr "Banor :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgid "The original data needs to be converted to an appropriate table:" +msgstr "Originaldata måste konverteras till en lämplig tabell:" -msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" -msgstr "6) Använda `Många till en`_ för att få lösningen på exempel 2 och 4" +msgid "The query" +msgstr "Frågeställningen" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" -msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{7\\}` `" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgstr "Visar endast relevant information för att jämföra med informationen om den bästa lösningen som publiceras på https://www.sintef.no/projectweb/top/pdptw/100-customers/" -msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" -msgstr "7) Använda `Många till många`_ för att få lösningen på exempel 1 till 4" +msgid "The best solution found for **lc101** is a travel time: 828.94" +msgstr "Den bästa lösningen som hittades för **lc101** är en restid: 828.94" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" -msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgid "This implementation's travel time: 854.54" +msgstr "Restid för detta genomförande: 854.54" -msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" -msgstr "8) Använda `Kombinationer`_ för att få lösningen på exempel 1 till 3" +msgid "``pgr_prim``" +msgstr "``pgr_prim``" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgstr "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgstr "``pgr_prim`` - Skog med minsta spann i en graf med Prims algoritm." -msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "För **omdirigerade** grafer med kolumnerna ``kostnad`` och ``omvända kostnader``" +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgstr "Denna algoritm hittar den minsta spännviddsskogen i en eventuellt frånkopplad graf med hjälp av Prims algoritm." -msgid "Undirected graph with cost and reverse cost columns" -msgstr "Oriktad graf med kostnads- och omvända kostnadskolumner" +msgid "Prim's running time: :math:`O(E * log V)`" +msgstr "Prims körtid: :math:`O(E * log V)`" -msgid "9) Path from :math:`6` to :math:`10`" -msgstr "9) Stigen från :math:`6` till :math:`10`" +msgid "pgr_prim(`Edges SQL`_)" +msgstr "pgr_prim(`Kanter SQL`_)" -msgid "10) Path from :math:`6` to :math:`7`" -msgstr "10) Väg från :math:`6` till :math:`7`" +msgid "Minimum spanning forest of a subgraph" +msgstr "Minsta skog som spänner över en delgraf" -msgid "11) Path from :math:`12` to :math:`10`" -msgstr "11) Stigen från :math:`12` till :math:`10`" +msgid "`Boost: Prim's algorithm documentation `__" +msgstr "`Boost: Dokumentation av Prims algoritm `__" -msgid "12) Path from :math:`12` to :math:`7`" -msgstr "12) Väg från :math:`12` till :math:`7`" +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primBFS`` - Prims algoritm för minsta spännviddsträd med djup först-sökordning." -msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" -msgstr "13) Använda `En till många`_ för att få lösningen till exempel 9 och 10" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Prims algoritm." -msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" -msgstr "14) Använda `Många till en`_ för att få lösningen på exempel 10 och 12" +msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primBFS(`Kanter SQL`_, **root vid**, [``max_depth``])" -msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" -msgstr "15) Använda `Många till många`_ för att få lösningen på exempel 9 till 12" +msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primBFS(`Kanter SQL`_, **root vids**, [``max_depth``])" -msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" -msgstr "16) Använda `Kombinationer`_ för att få lösningen på exempel 9 till 11" +msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." +msgstr "``pgr_primDD`` - Fångar upp noder med Prims algoritm." -msgid "For **directed** graphs only with ``cost`` column" -msgstr "För **riktade** grafer endast med kolumn ``kostnad``" +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgstr "Med hjälp av Prims algoritm, extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett avstånd från en rotvertex (eller vertex) inom det beräknade minsta spännträd." -msgid "Directed graph only with cost column" -msgstr "Riktad graf endast med kostnadskolumn" +msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +msgstr "pgr_primDD(`Kanter SQL`_, **root vid**, **distance**)" -msgid "17) Path from :math:`6` to :math:`10`" -msgstr "17) Väg från :math:`6` till :math:`10`" +msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgstr "pgr_primDD(`Kanter SQL`_, **root vids**, **distance**)" -msgid "18) Path from :math:`6` to :math:`7`" -msgstr "18) Väg från :math:`6` till :math:`7`" +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primDFS`` - Prim-algoritm för minsta spännviddsträd med djup först-sökordning." -msgid "19) Path from :math:`12` to :math:`10`" -msgstr "19) Väg från :math:`12` till :math:`10`" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Prims algoritm." -msgid "20) Path from :math:`12` to :math:`7`" -msgstr "20) Väg från :math:`12` till :math:`7`" +msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primDFS(`Kanter SQL`_, **root vid**, [``max_depth``])" -msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" -msgstr "21) Använda `En till många`_ för att få lösningen på exempel 17 och 18" +msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primDFS(`Kanter SQL`_, **root vids**, [``max_depth``])" -msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" -msgstr "22) Använda `Många till en`_ för att få lösningen på exempel 18 och 20" +msgid "``pgr_pushRelabel``" +msgstr "``pgr_pushRelabel``" -msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" -msgstr "23) Använda `Många till många`_ för att få lösningen på exempel 17 till 20" +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgstr "``pgr_pushRelabel`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Push Relabel-algoritmen." -msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" -msgstr "24) Använda `Kombinationer`_ för att få lösningen på exempel 17 till 19" +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(Combinations)" -msgid "For **undirected** graphs only with ``cost`` column" -msgstr "För **ej riktade** grafer endast med kolumn ``kostnad``" +msgid "Renamed from ``pgr_maxFlowPushRelabel``" +msgstr "Borttagen från ``pgr_maxFlowPushRelabel``" -msgid "Undirected graph only with cost column" -msgstr "Ostyrd graf endast med kostnadskolumn" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vid**, **end vid**)" -msgid "25) Path from :math:`6` to :math:`10`" -msgstr "25) Väg från :math:`6` till :math:`10`" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vid**, **end vids**)" -msgid "26) Path from :math:`6` to :math:`7`" -msgstr "26) Väg från :math:`6` till :math:`7`" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vids**, **end vid**)" -msgid "27) Path from :math:`12` to :math:`10`" -msgstr "27) Väg från :math:`12` till :math:`10`" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vids**, **end vids**)" -msgid "28) Path from :math:`12` to :math:`7`" -msgstr "28) Väg från :math:`12` till :math:`7`" +msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_pushRelabel(`Kanter SQL`_, `Combinations SQL`_)" -msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" -msgstr "29) Använda `En till många`_ för att få lösningen på exempel 25 och 26" +msgid "``pgr_separateCrossing``" +msgstr "``pgr_separateCrossing``" -msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" -msgstr "30) Använda `Många till en`_ för att få lösningen på exempel 26 och 28" +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." +msgstr "``pgr_separateCrossing`` - Från korsande geometrier genereras geometrier som inte korsar varandra." -msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" -msgstr "31) Använda `Många till många`_ för att få lösningen på exempel 25 till 28" +msgid "Proposed function." +msgstr "Föreslagen funktion." -msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" -msgstr "32) Använda `Kombinationer`_ för att få lösningen på exempel 25 till 27" +msgid "This is an auxiliary function for separating crossing edges." +msgstr "Detta är en hjälpfunktion för att separera korsande kanter." -msgid "Equvalences between signatures" -msgstr "Utjämningar mellan signaturer" +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateCrossing(`Kanter SQL`_, [``tolerance``, ``dryrun``])" -msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" -msgstr "Följande exempel visar sökvägen för :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "RETURNS |result-separate|" +msgstr "RETURNS |result-separate|" -msgid "33) Using `One to One`_" -msgstr "33) Använda `En till en`_" +msgid "Get the segments of the crossing geometries" +msgstr "Hämta segmenten för korsningsgeometrierna" -msgid "34) Using `One to Many`_" -msgstr "34) Använda `En till många`_" +msgid "``tolerance``" +msgstr "``tolerance``" -msgid "35) Using `Many to One`_" -msgstr "35) Använda `Många till en`_" +msgid "0.01" +msgstr "0.01" -msgid "36) Using `Many to Many`_" -msgstr "36) Använda `Många till många`_" +msgid "Used in ST_Snap before ST_Split" +msgstr "Används i ST_Snap före ST_Split" -msgid "37) Using `Combinations`_" -msgstr "37) Använda `Kombinationer`_" +msgid "Get the code for further refinement." +msgstr "Hämta koden för ytterligare förfining." -msgid "`Boost: Dijkstra shortest paths `__" -msgstr "`Boost: Dijkstra kortaste vägar `__" +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgstr "När det finns speciella detaljer som måste tas om hand på grund av den slutliga applikationen eller datakvaliteten kan koden erhållas på en PostgreSQL ``NOTICE`` med hjälp av ``dryrun`` flaggan." -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" -msgid "``pgr_dijkstraCost``" -msgstr "``pgr_dijkstraCost``" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" +msgstr "``pgr_separateTouching`` - Från berörande geometrier genereras geometrier som är korrekt anslutna vid ändpunkterna" -msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." -msgstr "``pgr_dijkstraCost`` - Totalkostnad för den kortaste vägen med Dijkstra-algoritmen." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." +msgstr "Detta är en hjälpfunktion för bearbetning av geometrier som berör varandra men inte har exakta ändpunkter, och som delas upp vid sina skärningspunkter för att förbättra nätverksanslutningen." -msgid "pgr_dijkstraCost(Combinations)" -msgstr "pgr_dijkstraCost(Combinations)" +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateTouching(`Kanter SQL`_, [``tolerance``, ``dryrun``])" -msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." -msgstr "Funktionen ``pgr_dijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av Dijkstra-algoritmen." +msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgstr "```pgr_sequentialVertexColoring`` - Föreslagen" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgstr "``pgr_sequentialVertexColoring`` - Returnerar vertexfärgningen av en odelad graf med hjälp av en girig metod." -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgstr "Sequential vertex coloring algorithm är en algoritm för färgläggning av grafer där färgidentifierare tilldelas topparna i en graf sekventiellt, så att ingen kant förbinder två identiskt färgade toppar." -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "The implementation is applicable only for **undirected** graphs." +msgstr "Implementeringen är endast tillämplig för **undirected** grafer." -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Provides the color to be assigned to all the vertices present in the graph." +msgstr "Ger den färg som ska tilldelas alla hörn som finns i grafen." -msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Color identifiers values are in the Range :math:`[1, |V|]`" +msgstr "Värden för färgidentifierare ligger i intervallet :math:`[1, |V|]`" -msgid "``pgr_dijkstraCostMatrix``" -msgstr "``pgr_dijkstraCostMatrix``" +msgid "The algorithm tries to assign the least possible color to every vertex." +msgstr "Algoritmen försöker tilldela minsta möjliga färg till varje toppunkt." -msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." -msgstr "``pgr_dijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_dijkstra`." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem, och därför ger den här algoritmen inte alltid optimal färgläggning. Den följer en girig strategi genom att iterera genom alla toppar i följd och tilldela varje topp den minsta möjliga färg som inte används av dess grannar." -msgid "Using Dijkstra algorithm, calculate and return a cost matrix." -msgstr "Beräkna och returnera en kostnadsmatris med hjälp av Dijkstra-algoritmen." +msgid "The returned rows are ordered in ascending order of the vertex value." +msgstr "De återlämnade raderna är ordnade i stigande ordning efter vertexvärdet." -msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_dijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" +msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" +msgstr "Sekventiell vertexfärgning Körtid: :math:`O(|V|*(d + k))`" -msgid "``pgr_dijkstraNear``" -msgstr "``pgr_dijkstraNear``" +msgid ":math:`d` is the maximum degree of the vertices in the graph," +msgstr ":math:`d` is the maximum degree of the vertices in the graph," -msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." -msgstr "``pgr_dijkstraNear`` - Med hjälp av Dijkstras algoritm hittar du den rutt som leder till närmaste toppunkt." +msgid ":math:`k` is the number of colors used." +msgstr ":math:`k` is the number of colors used." -msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." -msgstr "Givet en graf, en startpunkt och en uppsättning slutpunkter, hittar den här funktionen den kortaste vägen från startpunkten till närmaste slutpunkt." +msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgstr "pgr_sequentialVertexColoring(`Kanter SQL`_)" -msgid "Uses Dijkstra algorithm." -msgstr "Använder Dijkstra-algoritmen." +msgid "`Boost: Sequential Vertex Coloring `__" +msgstr "`Boost: Sekventiell färgläggning av toppar `__" -msgid "Works for **directed** and **undirected** graphs." -msgstr "Fungerar för **directed** och **undirected** grafer." +msgid "``pgr_sloanOrdering`` - Experimental" +msgstr "``pgr_sloanOrdering`` - Experimentell" -msgid "When there are more than one path to the same vertex with same cost:" -msgstr "När det finns mer än en väg till samma toppunkt med samma kostnad:" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgstr "``pgr_sloanOrdering`` - Returnerar Sloan-ordningen för en odränerad graf" -msgid "The algorithm will return just one path" -msgstr "Algoritmen kommer bara att returnera en väg" +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." +msgstr "Sloans ordningsalgoritm ordnar om topparna i en graf för att minska bandbredd, profil och vågfrontsegenskaper, vilket är särskilt användbart för glesa matrisberäkningar och finita elementanalyser." -msgid "Optionally allows to find more than one path." -msgstr "Det går även att hitta mer än en sökväg." +msgid "Finds a pseudoperipheral vertex pair to determine good starting points" +msgstr "Hittar ett pseudoperifert toppunktspar för att bestämma bra startpunkter" -msgid "When more than one path is to be returned:" -msgstr "När mer än ett tågläge ska returneras:" +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." +msgstr "Använder en prioritetsbaserad algoritm som balanserar vertexgrad och avstånd från startvertexet." -msgid "Results are sorted in increasing order of:" -msgstr "Resultaten sorteras i stigande ordning efter:" +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." +msgstr "Syftar till att minimera bandbredden (maximal skillnad mellan index för anslutna vertex)." -msgid "aggregate cost" -msgstr "sammanlagd kostnad" +msgid "Typically produces better orderings than simple breadth-first approaches." +msgstr "Ger vanligtvis bättre ordningar än enkla bredd-först-metoder." -msgid "Within the same value of aggregate costs:" -msgstr "Inom samma värde för de sammanlagda kostnaderna:" +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." +msgstr "Tidskomplexitet: :math:`O(V² + E)` där V är antalet toppar och E är antalet kanter." -msgid "results are sorted by (source, target)" -msgstr "resultaten sorteras efter (källa, mål)" +msgid "pgr_sloanOrdering(`Edges SQL`_)" +msgstr "pgr_sloanOrdering(`Edges SQL`_)" -msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" -msgstr "Körtid: Dijkstra-löptid: :math:`drt = O((|E| + |V|)log|V|)`" +msgid ":Example : Sloan ordering without specifying start vertex" +msgstr ":Exempel : Sloan-order utan att ange startpunkt" -msgid "One to Many; :math:`drt`" -msgstr "En till många; :math:`drt`" +msgid "New sloan ordering order." +msgstr "Ny beställning av Sloan." -msgid "Many to One: :math:`drt`" -msgstr "Många till en: :math:`drt`" +msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." +msgstr "Sloan-ordning av originalgrafen från Boost-exemplet (toppar 0-9)." -msgid "Many to Many: :math:`drt * |Starting vids|`" -msgstr "Många till många: :math:`drt * |Startande vids|`" +msgid "`Boost: Sloan Ordering `__" +msgstr "`Boost: Sloan Beställning `__" -msgid "Combinations: :math:`drt * |Starting vids|`" -msgstr "Kombinationer: :math:`drt * |Starting vids|`" +msgid "``pgr_stoerWagner`` - Experimental" +msgstr "``pgr_stoerWagner`` - Experimentell" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." +msgstr "``pgr_stoerWagner`` - Min-cut av grafen med stoerWagner-algoritmen." -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "Version 3.0" +msgstr "Version 3.0" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgstr "Inom grafteorin är Stoer-Wagner-algoritmen en rekursiv algoritm för att lösa problemet med minsta snitt i ovägda viktade grafer med icke-negativa vikter. Den grundläggande idén med denna algoritm är att krympa grafen genom att slå samman de mest intensiva topparna, tills grafen bara innehåller två kombinerade toppuppsättningar. I varje fas hittar algoritmen det minsta s-t-snittet för två toppar s och t som valts som dess vilja. Därefter krymper algoritmen kanten mellan s och t för att söka efter andra snitt än s-t-snitt. Det minsta snitt som hittas i alla faser kommer att vara det minsta viktade snittet i grafen." -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options B**])" +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgstr "Ett snitt är en uppdelning av hörnen i en graf i två disjunkta delmängder. En minsta skärning är en skärning där skärningens storlek eller vikt inte är större än storleken på någon annan skärning. För en oviktad graf skulle det minsta snittet helt enkelt vara det snitt som har minst kanter. För en viktad graf är det summan av alla kanters vikt på snittet som avgör om det är ett minimisnitt." -msgid "**options A:** ``[directed, cap]``" -msgstr "**options A:** ``[directed, cap]``" +msgid "Sum of the weights of all edges between the two sets is mincut." +msgstr "Summan av vikterna för alla kanter mellan de två uppsättningarna är mincut." -msgid "**options B:** ``[directed, cap, global]``" -msgstr "**options B:** ``[directed, cap, global]``" +msgid "A **mincut** is a cut having the least weight." +msgstr "Ett **mincut** är ett snitt som har minst vikt." -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Values are returned when graph is connected." +msgstr "Värdena returneras när grafen är ansluten." -msgid "**options:** ``[directed, cap]``" -msgstr "**options:** ``[directed, cap]``" +msgid "When there is no edge in graph then EMPTY SET is return." +msgstr "När det inte finns någon kant i grafen returneras EMPTY SET." -msgid "Departing on car from vertex :math:`6` find the nearest subway station." -msgstr "Avgår med bil från toppunkt :math:`6` hitta närmaste tunnelbanestation." +msgid "When the graph is unconnected then EMPTY SET is return." +msgstr "När grafen inte är sammankopplad returneras EMPTY SET." -msgid "Using a **directed** graph for car routing." -msgstr "Använda en **riktad** graf för bildirigering." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgstr "Ibland har en graf flera min-cuts, men alla har samma vikt. Den här funktionen bestämmer exakt en av min-cuts samt dess vikt." -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" -msgstr "Tunnelbanestationerna ligger på följande hörn :math:`\\{1, 10, 11\\}`" +msgid "Running time: :math:`O(V*E + V^2*log V)`." +msgstr "Drifttid: :math:`O(V*E + V^2*log V)`." -msgid "The defaults used:" -msgstr "De standardvärden som används:" +msgid "pgr_stoerWagner(`Edges SQL`_)" +msgstr "pgr_stoerWagner(`Kanter SQL`_)" -msgid "`directed => true`" -msgstr "`riktad => sann`" +msgid "Returns set of |result-mincut|" +msgstr "Returnerar uppsättning av |result-mincut|" -msgid "`cap => 1`" -msgstr "`kap => 1`" +msgid "min cut of the main subgraph" +msgstr "min-klippning av huvudundergrafen" -msgid "The result shows that station at vertex :math:`11` is the nearest." -msgstr "Resultatet visar att stationen vid toppunktet :math:`11` är den närmaste." +msgid "Returns set of ``(seq, edge, cost, mincut)``" +msgstr "Returnerar uppsättning av ``(seq, edge, cost, mincut)``" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vid**, [**options**])" +msgid "Edges which divides the set of vertices into two." +msgstr "Kanter som delar upp uppsättningen av hörn i två." -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" -msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`2`" +msgid "Cost to traverse of edge." +msgstr "Kostnad för att korsa kanten." -msgid "On line `4`: using the positional parameter: `directed` set to ``true``" -msgstr "På rad `4`: använder den positionella parametern: `directed` satt till ``true``" +msgid "**mincut**" +msgstr "**mincut**" -msgid "In line `5`: using named parameter `cap => 2`" -msgstr "I rad `5`: använder namngiven parameter `cap => 2`" +msgid "Min-cut weight of a undirected graph." +msgstr "Min-cut-vikt för en odränerad graf." -msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." -msgstr "Resultatet visar att stationen vid toppunktet :math:`10` är den närmaste och den näst bästa är :math:`11`." +msgid "Additional Example:" +msgstr "Ytterligare exempel:" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vids**, [**options**])" +msgid "min cut of an edge" +msgstr "minutskärning av en kant" -msgid "**options:** ``[directed, cap, global]``" -msgstr "**options:** ``[directed, cap, global]``" +msgid "Using :doc:`pgr_connectedComponents`" +msgstr "Använda :doc:`pgr_connectedComponents`" -msgid "Find the best pedestrian connection between two lines of buses" -msgstr "Hitta den bästa förbindelsen för fotgängare mellan två busslinjer" +msgid "`Boost: Stoer Wagner min cut `__" +msgstr "`Boost: Stoer Wagner min cut `__" -msgid "Using an **undirected** graph for pedestrian routing" -msgstr "Använda en **omdirigerad** graf för att leda fotgängare" +msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" -msgid "The first subway line stations are at :math:`\\{15, 16\\}`" -msgstr "De första tunnelbanestationerna ligger vid :math:`\\{15, 16\\}`" +msgid "``pgr_strongComponents``" +msgstr "``pgr_strongComponents``" -msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "Den andra tunnelbanelinjen stannar vid :math:`\\{1, 10, 11\\}`" +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgstr "``pgr_strongComponents`` - Starkt förbundna komponenter i en riktad graf med hjälp av Tarjans algoritm baserad på DFS." -msgid "On line `4`: using the named parameter: `directed => false`" -msgstr "På rad `4`: använder den namngivna parametern: `directed => false`" +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." +msgstr "En starkt sammanhängande komponent i en riktad graf är en uppsättning hörn som alla är nåbara från varandra." -msgid "`global => true`" -msgstr "`global => sant`" +msgid "Works for **directed** graphs." +msgstr "Fungerar för **riktade** grafer." -msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." -msgstr "För en fotgängare är den bästa anslutningen att gå av och på vid toppunkten :math:`15` på den första tunnelbanelinjen och vid toppunkten :math:`10` på den andra tunnelbanelinjen." +msgid "Components are described by vertices identifiers." +msgstr "Komponenterna beskrivs med hjälp av identifierare för vertikalerna." -msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" -msgstr "Endast `en` rutt returneras eftersom `global` är ``true`` och `cap` är ``1``" +msgid "pgr_strongComponents(`Edges SQL`_)" +msgstr "pgr_strongComponents(`Kanter SQL`_)" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options**])" +msgid "The strong components of the graph" +msgstr "De starka komponenterna i grafen" -msgid "Find the best car connection between all the stations of two subway lines" -msgstr "Hitta den bästa bilförbindelsen mellan alla stationer på två tunnelbanelinjer" +msgid "`Boost: Strong components `__" +msgstr "`Boost: Starka komponenter `__" -msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "Den första tunnelbanelinjen stannar vid :math:`\\{1, 10, 11\\}`" +msgid "wikipedia: `Strongly connected component `__" +msgstr "wikipedia: `Starkt ansluten komponent `__" -msgid "The second subway line stations are at :math:`\\{15, 16\\}`" -msgstr "Den andra tunnelbanelinjens stationer ligger vid :math:`\\{15, 16\\}`" +msgid "``pgr_topologicalSort`` - Experimental" +msgstr "``pgr_topologicalSort`` - Experimentell" -msgid "The combinations contents:" -msgstr "Kombinationernas innehåll:" +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgstr "``pgr_topologicalSort`` - Linjär ordning av topparna för riktade acykliska grafer (DAG)." -msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" -msgstr "linjerna `3~4` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den andra tunnelbanelinjen" +msgid "Standardize output to |result_node_order|" +msgstr "Standardisera utdata till |result_node_order|" -msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" -msgstr "linjerna `6~7` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den första tunnelbanelinjen" +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgstr "Den topologiska sorteringsalgoritmen skapar en linjär ordning av hörnen så att om kanten :math:`(u,v)` förekommer i grafen, så kommer :math:`v` före :math:`u` i ordningen." -msgid "On line `8`: using the named parameter is `global => false`" -msgstr "På rad `8`: att använda den namngivna parametern är `global => false`" +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgstr "Processen är endast giltig för riktade acykliska grafer. annars kommer den att ge varningar." -msgid "From the results:" -msgstr "Från resultaten:" +msgid "For optimization purposes, if there are more than one answer, the function" +msgstr "För optimeringsändamål, om det finns mer än ett svar, kan funktionen" -msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" -msgstr "skapa en förbindelse från den första tunnelbanelinjen :math:`\\{1, 10, 11\\\\}` till den andra :math:`\\{15, 16\\\\}`:" +msgid "will return one of them." +msgstr "kommer att returnera en av dem." -msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgstr "De bästa förbindelserna från alla stationer från den första linjen är: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "The returned values are ordered in topological order:" +msgstr "De returnerade värdena är ordnade i topologisk ordning:" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" -msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad på :math:`1` (rader: `11` och `12`)" +msgid "pgr_topologicalSort(`Edges SQL`_)" +msgstr "pgr_topologicalSort(`Kanter SQL`_)" -msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" -msgstr "skapa en förbindelse från den andra tunnelbanelinjen :math:`\\{15, 16\\\\}` till den första :math:`\\{1, 10, 11\\\\}`:" +msgid "Topologically sorting the graph" +msgstr "Topologisk sortering av grafen" -msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgstr "De bästa förbindelserna från alla stationer från den andra linjen är: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "Sequential value starting from :math:`1`" +msgstr "Sekventiellt värde med början från :math:`1`" -msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" -msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `13` och `14` och rader: `15` och `16`)" +msgid "Linear topological ordering of the vertices" +msgstr "Linjär topologisk ordning av hörnen" -msgid "Dijkstra optional parameters" -msgstr "Dijkstra valfria parametrar" +msgid "Additional examples" +msgstr "Ytterligare exempel" -msgid "Near optional parameters" -msgstr "Nära valfria parametrar" +msgid "Topologically sorting the one way segments" +msgstr "Topologisk sortering av enkelriktade segment" -msgid "``cap``" -msgstr "``cap``" +msgid "Graph is not a DAG" +msgstr "Grafen är inte en DAG" -msgid "Find at most ``cap`` number of nearest shortest paths" -msgstr "Hitta högst ``cap`` antal närmaste kortaste vägar" +msgid "`Boost: topological sort `__" +msgstr "`Boost: topologisk sortering `__" -msgid "``global``" -msgstr "``global``" +msgid "``pgr_transitiveClosure`` - Experimental" +msgstr "``pgr_transitiveClosure`` - Experimentell" -msgid "When ``true``: only ``cap`` limit results will be returned" -msgstr "När ``true``: endast ``cap`` gränsresultat kommer att returneras" +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgstr "``pgr_transitiveClosure`` - Transitiv stängningsgraf för en riktad graf." -msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" -msgstr "När ``false``: ``cap`` gräns per ``Start vid`` kommer att returneras" +msgid "Standardized output to |result-closure|" +msgstr "Standardisera utdata till |result-closure|" -msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "Transforms the input directed graph into the transitive closure of the graph." +msgstr "Transformerar den inmatade riktade grafen till grafens transitiva slutenhet." -msgid "``pgr_dijkstraNearCost``" -msgstr "``pgr_dijkstraNearCost``" +msgid "Process is valid for directed graphs." +msgstr "Processen är giltig för riktade grafer." -msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." -msgstr "``pgr_dijkstraNearCost`` - Med hjälp av dijkstra-algoritmen hittar du den rutt som leder till närmaste toppunkt." +msgid "The transitive closure of an undirected graph produces a cluster graph" +msgstr "Den transitiva stängningen av en odelad graf ger en klustergraf" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgstr "Nåbarhet mellan hörn i en odelad graf uppstår när de tillhör samma sammankopplade komponent. (se :doc:`pgr_connectedComponents`)" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "The returned values are not ordered" +msgstr "De returnerade värdena är inte ordnade" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "The returned graph is compressed" +msgstr "Den returnerade grafen är komprimerad" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options B**])" +msgid "Running time: :math:`O(|V||E|)`" +msgstr "Speltid: :math:`O(|V||E|)`" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "The pgr_transitiveClosure function has the following signature:" +msgstr "Funktionen pgr_transitiveClosure har följande signatur:" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_transitiveClosure(`Edges SQL`_)" +msgstr "pgr_transitiveClosure(`Kanter SQL`_)" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" -msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`6``" +msgid "Returns set of |result-closure|" +msgstr "Returnerar uppsättning av |result-closure|" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Rechability of a subgraph" +msgstr "Rechability av en delgraf" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" +msgid "Identifier of the source of the edges" +msgstr "Identifierare av källan till kanterna" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" -msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad av :math:`1` (rader: `1`)" +msgid "``target_array``" +msgstr "``target_array``" -msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" -msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `12` och `13`)" +msgid "Identifiers of the targets of the edges" +msgstr "Identifierare av målen för kanterna" -msgid "``pgr_dijkstraVia``" -msgstr "``pgr_dijkstraVia``" +msgid "Identifiers of the vertices that are reachable from vertex v." +msgstr "Identifierare för de toppar som är nåbara från topp v." -msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." -msgstr "``pgr_dijkstraVia`` - Rutt som går genom en lista med toppar." +msgid "`Boost: transitive closure `__" +msgstr "`Boost: transitiv stängning `__" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." -msgstr "Med en lista över hörnpunkter och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;hörnpunkter)`." +msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "Route" -msgstr "Rutt" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" -msgid "is a sequence of paths." -msgstr "är en sekvens av banor." +msgid "``pgr_trsp`` - routing vertices with restrictions." +msgstr "``pgr_trsp`` - routing av toppar med restriktioner." -msgid "Path" -msgstr "Sökväg" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid "is a section of the route." -msgstr "är en del av rutten." +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "One Via" -msgstr "En Via" +msgid "pgr_trsp(One to One)" +msgstr "pgr_trsp(One to One)" -msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" -msgstr "pgr_dijkstraVia(`Kanter SQL`_, **via vertices**, [**options**])" +msgid "pgr_trsp(One to Many)" +msgstr "pgr_trsp(One to Many)" -msgid "**options:** ``[directed, strict, U_turn_on_edge]``" -msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" +msgid "pgr_trsp(Many to One)" +msgstr "pgr_trsp(Many to One)" -msgid "Returns set of |via-result|" -msgstr "Returnerar uppsättning av |via-result|" +msgid "pgr_trsp(Many to Many)" +msgstr "pgr_trsp(Many to Many)" -msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." -msgstr "Hitta den rutt som besöker topparna :math:`\\{5, 1, 8\\}` i den ordningen i en riktad graf." +msgid "pgr_trsp(Combinations)" +msgstr "pgr_trsp(Combinations)" -msgid "Via optional parameters" -msgstr "Via valfria parametrar" +msgid "Deprecated signatures" +msgstr "Föråldrade signaturer" -msgid "When ``true`` departing from a visited vertex will not try to avoid" -msgstr "När ``true`` avgår från en besökt vertex kommer inte att försöka undvika" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgid "Identifier of a path. Has value **1** for the first path." -msgstr "Identifierare för ett led. Har värdet **1** för det första tågläget." +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." -msgstr "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen." +msgid "New prototypes" +msgstr "Nya prototyper" -msgid "-1 for the last node of the path." -msgstr "-1 för den sista noden på vägen." +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "-2 for the last node of the route." -msgstr "-2 för den sista noden i rutten." +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" -msgid "``route_agg_cost``" -msgstr "``route_agg_cost``" +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgstr "Turn restricted shortest path (TRSP) är en algoritm som tar emot svängrestriktioner i form av en fråga, liknande de som finns i verkliga vägnät." -msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." -msgstr "Total kostnad från ``start_vid`` av ``seq = 1`` till ``slut_vid`` av den aktuella ``seq``." +msgid "It does no guarantee the shortest path as it might contain restriction paths." +msgstr "Den garanterar inte den kortaste vägen eftersom den kan innehålla begränsande vägar." -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." -msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen på en **riktad** graf." +msgid "The general algorithm is as follows:" +msgstr "Den allmänna algoritmen är som följer:" -msgid "The main query" -msgstr "Den huvudsakliga frågeställningen" +msgid "Execute a Dijkstra." +msgstr "Utför en Dijkstra." -msgid "Aggregate cost of the third path." -msgstr "Sammanlagd kostnad för det tredje tågläget." +msgid "If the solution passes thru a restriction then." +msgstr "Om lösningen passerar genom en begränsning då." -msgid "Route's aggregate cost of the route at the end of the third path." -msgstr "Ruttens sammanlagda kostnad för rutten vid slutet av den tredje vägen." +msgid "Execute the **TRSP** algorithm with restrictions." +msgstr "Utför **TRSP**-algoritmen med begränsningar." -msgid "Nodes visited in the route." -msgstr "Noder som besökts i rutten." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, [``directed``])" -msgid "The aggregate costs of the route when the visited vertices are reached." -msgstr "De sammanlagda kostnaderna för rutten när de besökta topparna nås." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vids**, [``directed``])" -msgid "Status of \"passes in front\" or \"visits\" of the nodes." -msgstr "Status för \"passeringar framför\" eller \"besök\" av noderna." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vid**, [``directed``])" -msgid ":doc:`via-category`." -msgstr ":doc:`via-category`." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vids**, [``directed``])" -msgid ":doc:`dijkstra-family`." -msgstr ":doc:`dijkstra-family`." +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restriktioner SQL`_, `Kombinationer SQL`_, [``directed``])" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." -msgstr "``pgr_drivingDistance`` - Returnerar köravståndet från en startnod." +msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." +msgstr "Från toppunkt :math:`6` till toppunkt :math:`10` i en odelad graf." -msgid "pgr_drivingDistance(Single vertex)" -msgstr "pgr_drivingDistance(Single vertex)" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 1\\}` i en odelad graf." -msgid "Added ``depth`` and ``start_vid`` result columns." -msgstr "Lagt till resultatkolumnerna ``depth`` och ``start_vid``." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`8` i en riktad graf." -msgid "pgr_drivingDistance(Multiple vertices)" -msgstr "pgr_drivingDistance(Multiple vertices)" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 8\\}` i en odelad graf." -msgid "Result column name change: ``from_v`` to ``start_vid``." -msgstr "Namnbyte på resultatkolumnen: ``from_v`` till ``start_vid``." +msgid "Using a combinations table on an undirected graph." +msgstr "Använda en kombinationstabell på en ostyrd graf." -msgid "Added ``depth`` and ``pred`` result columns." -msgstr "Lagt till resultatkolumnerna ``depth`` och ``pred``." +msgid "`Deprecated documentation `_" +msgstr "föråldrad dokumentation `_" -msgid "Signature change:" -msgstr "Ändring av signatur:" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" -msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance(single vertex)" +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgstr "``pgr_trspVia`` Rutt som går igenom en lista med toppar med restriktioner." -msgid "New official signature:" -msgstr "Ny officiell signatur:" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance(multiple vertices)" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "Givet en lista med toppar och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;toppar)` och försöker att inte använda begränsade vägar." -msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." -msgstr "Med hjälp av Dijkstra-algoritmen extraheras alla noder som har kostnader som är mindre än eller lika med värdet ``distance``. De kanter som extraheras kommer att överensstämma med motsvarande spännträd." +msgid "The paths represents the sections of the route." +msgstr "Banorna representerar de olika delarna av rutten." -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "Execute a :doc:`pgr_dijkstraVia`." +msgstr "Exekvera en :doc:`pgr_dijkstraVia`." -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" -msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "For the set of sub paths of the solution that pass through a restriction then" +msgstr "För uppsättningen delvägar för lösningen som passerar genom en begränsning gäller följande" -msgid "**options:** [directed, equicost]" -msgstr "**options:** [directed, equicost]" +msgid "Execute the **TRSP** algorithm with restrictions for the paths." +msgstr "Utför **TRSP**-algoritmen med begränsningar för banorna." -msgid "Single Vertex" -msgstr "Enstaka toppunkt" +msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." +msgstr "**OBSERVERA** när detta görs ignoreras flaggan ``U_turn_on_edge``." -msgid "From vertex :math:`11` for a distance of :math:`3.0`" -msgstr "Från toppunkten :math:`11` för ett avstånd av :math:`3.0`" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgstr "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgid "Multiple Vertices" -msgstr "Flera vertikaler" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen i en riktad graf." -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" -msgstr "Från topparna :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` med equi-cost på en riktad graf" +msgid "Simulation of how algorithm works." +msgstr "Simulering av hur algoritmen fungerar." -msgid "Driving distance optional parameters" -msgstr "Valfria parametrar för körsträcka" +msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" +msgstr "Algoritmen utför en :doc:`pgr_dijkstraVia`" -msgid "``equicost``" -msgstr "``equicost``" +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +msgstr "Detekterar vilka av undervägarna som passerar genom en begränsning i det här fallet är för ``väg_id = 5`` från ``6`` till ``3`` eftersom vägen :math:`15 \\rightarrow 1` är begränsad." -msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." -msgstr "När ``true`` kommer noden endast att visas i den närmaste ``start_vid``-listan. Bindningsbromsar är godtyckliga." +msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." +msgstr "Exekverar :doc:`pgr_trsp` -algoritmen för de motstridiga vägarna." -msgid "When ``false`` which resembles several calls using the single vertex signature." -msgstr "När ``false`` vilket liknar flera anrop som använder signaturen med en enda vertex." +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "Från :doc:`pgr_dijkstraVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen:" -msgid "end-before" -msgstr "slut-innan" +msgid "Getting the same result as ``pgr_trspVia``:" +msgstr "Får samma resultat som ``pgr_trspVia``:" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" -msgstr "Från hörnen :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` på en odelad graf" +msgid "Example 8" +msgstr "Exempel 8" -msgid "``pgr_edgeColoring`` - Experimental" -msgstr "``pgr_edgeColoring`` - Experimentell" +msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." +msgstr "Ibland ignoreras flaggan ``U_turn_on_edge`` när den är satt till ``false``." -msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" -msgstr "``pgr_edgeColoring`` - Returnerar kantfärgning av oledade och loopfria grafer" +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." +msgstr "Det första steget, att göra en :doc:`pgr_dijkstraVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men sökvägen :math:`16 \\rightarrow 13` (rad 4 och 5) är begränsad och resultatet använder den." -msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." -msgstr "Edge Coloring är en algoritm som används för att färglägga kanterna för topparna i grafen. Det är en tilldelning av färger till kanterna i grafen så att inga två intilliggande kanter har samma färg." +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "När :doc:`pgr_trsp`-algoritmen körs för den konfliktfyllda banan finns det ingen flagga för ``U_turn_on_edge``." -msgid "The implementation is for **undirected** and **loop-free** graphs" -msgstr "Implementeringen är för **undirected** och **loop-free** grafer" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." +msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``." -msgid "loop free" -msgstr "slinga fri" +msgid ":doc:`via-category`" +msgstr ":doc:`via-category`" -msgid "no self-loops and no parallel edges." -msgstr "inga självslingor och inga parallella kanter." +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" -msgid "Provides the color to be assigned to all the edges present in the graph." -msgstr "Ger den färg som ska tilldelas alla kanter som finns i grafen." +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." +msgstr "``pgr_trspVia_withPoints`` - Rutt som går igenom en lista med toppar och/eller punkter med restriktioner." -msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." -msgstr "Högst :math:`\\Delta + 1` färger används, där :math:`\\Delta` är grafens grad." +msgid "**Driving side** parameter is positional unnamed." +msgstr "**Driving side** parametern är positionell utan namn." -msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." -msgstr "Detta är optimalt för vissa grafer och enligt Vizings teorem används högst en färg mer än vad som är optimalt för alla andra." +msgid "Valid values depend on kind of graph" +msgstr "Giltiga värden beror på typ av graf" -msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" -msgstr "det kromatiska talet :math:`x'(G)` (minsta antal färger som behövs för korrekt kantfärgning av grafen) är lika med graden :math:`\\Delta + 1` av grafen, (:math:`x'(G) = \\Delta`)" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "The algorithm tries to assign the least possible color to every edge." -msgstr "Algoritmen försöker tilldela varje kant minsta möjliga färg." +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "Med tanke på en graf, en uppsättning begränsningar på grafens kanter, en uppsättning punkter på grafens kanter och en lista med vertexer, är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en vertex eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)` och försöker att inte använda begränsade vägar." -msgid "Does not always produce optimal coloring." -msgstr "Ger inte alltid optimal färgsättning." +msgid "is a sequence of paths" +msgstr "är en sekvens av banor" -msgid "The returned rows are ordered in ascending order of the edge identifier." -msgstr "De returnerade raderna är ordnade i stigande ordning efter kantidentifieraren." +msgid "Build the Graph with the new points." +msgstr "Bygg grafen med de nya punkterna." -msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" -msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem och därför:" +msgid "The points identifiers will be converted to negative values." +msgstr "Punkternas identifierare kommer att omvandlas till negativa värden." -msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" -msgstr "I den här implementeringen är körtiden: :math:`O(|E|*|V|)`" +msgid "The vertices identifiers will remain positive." +msgstr "Topparnas identifierare kommer att förbli positiva." -msgid "where :math:`|E|` is the number of edges in the graph," -msgstr "där :math:`|E|` är antalet kanter i grafen," +msgid "Execute a :doc:`pgr_withPointsVia`." +msgstr "Exekvera en :doc:`pgr_withPointsVia`." -msgid ":math:`|V|` is the number of vertices in the graph." -msgstr ":math:`|V|` is the number of vertices in the graph." +msgid "For the set of paths of the solution that pass through a restriction then" +msgstr "För uppsättningen av vägar för lösningen som passerar genom en restriktion gäller följande" -msgid "pgr_edgeColoring(`Edges SQL`_)" -msgstr "pgr_edgeColoring(`Kanter SQL`_)" +msgid "Execute the **TRSP** algorithm with restrictions for the path." +msgstr "Utför **TRSP**-algoritmen med begränsningar för banan." -msgid "Graph coloring of pgRouting :doc:`sampledata`" -msgstr "Grafisk färgläggning av pgRouting :doc:`sampledata`" +msgid "Do not use negative values on identifiers of the inner queries." +msgstr "Använd inte negativa värden på identifierare för de inre frågorna." -msgid "`Boost: Edge Coloring `__" -msgstr "`Boost: Färgläggning av kanter `__" +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" -msgid "`Wikipedia: Graph coloring `__" -msgstr "`Wikipedia: Färgläggning av grafer `__" +msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" +msgstr "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." -msgstr "``pgr_edgeDisjointPaths`` - Beräknar kantdisjunkta vägar mellan två grupper av toppar." +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." +msgstr "Hitta den rutt som besöker topparna :math:`\\{-6, 15, -5\\\\}` i den ordningen i en riktad graf." -msgid "pgr_edgeDisjointPaths(Combinations)" -msgstr "pgr_edgeDisjointPaths(Combinations)" +msgid "When positive it is considered a vertex identifier" +msgstr "När den är positiv betraktas den som en vertexidentifierare" -msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." -msgstr "Beräknar de kantdisjunkta vägarna mellan två grupper av hörnpunkter. Använder underliggande algoritmer för maximalt flöde för att beräkna vägarna." +msgid "When negative it is considered a point identifier" +msgstr "När den är negativ betraktas den som en punktidentifierare" -msgid "The main characterics are:" -msgstr "De viktigaste egenskaperna är:" +msgid "[**driving side**]" +msgstr "[**driving side**]" -msgid "Calculates the edge disjoint paths between any two groups of vertices." -msgstr "Beräknar de kantskiljande vägarna mellan två valfria grupper av hörnpunkter." +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" +msgstr "Värde i [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] som anger om förarsidan är:" -msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." -msgstr "Returnerar EMPTY SET när källan och destinationen är desamma eller inte kan nås." +msgid "For directed graph:" +msgstr "För riktad graf:" -msgid "The graph can be directed or undirected." -msgstr "Grafen kan vara riktad eller oriktad." +msgid "[``r``, ``R``] for right driving side" +msgstr "[``r``, ``R``] för höger körsida" -msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." -msgstr "Använder :doc:`pgr_boykovKolmogorov` för att beräkna banorna." +msgid "[``l``, ``L``] for left driving side" +msgstr "[``l``, ``L``] för vänster körsida" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])" +msgid "For undirected graph:" +msgstr "För odelad graf:" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])" +msgid "[``b``, ``B``] for both driving sides" +msgstr "[``b``, ``B``] för båda körsidorna" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])" +msgid "Default values when parameter is missing:" +msgstr "Standardvärden när parameter saknas:" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" +msgid "[``r``, ``R``] for directed graph" +msgstr "[``r``, ``R``] för riktad graf" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "[``l``, ``L``] for undirected graph" +msgstr "[``l``, ``L``] för odelad graf" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." -msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}` i en ostyrd graf." +msgid "With points optional parameters" +msgstr "Med punkter valfria parametrar" -msgid "Manually assigned vertex combinations on an undirected graph." -msgstr "Manuellt tilldelade toppunktskombinationer på en odelad graf." +msgid "``details``" +msgstr "``details``" -msgid "``pgr_edmondsKarp``" -msgstr "``pgr_edmondsKarp``" +msgid "For showing points stops." +msgstr "För att visa punkter stoppar." -msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." -msgstr "``pgr_edmondsKarp`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Edmonds Karps algoritm." +msgid "When ``true`` the results will include the points that are in the path." +msgstr "När ``true`` visas kommer resultaten att inkludera de punkter som ligger i banan." -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(Combinations)" +msgid "When ``false`` the results will not include the points that are in the path." +msgstr "När ``false`` visas kommer resultaten inte att omfatta de punkter som ligger i banan." -msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" -msgstr "Borttagen från ``pgr_maxFlowEdmondsKarp``" +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgstr "När kolumnerna ``start_vid``, ``end_vid`` och ``node`` har negativa värden är identifieraren för en Point." -msgid "Running time: :math:`O( V * E ^ 2)`" -msgstr "Speltid: :math:`O( V * E ^ 2)`" +msgid "Use ``pgr_findCloseEdges`` for points on the fly" +msgstr "Använd ``pgr_findCloseEdges`` för punkter i farten" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "Using :doc:`pgr_findCloseEdges`:" +msgstr "Använder :doc:`pgr_findCloseEdges`:" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." +msgstr "Besök från toppunkten :math:`1` till de två platserna på grafen för punkten `(2,9, 1,8)` i ordning efter närhet till grafen." -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgstr "Punkten :math:`-1` motsvarar den närmaste kanten från punkten `(2,9, 1,8)`." -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgstr "Punkten :math:`-2` motsvarar nästa nära kant från punkten `(2,9, 1,8)`." -msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_edmondsKarp(`Kanter SQL`_, `Combinations SQL`_)" +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgstr "Punkt :math:`-2` besöks på rutten till från toppunkt :math:`1` till punkt :math:`-1` (Se rad där :math:`seq = 4`)." -msgid "`Boost: Edmonds Karp max flow `__" -msgstr "`Boost: Edmonds Karp maxflöde `__" +msgid "Usage variations" +msgstr "Variationer i användning" -msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-6, 7, -4, 8, -2\\\\}` i den ordningen i en riktad graf." -msgid "``pgr_edwardMoore`` - Experimental" -msgstr "``pgr_edwardMoore`` - Experimentell" +msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." +msgstr "Status för \"passeringar framför\" eller \"besök\" av noder och punkter." -msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." -msgstr "``pgr_edwardMoore`` - Returnerar den kortaste vägen med Edward-Moore-algoritmen." +msgid "The algorithm performs a :doc:`pgr_withPointsVia`" +msgstr "Algoritmen utför en :doc:`pgr_withPointsVia`" -msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." -msgstr "Edward Moores algoritm är en förbättring av Bellman-Ford-algoritmen. Den kan beräkna de kortaste vägarna från ett enda källvertex till alla andra vertex i en viktad riktad graf. Den största skillnaden mellan Edward Moores algoritm och Bellman Fords algoritm ligger i körtiden." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgstr "Detekterar vilka av sökvägarna som passerar genom en begränsning i detta fall är för ``path_id = 1`` från ``-6`` till ``15`` eftersom sökvägen :math:`9 \\rightarrow 16` är begränsad." -msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." -msgstr "I värsta fall är algoritmens körtid :math:`O(| V | * | E |)`, vilket liknar tidskomplexiteten för Bellman-Ford-algoritmen. Experiment tyder dock på att denna algoritm har en genomsnittlig komplexitet på :math:`O( | E | )` för slumpmässiga grafer. Detta är betydligt snabbare när det gäller beräkningshastighet." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgstr "Exekverar :ref:`TRSP-family:TRSP algorithm` för de motstridiga sökvägarna." -msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" -msgstr "Algoritmen är alltså i bästa fall betydligt snabbare än Bellman-Ford-algoritmen och i sämsta fall lika bra som Bellman-Ford-algoritmen" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "Från resultatet av :doc:`pgr_withPointsVia` tar den bort de motstridiga vägarna och bygger lösningen med resultaten av algoritmen :doc:`pgr_trsp`:" -msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" -msgstr "`agg_cost` de icke inkluderade värdena `(v, v)` är :math:`0`" +msgid "Getting the same result as ``pgr_trspVia_withPoints``:" +msgstr "Får samma resultat som ``pgr_trspVia_withPoints``:" -msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." -msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start vids` eller `end vids`." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgstr "Det första steget, att göra en :doc:`pgr_withPointsVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men banan :math:`9 \\rightarrow 16` (rad 4 och 5) är begränsad och resultatet är att använda den." -msgid "Running time:" -msgstr "Löptid:" +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "När algoritmen :doc:`pgr_trsp_withPoints` exekveras för den konfliktfyllda banan finns det ingen flagga ``U_turn_on_edge``." -msgid "Worst case: :math:`O(| V | * | E |)`" -msgstr "Sämsta fall: :math:`O(| V | * | E |)`" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``. Från :doc:`pgr_withPointsVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen. I det här fallet har en U-sväng gjorts med samma kant." -msgid "Average case: :math:`O( | E | )`" -msgstr "Genomsnittligt fall: :math:`O( | E | )`" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." +msgstr "``pgr_trsp_withPoints`` Routing Vertex/Point med restriktioner." -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "**Driving side** parameter is positional unnamed and compulsory." +msgstr "**Driving side** parametern är positionell, namnlös och obligatorisk." -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_edwardMoore(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "Using a combinations table on an **undirected** graph." -msgstr "Använda en kombinationstabell i en **icke-riktad** graf." +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgid "``pgr_extractVertices``" -msgstr "``pgr_extractVertices``" +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Beakta de ogiltiga vägarna i `Restrictions SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen." -msgid "``pgr_extractVertices`` — Extracts the vertices information" -msgstr "``pgr_extractVertices`` - Extraherar information om hörnpunkter" +msgid "Vertices of the graph are:" +msgstr "Grafens hörn är:" -msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." -msgstr "Detta är en hjälpfunktion för att extrahera toppunktsinformationen för en grafs uppsättning kanter." +msgid "**positive** when it belongs to the `Edges SQL`_" +msgstr "**positiv** när den tillhör `Kanter SQL`_" -msgid "When the edge identifier is given, then it will also calculate the in and out edges" -msgstr "När kantidentifieraren anges kommer den också att beräkna in- och utkanterna" +msgid "**negative** when it belongs to the `Points SQL`_" +msgstr "**negativ** när den tillhör `Points SQL`_" -msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" -msgstr "pgr_extractVertices(`Kanter SQL`_, [``dryrun``])" +msgid "The `agg_cost` in the non included values `(v, v)` is `0`" +msgstr "`Agg_cost` i de icke inkluderade värdena \"v, v\" är \"0\"" -msgid "RETURNS SETOF |result-extract|" -msgstr "RETURNS SETOF |result-extract|" +msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" +msgstr "Agg_cost i de icke inkluderade värdena `(u, v)` är :math:`\\infty`" -msgid "When line geometry is known" -msgstr "När linjegeometrin är känd" +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i inmatningsmatriserna för **start vids** eller **end vids** eller." -msgid "(Optional) identifier of the edge." -msgstr "(Valfritt) identifierare för kanten." +msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgstr "Drifttid: :math:`O(|start\\_vids|\\times(V \\log V + E))`" -msgid "``geom``" -msgstr "``geom``" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**driving side**,] [**options**])" -msgid "``LINESTRING``" -msgstr "``LINESTRING``" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])" -msgid "Geometry of the edge." -msgstr "Geometri för kanten." +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**,] [**options**])" -msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." -msgstr "Denna inre fråga har företräde framför de två följande inre frågorna, och därför ignoreras andra kolumner när kolumnen ``geom`` visas." +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])" -msgid "Ignored columns:" -msgstr "Ignorerade kolumner:" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" -msgid "``startpoint``" -msgstr "``startpoint``" +msgid "**options:** ``[directed, details]``" +msgstr "**options:** ``[directed, details]``" -msgid "``endpoint``" -msgstr "``endpoint``" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (med detaljer)" -msgid "When vertex geometry is known" -msgstr "När toppunktsgeometrin är känd" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` på en odelad graf" -msgid "To use this inner query the column ``geom`` should not be part of the set of columns." -msgstr "För att använda den här inre frågan får kolumnen ``geom`` inte ingå i kolumnuppsättningen." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf. (utan detaljer)" -msgid "``POINT``" -msgstr "``POINT``" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` med körning på vänster sida." -msgid "POINT geometry of the starting vertex." -msgstr "POINT Geometri för startvertexen." +msgid "Two combinations" +msgstr "Två kombinationer" -msgid "POINT geometry of the ending vertex." -msgstr "POINT Geometri för den avslutande vertexen." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med högerkörning. (med detaljer)" -msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." -msgstr "Denna inre fråga har företräde framför nästa inre fråga, och därför ignoreras andra kolumner när kolumnerna ``startpunkt`` och ``slutpunkt`` visas." +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." +msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_." -msgid "When identifiers of vertices are known" -msgstr "När identifierare av toppar är kända" +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Hitta vägarna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." -msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." -msgstr "För att kunna använda den här inre frågan får kolumnerna ``geom``, ``startpoint`` och ``endpoint`` inte ingå i kolumnuppsättningen." +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgstr "Alla exempel handlar om att resa från punkt :math:`1` och toppunkt :math:`5` till punkter :math:`\\{2, 3, 6\\}` och toppunkter :math:`\\{10, 11\\}` med restriktioner" -msgid "``NULL`` When the ``id`` is not part of the inner query" -msgstr "``NULL`` När ``id`` inte är en del av den inre frågan" +msgid "Passes in front or visits with right side driving." +msgstr "Passerar framför eller besöker med högerkörning." -msgid "X value of the point geometry" -msgstr "X-värde för punktgeometrin" +msgid "For point :math:`6` and vertex :math:`11`." +msgstr "För punkt :math:`6` och toppunkt :math:`11`." -msgid "``NULL`` When no geometry is provided" -msgstr "``NULL`` När ingen geometri anges" +msgid "Passes in front or visits with left side driving." +msgstr "Passerar framför eller besöker med vänsterkörning." -msgid "Geometry of the point" -msgstr "Geometri för punkten" +msgid "``pgr_turnRestrictedPath`` - Experimental" +msgstr "``pgr_turnRestrictedPath`` - Experimentell" -msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." -msgstr "Använd ``dryrun := true`` för att få den fråga som genereras för att få fram toppunktsinformationen." +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgstr "``pgr_turnRestrictedPath`` Använd Yen's algoritm Vertex - Vertex routing med restriktioner" -msgid "Create a routing topology" -msgstr "Skapa en routningstopologi" +msgid "Output columns standardized to |nksp-result|" +msgstr "Utdatakolumner standardiserade till |nksp-result|" -msgid "Make sure the database does not have the ``vertices_table``" -msgstr "Kontrollera att databasen inte har ``vertices_table``" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" +msgstr "Använd Yen's algoritm för att få K kortaste vägar och analysera vägarna för att välja de vägar som inte använder begränsningarna" -msgid "Clean up the columns of the routing topology to be created" -msgstr "Rensa upp kolumnerna i den routningstopologi som ska skapas" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, **K**, [**options**])" -msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" -msgstr "När ``LINESTRING`` har en SRID används ``geom::geometry(POINT, )``" +msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +msgstr "**options:** ``[directed, heap_paths, stop_on_first, strict]``" -msgid "For big edge tables that are been prepared," -msgstr "För bord med stor kant som är förberedda," +msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" +msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` på en riktad graf" -msgid "Create it as ``UNLOGGED`` and" -msgstr "Skapa den som ``UNLOGGED`` och" +msgid "Special optional parameters" +msgstr "Särskilda valfria parametrar" -msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" -msgstr "Efter att tabellen har skapats ``ALTER TABLE .. SET LOGGED``" +msgid "``stop_on_first``" +msgstr "``stop_on_first``" -msgid "Inspect the vertices table" -msgstr "Inspektera tabellen med hörnpunkter" +msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgstr "När ``true`` stannar på första bästa väg som inte bryter mot restriktioner" -msgid "Create the routing topology on the edge table" -msgstr "Skapa routningstopologin på edge-tabellen" +msgid "When ``false`` returns at most K paths" +msgstr "När ``false`` returnerar högst K sökvägar" -msgid "Updating the ``source`` information" -msgstr "Uppdatering av informationen om ``källan``" +msgid "When ``true`` returns only paths that do not violate restrictions" +msgstr "När ``true`` returnerar endast sökvägar som inte bryter mot begränsningar" -msgid "Updating the ``target`` information" -msgstr "Uppdatering av informationen om \"målet" +msgid "When ``false`` returns the paths found" +msgstr "När ``false`` returneras de hittade sökvägarna" -msgid "Inspect the routing topology" -msgstr "Inspektera routingtopologin" +msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." +msgstr "Från toppunkt :math:`3` till :math:`8` med flaggan ``strict`` på." -msgid "**Generated topology**" -msgstr "**Genererad topologi**" +msgid "No results because the only path available follows a restriction." +msgstr "Inga resultat eftersom den enda tillgängliga vägen följer en begränsning." -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" +msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" +msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` i en odelad graf" -msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." -msgstr "``pgr_findCloseEdges`` - Hittar de närmaste kanterna till en punktgeometri." +msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" +msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` med fler alternativ" -msgid "``partial`` option is removed." -msgstr "``partial`` alternativet är borttaget." +msgid "``pgr_version``" +msgstr "``pgr_version``" -msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." -msgstr "``pgr_findCloseEdges`` - En verktygsfunktion som hittar den närmaste kanten till en punktgeometri." +msgid "``pgr_version`` — Query for pgRouting version information." +msgstr "``pgr_version`` - Fråga efter versionsinformation för pgRouting." -msgid "The geometries must be in the same coordinate system (have the same SRID)." -msgstr "Geometrierna måste ligga i samma koordinatsystem (ha samma SRID)." +msgid "Breaking change on result columns" +msgstr "Förändring i resultatkolumnerna" -msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." -msgstr "Koden för att göra beräkningarna kan erhållas för ytterligare specifika justeringar som krävs av applikationen." +msgid "Support for old signature ends" +msgstr "Stöd för gamla signaturer slutar" -msgid "``EMPTY SET`` is returned on dryrun executions" -msgstr "``EMPTY SET`` returneras vid dryrun-körningar" +msgid "Returns pgRouting version information." +msgstr "Returnerar versionsinformation för pgRouting." -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgstr "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "pgr_version()" +msgstr "pgr_version()" -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgstr "pgr_findCloseEdges(`Edges SQL`_, **punkter**, **tolerans**, [**alternativ**])" +msgid "RETURNS ``TEXT``" +msgstr "RETURNERAR ``TEXT``" -msgid "**options:** ``[cap, dryrun]``" -msgstr "**options:** ``[cap, dryrun]``" +msgid "pgRouting Version for this documentation" +msgstr "pgRouting Version för denna dokumentation" -msgid "Returns set of |result-find|" -msgstr "Returnerar uppsättning av |result-find|" +msgid "``pgr_vrpOneDepot`` - Experimental" +msgstr "``pgr_vrpOneDepot`` - Experimentell" -msgid "One point" -msgstr "En punkt" +msgid "**No documentation available**" +msgstr "**Ingen dokumentation tillgänglig**" -msgid "Get two close edges to points of interest with :math:`pid = 5`" -msgstr "Få två nära kanter till intressanta platser med :math:`pid = 5`" +msgid "**TBD**" +msgstr "**TBD**" -msgid "``cap => 2``" -msgstr "``cap => 2``" +msgid "TBD" +msgstr "TBD" -msgid "Many points" -msgstr "Många punkt" +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgstr "``pgr_withPoints`` - Returnerar den kortaste vägen i en graf med ytterligare tillfälliga toppar." -msgid "For each points of interests, find the closest edge." -msgstr "För varje intressepunkt, hitta den närmaste kanten." +msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "**point**" -msgstr "**punkt**" +msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgid "The point geometry" -msgstr "Punktgeometri" +msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgid "**points**" -msgstr "**punkter**" +msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -msgid "``POINT[]``" -msgstr "``POINT[]```" +msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" +msgstr "pgr_withpoints(text,text,text,boolean,character,boolean)" -msgid "An array of point geometries" -msgstr "En array av punktgeometrier" +msgid "pgr_withPoints(Combinations)" +msgstr "pgr_withPoints(Combinations)" -msgid "**tolerance**" -msgstr "**tolerans**" +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen." -msgid "Max distance between geometries" -msgstr "Max avstånd mellan geometrier" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**körsida**] [**alternativ**])" -msgid "Limit output rows" -msgstr "Begränsa utmatningsraderna" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**körsida**] [**options**])" -msgid "When ``false`` calculations are performed." -msgstr "När ``falska`` beräkningar utförs." +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**drivande sida**] [**optioner**])" -msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." -msgstr "När `` sanna`` beräkningar inte utförs och frågan för att göra beräkningarna exponeras i en PostgreSQL ``NOTICE``." +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**drivande sida**] [**optioner**])" -msgid "``geometry``" -msgstr "``geometry``" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgid "The ``LINESTRING`` geometry of the edge." -msgstr "Geometri för ``LINESTRING`` på kanten." +msgid "**options:** ``[directed, details])``" +msgstr "**options:** ``[directed, details])``" -msgid "When :math:`cap = 1`, it is the closest edge." -msgstr "När :math:`cap = 1` är det den närmaste kanten." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (utan detaljer)" -msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." -msgstr "Värde i <0,1> som anger den relativa positionen från den första ändpunkten på kanten." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgstr "Identifierare för banans startvertex. Negativt värde är för punktens identifierare." -msgid "Value in ``[r, l]`` indicating if the point is:" -msgstr "Värde i ``[r, l]`` som indikerar om punkten är:" +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgstr "Array med identifierare för startpunkter. Negativa värden är för punktens identifierare." -msgid "At the right ``r`` of the segment." -msgstr "På höger sida av segmentet." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgstr "Identifierare för banans slutpunkt. Negativt värde är för punktens identifierare." -msgid "When the point is on the line it is considered to be on the right." -msgstr "När punkten ligger på linjen anses den ligga till höger." +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +msgstr "Array med identifierare för ändpunkter. Negativa värden är för punktens identifierare." -msgid "At the left ``l`` of the segment." -msgstr "På vänster sida av segmentet." +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Alla exempel handlar om att resa från punkten :math:`1` och toppunkten :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`" -msgid "``distance``" -msgstr "``distance``" +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." +msgstr "``pgr_withPointsCost`` - Beräknar den kortaste vägen och returnerar endast den sammanlagda kostnaden för den kortaste vägen som hittats, för den kombination av punkter som anges." -msgid "Distance from the point to the edge." -msgstr "Avstånd från punkten till kanten." +msgid "**Driving side** parameter is unnamed and compulsory." +msgstr "*parametern *Driving side** är inte namngiven och är obligatorisk." -msgid "Original ``POINT`` geometry." -msgstr "Ursprunglig ``POINT`` geometri." +msgid "Output columns standardized to |matrix-result|" +msgstr "Utmatningskolumner standardiserade till |matrix-result|" -msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" -msgstr "``LINESTRING`` geometri som förbinder den ursprungliga **punkten** med den närmaste punkten på kanten med identifieraren ``edge_id``" +msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +msgstr "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -msgid "One point in an edge" -msgstr "En punkt i en kant" +msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgstr "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -msgid "The green node is the original point." -msgstr "Den gröna noden är den ursprungliga punkten." +msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgstr "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -msgid "``geom`` has the value of the original point." -msgstr "``geom`` har värdet av den ursprungliga punkten." +msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgstr "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." -msgstr "Geometrin ``kant`` är en linje som förbinder den ursprungliga punkten med kanten :math:`sp \\rightarrow ep` kant." +msgid "pgr_withpointscost(text,text,text,boolean,character)" +msgstr "pgr_withpointscost(text,text,text,boolean,character)" -msgid "The point is located at the left of the edge." -msgstr "Punkten är placerad till vänster om kanten." +msgid "pgr_withPointsCost(Combinations)" +msgstr "pgr_withPointsCost(Combinations)" -msgid "One point dry run execution" -msgstr "En punkts provkörning" +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." +msgstr "Modifiera grafen så att den innehåller punkter definierade av points_sql. Använd Dijkstra-algoritmen och returnera endast den sammanlagda kostnaden för den kortaste vägen som hittats." -msgid "Using the query from the previous example:" -msgstr "Använd frågan från föregående exempel:" +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgstr "Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer av toppar i den modifierade grafen." -msgid "Returns ``EMPTY SET``." -msgstr "Returnerar ``EMPTY SET``." +msgid "The returned values are in the form of a set of |matrix-result|." +msgstr "De returnerade värdena är i form av en uppsättning |matrix-result|." -msgid "``dryrun => true``" -msgstr "``dryrun => true``" +msgid "**positive** when it belongs to the edges_sql" +msgstr "**positiv** när den hör till kanterna_sql" -msgid "Generates a PostgreSQL ``NOTICE`` with the code used." -msgstr "Genererar en PostgreSQL ``NOTICE`` med den använda koden." +msgid "**negative** when it belongs to the points_sql" +msgstr "**negativ** när den hör till punktsql" -msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." -msgstr "Den genererade koden kan användas som en baskod för ytterligare krav, t.ex. för att ta hänsyn till SRID." +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgstr "Om de värden som returneras lagras i en tabell skulle det unika indexet vara paret: `(start_vid, end_vid)`." -msgid "Many points in an edge" -msgstr "Många punkter i en kant" +msgid "For **undirected** graphs, the results are **symmetric**." +msgstr "För **ej riktade** grafer är resultaten **symmetriska**." -msgid "The green nodes are the **original points**" -msgstr "De gröna noderna är **originalpunkterna**" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**drivande sida**] [**optioner**])" -msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" -msgstr "Geometrin ``geom``, markerad som **g1** och **g2** är de **originalpunkter**" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])" -msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." -msgstr "Geometrin ``kant``, markerad som **kant1** och **kant2** är en linje som förbinder **originalpunkten** med den närmaste punkten på :math:`sp \\rightarrow ep`-kanten." +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**] [**options**])" -msgid "Many points dry run execution" -msgstr "Utförande av torrkörning på många punkter" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])" -msgid "Do not process query" -msgstr "Bearbeta inte förfrågan" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" -msgstr "Generera en PostgreSQL ``NOTICE`` med koden som används för att beräkna alla kolumner" +msgid "**options:** ``[directed]``" +msgstr "**options:** ``[directed]``" -msgid "Find at most two routes to a given point" -msgstr "Hitta högst två vägar till en given punkt" +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgstr "Det finns ingen **details**-flagga, till skillnad från de andra medlemmarna i withPoints-familjen av funktioner." -msgid "Using :doc:`pgr_withPoints`" -msgstr "Använda :doc:`pgr_withPoints`" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf." -msgid "A point of interest table" -msgstr "Ett bord för intressepunkter" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf." -msgid "Handling points outside the graph." -msgstr "Hantering av punkter utanför grafen." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med körning på höger sida." -msgid "Points of interest" -msgstr "Attraktioner" +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Beräkna kostnaden för rutterna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." -msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." -msgstr "Ibland fungerar applikationerna \"on the fly\" med utgångspunkt från en plats som inte är ett vertex i grafen. Dessa platser kallas i pgRrouting för intressepunkter." +msgid "Being close to the graph does not mean have a shorter route." +msgstr "Att vara nära grafen betyder inte att man har en kortare väg." -msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." -msgstr "Den information som behövs i intressepunkterna är ``pid``, ``edge_id``, ``side``, ``fraction``." +msgid "Right side driving topology" +msgstr "Topologi för drivning av höger sida" -msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." -msgstr "På denna dokumentation kommer det att finnas cirka 6 fasta punkter av intresse och de kommer att lagras på ett bord." +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Reser från punkt :math:`1` och toppunkt :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`" -msgid "A unique identifier." -msgstr "En unik identifierare." +msgid "Left side driving topology" +msgstr "Topologi för drivning av vänster sida" -msgid "Identifier of the nearest segment." -msgstr "Identifierare för det närmaste segmentet." +msgid "Does not matter driving side driving topology" +msgstr "Spelar ingen roll drivsida drivtopologi" -msgid "Is it on the left, right or both sides of the segment ``edge_id``." -msgstr "Är det på vänster, höger eller båda sidor av segmentet ``edge_id``." +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgstr "``pgr_withPointsCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_withPoints`." -msgid "Where in the segment is the point located." -msgstr "Var i segmentet är punkten belägen." +msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgid "The geometry of the points." -msgstr "Punkternas geometri." +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" -msgid "The distance between ``geom`` and the segment ``edge_id``." -msgstr "Avståndet mellan ``geom`` och segmentet ``edge_id``." +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgstr "Kostnadsmatris för punkterna :math:`\\{1, 6\\}` och hörnen :math:`\\{10, 11\\}` i en **omdirigerad** graf" -msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." -msgstr "Ett segment som förbinder punktens ``geom`` med den närmaste punkten på segmentet ``edge_id``." +msgid "Returning a **symmetrical** cost matrix" +msgstr "Returnerar en **symmetrisk** kostnadsmatris" -msgid "``newPoint``" -msgstr "``newPoint``" +msgid "Using the default ``side`` value on the **points_sql** query" +msgstr "Använda standardvärdet ``side`` på **points_sql**-frågan" -msgid "A point on segment ``edge_id`` that is the closest to ``geom``." -msgstr "En punkt på segmentet ``edge_id`` som ligger närmast ``geom``." +msgid "Using the default ``driving side`` value" +msgstr "Använda standardvärdet för \"körsida" -msgid "Points of interest fill up" -msgstr "Intressanta platser fylls upp" +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Hitta matriskostnaden för rutterna från toppunkten :math:`1` och de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." -msgid "Inserting the points of interest." -msgstr "Infoga intressepunkterna." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." +msgstr "``pgr_withPointsDD`` - Returnerar köravståndet **från** en startpunkt." -msgid "Filling the rest of the table." -msgstr "Fyller resten av bordet." +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." -msgstr "Någon annan ytterligare modifiering: I denna manual kan punkten :math:`6` nås från båda sidor." +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "The points of interest:" -msgstr "De intressanta platserna:" +msgid "Output columns standardized to |result-spantree|" +msgstr "Utgångskolumner standardiserade till |result-spantree|" -msgid "``pgr_floydWarshall``" -msgstr "``pgr_floydWarshall``" +msgid "When ``details`` is ``false``:" +msgstr "När ``details`` är ``false``:" -msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." -msgstr "``pgr_floydWarshall`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen." +msgid "Points reached within the distance are not included." +msgstr "Punkter som nås inom avståndet ingår inte." -msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," -msgstr "Floyd-Warshall-algoritmen, även känd som Floyds algoritm, är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *täta grafer*. Vi använder Boosts implementation som körs på :math:`\\Theta(V^3)`-tid," +msgid "Deprecated signatures:" +msgstr "Föråldrade signaturer:" -msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" -msgstr "pgr_floydWarshall(`Kanter SQL`_, [``directed``])" +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgstr "Modifiera grafen så att den inkluderar punkter och använd Dijkstra-algoritmen för att extrahera alla noder och punkter som har kostnader som är mindre än eller lika med värdet ``**avstånd**`` från startpunkten. De extraherade kanterna kommer att överensstämma med motsvarande spännträd." -msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "För en riktad delgraf med kanter :math:`\\{1, 2, 3, 4\\}`." +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" -msgid "Boost `Floyd-Warshall `_" -msgstr "Boost `Floyd-Warshall `_" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" -msgid "``pgr_full_version``" -msgstr "``pgr_full_version``" +msgid "**options A:** ``[directed, details]``" +msgstr "**options A:** ``[directed, details]``" -msgid "``pgr_full_version`` — Get the details of pgRouting version information." -msgstr "``pgr_full_version`` - Hämta detaljerna i versionsinformationen för pgRouting." +msgid "**options B:** ``[directed, details, equicost]``" +msgstr "**options B:** ``[directed, details, equicost]``" -msgid "Get complete details of pgRouting version information" -msgstr "Få fullständig information om pgRouting version information" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" -msgid "pgr_full_version()" -msgstr "pgr_full_version()" +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgstr "Höger sida körtopologi, från punkt :math:`1` inom ett avstånd av :math:`3.3` med detaljer." -msgid "RETURNS |result-version|" -msgstr "RETURNS |result-version|" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" -msgid "Information about when this documentation was built" -msgstr "Information om när denna dokumentation skapades" +msgid "**options:** ``[directed, details, equicost]``" +msgstr "**options:** ``[directed, details, equicost]``" -msgid "``version``" -msgstr "``version``" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgstr "Från punkt :math:`1` och toppunkt :math:`16` inom ett avstånd av :math:`3.3` med ``equicost`` på en riktad graf" -msgid "pgRouting version" -msgstr "pgRouting-version" +msgid "Negative values represent a point" +msgstr "Negativa värden representerar en punkt" -msgid "``build_type``" -msgstr "``build_type``" +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Hitta köravståndet från de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." -msgid "The Build type" -msgstr "Typ av byggnad" +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgstr "Punkt :math:`-1` motsvarar den närmaste kanten från punkt :math:`(2,9, 1,8)`." -msgid "``compile_date``" -msgstr "``compile_date``" +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgstr "Punkt :math:`-2` motsvarar nästa nära kant från punkt :math:`(2,9, 1,8)`." -msgid "Compilation date" -msgstr "Datum för sammanställning" +msgid "Driving side does not matter" +msgstr "Körsidan spelar ingen roll" -msgid "``library``" -msgstr "``library``" +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgstr "Från punkt :math:`1` inom ett avstånd av :math:`3.3`, spelar ingen roll körsida, med detaljer." -msgid "Library name and version" -msgstr "Bibliotekets namn och version" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" -msgid "``system``" -msgstr "``system``" +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_withPointsKSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra." -msgid "Operative system" -msgstr "Operativt system" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "``postgreSQL``" -msgstr "``postgreSQL``" +msgid "pgr_withPointsKSP(One to Many)" +msgstr "pgr_withPointsKSP(One to Many)" -msgid "pgsql used" -msgstr "pgsql används" +msgid "pgr_withPointsKSP(Many to One)" +msgstr "pgr_withPointsKSP(Many to One)" -msgid "``compiler``" -msgstr "``compiler``" +msgid "pgr_withPointsKSP(Many to Many)" +msgstr "pgr_withPointsKSP(Many to Many)" -msgid "Compiler and version" -msgstr "Kompilator och version" +msgid "pgr_withPointsKSP(Combinations)" +msgstr "pgr_withPointsKSP(Combinations)" -msgid "``boost``" -msgstr "``boost``" +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgstr "Modifierar grafen så att den innehåller de punkter som definieras i `Points SQL`_ och använder Yen-algoritmen för att hitta de :math:`K` kortaste vägarna." -msgid "Boost version" -msgstr "Boost-version" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])" -msgid "``hash``" -msgstr "``hash``" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])" -msgid "Git hash of pgRouting build" -msgstr "Git-hash av pgRouting-byggnaden" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])" -msgid "``pgr_hawickCircuits`` - Experimental" -msgstr "``pgr_hawickCircuits`` - Experimentell" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])" -msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." -msgstr "``pgr_hawickCircuits`` - Returnerar listan över kretsar som använder Hawick-kretsalgoritmen." +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" -msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." -msgstr "Hawick Circuit algorithm, publicerades 2008 av Ken Hawick och Health A. James. Algoritmen löser problemet med att upptäcka och räkna upp kretsar i grafer. Den kan räkna upp kretsar i grafer med riktade arcs, multipla arcs och self-arcs med en minneseffektiv och högpresterande implementering. Den är en utvidgning av Johnsons algoritm för att hitta alla elementära kretsar i en riktad graf." +msgid "**options:** ``[directed, heap_paths, details]``" +msgstr "**options:** ``[directed, heap_paths, details]``" -msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." -msgstr "Det finns 2 varianter definierade i Boost Graph Library. Här har vi bara implementerat den andra eftersom den är det mest lämpliga och praktiska användningsfallet. I den här varianten får vi kretsarna efter att ha filtrerat bort de kretsar som orsakas av parallella kanter. Parallella kantkretsar har fler användningsfall när du vill räkna antalet kretsar. Kanske i framtiden kommer vi också att implementera denna variation." +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgstr "Få 2 vägar från punkt :math:`1` till punkt :math:`2` på en riktad graf med **vänster** sida som kör." -msgid "The algorithm implementation works only for directed graph" -msgstr "Implementeringen av algoritmen fungerar endast för riktade grafer" +msgid "For a directed graph." +msgstr "För en riktad graf." -msgid "It is a variation of Johnson's algorithm for circuit enumeration." -msgstr "Det är en variant av Johnsons algoritm för kretsuppräkning." +msgid "No details are given about distance of other points of the query." +msgstr "Inga detaljer ges om avståndet till andra punkter i frågan." -msgid "The algorithm outputs the distinct circuits present in the graph." -msgstr "Algoritmen matar ut de olika kretsar som finns i grafen." +msgid "No heap paths are returned." +msgstr "Inga heap-sökvägar returneras." -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" -msgstr "Tidskomplexitet: :math:`O((V + E) (c + 1))`" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Hämta 2 vägar från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` i en ostyrd graf" -msgid ":math:`|c|` is the number of circuits in the graph." -msgstr ":math:`|c|` is the number of circuits in the graph." +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgstr "Hämta en väg från punkt :math:`1` och vertex :math:`6` till punkt :math:`3` i en **riktad** graf med **höger** sida och **detaljer** inställt på **True**" -msgid "pgr_hawickCircuits(`Edges SQL`_)" -msgstr "pgr_hawickCircuits(`Kanter SQL`_)" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgstr "Hämta en väg från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` i en **directed** graf med **left** side driving och **heap_paths** satt till **True**" -msgid "Circuits present in the pgRouting :doc:`sampledata`" -msgstr "Kretsar som finns i pgRouting :doc:`sampledata`" +msgid "Using a combinations table on an **directed** graph" +msgstr "Använda en kombinationstabell på en **riktad** graf" -msgid "Id of the circuit starting from ``1``" -msgstr "Id för kretsen med början från ``1``" +msgid "Number of required paths" +msgstr "Antal nödvändiga sökvägar" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" -msgstr "Relativ position i banan. Har värdet ``0`` för början av banan" +msgid "withPointsKSP optional parameters" +msgstr "withPointsKSP valfria parametrar" -msgid "Identifier of the starting vertex of the circuit." -msgstr "Identifierare av kretsens startvertex." +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgstr "Skaffa :math:`2` banor med hjälp av vänstersidig körtopologi, från toppunkten :math:`1` till den närmaste platsen på grafen för punkten `(2,9, 1,8)`." -msgid "Identifier of the ending vertex of the circuit." -msgstr "Identifierare för kretsens slutpunkt." +msgid "Left driving side" +msgstr "Vänster körsida" -msgid "Identifier of the node in the path from a vid to next vid." -msgstr "Identifierare av noden i sökvägen från en vid till nästa vid." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgstr "Få :math:`2` banor med hjälp av vänstersidig drivtopologi, från punkt :math:`1` till punkt :math:`3` med detaljer." -msgid "`Boost: Hawick Circuit Algorithm `__" -msgstr "`Boost: Hawick Circuit Algorithm `__" +msgid "Right driving side" +msgstr "Höger körsida" -msgid "``pgr_isPlanar`` - Experimental" -msgstr "``pgr_isPlanar`` - Experimentell" +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgstr "Få :math:`2` banor med hjälp av höger sidas drivande topologi från, punkt :math:`1` till punkt :math:`2` med högbanor och detaljer." -msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." -msgstr "``pgr_isPlanar`` - Returnerar ett boolean beroende på grafens planaritet." +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" -msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." -msgstr "En graf är plan om den kan ritas i ett tvådimensionellt rum utan att två av dess kanter korsar varandra. En sådan ritning av en plan graf kallas för en plan ritning. Varje plan graf kan också ritas med en rak linje, vilket är en plan ritning där varje kant representeras av ett linjesegment. När en graf har :math:`K_5` eller :math:`K_{3, 3}` som undergraf är grafen inte plan." +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgstr "``pgr_withPointsVia`` - Rutt som går genom en lista med toppar och/eller punkter." -msgid "This implementation use the Boyer-Myrvold Planarity Testing." -msgstr "Denna implementering använder Boyer-Myrvolds planaritetstest." +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "It will return a boolean value depending upon the planarity of the graph." -msgstr "Den returnerar ett booleskt värde som beror på grafens planhet." +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "Med tanke på en graf, en uppsättning punkter på grafens kanter och en lista med hörnpunkter är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en hörnpunkt eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)`." -msgid "Applicable only for **undirected** graphs." -msgstr "Gäller endast för **undirected** grafer." +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgstr "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" -msgid "The algorithm does not considers traversal costs in the calculations." -msgstr "Algoritmen tar inte hänsyn till traversalkostnader i beräkningarna." +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgstr "Hitta rutten som besöker topparna :math:`\\{ -6, 15, -1\\\\}` i den ordningen med höger körsida i riktad graf..." -msgid "Running time: :math:`O(|V|)`" -msgstr "Speltid: :math:`O(|V|)`" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" +msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_" -msgid "pgr_isPlanar(`Edges SQL`)" -msgstr "pgr_isPlanar(`Kanter SQL`)" +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." +msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-1, 7, -3, 16, 15\\}` i den ordningen i en **riktad** graf." -msgid "RETURNS ``BOOLEAN``" -msgstr "RETURNERAR ``BOOLEAN``" +msgid "Prim - Family of functions" +msgstr "Prim - Familj av funktioner" -msgid "Returns a boolean ``(pgr_isplanar)``" -msgstr "Returnerar en boolean ``(pgr_isplanar)```" +msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." +msgstr "Prim-algoritmen utvecklades 1930 av den tjeckiske matematikern Vojtěch Jarník. Det är en girig algoritm som hittar ett träd med minsta spännvidd för en viktad oiktad graf. Detta innebär att den hittar en delmängd av kanterna som bildar ett träd som inkluderar varje vertex, där den totala vikten av alla kanter i trädet minimeras. Algoritmen bygger trädet ett vertex i taget, från ett godtyckligt startvertex, och lägger i varje steg till den billigaste möjliga förbindelsen från trädet till ett annat vertex." -msgid "``pgr_isplanar``" -msgstr "``pgr_isplanar``" +msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." +msgstr "Den här algoritmen hittar den minsta överspännande skogen i en eventuellt frånkopplad graf; däremot hittar den mest grundläggande formen av Prims algoritm bara minsta överspännande träd i sammanhängande grafer. Men om man kör Prims algoritm separat för varje ansluten komponent i grafen kallas den minsta spännvidden för skog." -msgid "`true` when the graph is planar." -msgstr "`true` när grafen är planar." +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgstr "Från Boost Graph: \"Algoritmen som den implementeras i Boost.Graph ger inte korrekta resultat på grafer med parallella kanter.\"" -msgid "`false` when the graph is not planar." -msgstr "`false` när grafen inte är planar." +msgid "Boost: `Prim's algorithm `__" +msgstr "Boost: `Prims algoritm `__" -msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." -msgstr "Följande kanter kommer att göra undergrafen med topparna {10, 15, 11, 16, 13} till en :math:`K_1`-graf." +msgid "Wikipedia: `Prim's algorithm `__" +msgstr "Wikipedia: `Prims algoritm `__" -msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." -msgstr "Den nya grafen är inte plan eftersom den har en :math:`K_5`-undergraf. Kanter i blått representerar :math:`K_5` subgraf." +msgid "Proposed Functions" +msgstr "Föreslagna funktioner" -msgid "`Boost: Boyer Myrvold `__" -msgstr "`Boost: Boyer Myrvold `__" +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgid "``pgr_johnson``" -msgstr "``pgr_johnson``" +msgid "Reference" +msgstr "Referens" -msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." -msgstr "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par noder i grafen med hjälp av Johnson-algoritmen." +msgid "Release Notes" +msgstr "Versionsinformation" -msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," -msgstr "Johnson-algoritmen är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *glesa grafer*. Den använder Boosts implementation som körs på :math:`O(V E \\log V)` tid," +msgid "To see the full list of changes check the list of `Git commits `_ on Github." +msgstr "För att se den fullständiga listan över ändringar, se listan över `Git commits `_ på Github." -msgid "pgr johnson(`Edges SQL`_, [``directed``])" -msgstr "pgr johnson(`Kanter SQL`_, [``directed``])" +msgid "Mayors" +msgstr "Borgmästare" -msgid "Boost `Johnson `_" -msgstr "Boost `Johnson `_" +msgid "pgRouting 4" +msgstr "pgRouting 4" -msgid "``pgr_kingOrdering`` - Experimental" -msgstr "``pgr_kingOrdering`` - Experimentell" +msgid "Minors 4.x" +msgstr "Minors 4.x" -msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." -msgstr "``pgr_kingOrdering`` - Returnerar King-ordningen för en odelad graf." +msgid "pgRouting 4.1" +msgstr "pgRouting 4.1" -msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." -msgstr "Inom numerisk linjär algebra och grafteori är King Ordering Algorithm en heuristisk metod för att omordna topparna i en graf så att bandbredden minskar." +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" -msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." -msgstr "Metoden följer en BFS-traversering (breadth-first search), men med en förfining: i varje steg infogas de obesökta grannarna till det aktuella toppunktet i kön i stigande ordning efter deras pseudograd, där pseudograden för ett toppunkt är antalet kanter som ansluter det till ännu obesökta toppunkter. Den här prioriteringen ger ofta en mindre bandbredd jämfört med enklare BFS-ordning." +#, fuzzy +msgid "pgRouting 4.0.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.1" -msgid "The implementation targets undirected graphs." -msgstr "Implementationen är inriktad på oledade grafer." +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" -msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." -msgstr "Minimering av bandbredd är ett NP-komplett problem; King Ordering ger en praktisk lokal minimeringsmetod." +msgid "Bug Fixes" +msgstr "Buggfixar" -msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" -msgstr "Tidskomplexiteten är: :math:`O(m^2 \\log(m)|E|)`" +msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" +msgstr "`#2966 `__: pgr_withPoints väljer inte optimal rutt när fraction = 1" -msgid "where :math:`|E|` is the number of edges," -msgstr "där :math:`|E|` är antalet kanter," +#, fuzzy +msgid "`#3034 `__: metrics driver should not be using new" +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid ":math:`m` is the maximum degree among all vertices." -msgstr ":math:`m` är den högsta graden bland alla toppar." +#, fuzzy +msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" +msgstr "`#2802 `__: Omorganisering av kod för pgr_contraction" -msgid "pgr_kingOrdering(`Edges SQL`_)" -msgstr "pgr_kingOrdering(`Edges SQL`_)" +#, fuzzy +msgid "`#3040 `__: Check and fix cppcoreguidelines-virtual-class-destructor" +msgstr "`#1002 `__: Fixade problem med sammandragning:" -msgid "`Boost: King Ordering `__" -msgstr "`Boost: Kungens beställning `__" +#, fuzzy +msgid "`#3039 `__: Check and fix cppcoreguidelines-special-member-functions" +msgstr "`#2605 `__: Standardisera utdata för funktioner för spänningsträd" -msgid "``pgr_kruskal``" -msgstr "``pgr_kruskal``" +#, fuzzy +msgid "`#3038 `__: Check and fix cppcoreguidelines-prefer-member-initializer" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." -msgstr "``pgr_kruskal`` - Minsta spännviddsträd för en graf med Kruskals algoritm." +#, fuzzy +msgid "`#3037 `__: Check and fix cppcoreguidelines-init-variables" +msgstr "`#2909 `__: pgr_edgeDisjointPaths" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." -msgstr "Denna algoritm hittar den minsta spännvidden i en eventuellt frånkopplad graf med hjälp av Kruskals algoritm." +#, fuzzy +msgid "`#3035 `__: Pass by reference on existing drivers" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "EMPTY SET is returned when there are no edges in the graph." -msgstr "EMPTY SET returneras när det inte finns några kanter i grafen." +#, fuzzy +msgid "Administration" +msgstr "Begränsningar" -msgid "pgr_kruskal(`Edges SQL`_)" -msgstr "pgr_kruskal(`Kanter SQL`_)" +#, fuzzy +msgid "`#3031 `__: pgtap license to Creative commons and License texts standardization" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -msgid "Returns set of |result-mst|" -msgstr "Returnerar uppsättning av |result-mst|" +msgid "pgRouting 4.0.0 Release Notes" +msgstr "pgRouting 4.0.0 Release Notes" -msgid "Minimum spanning forest" -msgstr "Skog med minsta spann" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" -msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." -msgstr "``pgr_kruskalBFS`` - Kruskals algoritm för minsta spännviddsträd med bredd först sökordning." +msgid "Build" +msgstr "Skapa" -msgid "Added ``pred`` result columns." -msgstr "Lagt till ``pred`` resultatkolumner." +msgid "C++ standard is std17" +msgstr "C++-standarden är std17" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Kruskals algoritm." +msgid "Using this standard, all supported toolchains across our CI matrix will work." +msgstr "Med hjälp av denna standard kommer alla verktygskedjor som stöds i vår CI-matris att fungera." -msgid "Returned tree nodes from a root vertex are on Breath First Search order" -msgstr "Returnerade trädnoder från en rotvertex är på Breath First Search-ordning" +msgid "The code is not yet modified to use std17:" +msgstr "Koden är ännu inte modifierad för att använda std17:" -msgid "Breath First Search Running time: :math:`O(E + V)`" -msgstr "Breath First Search Speltid: :math:`O(E + V)`" +msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." +msgstr "Om det behövs: ``-DCMAKE_CXX_STANDARD=14`` för att sänka standarden." -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_kruskalBFS(`Kanter SQL`_, **root vid**, [``max_depth``])" +msgid "The user's documentation is built by default." +msgstr "Användarens dokumentation byggs som standard." -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_kruskalBFS(`Kanter SQL`_, **root vids**, [``max_depth``])" +msgid "The doxygen documentation is built by default." +msgstr "Doxygen-dokumentationen byggs som standard." -msgid "The Minimum Spanning Tree having as root vertex :math:`6`" -msgstr "Det minsta spännviddsträdet som har som rotvertex :math:`6``" +msgid "For developers:" +msgstr "För utvecklare:" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" -msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`djup \\leq 3`" +msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." +msgstr "Ställ in `-DUSE_CLANG_TIDY=ON` för clang tidy-kontroller." -msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." -msgstr "``pgr_kruskalDD`` - Fångar upp noder med hjälp av Kruskals algoritm." +msgid "Tidy checks are done on CI." +msgstr "Ordentliga kontroller görs på CI." -msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." -msgstr "Använd Kruskals algoritm för att extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett **avstånd** från en **rot**-vertex (eller vertex) inom det beräknade minsta spännvidden i trädet." +msgid "Documentation build" +msgstr "Uppbyggnad av dokumentation" -msgid "Returned tree nodes from a root vertex are on Depth First Search order." -msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning." +msgid "The doxygen documentation is built by default" +msgstr "Doxygen-dokumentationen byggs som standard" -msgid "Depth First Search running time: :math:`O(E + V)`" -msgstr "Djup Första sökning Löptid: :math:`O(E + V)`" +msgid "The HTML documentation is built by default" +msgstr "HTML-dokumentationen byggs som standard" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vid**, **distance**)" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" +msgstr "HTML-dokumentationen för översatta språk (en, es, sv, zh_Hans) byggs som standard" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vids**, **distance**)" +msgid "`WITH-DOC` is not used anymore" +msgstr "`WITH-DOC` används inte längre" -msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" -msgstr "Det minsta spännviddsträdet som börjar på toppunkten :math:`6` med :math:`avstånd \\leq 3.5`" +msgid "User Documentation is not built when" +msgstr "Användardokumentation skapas inte när" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" -msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`avstånd \\leq 3.5`" +msgid "Sphinx is not found" +msgstr "Sfinxen hittas inte" -msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_kruskalDFS`` - Kruskals algoritm för minsta spännviddsträd med djup första sökordning." +msgid "When all Sphinx formats are OFF" +msgstr "När alla Sphinx-format är OFF" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Kruskals algoritm." +msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" +msgstr "För att inte bygga HTML-standardformat: `-DBUILD_HTML=OFF`" -msgid "Returned tree nodes from a root vertex are on Depth First Search order" -msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning" +msgid "When all languages are OFF" +msgstr "När alla språk är OFF" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_kruskalDFS(`Kanter SQL`_, **root vid**, [``max_depth``])" +msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" +msgstr "Om du bara vill bygga på engelska: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_kruskalDFS(`Kanter SQL`_, **root vids**, [``max_depth``])" +msgid "Documentation output location: ``build/doc/_build/``" +msgstr "Plats för dokumentationsutdata: ``build/doc/_build/``" -msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" -msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimentell" +msgid "For example: for HTML output is on `build/doc/_build/html` directory" +msgstr "Till exempel: för HTML-utdata i katalogen `build/doc/_build/html`" -msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." -msgstr "``pgr_lengauerTarjanDominatorTree`` - Returnerar den omedelbara dominatorn för alla toppar." +msgid "Developers' Documentation is not built when" +msgstr "Dokumentation för utvecklare byggs inte när" -msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." -msgstr "Algoritmen beräknar den * omedelbara dominatorn * för varje toppunkt som kallas **idom**, när **idom** för varje toppunkt har beräknats genom att göra varje **idom** för varje toppunkt som dess förälder, kan dominatorträdet byggas." +msgid "Doxygen is not found" +msgstr "Doxygen hittas inte" -msgid "The algorithm works in directed graph only." -msgstr "Algoritmen fungerar endast i riktade grafer." +msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" +msgstr "Om du inte vill bygga Doxygen-dokumentation: `-DBUILD_DOXY=OFF`" -msgid "The algorithm returns *idom* of each vertex." -msgstr "Algoritmen returnerar *idom* för varje toppunkt." +msgid "Summary of changes by function" +msgstr "Sammanfattning av förändringar per funktion" -msgid "If the *root vertex* not present in the graph then it returns empty set." -msgstr "Om *rotvertexet* inte finns i grafen returneras en tom uppsättning." +msgid "pgr_aStar" +msgstr "pgr_aStar" -msgid "Running time: :math:`O((V+E)log(V+E))`" -msgstr "Drifttid: :math:`O((V+E)log(V+E))`" +msgid "pgr_aStarCost" +msgstr "pgr_aStarCost" -msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" -msgstr "pgr_lengauerTarjanDominatorTree(`Kanter SQL`_, **root vertex**)" +msgid "pgr_bandwidth" +msgstr "pgr_bandwidth" -msgid "Returns set of |result-idom|" -msgstr "Returnerar uppsättning av |result-idom|" +msgid "pgr_bdAstar" +msgstr "pgr_bdAstar" -msgid "The dominator tree with root vertex :math:`5`" -msgstr "Dominatorträdet med rotvertex :math:`5`" +msgid "pgr_bdAstarCost" +msgstr "pgr_bdAstarCost" -msgid "SQL query as described above." -msgstr "SQL-fråga enligt beskrivningen ovan." +msgid "pgr_bdDijkstra" +msgstr "pgr_bdDijkstra" -msgid "**root vertex**" -msgstr "**Rot toppunkt**" +msgid "pgr_bdDijkstraCost" +msgstr "pgr_bdDijkstraCost" -msgid "Returns set of ``(seq, vertex_id, idom)``" -msgstr "Returnerar uppsättning av ``(seq, vertex_id, idom)``" +msgid "pgr_bellmanFord" +msgstr "pgr_bellmanFord" -msgid "``vertex_id``" -msgstr "``vertex_id``" +msgid "pgr_binaryBreadthFirstSearch" +msgstr "pgr_binaryBreadthFirstSearch" -msgid "Identifier of vertex ." -msgstr "Identifierare för toppunkt ." +msgid "pgr_bipartite" +msgstr "pgr_bipartite" -msgid "``idom``" -msgstr "``idom``" +msgid "pgr_boykovKolmogorov" +msgstr "pgr_boykovKolmogorov" -msgid "Immediate dominator of vertex." -msgstr "Omedelbar dominator av toppunkt." +msgid "pgr_breadthFirstSearch" +msgstr "pgr_breadthFirstSearch" -msgid "Dominator tree of another component." -msgstr "Dominant träd av en annan komponent." +msgid ":" +msgstr ":" -msgid "`Boost: Lengauer-Tarjan dominator `__" -msgstr "`Boost: Lengauer-Tarjan dominator `__" +msgid "pgr_contraction" +msgstr "pgr_contraction" -msgid "`Wikipedia: dominator tree `__" -msgstr "`Wikipedia: dominatorträd `__" +msgid "pgr_dagShortestPath" +msgstr "pgr_dagShortestPath" -msgid "``pgr_lineGraph`` - Proposed" -msgstr "``pgr_lineGraph`` - Föreslagen" +msgid "pgr_depthFirstSearch" +msgstr "pgr_depthFirstSearch" -msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." -msgstr "``pgr_lineGraph`` - Transformerar den givna grafen till dess motsvarande kantbaserade graf." +msgid "pgr_dijkstra" +msgstr "pgr_dijkstra" -msgid "Works for directed and undirected graphs." -msgstr "Fungerar för riktade och oriktade grafer." +msgid "pgr_dijkstraCost" +msgstr "pgr_dijkstraCost" -msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" -msgstr "Givet en graf :math:`G`, är dess linjegraf :math:`L(G)` en sådan graf att:" +msgid "pgr_dijkstraNear" +msgstr "pgr_dijkstraNear" -msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." -msgstr "Varje toppunkt i :math:`L(G)` representerar en kant i :math:`G`." +msgid "pgr_dijkstraNearCost" +msgstr "pgr_dijkstraNearCost" -msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" -msgstr "Två hörn i :math:`L(G)` är angränsande om och endast om deras motsvarande kanter har en gemensam ändpunkt i :math:`G`" +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" -msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." -msgstr "Kolumnerna ``cost`` och ``reverse_cost`` i resultatet representerar existensen av kanten." +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" -msgid "When the graph is directed the result is directed." -msgstr "När grafen är riktad är resultatet riktat." +msgid "pgr_edgeDisjointPaths" +msgstr "pgr_edgeDisjointPaths" -msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." -msgstr "För att få en komplett linjediagram används unika identifierare på dubbelvägskanterna (se `Ytterligare exempel`_)." +msgid "pgr_edmondsKarp" +msgstr "pgr_edmondsKarp" -msgid "When the graph is undirected the result is undirected." -msgstr "När grafen är odränerad är resultatet odränerat." +msgid "pgr_edwardMoore" +msgstr "pgr_edwardMoore" -msgid "The ``reverse_cost`` is always :math:`-1`." -msgstr "Den ``omvända_kostnaden`` är alltid :math:`-1`." +msgid "pgr_kingOrdering" +msgstr "pgr_kingOrdering" -msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" -msgstr "pgr_lineGraph(`Kanter SQL`_, [``directed``])" +msgid "pgr_KSP" +msgstr "pgr_KSP" -msgid "Returns set of |result-lineg|" -msgstr "Returnerar uppsättning av |result-lineg|" +msgid "pgr_maxCardinalityMatch" +msgstr "pgr_maxCardinalityMatch" -msgid "For an undirected graph with edges :math:'{2,4,5,8}'" -msgstr "För en enkelriktad graf med kanter :math:'{2,4,5,8}'" +msgid "pgr_maxFlow" +msgstr "pgr_maxFlow" -msgid "Gives a local identifier for the edge" -msgstr "Ger en lokal identifierare för kanten" +msgid "pgr_pushRelabel" +msgstr "pgr_pushRelabel" -msgid "When `negative`: the source is the reverse edge in the original graph." -msgstr "När `negativ`: källan är den omvända kanten i den ursprungliga grafen." +msgid "pgr_sequentialVertexColoring" +msgstr "pgr_sequentialVertexColoring" -msgid "When `negative`: the target is the reverse edge in the original graph." -msgstr "När `negativ`: målet är den omvända kanten i den ursprungliga grafen." +msgid "pgr_sloanOrdering" +msgstr "pgr_sloanOrdering" -msgid "Weight of the edge (``source``, ``target``)." -msgstr "Kantvikt (``källa``, ``mål``)." +msgid "pgr_topologicalSort" +msgstr "pgr_topologicalSort" -msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." -msgstr "När `negativ`: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen." +msgid "pgr_transitiveClosure" +msgstr "pgr_transitiveClosure" -msgid "Weight of the edge (``target``, ``source``)." -msgstr "Kantvikt (``mål``, ``källa``)." +msgid "pgr_trsp" +msgstr "pgr_trsp" -msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." -msgstr "När `negativ`: kant (``mål``, ``källa``) finns inte, därför är den inte en del av grafen." +msgid "pgr_trspVia" +msgstr "pgr_trspVia" -msgid "Given the following directed graph" -msgstr "Givet följande riktade graf" +msgid "pgr_trspVia_withPoints" +msgstr "pgr_trspVia_withPoints" -msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" -msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgid "pgr_trsp_withPoints" +msgstr "pgr_trsp_withPoints" -msgid "Representation as directed with shared edge identifiers" -msgstr "Representation som riktad med delade kantidentifierare" +msgid "pgr_TSP" +msgstr "pgr_TSP" -msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" -msgstr "För enkelhetens skull har utformningen av kanttabellen i databasen, att kanternas identifierare representeras med 3 siffror:" +msgid "pgr_TSPeuclidean" +msgstr "pgr_TSPeuclidean" -msgid "hundreds" -msgstr "hundratals" +msgid "pgr_turnRestrictedPath" +msgstr "pgr_turnRestrictedPath" -msgid "the source vertex" -msgstr "källvertexen" +msgid "pgr_withPoints" +msgstr "pgr_withPoints" -msgid "tens" -msgstr "tiotals" +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" -msgid "always 0, acts as a separator" -msgstr "alltid 0, fungerar som en separator" +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" -msgid "units" -msgstr "enheter" +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" -msgid "the target vertex" -msgstr "målvertexen" +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" -msgid "In this image," -msgstr "I den här bilden," +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" -msgid "Single or double head arrows represent one edge (row) on the edges table." -msgstr "Pilarna med enkelt eller dubbelt huvud representerar en kant (rad) på kanttabellen." +msgid "Functions promoted to official" +msgstr "Funktioner som befordrats till tjänsteman" -msgid "The numbers in the yellow shadow are the edge identifiers." -msgstr "Siffrorna i den gula skuggan är kantidentifierare." +msgid "`#2701 `__: pgr_trsp" +msgstr "`#2701 `__: pgr_trsp" -msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." -msgstr "Två par kanter delar samma identifierare när kolumnen ``reverse_cost`` används." +msgid "`#2701 `__: pgr_trspVia" +msgstr "`#2701 `__: pgr_trspVia" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." -msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras av en kantrad med :math:`id=203`." +msgid "`#2701 `__: pgr_trspVia_withPoints" +msgstr "`#2701 `__: pgr_trspVia_withPoints" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." -msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras av en kantrad med :math:`id=304`." +msgid "`#2701 `__: pgr_trsp_withPoints" +msgstr "`#2701 `__: pgr_trsp_withPoints" -msgid "The graph can be created as follows:" -msgstr "Grafen kan skapas på följande sätt:" +msgid "`#2700 `__: pgr_withPoints" +msgstr "`#2700 `__: pgr_withPoints" -msgid "Line Graph of a directed graph represented with shared edges" -msgstr "Linjediagram över en riktad graf som representeras med delade kanter" +msgid "`#2700 `__: pgr_withPointsCost" +msgstr "`#2700 `__: pgr_withPointsCost" -msgid "The result is a directed graph." -msgstr "Resultatet är en riktad graf." +msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgstr "`#2700 `__: pgr_withPointsCostMatrix" -msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" -msgstr "För :math:`seq=4` från :math:`203 \\vänster höger pil 304` representerar två kanter" +msgid "`#2700 `__: pgr_withPointsDD" +msgstr "`#2700 `__: pgr_withPointsDD" -msgid "For all the other values of ``seq`` represent one edge." -msgstr "För alla andra värden av ``seq`` representerar en kant." +msgid "`#2700 `__: pgr_withPointsKSP" +msgstr "`#2700 `__: pgr_withPointsKSP" -msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." -msgstr "Värdena ``cost`` och ``reverse_cost`` anger om kanten existerar." +msgid "`#2700 `__: pgr_withPointsVia" +msgstr "`#2700 `__: pgr_withPointsVia" -msgid "When positive: the edge exists." -msgstr "När den är positiv: kanten finns." +msgid "`#2983 `__: pgr_dijkstraNear" +msgstr "`#2983 `__: pgr_dijkstraNear" -msgid "When negative: the edge does not exist." -msgstr "När den är negativ: kanten existerar inte." +msgid "`#2983 `__: pgr_dijkstraNearCost" +msgstr "`#2983 `__: pgr_dijkstraNearCost" -msgid "Representation as directed with unique edge identifiers" -msgstr "Representation som riktad med unika kantidentifierare" +msgid "`#2983 `__: pgr_dijkstraVia" +msgstr "`#2983 `__: pgr_dijkstraVia" -msgid "Single head arrows represent one edge (row) on the edges table." -msgstr "Pilarna med ett huvud representerar en kant (rad) i tabellen över kanter." +msgid "Signatures promoted to official" +msgstr "Underskrifter befordrade till officiella" -msgid "There are no double head arrows" -msgstr "Det finns inga pilar med dubbla huvuden" +msgid "`#2718 `__: pgr_aStar(Combinations)" +msgstr "`#2718 `__: pgr_aStar(Kombinationer)" -msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." -msgstr "Två par kanter har samma slutnoder och kolumnen ``reverse_cost`` används inte." +msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgstr "`#2718 `__: pgr_aStarCost(Kombinationer)" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." -msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras med två kanter :math:`id=203` respektive :math:`id=302`." +msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgstr "`#2718 `__: pgr_bdAstar(Kombinationer)" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." -msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras med två kanter :math:`id=304` respektive :math:`id=403`." +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgstr "`#2718 `__: pgr_bdAstarCost(Kombinationer)" -msgid "Line Graph of a directed graph represented with unique edges" -msgstr "Linjediagram över en riktad graf som representeras med unika kanter" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" +msgstr "`#2718 `__: pgr_bdDijkstra(Kombinationer)" -msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." -msgstr "För :math:`seq=7` från :math:`203 \\leftrightarrow 302` representerar två kanter." +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgstr "`#2718 `__: pgr_bdDijkstraCost(Kombinationer)" -msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." -msgstr "För :math:`seq=8` från :math:`304 \\vänster höger pil 403` representerar två kanter." +msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgstr "`#2718 `__: pgr_dijkstra(Kombinationer)" -msgid "wikipedia: `Line Graph `__" -msgstr "wikipedia: `Linjediagram `__" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgstr "`#2718 `__: pgr_dijkstraCost(Kombinationer)" -msgid "mathworld: `Line Graph `__" -msgstr "mathworld: `Linjegraf `__" +msgid "`#2718 `__: pgr_KSP(All signatures)" +msgstr "`#2718 `__: pgr_KSP(Alla signaturer)" -msgid "``pgr_lineGraphFull`` - Experimental" -msgstr "``pgr_lineGraphFull`` - Experimentell" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" +msgstr "`#2718 `__: pgr_boykovKolmogorov(Kombinationer)" -msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." -msgstr "``pgr_lineGraphFull`` - Transformerar en given graf till en ny graf där alla hörn från den ursprungliga grafen konverteras till linjegrafer." +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgstr "`#2718 `__: pgr_edmondsKarp(Kombinationer)" -msgid "Version 2.6.0" -msgstr "Version 2.6.0" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" +msgstr "`#2718 `__: pgr_maxFlow(Kombinationer)" -msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." -msgstr "``pgr_lineGraphFull``, konverterar en ursprunglig riktad graf till en riktad linjegraf genom att konvertera varje vertex till en komplett graf och behålla alla ursprungliga kanter. De nya anslutande kanterna har en kostnad på 0 och går mellan de intilliggande ursprungliga kanterna, med respekt för riktningen." +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" +msgstr "`#2718 `__: pgr_pushRelabel(Kombinationer)" -msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" -msgstr "En möjlig tillämpning av den resulterande grafen är **\"routing med två kantbegränsningar\"**:" +msgid "New experimental functions." +msgstr "Nya experimentella funktioner." -msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" -msgstr "Ställer in en kostnad för att använda vertexen vid routing mellan kanter på den anslutande kanten" +msgid "Metrics" +msgstr "Mätvärde" -msgid "Forbid the routing between two edges by removing the connecting edge" -msgstr "Förbjud routing mellan två kanter genom att ta bort den anslutande kanten" +msgid "`#2951 `__: pgr_bandwidth" +msgstr "`#2951 `__: pgr_bandbredd" -msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." -msgstr "Detta är möjligt eftersom alla korsningar (hörnpunkter) i den ursprungliga grafen nu är kompletta grafer som har en ny kant för varje möjlig sväng över korsningen." +msgid "Ordering" +msgstr "Ordning" -msgid "This function is for **directed** graphs." -msgstr "Denna funktion är avsedd för **riktade** grafer." +msgid "`#2954 `__: pgr_kingOrdering" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "Results are undefined when a negative vertex id is used in the input graph." -msgstr "Resultaten är odefinierade när ett negativt vertex-id används i indatagrafen." +msgid "`#2955 `__: pgr_sloanOrdering" +msgstr "`#2955 `__: pgr_sloanOrdering" -msgid "Results are undefined when a duplicated edge id is used in the input graph." -msgstr "Resultaten är odefinierade när ett duplicerat kant-ID används i indatagrafen." +msgid "SQL signatures and output standardization" +msgstr "SQL-signaturer och standardisering av utdata" -msgid "Running time: TBD" -msgstr "Löptid: TBD" +msgid "`#2904 `__: Standardize output columns of functions with different output" +msgstr "`#2904 `__: Standardisera utdatakolumner för funktioner med olika utdata" -msgid "pgr_lineGraphFull(`Edges SQL`_)" -msgstr "pgr_lineGraphFull(`Kanter SQL`_)" +msgid "columns within overloads" +msgstr "kolumner inom överbelastningar" -msgid "Returns set of |result-linegf|" -msgstr "Returnerar uppsättning av |result-linegf|" +msgid "Standardized to |short-generic-result|" +msgstr "Standardiserad till |short-generic-result|" -msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" -msgstr "Fullständig linjegraf av delgraf av kanter :math:`{\\4, 7, 8, 10\\}`" +msgid "`#2905 `__: pgr_withPoints" +msgstr "`#2905 `__: pgr_withPoints" -msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." -msgstr "Exemplen inkluderar delgrafen som innehåller kanterna 4, 7, 8 och 10 med ``reverse_cost``." +msgid "`#2906 `__: pgr_bdDijkstra" +msgstr "`#2906 `__: pgr_bdDijkstra" -msgid "The data" -msgstr "Uppgifterna" +msgid "`#2907 `__: pgr_bellmanFord" +msgstr "`#2907 `__: pgr_bellmanFord" -msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." -msgstr "Detta exempel visar hur denna grafomvandling fungerar för att skapa ytterligare kanter för varje möjlig vändning i en graf." +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgstr "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgid "|first|" -msgstr "|first|" +msgid "`#2910 `__: pgr_edwardMoore" +msgstr "`#2910 `__: pgr_edwardMoore" -msgid "first" -msgstr "första" +msgid "`#2913 `__: pgr_dagShortestPath" +msgstr "`#2913 `__: pgr_dagShortestPath" -msgid "The transformation" -msgstr "Omvandlingen" +msgid "Standardized to |matrix-result|" +msgstr "Standardiserat till |matrix-result|" -msgid "|second|" -msgstr "|second|" +msgid "`#2905 `__: pgr_withPointsCost" +msgstr "`#2905 `__: pgr_withPointsCost" -msgid "second" -msgstr "sekund" +msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgstr "`#2905 `__: pgr_withPointsCostMatrix" -msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." -msgstr "I den transformerade grafen finns alla kanter från den ursprungliga grafen kvar (gult), men vi har nu ytterligare kanter för varje sväng som skulle kunna göras över toppunkt 7 (orange)." +msgid "Standardized to |generic-result|" +msgstr "Standardiserat till |generic-result|" -msgid "Creating table that identifies transformed vertices" -msgstr "Skapa tabell som identifierar transformerade toppar" +msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgstr "`#2909 `__: pgr_edgeDisjointPaths" -msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." -msgstr "Varje toppunkt i den transformerade grafen skapas genom att dela upp toppunkterna i den ursprungliga grafen. Om inte en vertex i den ursprungliga grafen är en bladvertex kommer den att generera mer än en vertex i den transformerade grafen. Ett av de nyskapade vertexen i den transformerade grafen får samma vertexidentifierare som det vertex som det skapades från i den ursprungliga grafen, men resten av de nyskapade vertexen får negativa vertexidentifierare." +msgid "`#2909 `__: pgr_turnRestrictedPath" +msgstr "`#2909 `__: pgr_turnRestrictedPath" -msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" -msgstr "Här följer ett exempel på hur man genererar en tabell som mappar id:n för de nyskapade topparna med den ursprungliga topp som de skapades från" +msgid "Standardized to |result_edge_color|" +msgstr "Standardiserad till |result_edge_color|" -msgid "Store edge results" -msgstr "Förvara kantresultat" +msgid "`#2924 `__: pgr_edgeColoring" +msgstr "`#2924 `__: pgr_edgeColoring" -msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" -msgstr "Det första steget är att lagra resultatet av anropet ``pgr_lineGraphFull`` i en tabell" +msgid "Standardized to |result_node_color|" +msgstr "Standardiserad till |result_node_color|" -msgid "Create the mapping table" -msgstr "Skapa mappningstabellen" +msgid "`#2924 `__: pgr_bipartite" +msgstr "`#2924 `__: pgr_bipartite" -msgid "From the original graph's vertex information" -msgstr "Från den ursprungliga grafens toppunktsinformation" +msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgstr "`#2927 `__: pgr_sequentialVertexColoring" -msgid "Add the new vertices" -msgstr "Lägg till de nya hörnen" +msgid "Standardized to |result-spantree|" +msgstr "Standardiserad till |result-spantree|" -msgid "Filling the mapping table" -msgstr "Fylla kartläggningstabellen" +msgid "`#2931 `__: pgr_breadthFirstSearch" +msgstr "`#2931 `__: pgr_breadthFirstSearch" -msgid "The positive vertex identifiers are the original identifiers" -msgstr "De positiva vertexidentifierarna är de ursprungliga identifierarna" +msgid "`#2931 `__: pgr_depthFirstSearch" +msgstr "`#2931 `__: pgr_depthFirstSearch" -msgid "Inspecting the vertices map" -msgstr "Inspektion av kartan över hörnpunkter" +msgid "Standardized to |result_node_order|" +msgstr "Standardisera till |result_node_order|" -msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." -msgstr "Självslingorna uppstår när det inte kostar något att resa till \"målet\" och källan har ett ursprungligt värde." +msgid "`#2934 `__: pgr_topologicalSort" +msgstr "`#2934 `__: pgr_topologicalSort" -msgid "Updating values from self loops" -msgstr "Uppdatering av värden från självloopar" +msgid "Standardized to |result-closure|" +msgstr "Standardisera till |result-closure|" -msgid "Inspecting the vertices table" -msgstr "Inspektera tabellen över hörnpunkter" +msgid "`#2934 `__: pgr_transitiveClosure" +msgstr "`#2934 `__: pgr_transitiveClosure" -msgid "Updating from inner self loops" -msgstr "Uppdatering från inre självloopar" +msgid "Removal of SQL deprecated signatures" +msgstr "Borttagning av SQL-signaturer som inte längre är aktuella" -msgid "Adding a soft restriction" -msgstr "Lägga till en mjuk begränsning" +msgid "`#2798 `__: pgr_contraction" +msgstr "`#2798 `__: pgr_kontraktion" -msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." -msgstr "En mjuk begränsning som går från toppunkt 6 till toppunkt 3 med hjälp av kanterna 4 -> 7 önskas." +msgid "`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" -msgid "Identifying the restriction" -msgstr "Identifiering av begränsningen" +msgid "`#2683 `__: pgr_trspVia" +msgstr "`#2683 `__: pgr_trspVia" -msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" -msgstr "Kör en :doc:`pgr_dijkstraNear` kanten med kostnad 0, kant 8, är där kostnaden kommer att ökas" +msgid "`#2888 `__: pgr_findCloseEdges" +msgstr "`#2888 `__: pgr_findCloseEdges" -msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" -msgstr "Kanten som ska ändras är ``WHERE cost = 0 AND seq != 1 AND edge != -1`` från den föregående frågan:" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgid "Adding a value to the restriction" -msgstr "Lägga till ett värde till begränsningen" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgid "Updating the cost to the edge:" -msgstr "Uppdatering av kostnaden till kanten:" +msgid "`#2890 `__: pgr_withPointsDD" +msgstr "`#2890 `__: pgr_withPointsDD" -msgid "Routing from :math:`6` to :math:`3`" -msgstr "Omdirigering från :math:`6` till :math:`3`" +msgid "`#2895 `__: pgr_withPointsKSP" +msgstr "`#2895 `__: pgr_withPointsKSP" -msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." -msgstr "Nu använder rutten inte kant 8 och gör en U-sväng på en bladvertex." +msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgstr "`#2899 `__: pgr_maxCardinalityMatch" -msgid "Simplifying leaf vertices" -msgstr "Förenkling av bladhörnpunkter" +msgid "`#2901 `__: pgr_TSP" +msgstr "`#2901 `__: pgr_TSP" -msgid "In this example, there is no additional cost for traversing a leaf vertex." -msgstr "I det här exemplet tillkommer ingen extra kostnad för att passera en bladvertex." +msgid "`#2901 `__: pgr_TSPeuclidean" +msgstr "`#2901 `__: pgr_TSPeuclidean" -msgid "Using the vertex map give the leaf verices their original value." -msgstr "Med hjälp av vertexkartan ger du bladvertices deras ursprungliga värde." +msgid "Removal of SQL deprecated functions" +msgstr "Borttagning av föråldrade SQL-funktioner" -msgid "On the source column" -msgstr "På källkolumnen" +msgid "`#2681 `__: pgr_trspViaedges" +msgstr "`#2681 `__: pgr_trspViaedges" -msgid "On the target column" -msgstr "På målkolumnen" +msgid "`#2682 `__: pgr_trspViaVertices" +msgstr "`#2682 `__: pgr_trspViaVertices" -msgid "Removing self loops on leaf nodes" -msgstr "Ta bort självloopar på bladnoder" +msgid "`#2748 `__: pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" -msgid "The self loops of the leaf nodes are" -msgstr "Bladnodernas självslingor är" +msgid "`#2751 `__: pgr_createTopology" +msgstr "`#2751 `__: pgr_createTopology" -msgid "Which can be removed" -msgstr "Som kan tas bort" +msgid "`#2752 `__: pgr_analyzeGraph" +msgstr "`#2752 `__: pgr_analyzeGraph" -msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" -msgstr "Routing kan nu göras med hjälp av originalvertices id med :doc:`pgr_dijkstra`" +msgid "`#2755 `__: pgr_analyzeOneWay" +msgstr "`#2755 `__: pgr_analyzeOneWay" -msgid "Complete routing graph" -msgstr "Komplett routningsgraf" +msgid "`#2827 `__: pgr_createVerticesTable" +msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "Add edges from the original graph" -msgstr "Lägg till kanter från den ursprungliga grafen" +msgid "`#2886 `__: pgr_nodeNetwork" +msgstr "`#2886 `__: pgr_nodeNetwork" -msgid "Add all the edges that are not involved in the line graph process to the new table" -msgstr "Lägg till alla kanter som inte är involverade i linjediagramprocessen i den nya tabellen" +msgid "Removal of SQL deprecated internal functions" +msgstr "Borttagning av interna funktioner i SQL som inte längre är aktuella" -msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "Vissa administrativa uppgifter för att få nya identifierare för kanterna" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgstr "`#2748 `__ _pgr_alphaShape(text,dubbel precision)" -msgid "Add the newly calculated edges" -msgstr "Lägg till de nyligen beräknade kanterna" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgstr "`#2861 `__ _pgr_checkVertTab(text,text[],heltal,text)" -msgid "Using the routing graph" -msgstr "Använda routningsgrafen" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_createIndex(text,text,text,heltal,text)" -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "När du använder den här metoden för routning med mjuka begränsningar kommer det att finnas uturns" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_createIndex(text,text,text,text,heltal,text)" -msgid "Routing from :math:`5` to :math:`1`" -msgstr "Routning från :math:`5` till :math:`1`" +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgstr "`#2913 `__ _pgr_dagShortestPath(text,valfri matris,valfri matris,boolean,boolean)" -msgid "https://en.wikipedia.org/wiki/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgstr "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstraNear(text,valfri matris,valfri matris,bigint,boolean)" -msgid "``pgr_makeConnected`` - Experimental" -msgstr "``pgr_makeConnected`` - Experimentell" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." -msgstr "``pgr_makeConnected`` - Uppsättning kanter som kommer att ansluta grafen." +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstraNear(text,bigint,valfri matris,bigint,boolean)" -msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." -msgstr "Lägger till det minsta antal kanter som behövs för att göra indatagrafen ansluten. Algoritmen identifierar först alla anslutna komponenter i grafen och lägger sedan till kanter för att ansluta dessa komponenter till varandra i en väg. Om en graf t.ex. innehåller tre anslutna komponenter A, B och C lägger make_connected till två kanter. De två kanterna som läggs till kan bestå av en som förbinder ett toppunkt i A med ett toppunkt i B och en som förbinder ett toppunkt i B med ett toppunkt i C." +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." -msgstr "Det kommer att ge en minimilista över alla kanter som behövs i grafen för att ansluta den." +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgid "The algorithm does not considers geometric topology in the calculations." -msgstr "Algoritmen tar inte hänsyn till geometrisk topologi i beräkningarna." +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgid "pgr_makeConnected(`Edges SQL`_)" -msgstr "pgr_makeConnected(`Kanter SQL`_)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgid "Returns set of |result-component-make|" -msgstr "Returnerar uppsättning av |result-component-make|" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgstr "`#2735 `__ _pgr_drivingDistance(text,valfri matris,dubbel precision,boolean,boolean)" -msgid "List of edges that are needed to connect the graph." -msgstr "Lista över kanter som behövs för att koppla ihop grafen." +msgid "`#2861 `__ _pgr_endPoint(geometry)" +msgstr "`#2861 `__ _pgr_endPoint(geometry)" -msgid "`Boost: make connected `__" -msgstr "`Boost: skapa anslutning `__" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnName(text,text,heltal,text)" -msgid "``pgr_maxCardinalityMatch``" -msgstr "``pgr_maxCardinalityMatch``" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnName(text,text,text,heltal,text)" -msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." -msgstr "``pgr_maxCardinalityMatch`` - Beräknar en matchning med maximal kardinalitet i en graf." +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnType(text,text,heltal,text)" -msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." -msgstr "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnType(text,text,text,heltal,text)" -msgid "Deprecated signature" -msgstr "Föråldrad signatur" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgstr "`#2861 `__ __pgr_getTableName(text,heltal,text)" -msgid "directed => ``false`` when used." -msgstr "riktad => ``false`` när den används." +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,heltal,text)" -msgid "Renamed from ``pgr_maximumCardinalityMatching``" -msgstr "Omdöpta från ``pgr_maximumCardinalityMatching``" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,text,heltal,text)" -msgid "A matching or independent edge set in a graph is a set of edges without common vertices." -msgstr "En matchande eller oberoende kantuppsättning i en graf är en uppsättning kanter utan gemensamma toppar." +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgstr "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgid "A maximum matching is a matching that contains the largest possible number of edges." -msgstr "En maximal matchning är en matchning som innehåller största möjliga antal kanter." +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "`#2745 `__ _pgr_kruskal(text,valfri matris,text,bigint,dubbel precision)" -msgid "There may be many maximum matchings." -msgstr "Det kan finnas många maximala matchningar." +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean,boolean)" -msgid "Calculates one possible maximum cardinality matching in a graph." -msgstr "Beräknar en möjlig matchning med maximal kardinalitet i en graf." +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,bigint,bigint,heltal,boolean,boolean)" -msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" -msgstr "Speltid: :math:`O( E*V * \\alpha(E,V))`" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,text,heltal,boolean,boolean)" -msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." -msgstr ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" -msgstr "pgr_maxCardinalityMatch(`Kanter SQL`_)" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" +msgstr "`#2861 `__ _pgr_msg(heltal,text,text)" -msgid "Using all edges." -msgstr "Använd alla kanter." +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" +msgstr "`#2861 `__ _pgr_onerror(boolean,heltal,text,text,text,text,text)" -msgid "SQL query, which should return a set of rows with the following columns:" -msgstr "SQL-fråga, som ska returnera en uppsättning rader med följande kolumner:" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" +msgstr "`#2861 `__ _pgr_pointtoid(geometri,dubbel precision,text,heltal)" -msgid "A positive value represents the existence of the edge (``source``, ``target``)." -msgstr "Ett positivt värde representerar existensen av kanten (``källa``, ``mål``)." +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "`#2743 `__ _pgr_prim(text,valfri matris,text,bigint,dubbel precision)" -msgid "A positive value represents the existence of the edge (``target``, ``source``)" -msgstr "Ett positivt värde representerar existensen av kanten (``target``, ``source``)" +msgid "`#2861 `__ _pgr_quote_ident(text)" +msgstr "`#2861 `__ _pgr_quote_ident(text)" -msgid "Identifier of the edge in the original query." -msgstr "Identifierare av kanten i den ursprungliga frågan." +msgid "`#2861 `__ _pgr_startPoint(geometry)" +msgstr "`#2861 `__ _pgr_startPoint(geometry)" -msgid "`Boost: maximum_matching `__" -msgstr "`Boost: maximum_matching `__" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "`#2683 `__ _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" -msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "https://en.wikipedia.org/wiki/Ackermann_function" -msgstr "https://en.wikipedia.org/wiki/Ackermann_function" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,valfri matris,bigint,boolean)" -msgid "``pgr_maxFlow``" -msgstr "``pgr_maxFlow``" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,valfri matris,boolean)" -msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." -msgstr "``pgr_maxFlow`` - Beräknar det maximala flödet i en riktad graf från källorna till målen med hjälp av Push Relabel-algoritmen." +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(Combinations)" +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgstr "`#2682 `__ _pgr_trspViaVertices(text,heltal[],boolean,boolean,text)" -msgid "Calculates the maximum flow from the sources to the targets." -msgstr "Beräknar det maximala flödet från källorna till målen." +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "When the maximum flow is **0** then there is no flow and **0** is returned." -msgstr "När det maximala flödet är **0** finns det inget flöde och **0** returneras." +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." -msgstr "Använder algoritmen :doc:`pgr_pushRelabel `." +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,tecken,boolean)" -msgid "Running time: :math:`O( V ^ 3)`" -msgstr "Speltid: :math:`O( V ^ 3)`" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlow(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlow(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "`#2861 `__ _pgr_versionLess(text,text)" +msgstr "`#2861 `__ _pgr_versionLess(text,text)" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlow(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "`#2890 `__ _pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlow(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,valfri matris,valfri matris,heltal,tecken,boolean,boolean,boolean,boolean,boolean)" -msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlow(`Kanter SQL`_, `Combinations SQL`_)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "RETURNS ``BIGINT``" -msgstr "RETURNERAR ``BIGINT``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,text,heltal,tecken,boolean,boolean,boolean,boolean)" -msgid "Maximum flow possible from the source(s) to the target(s)" -msgstr "Högsta möjliga flöde från källan/källorna till målet/målen" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgstr "`#2741 `__ _pgr_withPointsVia(text,bigint[],dubbel precision[],boolean)" -msgid "`Boost: push relabel max flow `__" -msgstr "`Boost: push relabel max flöde `__" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2741 `__ _pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)" -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "``pgr_maxFlowMinCost`` - Experimental" -msgstr "``pgr_maxFlowMinCost`` - Experimentell" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _v4trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" -msgstr "``pgr_maxFlowMinCost`` - Beräknar de kanter som minimerar den totala kostnaden för det maximala flödet i en graf" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgstr "`#2683 `__ _v4trsp(text,text,text,boolean)" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "pgr_maxFlowMinCost(Combinations)" +msgid "Summary of functions and signatures no longer on pgrouting" +msgstr "Sammanfattning av funktioner och signaturer som inte längre finns på pgrouting" -msgid "|Boost| Boost Graph Inside." -msgstr "|Boost| Boost Graph Inside." +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgstr "`#2748 `__ pgr_alphashape(geometri,dubbel precision)" -msgid "**TODO** check which statement is true:" -msgstr "**TODO** kontrollera vilket påstående som är sant:" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgstr "`#2752 `__ pgr_analyzegraph(text,dubbel precision,text,text,text,text,text,text)" -msgid "The cost value of all input edges must be nonnegative." -msgstr "Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt." +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgstr "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean,text,text,text)" -msgid "Process is done when the cost value of all input edges is nonnegative." -msgstr "Processen är klar när kostnadsvärdet för alla inmatade kanter är icke-negativt." +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "Process is done on edges with nonnegative cost." -msgstr "Processen görs på kanter med icke-negativ kostnad." +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgstr "`#2751 `__ pgr_createtopology(text,dubbel precision,text,text,text,text,text,boolean)" -msgid "Running time: :math:`O(U * (E + V * logV))`" -msgstr "Drifttid: :math:`O(U * (E + V * logV))`" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgstr "`#2827 `__ pgr_createverticestable(text,text,text,text,text,text)" -msgid "where :math:`U` is the value of the max flow." -msgstr "där :math:`U` är värdet på maxflödet." +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "`#2888 `__ pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean,boolean)" -msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." -msgstr ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "`#2888 `__ pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean,boolean)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgstr "`#2886 `__ pgr_nodenetwork(text,dubbel precision,text,text,text,text,text,boolean)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "`#2683 `__ pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "`#2683 `__ pgr_trsp(text,heltal,heltal,boolean,boolean,text)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, `Combinations SQL`_)" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "`#2681 `__ pgr_trspViaedges(text,heltal[],dubbel precision[],boolean,boolean,text)" -msgid "Returns set of |result-flow-mincost|" -msgstr "Returnerar uppsättning av |result-flow-mincost|" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "`#2682 `__ pgr_trspViaVertices(text,valfri matris,boolean,boolean,text)" -msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" -msgstr "``pgr_maxFlowMinCost_Cost`` - Experimentell" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" -msgstr "``pgr_maxFlowMinCost_Cost`` - Beräknar den lägsta totala kostnaden för det maximala flödet i en graf" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "pgr_maxFlowMinCost_Cost(Combinations)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "**The cost value of all input edges must be nonnegative.**" -msgstr "**Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt.**" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "When the maximum flow is 0 then there is no flow and **0** is returned." -msgstr "När det maximala flödet är 0 finns det inget flöde och **0** returneras." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgid "Uses :doc:`pgr_maxFlowMinCost`." -msgstr "Använder :doc:`pgr_maxFlowMinCost`." +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCostMatrix(text,text,valfri matris,boolean,tecken)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,valfri matris,valfri matris,boolean,tecken)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, `Combinations SQL`_)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,valfri matris,bigint,boolean,tecken)" -msgid "RETURNS FLOAT" -msgstr "RETURNS FLOAT" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,valfri matris,boolean,tecken)" -msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" -msgstr "Minsta kostnad Högsta möjliga flöde från källa(n) till mål(en)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgid "``pgr_pickDeliver`` - Experimental" -msgstr "``pgr_pickDeliver`` - Experimentell" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,tecken)" -msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" -msgstr "``pgr_pickDeliver`` - Problem med ruttplanering för hämtning och leverans av fordon" +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "`#2890 `__ pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." -msgstr "Problem: Fördela och optimera upphämtnings- och leveranspar i en fordonsflotta." +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "`#2890 `__ pgr_withPointsDD(text,text,bigint,dubbel precision,boolean,tecken,boolean)" -msgid "Optimization problem is NP-hard." -msgstr "Optimeringsproblemet är NP-svårt." +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "pickup and Delivery with time windows." -msgstr "upphämtning och leverans med tidsfönster." +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "All vehicles are equal." -msgstr "Alla fordon är likvärdiga." +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,valfri matris,bigint,boolean,tecken,boolean)" -msgid "Same Starting location." -msgstr "Samma Startplats." +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,valfri matris,boolean,tecken,boolean)" -msgid "Same Ending location which is the same as Starting location." -msgstr "Samma slutplacering som är densamma som startplaceringen." +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,tecken,boolean)" -msgid "All vehicles travel at the same speed." -msgstr "Alla fordon färdas med samma hastighet." +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,text,boolean,tecken,boolean)" -msgid "A customer is for doing a pickup or doing a deliver." -msgstr "En kund är för att göra en upphämtning eller göra en leverans." +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)" -msgid "has an open time." -msgstr "har en öppen tid." +msgid "Removal of unused C/C++ code" +msgstr "Borttagning av oanvänd C/C++-kod" -msgid "has a closing time." -msgstr "har en stängningstid." +msgid "Refactor the Script to build the update PostgreSQL file." +msgstr "Refaktorera skriptet för att bygga uppdateringsfilen PostgreSQL." -msgid "has a service time." -msgstr "har en servicetid." +msgid "One process & driver for:" +msgstr "En process & drivrutin för:" -msgid "has an (x, y) location." -msgstr "har en (x, y)-placering." +msgid "allpairs: johnson and Floyd-Warshall" +msgstr "alla par: johnson och Floyd-Warshall" -msgid "There is a customer where to deliver a pickup." -msgstr "Det finns en kund där man ska leverera en pickup." +msgid "Shortest path: Dijkstra and withPoints using Dijkstra" +msgstr "Kortaste vägen: Dijkstra och withPoints med hjälp av Dijkstra" -msgid "travel time between customers is distance / speed" -msgstr "restid mellan kunder är avstånd / hastighet" +msgid "Deprecation of internal C/C++ functions" +msgstr "Avveckling av interna C/C++-funktioner" -msgid "pickup and delivery pair is done with the same vehicle." -msgstr "hämtning och leverans sker med samma fordon." +msgid "Deprecated functions are substituted by new function." +msgstr "Föråldrade funktioner ersätts av nya funktioner." -msgid "All trucks depart at time 0." -msgstr "Alla lastbilar avgår vid tidpunkt 0." +msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" +msgstr "_pgr_drivingDistance => _pgr_drivingDistancev4" -msgid "the algorithm will raise an exception when" -msgstr "algoritmen kommer att ge upphov till ett undantag när" +msgid "_pgr_withPointsDD => _pgr_withPointsddv4" +msgstr "_pgr_medPointsDD => _pgr_medPointsddv4" -msgid "If there is a pickup-deliver pair than violates time window" -msgstr "Om det finns ett upphämtnings-/leveranspar som bryter mot tidsfönstret" +msgid "_pgr_kruskal => _pgr_kruskalv4" +msgstr "_pgr_kruskal => _pgr_kruskalv4" -msgid "The speed, max_cycles, ma_capacity have illegal values" -msgstr "Hastigheten, max_cycles, ma_capacity har olagliga värden" +msgid "_pgr_prim => _pgr_primv4" +msgstr "_pgr_prim => _pgr_primv4" -msgid "Six different initial will be optimized - the best solution found will be result" -msgstr "Sex olika initialer kommer att optimeras - den bästa lösningen som hittas blir resultatet" +msgid "_pgr_dijkstra => _pgr_dijkstra_v4" +msgstr "_pgr_dijkstra => _pgr_dijkstra_v4" -msgid "Signature" -msgstr "Underskrift" +msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" +msgstr "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" -msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" -msgstr "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgstr "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" -msgid "**options:** ``[factor, max_cycles, initial_sol]``" -msgstr "**options:** ``[factor, max_cycles, initial_sol]``" +msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" +msgstr "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" -msgid "Returns set of |result-pickdrop|" -msgstr "Returnerar uppsättning av |result-pickdrop|" +msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" +msgstr "_pgr_medPointsVia => _pgr_medPointsvia_v4" -msgid "Solve the following problem" -msgstr "Lös följande problem" +msgid "Internal C/C++ functions in legacy" +msgstr "Interna C/C++-funktioner i äldre" -msgid "Given the vehicles:" -msgstr "Med tanke på fordonen:" +msgid "`#2683 `__ _trsp" +msgstr "`#2683 `__ _trsp" -msgid "and the orders:" -msgstr "och order:" +msgid "`#2683 `__ _v4trsp" +msgstr "`#2683 `__ _v4trsp" -msgid "The parameters are:" -msgstr "Parametrarna är:" +msgid "`#2748 `__ _pgr_alphaShape" +msgstr "`#2748 `__ _pgr_alphaShape" -msgid "A `SELECT` statement that returns the following columns:" -msgstr "En `SELECT`-sats som returnerar följande kolumner:" +msgid "`#2913 `__ _pgr_dagShortestPath" +msgstr "`#2913 `__ _pgr_dagShortestPath" -msgid "id, demand" -msgstr "id, efterfrågan" +msgid "pgRouting 3" +msgstr "pgRouting 3" -msgid "p_node_id, p_open, p_close, [p_service,]" -msgstr "p_node_id, p_open, p_close, [p_service,]" +msgid "Minors 3.x" +msgstr "Minors 3.x" -msgid "d_node_id, d_open, d_close, [d_service,]" -msgstr "d_node_id, d_open, d_close, [d_service,]" +msgid "pgRouting 3.8" +msgstr "pgRouting 3.8" -msgid "id, capacity" -msgstr "id, kapacitet" +msgid "pgRouting 3.8.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.8.0" -msgid "start_node_id, start_open, start_close [, start_service,]" -msgstr "start_node_id, start_open, start_close [, start_service,]" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.8.0 `__" -msgid "[end_node_id, end_open, end_close, end_service]" -msgstr "[end_node_id, end_open, end_close, end_service]" +msgid "Promotion to official function of pgRouting." +msgstr "Befordran till officiell funktion för pgRouting." -msgid "``pgr_pickDeliverEuclidean`` - Experimental" -msgstr "``pgr_pickDeliverEuclidean`` - Experimentell" +msgid "Metric" +msgstr "Metriska" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" -msgstr "``pgr_pickDeliverEuclidean`` - Problem med ruttplanering för hämtning och leverans av fordon" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" +msgstr "`#2760 `__: Befordrad till officiell pgr_grad i version 3.8" -msgid "Replaces ``pgr_gsoc_vrppdtw``" -msgstr "Ersätter ``pgr_gsoc_vrppdtw``" +msgid "Utilities" +msgstr "Verktyg" -msgid "Pickup and Delivery:" -msgstr "Upphämtning och leverans:" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" +msgstr "`#2772 `__: Befordrad till officiell pgr_extractVertices i version 3.8" -msgid "capacitated" -msgstr "kapaciterad" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" +msgstr "`#2774 `__: Befordrad till officiell pgr_findCloseEdges i version 3.8" -msgid "with time windows." -msgstr "med tidsfönster." +msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" +msgstr "`#2873 `__: Befordrad till officiell pgr_separateCrossing i version 3.8" -msgid "have (x, y) start and ending locations." -msgstr "har (x, y) start- och slutpositioner." +msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" +msgstr "`#2874 `__: Befordrad till officiell pgr_separateTouching i version 3.8" -msgid "have a start and ending service times." -msgstr "har en start- och sluttid för tjänsten." +msgid "Proposed functions" +msgstr "Föreslagna funktioner" -msgid "An order is for doing a pickup and a a deliver." -msgstr "En order är till för att göra en upphämtning och en leverans." +msgid "Contraction" +msgstr "Sammandragning" -msgid "has (x, y) pickup and delivery locations." -msgstr "har (x, y) upphämtnings- och leveransplatser." +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" +msgstr "`#2790 `__: pgr_contractionDeadEnd ny funktion för sammandragning" -msgid "has opening and closing times for the pickup and delivery locations." -msgstr "har öppnings- och stängningstider för upphämtnings- och leveransplatserna." +msgid "`#2791 `__: pgr_contractionLinear new contraction function" +msgstr "`#2791 `__: pgr_contractionLinear ny funktion för sammandragning" -msgid "has a pickup and deliver service times." -msgstr "har en upphämtning och leverera servicetider." +msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" +msgstr "`#2536 `__: Stöd för sammandragningshierarkier (pgr_contractionHierarchies)" -msgid "Six different optional different initial solutions" -msgstr "Sex olika valfria olika ursprungliga lösningar" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" +msgstr "`#2848 `__: Skapa pgr_separateCrossing ny verktygsfunktion" -msgid "the best solution found will be result" -msgstr "den bästa lösningen som hittas blir resultatet" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" +msgstr "`#2849 `__: Skapande av pgr_separateTouching ny verktygsfunktion" -msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" -msgstr "pgr_pickDeliverEuclidean(`Orders SQL`_, `Fordon SQL`_, [**options**])" +msgid "Official functions changes" +msgstr "Förändringar i officiella funktioner" -msgid "p_x, p_y, p_open, p_close, [p_service,]" -msgstr "p_x, p_y, p_open, p_close, [p_service,]" +msgid "`#2786 `__: pgr_contraction(edges) new signature" +msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" -msgid "d_x, d_y, d_open, d_close, [d_service]" -msgstr "d_x, d_y, d_open, d_close, [d_service]" +msgid "C/C++ code enhancements" +msgstr "Förbättringar av C/C++-kod" -msgid "start_x, start_y, start_open, start_close [, start_service, ]" -msgstr "start_x, start_y, start_open, start_close [, start_service, ]" +msgid "`#2802 `__: Code reorganization on pgr_contraction" +msgstr "`#2802 `__: Omorganisering av kod för pgr_contraction" -msgid "[ end_x, end_y, end_open, end_close, end_service ]" -msgstr "[ end_x, end_y, end_open, end_close, end_service ]" +msgid "Other enhancements:" +msgstr "Andra förbättringar:" -msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" -msgstr "Detta dataexempel **lc101** är hämtat från data som publicerats på https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgid "`#2869 `__:" +msgstr "`#2869 `__:" -msgid "There are 25 vehicles in the problem all with the same characteristics." -msgstr "Det finns 25 fordon i problemet som alla har samma egenskaper." +msgid "SQL code enhancements" +msgstr "Förbättringar av SQL-kod" -msgid "The original orders" -msgstr "De ursprungliga beställningarna" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" +msgstr "`#2850 `__: Skriv om pgr_nodeNetwork" -msgid "The data comes in different rows for the pickup and the delivery of the same order." -msgstr "Uppgifterna kommer i olika rader för upphämtning och leverans av samma order." +msgid "Deprecation of SQL functions" +msgstr "Utfasning av SQL-funktioner" -msgid "The original data needs to be converted to an appropriate table:" -msgstr "Originaldata måste konverteras till en lämplig tabell:" +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" +msgstr "`#2749 `__: Avveckla pgr_AlphaShape i 3.8" -msgid "The query" -msgstr "Frågeställningen" +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" +msgstr "`#2750 `__: Avveckla pgr_CreateTopology i 3.8" -msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" -msgstr "Visar endast relevant information för att jämföra med informationen om den bästa lösningen som publiceras på https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" +msgstr "`#2753 `__: Avveckla pgr_analyzeGraph i 3.8" -msgid "The best solution found for **lc101** is a travel time: 828.94" -msgstr "Den bästa lösningen som hittades för **lc101** är en restid: 828.94" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" +msgstr "`#2754 `__: Avveckla pgr_analyzeOneWay i 3.8" -msgid "This implementation's travel time: 854.54" -msgstr "Restid för detta genomförande: 854.54" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" +msgstr "`#2826 `__: Avveckla pgr_createVerticesTable i 3.8" -msgid "``pgr_prim``" -msgstr "``pgr_prim``" +msgid "In the deprecated functions:" +msgstr "I de föråldrade funktionerna:" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." -msgstr "``pgr_prim`` - Skog med minsta spann i en graf med Prims algoritm." +msgid "Migration section is created." +msgstr "Migrationsavsnittet skapas." -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." -msgstr "Denna algoritm hittar den minsta spännviddsskogen i en eventuellt frånkopplad graf med hjälp av Prims algoritm." +msgid "The use of the functions is removed in the documentation." +msgstr "Användningen av funktionerna har tagits bort i dokumentationen." -msgid "Prim's running time: :math:`O(E * log V)`" -msgstr "Prims körtid: :math:`O(E * log V)`" +msgid "pgRouting 3.7" +msgstr "pgRouting 3.7" -msgid "pgr_prim(`Edges SQL`_)" -msgstr "pgr_prim(`Kanter SQL`_)" +msgid "pgRouting 3.7.3 Release Notes" +msgstr "Versionsinformation för pgRouting 3.7.3" -msgid "Minimum spanning forest of a subgraph" -msgstr "Minsta skog som spänner över en delgraf" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.3 `__" -msgid "`Boost: Prim's algorithm documentation `__" -msgstr "`Boost: Dokumentation av Prims algoritm `__" +msgid "`#2731 `__: Build Failure on Ubuntu 22" +msgstr "`#2731 `__: Byggfel på Ubuntu 22" -msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_primBFS`` - Prims algoritm för minsta spännviddsträd med djup först-sökordning." +msgid "pgRouting 3.7.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.7.2" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." -msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Prims algoritm." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.2 `__" -msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_primBFS(`Kanter SQL`_, **root vid**, [``max_depth``])" +msgid "`#2713 `__: cmake missing some policies and min version" +msgstr "`#2713 `__: cmake saknar vissa policyer och min-version" -msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_primBFS(`Kanter SQL`_, **root vids**, [``max_depth``])" +msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" +msgstr "Använda gamla policyer: CMP0148, CMP0144, CMP0167" -msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." -msgstr "``pgr_primDD`` - Fångar upp noder med Prims algoritm." +msgid "Minimum cmake version 3.12" +msgstr "Minsta cmake-version 3.12" -msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." -msgstr "Med hjälp av Prims algoritm, extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett avstånd från en rotvertex (eller vertex) inom det beräknade minsta spännträd." +msgid "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" +msgstr "`#2707 `__: Byggfel i pgRouting 3.7.1 på Alpine" -msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "pgr_primDD(`Kanter SQL`_, **root vid**, **distance**)" +msgid "`#2706 `__: winnie crashing on pgr_betweennessCentrality" +msgstr "`#2706 `__: winnie kraschar på pgr_betweennessCentrality" -msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "pgr_primDD(`Kanter SQL`_, **root vids**, **distance**)" +msgid "pgRouting 3.7.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.7.1" -msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_primDFS`` - Prim-algoritm för minsta spännviddsträd med djup först-sökordning." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.1 `__" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." -msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Prims algoritm." +msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" +msgstr "`#2680 `__: går inte att kompilera under mingw64 gcc 13.2" -msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_primDFS(`Kanter SQL`_, **root vid**, [``max_depth``])" +msgid "`#2689 `__: When point is a vertex, the withPoints family do not return results." +msgstr "`#2689 `__: När en punkt är en vertex ger inte withPoints-familjen något resultat." -msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_primDFS(`Kanter SQL`_, **root vids**, [``max_depth``])" +msgid "C/C++ code enhancemet" +msgstr "Förbättring av C/C++-kod" -msgid "``pgr_pushRelabel``" -msgstr "``pgr_pushRelabel``" +msgid "TRSP family" +msgstr "TRSP-familjen" -msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." -msgstr "``pgr_pushRelabel`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Push Relabel-algoritmen." +msgid "pgRouting 3.7.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.7.0" -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(Combinations)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.0 `__" -msgid "Renamed from ``pgr_maxFlowPushRelabel``" -msgstr "Borttagen från ``pgr_maxFlowPushRelabel``" +msgid "Support" +msgstr "Support" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "`#2656 `__: Stop support of PostgreSQL12 on pgrouting v3.7" +msgstr "`#2656 `__: Stoppa stöd för PostgreSQL12 på pgrouting v3.7" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "Stopping support of PostgreSQL 12" +msgstr "Stoppa stöd för PostgreSQL 12" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "CI does not test for PostgreSQL 12" +msgstr "CI testar inte för PostgreSQL 12" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "pgr_betweennessCentrality" +msgstr "pgr_betweennessCentrality" -msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_pushRelabel(`Kanter SQL`_, `Combinations SQL`_)" +msgid "`#2605 `__: Standardize spanning tree functions output" +msgstr "`#2605 `__: Standardisera utdata för funktioner för spänningsträd" -msgid "``pgr_separateCrossing``" -msgstr "``pgr_separateCrossing``" +msgid "Functions:" +msgstr "Funktioner:" -msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." -msgstr "``pgr_separateCrossing`` - Från korsande geometrier genereras geometrier som inte korsar varandra." +msgid "Experimental promoted to proposed." +msgstr "Experimentell befordrad till föreslagen." -msgid "Proposed function." -msgstr "Föreslagen funktion." +msgid "`#2635 `__: pgr_LineGraph ignores directed flag and use negative values for identifiers." +msgstr "`#2635 `__: pgr_LineGraph ignorerar directed flag och använder negativa värden för identifierare." -msgid "This is an auxiliary function for separating crossing edges." -msgstr "Detta är en hjälpfunktion för att separera korsande kanter." +msgid "``pgr_lineGraph``" +msgstr "``pgr_lineGraph``" -msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "pgr_separateCrossing(`Kanter SQL`_, [``tolerance``, ``dryrun``])" +msgid "Code enhancement" +msgstr "Förbättring av kod" -msgid "RETURNS |result-separate|" -msgstr "RETURNS |result-separate|" +msgid "`#2599 `__: Driving distance cleanup" +msgstr "`#2599 `__: Körsträcka uppstädning" -msgid "Get the segments of the crossing geometries" -msgstr "Hämta segmenten för korsningsgeometrierna" +msgid "`#2607 `__: Read postgresql data on C++" +msgstr "`#2607 `__: Läsa postgresql-data på C++" -msgid "``tolerance``" -msgstr "``tolerance``" +msgid "`#2614 `__: Clang tidy does not work" +msgstr "`#2614 `__: Clang tidy fungerar inte" -msgid "0.01" -msgstr "0.01" +msgid "pgRouting 3.6" +msgstr "pgRouting 3.6" -msgid "Used in ST_Snap before ST_Split" -msgstr "Används i ST_Snap före ST_Split" +msgid "pgRouting 3.6.3 Release Notes" +msgstr "Versionsinformation för pgRouting 3.6.3" -msgid "Get the code for further refinement." -msgstr "Hämta koden för ytterligare förfining." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.3 `__" -msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." -msgstr "När det finns speciella detaljer som måste tas om hand på grund av den slutliga applikationen eller datakvaliteten kan koden erhållas på en PostgreSQL ``NOTICE`` med hjälp av ``dryrun`` flaggan." +msgid "Explicit minimum requirements:" +msgstr "Uttryckliga minimikrav:" -msgid "``pgr_separateTouching``" -msgstr "``pgr_separateTouching``" +msgid "postgres 11.0.0" +msgstr "postgres 11.0.0" -msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" -msgstr "``pgr_separateTouching`` - Från berörande geometrier genereras geometrier som är korrekt anslutna vid ändpunkterna" +msgid "postgis 3.0.0" +msgstr "postgis 3.0.0" -msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." -msgstr "Detta är en hjälpfunktion för bearbetning av geometrier som berör varandra men inte har exakta ändpunkter, och som delas upp vid sina skärningspunkter för att förbättra nätverksanslutningen." +msgid "g++ 13+ is supported" +msgstr "g++ 13+ stöds" -msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "pgr_separateTouching(`Kanter SQL`_, [``tolerance``, ``dryrun``])" +msgid "Code fixes" +msgstr "Kodkorrigeringar" -msgid "``pgr_sequentialVertexColoring`` - Proposed" -msgstr "```pgr_sequentialVertexColoring`` - Föreslagen" +msgid "Fix warnings from cpplint." +msgstr "Fixa varningar från cpplint." -msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." -msgstr "``pgr_sequentialVertexColoring`` - Returnerar vertexfärgningen av en odelad graf med hjälp av en girig metod." +msgid "Fix warnings from clang 18." +msgstr "Fixa varningar från clang 18." -msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." -msgstr "Sequential vertex coloring algorithm är en algoritm för färgläggning av grafer där färgidentifierare tilldelas topparna i en graf sekventiellt, så att ingen kant förbinder två identiskt färgade toppar." +msgid "CI tests" +msgstr "CI-test" -msgid "The implementation is applicable only for **undirected** graphs." -msgstr "Implementeringen är endast tillämplig för **undirected** grafer." +msgid "Add a clang tidy test on changed files." +msgstr "Lägg till ett clang tidy-test på ändrade filer." -msgid "Provides the color to be assigned to all the vertices present in the graph." -msgstr "Ger den färg som ska tilldelas alla hörn som finns i grafen." +msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" +msgstr "Uppdateringstest inte gjort på versioner: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" -msgid "Color identifiers values are in the Range :math:`[1, |V|]`" -msgstr "Värden för färgidentifierare ligger i intervallet :math:`[1, |V|]`" +msgid "Documentation" +msgstr "Dokumentation" -msgid "The algorithm tries to assign the least possible color to every vertex." -msgstr "Algoritmen försöker tilldela minsta möjliga färg till varje toppunkt." +msgid "Results of documentation queries adujsted to boost 1.83.0 version:" +msgstr "Resultat av dokumentationsförfrågningar adujsted till boost 1.83.0 version:" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." -msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem, och därför ger den här algoritmen inte alltid optimal färgläggning. Den följer en girig strategi genom att iterera genom alla toppar i följd och tilldela varje topp den minsta möjliga färg som inte används av dess grannar." +msgid "pgr_stoerWagner" +msgstr "pgr_stoerWagner" -msgid "The returned rows are ordered in ascending order of the vertex value." -msgstr "De återlämnade raderna är ordnade i stigande ordning efter vertexvärdet." +msgid "pgtap tests" +msgstr "pgtap-test" -msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" -msgstr "Sekventiell vertexfärgning Körtid: :math:`O(|V|*(d + k))`" +msgid "bug fixes" +msgstr "buggfixar" -msgid ":math:`d` is the maximum degree of the vertices in the graph," -msgstr ":math:`d` is the maximum degree of the vertices in the graph," +msgid "pgRouting 3.6.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.6.2" -msgid ":math:`k` is the number of colors used." -msgstr ":math:`k` is the number of colors used." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.2 `__" -msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" -msgstr "pgr_sequentialVertexColoring(`Kanter SQL`_)" +msgid "Upgrade fix" +msgstr "Fix för uppgradering" -msgid "`Boost: Sequential Vertex Coloring `__" -msgstr "`Boost: Sekventiell färgläggning av toppar `__" +msgid "The upgrade was failing for same minor" +msgstr "Uppgraderingen misslyckades på grund av samma mindre" -msgid "``pgr_sloanOrdering`` - Experimental" -msgstr "``pgr_sloanOrdering`` - Experimentell" +msgid "Fix warnings from cpplint" +msgstr "Fixa varningar från cpplint" -msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" -msgstr "``pgr_sloanOrdering`` - Returnerar Sloan-ordningen för en odränerad graf" +msgid "Others" +msgstr "Andra" -msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." -msgstr "Sloans ordningsalgoritm ordnar om topparna i en graf för att minska bandbredd, profil och vågfrontsegenskaper, vilket är särskilt användbart för glesa matrisberäkningar och finita elementanalyser." +msgid "Adjust NEWS generator" +msgstr "Justera NEWS-generatorn" -msgid "Finds a pseudoperipheral vertex pair to determine good starting points" -msgstr "Hittar ett pseudoperifert toppunktspar för att bestämma bra startpunkter" +msgid "Name change to `NEWS.md` for better visualization on GitHub" +msgstr "Namnändring till `NEWS.md` för bättre visualisering på GitHub" -msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." -msgstr "Använder en prioritetsbaserad algoritm som balanserar vertexgrad och avstånd från startvertexet." +msgid "pgRouting 3.6.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.6.1" -msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." -msgstr "Syftar till att minimera bandbredden (maximal skillnad mellan index för anslutna vertex)." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.1 `__" -msgid "Typically produces better orderings than simple breadth-first approaches." -msgstr "Ger vanligtvis bättre ordningar än enkla bredd-först-metoder." +msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" +msgstr "`#2588 `__: pgrouting 3.6.0 går inte att bygga under OSX" -msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." -msgstr "Tidskomplexitet: :math:`O(V² + E)` där V är antalet toppar och E är antalet kanter." +msgid "pgRouting 3.6.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.6.0" -msgid "pgr_sloanOrdering(`Edges SQL`_)" -msgstr "pgr_sloanOrdering(`Edges SQL`_)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.0 `__" -msgid ":Example : Sloan ordering without specifying start vertex" -msgstr ":Exempel : Sloan-order utan att ange startpunkt" +msgid "`#2516 `__: Standardize output pgr_aStar" +msgstr "`#2516 `__: Standardisera utdata pgr_aStar" -msgid "New sloan ordering order." -msgstr "Ny beställning av Sloan." +msgid "Standardize output columns to |short-generic-result|" +msgstr "Standardisera utdatakolumner till |short-generic-result|" -msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." -msgstr "Sloan-ordning av originalgrafen från Boost-exemplet (toppar 0-9)." +msgid "`#2523 `__: Standardize output pgr_bdAstar" +msgstr "`#2523 `__: Standardisera utdata pgr_bdAstar" -msgid "`Boost: Sloan Ordering `__" -msgstr "`Boost: Sloan Beställning `__" +msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" +msgstr "`#2547 `__: Standardisera utdata och modifiera signatur pgr_KSP" -msgid "``pgr_stoerWagner`` - Experimental" -msgstr "``pgr_stoerWagner`` - Experimentell" +msgid "`#2548 `__: Standardize output pgr_drivingDistance" +msgstr "`#2548 `__: Standardisera utdata pgr_drivingDistance" -msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." -msgstr "``pgr_stoerWagner`` - Min-cut av grafen med stoerWagner-algoritmen." +msgid "Proposed functions changes" +msgstr "Föreslagna ändringar av funktioner" -msgid "Version 3.0" -msgstr "Version 3.0" +msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" +msgstr "`#2544 `__: Standardisera utdata och modifiera signaturen pgr_withPointsDD" -msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." -msgstr "Inom grafteorin är Stoer-Wagner-algoritmen en rekursiv algoritm för att lösa problemet med minsta snitt i ovägda viktade grafer med icke-negativa vikter. Den grundläggande idén med denna algoritm är att krympa grafen genom att slå samman de mest intensiva topparna, tills grafen bara innehåller två kombinerade toppuppsättningar. I varje fas hittar algoritmen det minsta s-t-snittet för två toppar s och t som valts som dess vilja. Därefter krymper algoritmen kanten mellan s och t för att söka efter andra snitt än s-t-snitt. Det minsta snitt som hittas i alla faser kommer att vara det minsta viktade snittet i grafen." +msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" +msgstr "`#2546 `__: Standardisera utdata och modifiera signaturen pgr_withPointsKSP" -msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." -msgstr "Ett snitt är en uppdelning av hörnen i en graf i två disjunkta delmängder. En minsta skärning är en skärning där skärningens storlek eller vikt inte är större än storleken på någon annan skärning. För en oviktad graf skulle det minsta snittet helt enkelt vara det snitt som har minst kanter. För en viktad graf är det summan av alla kanters vikt på snittet som avgör om det är ett minimisnitt." +msgid "`#2504 `__: To C++ pg data get, fetch and check." +msgstr "`#2504 `__: Till C++ pg-data hämta, hämta och kontrollera." -msgid "Sum of the weights of all edges between the two sets is mincut." -msgstr "Summan av vikterna för alla kanter mellan de två uppsättningarna är mincut." +msgid "Stopping support for compilation with MSVC." +msgstr "Stoppar stöd för kompilering med MSVC." -msgid "A **mincut** is a cut having the least weight." -msgstr "Ett **mincut** är ett snitt som har minst vikt." +msgid "`#2505 `__: Using namespace." +msgstr "`#2505 `__: Använder namnrymd." -msgid "Values are returned when graph is connected." -msgstr "Värdena returneras när grafen är ansluten." +msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." +msgstr "`#2512 `__: [Dijkstra] Borttagning av duplicerad kod på Dijkstra." -msgid "When there is no edge in graph then EMPTY SET is return." -msgstr "När det inte finns någon kant i grafen returneras EMPTY SET." +msgid "`#2517 `__: Astar code simplification." +msgstr "`#2517 `__: Förenkling av Astar-kod." -msgid "When the graph is unconnected then EMPTY SET is return." -msgstr "När grafen inte är sammankopplad returneras EMPTY SET." +msgid "`#2521 `__: Dijkstra code simplification." +msgstr "`#2521 `__: Förenkling av Dijkstra-kod." -msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." -msgstr "Ibland har en graf flera min-cuts, men alla har samma vikt. Den här funktionen bestämmer exakt en av min-cuts samt dess vikt." +msgid "`#2522 `__: bdAstar code simplification." +msgstr "`#2522 `__: Förenkling av bdAstar-koden." -msgid "Running time: :math:`O(V*E + V^2*log V)`." -msgstr "Drifttid: :math:`O(V*E + V^2*log V)`." +msgid "`#2490 `__: Automatic page history links." +msgstr "`#2490 `__: Automatiska länkar till sidhistorik." -msgid "pgr_stoerWagner(`Edges SQL`_)" -msgstr "pgr_stoerWagner(`Kanter SQL`_)" +msgid "..rubric:: Standardize SQL" +msgstr "..rubric:: Standardize SQL" -msgid "Returns set of |result-mincut|" -msgstr "Returnerar uppsättning av |result-mincut|" +msgid "`#2555 `__: Standardize deprecated messages" +msgstr "`#2555 `__: Standardisera föråldrade meddelanden" -msgid "min cut of the main subgraph" -msgstr "min-klippning av huvudundergrafen" +msgid "On new internal function: do not use named parameters and default parameters." +msgstr "För nya interna funktioner: använd inte namngivna parametrar och standardparametrar." -msgid "Returns set of ``(seq, edge, cost, mincut)``" -msgstr "Returnerar uppsättning av ``(seq, edge, cost, mincut)``" +msgid "pgRouting 3.5" +msgstr "pgRouting 3.5" -msgid "Edges which divides the set of vertices into two." -msgstr "Kanter som delar upp uppsättningen av hörn i två." +msgid "pgRouting 3.5.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.5.1" -msgid "Cost to traverse of edge." -msgstr "Kostnad för att korsa kanten." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.1 `__" -msgid "**mincut**" -msgstr "**mincut**" +msgid "Documentation fixes" +msgstr "Dokumentationsfixar" -msgid "Min-cut weight of a undirected graph." -msgstr "Min-cut-vikt för en odränerad graf." +msgid "Changes on the documentation to the following:" +msgstr "Ändringar i dokumentationen till följande:" -msgid "Additional Example:" -msgstr "Ytterligare exempel:" +msgid "pgr_degree" +msgstr "pgr_degree" -msgid "min cut of an edge" -msgstr "minutskärning av en kant" +msgid "pgr_ksp" +msgstr "pgr_ksp" -msgid "Using :doc:`pgr_connectedComponents`" -msgstr "Använda :doc:`pgr_connectedComponents`" +msgid "Automatic page history links" +msgstr "Automatiska länkar till sidhistorik" -msgid "`Boost: Stoer Wagner min cut `__" -msgstr "`Boost: Stoer Wagner min cut `__" +msgid "using bootstrap_version 2 because 3+ does not do dropdowns" +msgstr "använder bootstrap_version 2 eftersom 3+ inte gör dropdowns" -msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" -msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgid "Issue fixes" +msgstr "Problemkorrigeringar" -msgid "``pgr_strongComponents``" -msgstr "``pgr_strongComponents``" +msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" +msgstr "`#2565 `__: pgr_lengauerTarjanDominatorTree utlöser ett påstående" -msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." -msgstr "``pgr_strongComponents`` - Starkt förbundna komponenter i en riktad graf med hjälp av Tarjans algoritm baserad på DFS." +msgid "SQL enhancements" +msgstr "Förbättringar av SQL" -msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." -msgstr "En starkt sammanhängande komponent i en riktad graf är en uppsättning hörn som alla är nåbara från varandra." +msgid "`#2561 `__: Not use wildcards on SQL" +msgstr "`#2561 `__: Använd inte jokertecken i SQL" -msgid "Works for **directed** graphs." -msgstr "Fungerar för **riktade** grafer." +msgid "`#2559 `__: pgtap test using sampledata" +msgstr "`#2559 `__: pgtap-test med sampledata" -msgid "Components are described by vertices identifiers." -msgstr "Komponenterna beskrivs med hjälp av identifierare för vertikalerna." +msgid "Build fixes" +msgstr "Byggfixar" -msgid "pgr_strongComponents(`Edges SQL`_)" -msgstr "pgr_strongComponents(`Kanter SQL`_)" +msgid "Fix winnie build" +msgstr "Fixa winnie build" -msgid "The strong components of the graph" -msgstr "De starka komponenterna i grafen" +msgid "Fix clang warnings" +msgstr "Fixa clang-varningar" -msgid "`Boost: Strong components `__" -msgstr "`Boost: Starka komponenter `__" +msgid "Grouping headers of postgres readers" +msgstr "Gruppering av rubriker för postgres-läsare" -msgid "wikipedia: `Strongly connected component `__" -msgstr "wikipedia: `Starkt ansluten komponent `__" +msgid "pgRouting 3.5.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.5.0" -msgid "``pgr_topologicalSort`` - Experimental" -msgstr "``pgr_topologicalSort`` - Experimentell" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.0 `__" -msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." -msgstr "``pgr_topologicalSort`` - Linjär ordning av topparna för riktade acykliska grafer (DAG)." +msgid "Dijkstra" +msgstr "Dijkstra" -msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." -msgstr "Den topologiska sorteringsalgoritmen skapar en linjär ordning av hörnen så att om kanten :math:`(u,v)` förekommer i grafen, så kommer :math:`v` före :math:`u` i ordningen." +msgid "pgRouting 3.4" +msgstr "pgRouting 3.4" -msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." -msgstr "Processen är endast giltig för riktade acykliska grafer. annars kommer den att ge varningar." +msgid "pgRouting 3.4.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.4.2" -msgid "For optimization purposes, if there are more than one answer, the function" -msgstr "För optimeringsändamål, om det finns mer än ett svar, kan funktionen" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.2 `__" -msgid "will return one of them." -msgstr "kommer att returnera en av dem." +msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." +msgstr "`#2394 `__: pgr_bdAstar ackumulerar heuristisk kostnad i besökt nodkostnad." -msgid "The returned values are ordered in topological order:" -msgstr "De returnerade värdena är ordnade i topologisk ordning:" +msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." +msgstr "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variabeln ska vara av typen Record." -msgid "pgr_topologicalSort(`Edges SQL`_)" -msgstr "pgr_topologicalSort(`Kanter SQL`_)" +msgid "pgRouting 3.4.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.4.1" -msgid "Topologically sorting the graph" -msgstr "Topologisk sortering av grafen" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.1 `__" -msgid "Sequential value starting from :math:`1`" -msgstr "Sekventiellt värde med början från :math:`1`" +msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" +msgstr "`#2401 `__: pgRouting 3.4.0 bygger inte dokument när sphinx är för låg eller saknas" -msgid "Linear topological ordering of the vertices" -msgstr "Linjär topologisk ordning av hörnen" +msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" +msgstr "`#2398 `__: v3.4.0 uppgraderar inte från 3.3.3" -msgid "Additional examples" -msgstr "Ytterligare exempel" +msgid "pgRouting 3.4.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.4.0" -msgid "Topologically sorting the one way segments" -msgstr "Topologisk sortering av enkelriktade segment" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.0 `__" -msgid "Graph is not a DAG" -msgstr "Grafen är inte en DAG" +msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" +msgstr "`#1891 `__: pgr_ksp ger inte alla korrekta kortaste vägar" -msgid "`Boost: topological sort `__" -msgstr "`Boost: topologisk sortering `__" +msgid "New proposed functions." +msgstr "Nya föreslagna funktioner." -msgid "``pgr_transitiveClosure`` - Experimental" -msgstr "``pgr_transitiveClosure`` - Experimentell" +msgid "With points" +msgstr "Med punkt" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." -msgstr "``pgr_transitiveClosure`` - Transitiv stängningsgraf för en riktad graf." +msgid "pgr_withPointsVia(One Via)" +msgstr "pgr_withPointsVia(One Via)" -msgid "Transforms the input directed graph into the transitive closure of the graph." -msgstr "Transformerar den inmatade riktade grafen till grafens transitiva slutenhet." +msgid "Turn Restrictions" +msgstr "Begränsningar för sväng" -msgid "Process is valid for directed graphs." -msgstr "Processen är giltig för riktade grafer." +msgid "Via with turn restrictions" +msgstr "Via med svängrestriktioner" -msgid "The transitive closure of an undirected graph produces a cluster graph" -msgstr "Den transitiva stängningen av en odelad graf ger en klustergraf" +msgid "pgr_trspVia(One Via)" +msgstr "pgr_trspVia(One Via)" -msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" -msgstr "Nåbarhet mellan hörn i en odelad graf uppstår när de tillhör samma sammankopplade komponent. (se :doc:`pgr_connectedComponents`)" +msgid "pgr_trspVia_withPoints(One Via)" +msgstr "pgr_trspVia_withPoints(One Via)" -msgid "The returned values are not ordered" -msgstr "De returnerade värdena är inte ordnade" +msgid "pgr_trsp_withPoints(One to One)" +msgstr "pgr_trsp_withPoints(One to One)" -msgid "The returned graph is compressed" -msgstr "Den returnerade grafen är komprimerad" +msgid "pgr_trsp_withPoints(One to Many)" +msgstr "pgr_trsp_withPoints(One to Many)" -msgid "Running time: :math:`O(|V||E|)`" -msgstr "Speltid: :math:`O(|V||E|)`" +msgid "pgr_trsp_withPoints(Many to One)" +msgstr "pgr_trsp_withPoints(Many to One)" -msgid "The pgr_transitiveClosure function has the following signature:" -msgstr "Funktionen pgr_transitiveClosure har följande signatur:" +msgid "pgr_trsp_withPoints(Many to Many)" +msgstr "pgr_trsp_withPoints(Many to Many)" -msgid "pgr_transitiveClosure(`Edges SQL`_)" -msgstr "pgr_transitiveClosure(`Kanter SQL`_)" +msgid "pgr_trsp_withPoints(Combinations)" +msgstr "pgr_trsp_withPoints(Combinations)" -msgid "Returns set of |result-closure|" -msgstr "Returnerar uppsättning av |result-closure|" +msgid "Topology" +msgstr "Topologi" -msgid "Rechability of a subgraph" -msgstr "Rechability av en delgraf" +msgid "pgr_findCloseEdges(One point)" +msgstr "pgr_findCloseEdges(One point)" -msgid "Identifier of the source of the edges" -msgstr "Identifierare av källan till kanterna" +msgid "pgr_findCloseEdges(Many points)" +msgstr "pgr_findCloseEdges(Many points)" -msgid "``target_array``" -msgstr "``target_array``" +msgid "pgr_cuthillMckeeOrdering" +msgstr "pgr_cuthillMckeeOrdering" -msgid "Identifiers of the targets of the edges" -msgstr "Identifierare av målen för kanterna" +msgid "Unclassified" +msgstr "Oklassificerade" -msgid "Identifiers of the vertices that are reachable from vertex v." -msgstr "Identifierare för de toppar som är nåbara från topp v." +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" -msgid "`Boost: transitive closure `__" -msgstr "`Boost: transitiv stängning `__" +msgid "Flow functions" +msgstr "Flödesfunktioner" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" -msgstr "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "pgr_maxCardinalityMatch(text)" +msgstr "pgr_maxCardinalityMatch(text)" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" +msgstr "Föråldrad: pgr_maxCardinalityMatch(text,boolean)" -msgid "``pgr_trsp`` - routing vertices with restrictions." -msgstr "``pgr_trsp`` - routing av toppar med restriktioner." +msgid "Deprecated Functions" +msgstr "Föråldrade funktioner" -msgid "pgr_trsp(One to One)" -msgstr "pgr_trsp(One to One)" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" -msgid "pgr_trsp(One to Many)" -msgstr "pgr_trsp(One to Many)" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" +msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" -msgid "pgr_trsp(Many to One)" -msgstr "pgr_trsp(Many to One)" +msgid "pgRouting 3.3" +msgstr "pgRouting 3.3" -msgid "pgr_trsp(Many to Many)" -msgstr "pgr_trsp(Many to Many)" +msgid "pgRouting 3.3.5 Release Notes" +msgstr "Versionsinformation för pgRouting 3.3.5" -msgid "pgr_trsp(Combinations)" -msgstr "pgr_trsp(Combinations)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.5 `__" -msgid "Deprecated signatures" -msgstr "Föråldrade signaturer" +msgid "pgRouting 3.3.4 Release Notes" +msgstr "Versionsinformation för pgRouting 3.3.4" -msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.4 `__" -msgid "New prototypes" -msgstr "Nya prototyper" +msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" +msgstr "`#2400 `__: pgRouting 3.3.3 kan inte byggas i fokal" -msgid "pgr_trspViaVertices" -msgstr "pgr_trspViaVertices" +msgid "pgRouting 3.3.3 Release Notes" +msgstr "Versionsinformation för pgRouting 3.3.3" -msgid "pgr_trspViaEdges" -msgstr "pgr_trspViaEdges" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.3 `__" -msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." -msgstr "Turn restricted shortest path (TRSP) är en algoritm som tar emot svängrestriktioner i form av en fråga, liknande de som finns i verkliga vägnät." +msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." +msgstr "Ignorerar den valfria booleska parametern, eftersom algoritmen endast fungerar för oriktade grafer." -msgid "It does no guarantee the shortest path as it might contain restriction paths." -msgstr "Den garanterar inte den kortaste vägen eftersom den kan innehålla begränsande vägar." +msgid "pgRouting 3.3.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.3.2" -msgid "The general algorithm is as follows:" -msgstr "Den allmänna algoritmen är som följer:" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.2 `__" -msgid "Execute a Dijkstra." -msgstr "Utför en Dijkstra." +msgid "Revised documentation" +msgstr "Reviderad dokumentation" -msgid "If the solution passes thru a restriction then." -msgstr "Om lösningen passerar genom en begränsning då." +msgid "Simplifying table names and table columns, for example:" +msgstr "Förenkling av t.ex. tabellnamn och tabellkolumner:" -msgid "Execute the **TRSP** algorithm with restrictions." -msgstr "Utför **TRSP**-algoritmen med begränsningar." +msgid "``edges`` instead of ``edge_table``" +msgstr "``edges`` i stället för ``edge_table``" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, [``directed``])" +msgid "Removing unused columns ``category_id`` and ``reverse_category_id``." +msgstr "Ta bort oanvända kolumner ``category_id`` och ``reverse_category_id``." -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vids**, [``directed``])" +msgid "``combinations`` instead of ``combinations_table``" +msgstr "``combinations`` i stället för ``combinations_table``" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vid**, [``directed``])" +msgid "Using PostGIS standard for geometry column." +msgstr "Använda PostGIS-standard för geometrikolumn." -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vids**, [``directed``])" +msgid "``geom`` instead of ``the_geom``" +msgstr "``geom`` i stället för ``the_geom``" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restriktioner SQL`_, `Kombinationer SQL`_, [``directed``])" +msgid "Avoiding usage of functions that modify indexes, columns etc on tables." +msgstr "Undvika användning av funktioner som modifierar index, kolumner etc. i tabeller." -msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." -msgstr "Från toppunkt :math:`6` till toppunkt :math:`10` i en odelad graf." +msgid "Using ``pgr_extractVertices`` to create a routing topology" +msgstr "Använda ``pgr_extractVertices`` för att skapa en routningstopologi" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." -msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 1\\}` i en odelad graf." +msgid "Restructure of the pgRouting concepts page." +msgstr "Omstrukturering av sidan med pgRouting-koncept." -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." -msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`8` i en riktad graf." +msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" +msgstr "`#2276 `__: edgeDisjointPaths-problem med start_vid och kombinationer" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." -msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 8\\}` i en odelad graf." +msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" +msgstr "`#2312 `__: pgr_extractVertices fel när målet inte är BIGINT" -msgid "Using a combinations table on an undirected graph." -msgstr "Använda en kombinationstabell på en ostyrd graf." +msgid "`#2357 `__: Apply clang-tidy performance-*" +msgstr "`#2357 `__: Tillämpa clang-tidy prestanda-*" -msgid "`Deprecated documentation `_" -msgstr "föråldrad dokumentation `_" +msgid "pgRouting 3.3.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.3.1" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.1 `__" -msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." -msgstr "``pgr_trspVia`` Rutt som går igenom en lista med toppar med restriktioner." +msgid "`#2216 `__: Warnings when using clang" +msgstr "`#2216 `__: Varningar vid användning av clang" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "Givet en lista med toppar och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;toppar)` och försöker att inte använda begränsade vägar." +msgid "`#2266 `__: Error processing restrictions" +msgstr "`#2266 `__: Fel vid bearbetning av restriktioner" -msgid "The paths represents the sections of the route." -msgstr "Banorna representerar de olika delarna av rutten." +msgid "pgRouting 3.3.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.3.0" -msgid "Execute a :doc:`pgr_dijkstraVia`." -msgstr "Exekvera en :doc:`pgr_dijkstraVia`." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.0 `__" -msgid "For the set of sub paths of the solution that pass through a restriction then" -msgstr "För uppsättningen delvägar för lösningen som passerar genom en begränsning gäller följande" +msgid "`#2057 `__: trspViaEdges columns in different order" +msgstr "`#2057 `__: trspViaEdges-kolumner i olika ordning" -msgid "Execute the **TRSP** algorithm with restrictions for the paths." -msgstr "Utför **TRSP**-algoritmen med begränsningar för banorna." +msgid "`#2087 `__: pgr_extractVertices to proposed" +msgstr "`#2087 `__: pgr_extractVertices till förslag" -msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." -msgstr "**OBSERVERA** när detta görs ignoreras flaggan ``U_turn_on_edge``." +msgid "`#2201 `__: pgr_depthFirstSearch to proposed" +msgstr "`#2201 `__: pgr_depthFirstSearch till proposed" -msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgstr "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" +msgstr "`#2202 `__: pgr_sequentialVertexColoring till föreslagen" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." -msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen i en riktad graf." +msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" +msgstr "`#2203 `__: pgr_dijkstraNear och pgr_dijkstraNearCost till föreslagna" -msgid "Simulation of how algorithm works." -msgstr "Simulering av hur algoritmen fungerar." +msgid "Coloring" +msgstr "Färgläggning" -msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" -msgstr "Algoritmen utför en :doc:`pgr_dijkstraVia`" +msgid "Experimental promoted to Proposed" +msgstr "Experimentell befordrad till Föreslagen" -msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." -msgstr "Detekterar vilka av undervägarna som passerar genom en begränsning i det här fallet är för ``väg_id = 5`` från ``6`` till ``3`` eftersom vägen :math:`15 \\rightarrow 1` är begränsad." +msgid "pgr_dijkstraNear(Combinations)" +msgstr "pgr_dijkstraNear(Combinations)" -msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." -msgstr "Exekverar :doc:`pgr_trsp` -algoritmen för de motstridiga vägarna." +msgid "pgr_dijkstraNear(Many to Many)" +msgstr "pgr_dijkstraNear(Many to Many)" -msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "Från :doc:`pgr_dijkstraVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen:" +msgid "pgr_dijkstraNear(Many to One)" +msgstr "pgr_dijkstraNear(Many to One)" -msgid "Getting the same result as ``pgr_trspVia``:" -msgstr "Får samma resultat som ``pgr_trspVia``:" +msgid "pgr_dijkstraNear(One to Many)" +msgstr "pgr_dijkstraNear(One to Many)" -msgid "Example 8" -msgstr "Exempel 8" +msgid "pgr_dijkstraNearCost(Combinations)" +msgstr "pgr_dijkstraNearCost(Combinations)" -msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." -msgstr "Ibland ignoreras flaggan ``U_turn_on_edge`` när den är satt till ``false``." +msgid "pgr_dijkstraNearCost(Many to Many)" +msgstr "pgr_dijkstraNearCost(Many to Many)" -msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." -msgstr "Det första steget, att göra en :doc:`pgr_dijkstraVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men sökvägen :math:`16 \\rightarrow 13` (rad 4 och 5) är begränsad och resultatet använder den." +msgid "pgr_dijkstraNearCost(Many to One)" +msgstr "pgr_dijkstraNearCost(Many to One)" -msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "När :doc:`pgr_trsp`-algoritmen körs för den konfliktfyllda banan finns det ingen flagga för ``U_turn_on_edge``." +msgid "pgr_dijkstraNearCost(One to Many)" +msgstr "pgr_dijkstraNearCost(One to Many)" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." -msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``." +msgid "pgr_extractVertices" +msgstr "pgr_extractVertices" -msgid ":doc:`via-category`" -msgstr ":doc:`via-category`" +msgid "Traversal" +msgstr "Traversal" -msgid "``pgr_trspVia_withPoints``" -msgstr "``pgr_trspVia_withPoints``" +msgid "pgr_depthFirstSearch(Multiple vertices)" +msgstr "pgr_depthFirstSearch(Multiple vertices)" -msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." -msgstr "``pgr_trspVia_withPoints`` - Rutt som går igenom en lista med toppar och/eller punkter med restriktioner." +msgid "pgr_depthFirstSearch(Single vertex)" +msgstr "pgr_depthFirstSearch(Single vertex)" -msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "Med tanke på en graf, en uppsättning begränsningar på grafens kanter, en uppsättning punkter på grafens kanter och en lista med vertexer, är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en vertex eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)` och försöker att inte använda begränsade vägar." +msgid "pgRouting 3.2" +msgstr "pgRouting 3.2" -msgid "is a sequence of paths" -msgstr "är en sekvens av banor" +msgid "pgRouting 3.2.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.2.2" -msgid "Build the Graph with the new points." -msgstr "Bygg grafen med de nya punkterna." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.2 `__" -msgid "The points identifiers will be converted to negative values." -msgstr "Punkternas identifierare kommer att omvandlas till negativa värden." +msgid "`#2093 `__: Compilation on Visual Studio" +msgstr "`#2093 `__: Kompilering i Visual Studio" -msgid "The vertices identifiers will remain positive." -msgstr "Topparnas identifierare kommer att förbli positiva." +msgid "`#2189 `__: Build error on RHEL 7" +msgstr "`#2189 `__: Byggfel på RHEL 7" -msgid "Execute a :doc:`pgr_withPointsVia`." -msgstr "Exekvera en :doc:`pgr_withPointsVia`." +msgid "pgRouting 3.2.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.2.1" -msgid "For the set of paths of the solution that pass through a restriction then" -msgstr "För uppsättningen av vägar för lösningen som passerar genom en restriktion gäller följande" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.1 `__" -msgid "Execute the **TRSP** algorithm with restrictions for the path." -msgstr "Utför **TRSP**-algoritmen med begränsningar för banan." +msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" +msgstr "`#1883 `__: pgr_TSPEuclidean kraschar anslutningen i Windows" -msgid "Do not use negative values on identifiers of the inner queries." -msgstr "Använd inte negativa värden på identifierare för de inre frågorna." +msgid "The solution is to use Boost::graph::metric_tsp_approx" +msgstr "Lösningen är att använda Boost::graph::metric_tsp_approx" -msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" -msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" +msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" +msgstr "För att inte bryta användarens kod ignoreras de valfria parametrarna som är relaterade till TSP Annaeling" -msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgstr "**options:** ``[directed, strict, U_turn_on_edge, details]``" +msgid "The function with the annaeling optional parameters is deprecated" +msgstr "Funktionen med de valfria parametrarna annaeling är föråldrad" -msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." -msgstr "Hitta den rutt som besöker topparna :math:`\\{-6, 15, -5\\\\}` i den ordningen i en riktad graf." +msgid "pgRouting 3.2.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.2.0" -msgid "When positive it is considered a vertex identifier" -msgstr "När den är positiv betraktas den som en vertexidentifierare" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.0 `__" -msgid "When negative it is considered a point identifier" -msgstr "När den är negativ betraktas den som en punktidentifierare" +msgid "`#1850 `__: Change Boost min version to 1.56" +msgstr "`#1850 `__: Ändra Boost min-version till 1.56" -msgid "[**driving side**]" -msgstr "[**driving side**]" +msgid "Removing support for Boost v1.53, v1.54 & v1.55" +msgstr "Borttagande av stöd för Boost v1.53, v1.54 & v1.55" -msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" -msgstr "Värde i [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] som anger om förarsidan är:" +msgid "Dijkstra Near" +msgstr "Dijkstra Nära" -msgid "For directed graph:" -msgstr "För riktad graf:" +msgid "pgr_isPlanar" +msgstr "pgr_isPlanar" -msgid "[``r``, ``R``] for right driving side" -msgstr "[``r``, ``R``] för höger körsida" +msgid "pgr_lengauerTarjanDominatorTree" +msgstr "pgr_lengauerTarjanDominatorTree" -msgid "[``l``, ``L``] for left driving side" -msgstr "[``l``, ``L``] för vänster körsida" +msgid "pgr_makeConnected" +msgstr "pgr_makeConnected" -msgid "For undirected graph:" -msgstr "För odelad graf:" +msgid "Astar" +msgstr "Astar" -msgid "[``b``, ``B``] for both driving sides" -msgstr "[``b``, ``B``] för båda körsidorna" +msgid "Bidirectional Astar" +msgstr "Dubbelriktad Astar" -msgid "Default values when parameter is missing:" -msgstr "Standardvärden när parameter saknas:" +msgid "Bidirectional Dijkstra" +msgstr "Dubbelriktad Dijkstra" -msgid "[``r``, ``R``] for directed graph" -msgstr "[``r``, ``R``] för riktad graf" +msgid "pgRouting 3.1" +msgstr "pgRouting 3.1" -msgid "[``l``, ``L``] for undirected graph" -msgstr "[``l``, ``L``] för odelad graf" +msgid "pgRouting 3.1.4 Release Notes" +msgstr "Versionsinformation för pgRouting 3.1.4" -msgid "With points optional parameters" -msgstr "Med punkter valfria parametrar" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.4 `__" -msgid "``details``" -msgstr "``details``" +msgid "Issues fixes" +msgstr "Problemlösningar" -msgid "For showing points stops." -msgstr "För att visa punkter stoppar." +msgid "pgRouting 3.1.3 Release Notes" +msgstr "Versionsinformation för pgRouting 3.1.3" -msgid "When ``true`` the results will include the points that are in the path." -msgstr "När ``true`` visas kommer resultaten att inkludera de punkter som ligger i banan." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.3 `__" -msgid "When ``false`` the results will not include the points that are in the path." -msgstr "När ``false`` visas kommer resultaten inte att omfatta de punkter som ligger i banan." +msgid "`#1825 `__: Boost versions are not honored" +msgstr "`#1825 `__: Boost-versioner respekteras inte" -msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." -msgstr "När kolumnerna ``start_vid``, ``end_vid`` och ``node`` har negativa värden är identifieraren för en Point." +msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" +msgstr "`#1849 `__: Boost 1.75.0 geometri \"point_xy.hpp\" byggfel i macOS-miljö" -msgid "Use ``pgr_findCloseEdges`` for points on the fly" -msgstr "Använd ``pgr_findCloseEdges`` för punkter i farten" +msgid "`#1861 `__: vrp functions crash server" +msgstr "`#1861 `__: vrp-funktioner kraschar server" -msgid "Using :doc:`pgr_findCloseEdges`:" -msgstr "Använder :doc:`pgr_findCloseEdges`:" +msgid "pgRouting 3.1.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.1.2" -msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." -msgstr "Besök från toppunkten :math:`1` till de två platserna på grafen för punkten `(2,9, 1,8)` i ordning efter närhet till grafen." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.2 `__" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." -msgstr "Punkten :math:`-1` motsvarar den närmaste kanten från punkten `(2,9, 1,8)`." +msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" +msgstr "`#1304 `__: FreeBSD 12 64-bit kraschar på pgr_vrOneDepot-tester Experimentell funktion" -msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." -msgstr "Punkten :math:`-2` motsvarar nästa nära kant från punkten `(2,9, 1,8)`." +msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +msgstr "`#1356 `__: tools/testers/pg_prove_tests.sh misslyckas när PostgreSQL-porten inte är godkänd" -msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." -msgstr "Punkt :math:`-2` besöks på rutten till från toppunkt :math:`1` till punkt :math:`-1` (Se rad där :math:`seq = 4`)." +msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +msgstr "`#1725 `__: Serverkrasch på pgr_pickDeliver och pgr_vrpOneDepot på openbsd" -msgid "Usage variations" -msgstr "Variationer i användning" +msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" +msgstr "`#1760 `__: TSP-serverkrasch på ubuntu 20.04 #1760" -msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." -msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-6, 7, -4, 8, -2\\\\}` i den ordningen i en riktad graf." +msgid "`#1770 `__: Remove warnings when using clang compiler" +msgstr "`#1770 `__: Ta bort varningar vid användning av clang-kompilatorn" -msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." -msgstr "Status för \"passeringar framför\" eller \"besök\" av noder och punkter." +msgid "pgRouting 3.1.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.1.1" -msgid "The algorithm performs a :doc:`pgr_withPointsVia`" -msgstr "Algoritmen utför en :doc:`pgr_withPointsVia`" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.1 `__" -msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." -msgstr "Detekterar vilka av sökvägarna som passerar genom en begränsning i detta fall är för ``path_id = 1`` från ``-6`` till ``15`` eftersom sökvägen :math:`9 \\rightarrow 16` är begränsad." +msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" +msgstr "`#1733 `__: pgr_bdAstar misslyckas när käll- eller målvertexen inte finns i grafen" -msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." -msgstr "Exekverar :ref:`TRSP-family:TRSP algorithm` för de motstridiga sökvägarna." +msgid "`#1647 `__: Linear Contraction contracts self loops" +msgstr "`#1647 `__: Linjär sammandragning kontrakterar självloopar" -msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "Från resultatet av :doc:`pgr_withPointsVia` tar den bort de motstridiga vägarna och bygger lösningen med resultaten av algoritmen :doc:`pgr_trsp`:" +msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" +msgstr "`#1640 `__: pgr_withPoints misslyckas när points_sql är tom" -msgid "Getting the same result as ``pgr_trspVia_withPoints``:" -msgstr "Får samma resultat som ``pgr_trspVia_withPoints``:" +msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" +msgstr "`#1616 `__: Banutvärdering på C++ uppdateras inte innan resultaten går tillbaka till C" -msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." -msgstr "Det första steget, att göra en :doc:`pgr_withPointsVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men banan :math:`9 \\rightarrow 16` (rad 4 och 5) är begränsad och resultatet är att använda den." +msgid "`#1300 `__: pgr_chinesePostman crash on test data" +msgstr "`#1300 `__: pgr_chinesePostman kraschar på testdata" -msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "När algoritmen :doc:`pgr_trsp_withPoints` exekveras för den konfliktfyllda banan finns det ingen flagga ``U_turn_on_edge``." +msgid "pgRouting 3.1.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.1.0" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." -msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``. Från :doc:`pgr_withPointsVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen. I det här fallet har en U-sväng gjorts med samma kant." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.0 `__" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +msgid "pgr_dijkstra(combinations)" +msgstr "pgr_dijkstra(combinations)" -msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." -msgstr "``pgr_trsp_withPoints`` Routing Vertex/Point med restriktioner." +msgid "pgr_dijkstraCost(combinations)" +msgstr "pgr_dijkstraCost(combinations)" -msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." -msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Beakta de ogiltiga vägarna i `Restrictions SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen." +msgid "Build changes" +msgstr "Förändringar i byggnaden" -msgid "Vertices of the graph are:" -msgstr "Grafens hörn är:" +msgid "Minimal requirement for Sphinx: version 1.8" +msgstr "Minimikrav för Sphinx: version 1.8" -msgid "**positive** when it belongs to the `Edges SQL`_" -msgstr "**positiv** när den tillhör `Kanter SQL`_" +msgid "pgRouting 3.0" +msgstr "pgRouting 3.0" -msgid "**negative** when it belongs to the `Points SQL`_" -msgstr "**negativ** när den tillhör `Points SQL`_" +msgid "pgRouting 3.0.6 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.6" -msgid "The `agg_cost` in the non included values `(v, v)` is `0`" -msgstr "`Agg_cost` i de icke inkluderade värdena \"v, v\" är \"0\"" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.6 `__" -msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" -msgstr "Agg_cost i de icke inkluderade värdena `(u, v)` är :math:`\\infty`" +msgid "pgRouting 3.0.5 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.5" -msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." -msgstr "För optimeringsändamål ignoreras alla duplicerade värden i inmatningsmatriserna för **start vids** eller **end vids** eller." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.5 `__" -msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" -msgstr "Drifttid: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgid "Backport issue fixes" +msgstr "Fixar problem med backport" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**driving side**,] [**options**])" +msgid "pgRouting 3.0.4 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.4" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.4 `__" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**,] [**options**])" +msgid "pgRouting 3.0.3 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.3" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.3 `__" -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgid "pgRouting 3.0.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.2" -msgid "**options:** ``[directed, details]``" -msgstr "**options:** ``[directed, details]``" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.2 `__" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" -msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (med detaljer)" +msgid "`#1378 `__: Visual Studio build failing" +msgstr "`#1378 `__: Visual Studio-byggnad misslyckas" -msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" -msgstr "Från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` på en odelad graf" +msgid "pgRouting 3.0.1 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.1" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" -msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf. (utan detaljer)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.1 `__" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." -msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` med körning på vänster sida." +msgid "`#232 `__: Honor client cancel requests in C /C++ code" +msgstr "`#232 `__: Uppfylla begäran om avbrytande av klient i C/C++-kod" -msgid "Two combinations" -msgstr "Två kombinationer" +msgid "pgRouting 3.0.0 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.0" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" -msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med högerkörning. (med detaljer)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.0 `__" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." -msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_." +msgid "Fixed Issues" +msgstr "Korrigerade problem" -msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Hitta vägarna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." +msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" +msgstr "`#1153 `__: Bytte namn på pgr_eucledianTSP till pgr_TSPeuclidean" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" -msgstr "Alla exempel handlar om att resa från punkt :math:`1` och toppunkt :math:`5` till punkter :math:`\\{2, 3, 6\\}` och toppunkter :math:`\\{10, 11\\}` med restriktioner" +msgid "`#1188 `__: Removed CGAL dependency" +msgstr "`#1188 `__: Borttaget CGAL-beroende" -msgid "Passes in front or visits with right side driving." -msgstr "Passerar framför eller besöker med högerkörning." +msgid "`#1002 `__: Fixed contraction issues:" +msgstr "`#1002 `__: Fixade problem med sammandragning:" -msgid "For point :math:`6` and vertex :math:`11`." -msgstr "För punkt :math:`6` och toppunkt :math:`11`." +msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" +msgstr "`#1004 `__: Kontrakt när förbjudna toppar inte tillhör grafen" -msgid "Passes in front or visits with left side driving." -msgstr "Passerar framför eller besöker med vänsterkörning." +msgid "`#1005 `__: Intermideate results eliminated" +msgstr "`#1005 `__: Medelmåttiga resultat eliminerade" -msgid "``pgr_turnRestrictedPath`` - Experimental" -msgstr "``pgr_turnRestrictedPath`` - Experimentell" +msgid "`#1006 `__: No loss of information" +msgstr "`#1006 `__: Ingen förlust av information" -msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" -msgstr "``pgr_turnRestrictedPath`` Använd Yen's algoritm Vertex - Vertex routing med restriktioner" +msgid "New Functions" +msgstr "Nya funktioner" -msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" -msgstr "Använd Yen's algoritm för att få K kortaste vägar och analysera vägarna för att välja de vägar som inte använder begränsningarna" +msgid "Kruskal family" +msgstr "Familjen Kruskal" -msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, **K**, [**options**])" +msgid "pgr_kruskal" +msgstr "pgr_kruskal" -msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" -msgstr "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +msgid "pgr_kruskalBFS" +msgstr "pgr_kruskalBFS" -msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" -msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` på en riktad graf" +msgid "pgr_kruskalDD" +msgstr "pgr_kruskalDD" -msgid "Special optional parameters" -msgstr "Särskilda valfria parametrar" +msgid "pgr_kruskalDFS" +msgstr "pgr_kruskalDFS" -msgid "``stop_on_first``" -msgstr "``stop_on_first``" +msgid "Prim family" +msgstr "Familjen Prim" -msgid "When ``true`` stops on first path found that dos not violate restrictions" -msgstr "När ``true`` stannar på första bästa väg som inte bryter mot restriktioner" +msgid "pgr_prim" +msgstr "pgr_prim" -msgid "When ``false`` returns at most K paths" -msgstr "När ``false`` returnerar högst K sökvägar" +msgid "pgr_primDD" +msgstr "pgr_primDD" -msgid "When ``true`` returns only paths that do not violate restrictions" -msgstr "När ``true`` returnerar endast sökvägar som inte bryter mot begränsningar" +msgid "pgr_primDFS" +msgstr "pgr_primDFS" -msgid "When ``false`` returns the paths found" -msgstr "När ``false`` returneras de hittade sökvägarna" +msgid "pgr_primBFS" +msgstr "pgr_primBFS" -msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." -msgstr "Från toppunkt :math:`3` till :math:`8` med flaggan ``strict`` på." +msgid "Proposed moved to official on pgRouting" +msgstr "Föreslagen flyttad till officiell på pgRouting" -msgid "No results because the only path available follows a restriction." -msgstr "Inga resultat eftersom den enda tillgängliga vägen följer en begränsning." +msgid "aStar Family" +msgstr "aStar-familjen" -msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" -msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` i en odelad graf" +msgid "pgr_aStarCost(One to One)" +msgstr "pgr_aStarCost(One to One)" -msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" -msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` med fler alternativ" +msgid "pgr_aStarCost(One to Many)" +msgstr "pgr_aStarCost(One to Many)" -msgid "``pgr_version``" -msgstr "``pgr_version``" +msgid "pgr_aStarCost(Many to One)" +msgstr "pgr_aStarCost(Many to One)" -msgid "``pgr_version`` — Query for pgRouting version information." -msgstr "``pgr_version`` - Fråga efter versionsinformation för pgRouting." +msgid "pgr_aStarCost(Many to Many)" +msgstr "pgr_aStarCost(Many to Many)" -msgid "Breaking change on result columns" -msgstr "Förändring i resultatkolumnerna" +msgid "pgr_aStarCostMatrix" +msgstr "pgr_aStarCostMatrix" -msgid "Support for old signature ends" -msgstr "Stöd för gamla signaturer slutar" +msgid "bdAstar Family" +msgstr "bdAstar Familj" -msgid "Returns pgRouting version information." -msgstr "Returnerar versionsinformation för pgRouting." +msgid "pgr_bdAstarCost(One to One)" +msgstr "pgr_bdAstarCost(One to One)" -msgid "pgr_version()" -msgstr "pgr_version()" +msgid "pgr_bdAstarCost(One to Many)" +msgstr "pgr_bdAstarCost(One to Many)" -msgid "RETURNS ``TEXT``" -msgstr "RETURNERAR ``TEXT``" +msgid "pgr_bdAstarCost(Many to One)" +msgstr "pgr_bdAstarCost(Many to One)" -msgid "pgRouting Version for this documentation" -msgstr "pgRouting Version för denna dokumentation" +msgid "pgr_bdAstarCost(Many to Many)" +msgstr "pgr_bdAstarCost(Many to Many)" -msgid "``pgr_vrpOneDepot`` - Experimental" -msgstr "``pgr_vrpOneDepot`` - Experimentell" +msgid "pgr_bdAstarCostMatrix" +msgstr "pgr_bdAstarCostMatrix" -msgid "**No documentation available**" -msgstr "**Ingen dokumentation tillgänglig**" +msgid "bdDijkstra Family" +msgstr "familjen bdDijkstra" -msgid "**TBD**" -msgstr "**TBD**" +msgid "pgr_bdDijkstraCost(One to One)" +msgstr "pgr_bdDijkstraCost(One to One)" -msgid "TBD" -msgstr "TBD" +msgid "pgr_bdDijkstraCost(One to Many)" +msgstr "pgr_bdDijkstraCost(One to Many)" -msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." -msgstr "``pgr_withPoints`` - Returnerar den kortaste vägen i en graf med ytterligare tillfälliga toppar." +msgid "pgr_bdDijkstraCost(Many to One)" +msgstr "pgr_bdDijkstraCost(Many to One)" -msgid "pgr_withPoints(Combinations)" -msgstr "pgr_withPoints(Combinations)" +msgid "pgr_bdDijkstraCost(Many to Many)" +msgstr "pgr_bdDijkstraCost(Many to Many)" -msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." -msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen." +msgid "pgr_bdDijkstraCostMatrix" +msgstr "pgr_bdDijkstraCostMatrix" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**körsida**] [**alternativ**])" +msgid "Flow Family" +msgstr "Flödesfamilj" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**körsida**] [**options**])" +msgid "pgr_pushRelabel(One to One)" +msgstr "pgr_pushRelabel(One to One)" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**drivande sida**] [**optioner**])" +msgid "pgr_pushRelabel(One to Many)" +msgstr "pgr_pushRelabel(One to Many)" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**drivande sida**] [**optioner**])" +msgid "pgr_pushRelabel(Many to One)" +msgstr "pgr_pushRelabel(Many to One)" -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgid "pgr_pushRelabel(Many to Many)" +msgstr "pgr_pushRelabel(Many to Many)" -msgid "**options:** ``[directed, details])``" -msgstr "**options:** ``[directed, details])``" +msgid "pgr_edmondsKarp(One to One)" +msgstr "pgr_edmondsKarp(One to One)" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" -msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (utan detaljer)" +msgid "pgr_edmondsKarp(One to Many)" +msgstr "pgr_edmondsKarp(One to Many)" -msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." -msgstr "Identifierare för banans startvertex. Negativt värde är för punktens identifierare." +msgid "pgr_edmondsKarp(Many to One)" +msgstr "pgr_edmondsKarp(Many to One)" -msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." -msgstr "Array med identifierare för startpunkter. Negativa värden är för punktens identifierare." +msgid "pgr_edmondsKarp(Many to Many)" +msgstr "pgr_edmondsKarp(Many to Many)" -msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." -msgstr "Identifierare för banans slutpunkt. Negativt värde är för punktens identifierare." +msgid "pgr_boykovKolmogorov (One to One)" +msgstr "pgr_boykovKolmogorov (One to One)" -msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." -msgstr "Array med identifierare för ändpunkter. Negativa värden är för punktens identifierare." +msgid "pgr_boykovKolmogorov (One to Many)" +msgstr "pgr_boykovKolmogorov (One to Many)" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "Alla exempel handlar om att resa från punkten :math:`1` och toppunkten :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`" +msgid "pgr_boykovKolmogorov (Many to One)" +msgstr "pgr_boykovKolmogorov (Many to One)" -msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." -msgstr "``pgr_withPointsCost`` - Beräknar den kortaste vägen och returnerar endast den sammanlagda kostnaden för den kortaste vägen som hittats, för den kombination av punkter som anges." +msgid "pgr_boykovKolmogorov (Many to Many)" +msgstr "pgr_boykovKolmogorov (Many to Many)" -msgid "pgr_withPointsCost(Combinations)" -msgstr "pgr_withPointsCost(Combinations)" +msgid "pgr_maxCardinalityMatching" +msgstr "pgr_maxCardinalityMatching" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." -msgstr "Modifiera grafen så att den innehåller punkter definierade av points_sql. Använd Dijkstra-algoritmen och returnera endast den sammanlagda kostnaden för den kortaste vägen som hittats." +msgid "pgr_edgeDisjointPaths(One to One)" +msgstr "pgr_edgeDisjointPaths(One to One)" -msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." -msgstr "Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer av toppar i den modifierade grafen." +msgid "pgr_edgeDisjointPaths(One to Many)" +msgstr "pgr_edgeDisjointPaths(One to Many)" -msgid "The returned values are in the form of a set of |matrix-result|." -msgstr "De returnerade värdena är i form av en uppsättning |matrix-result|." +msgid "pgr_edgeDisjointPaths(Many to One)" +msgstr "pgr_edgeDisjointPaths(Many to One)" -msgid "**positive** when it belongs to the edges_sql" -msgstr "**positiv** när den hör till kanterna_sql" +msgid "pgr_edgeDisjointPaths(Many to Many)" +msgstr "pgr_edgeDisjointPaths(Many to Many)" -msgid "**negative** when it belongs to the points_sql" -msgstr "**negativ** när den hör till punktsql" +msgid "Components family" +msgstr "Komponenter familj" -msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." -msgstr "Om de värden som returneras lagras i en tabell skulle det unika indexet vara paret: `(start_vid, end_vid)`." +msgid "pgr_connectedComponents" +msgstr "pgr_connectedComponents" -msgid "For **undirected** graphs, the results are **symmetric**." -msgstr "För **ej riktade** grafer är resultaten **symmetriska**." +msgid "pgr_strongComponents" +msgstr "pgr_strongComponents" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**drivande sida**] [**optioner**])" +msgid "pgr_biconnectedComponents" +msgstr "pgr_biconnectedComponents" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])" +msgid "pgr_articulationPoints" +msgstr "pgr_articulationPoints" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**] [**options**])" +msgid "pgr_bridges" +msgstr "pgr_bridges" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])" +msgid "Contraction:" +msgstr "Sammandragning:" -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgid "Removed unnecessary column seq" +msgstr "Tog bort onödig kolumn seq" -msgid "**options:** ``[directed]``" -msgstr "**options:** ``[directed]``" +msgid "pgr_maxFlowMinCost" +msgstr "pgr_maxFlowMinCost" -msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." -msgstr "Det finns ingen **details**-flagga, till skillnad från de andra medlemmarna i withPoints-familjen av funktioner." +msgid "pgr_maxFlowMinCost_Cost" +msgstr "pgr_maxFlowMinCost_Cost" -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." -msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf." +msgid "pgr_dagShortestpath" +msgstr "pgr_dagShortestpath" -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." -msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf." +msgid "VRP category" +msgstr "VRP-kategori" -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." -msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med körning på höger sida." +msgid "pgr_pickDeliverEuclidean" +msgstr "pgr_pickDeliverEuclidean" -msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Beräkna kostnaden för rutterna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." +msgid "pgr_pickDeliver" +msgstr "pgr_pickDeliver" -msgid "Being close to the graph does not mean have a shorter route." -msgstr "Att vara nära grafen betyder inte att man har en kortare väg." +msgid "Chinese Postman family" +msgstr "Chinese Postman family" -msgid "Right side driving topology" -msgstr "Topologi för drivning av höger sida" +msgid "pgr_chinesePostman" +msgstr "pgr_chinesePostman" -msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "Reser från punkt :math:`1` och toppunkt :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`" +msgid "pgr_chinesePostmanCost" +msgstr "pgr_chinesePostmanCost" -msgid "Left side driving topology" -msgstr "Topologi för drivning av vänster sida" +msgid "Breadth First Search family" +msgstr "Breadth First Search family" -msgid "Does not matter driving side driving topology" -msgstr "Spelar ingen roll drivsida drivtopologi" +msgid "Bellman Ford family" +msgstr "Bellman Ford family" -msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." -msgstr "``pgr_withPointsCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_withPoints`." +msgid "Moved to legacy" +msgstr "Flyttat till legacy" -msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgid "pgr_labelGraph - Use the components family of functions instead." +msgstr "pgr_labelGraph - Use the components family of functions instead." -msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" -msgstr "Kostnadsmatris för punkterna :math:`\\{1, 6\\}` och hörnen :math:`\\{10, 11\\}` i en **omdirigerad** graf" +msgid "Max flow - functions were renamed on v2.5.0" +msgstr "Maxflöde - funktioner döptes om i v2.5.0" -msgid "Returning a **symmetrical** cost matrix" -msgstr "Returnerar en **symmetrisk** kostnadsmatris" +msgid "pgr_maxFlowPushRelabel" +msgstr "pgr_maxFlowPushRelabel" -msgid "Using the default ``side`` value on the **points_sql** query" -msgstr "Använda standardvärdet ``side`` på **points_sql**-frågan" +msgid "pgr_maxFlowBoykovKolmogorov" +msgstr "pgr_maxFlowBoykovKolmogorov" -msgid "Using the default ``driving side`` value" -msgstr "Använda standardvärdet för \"körsida" +msgid "pgr_maxFlowEdmondsKarp" +msgstr "pgr_maxFlowEdmondsKarp" -msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Hitta matriskostnaden för rutterna från toppunkten :math:`1` och de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." +msgid "pgr_maximumcardinalitymatching" +msgstr "pgr_maximumcardinalitymatching" -msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." -msgstr "``pgr_withPointsDD`` - Returnerar köravståndet **från** en startpunkt." +msgid "VRP" +msgstr "VRP" -msgid "Output columns standardized to |result-spantree|" -msgstr "Utgångskolumner standardiserade till |result-spantree|" +msgid "pgr_gsoc_vrppdtw" +msgstr "pgr_gsoc_vrppdtw" -msgid "When ``details`` is ``false``:" -msgstr "När ``details`` är ``false``:" +msgid "TSP old signatures" +msgstr "TSP gamla signaturer" -msgid "Points reached within the distance are not included." -msgstr "Punkter som nås inom avståndet ingår inte." +msgid "pgr_pointsAsPolygon" +msgstr "pgr_pointsAsPolygon" -msgid "Deprecated signatures:" -msgstr "Föråldrade signaturer:" +msgid "pgr_alphaShape old signature" +msgstr "pgr_alphaShape old signature" -msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." -msgstr "Modifiera grafen så att den inkluderar punkter och använd Dijkstra-algoritmen för att extrahera alla noder och punkter som har kostnader som är mindre än eller lika med värdet ``**avstånd**`` från startpunkten. De extraherade kanterna kommer att överensstämma med motsvarande spännträd." +msgid "pgRouting 2" +msgstr "pgRouting 2" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgid "Minors 2.x" +msgstr "Minors 2.x" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgid "pgRouting 2.6" +msgstr "pgRouting 2.6" -msgid "**options A:** ``[directed, details]``" -msgstr "**options A:** ``[directed, details]``" +msgid "pgRouting 2.6.3 Release Notes" +msgstr "Versionsinformation för pgRouting 2.6.3" -msgid "**options B:** ``[directed, details, equicost]``" -msgstr "**options B:** ``[directed, details, equicost]``" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.3 `__" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgid "`#1219 `__: Implicit cast for via_path integer to text" +msgstr "`#1219 `__: Implicit kast för via_path heltal till text" -msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." -msgstr "Höger sida körtopologi, från punkt :math:`1` inom ett avstånd av :math:`3.3` med detaljer." +msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +msgstr "`#1193 `__: Fixat att pgr_pointsAsPolygon bröts när strängar jämfördes i WHERE-satsen" -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgid "`#1185 `__: Improve FindPostgreSQL.cmake" +msgstr "`#1185 `__: Förbättra FindPostgreSQL.cmake" -msgid "**options:** ``[directed, details, equicost]``" -msgstr "**options:** ``[directed, details, equicost]``" +msgid "pgRouting 2.6.2 Release Notes" +msgstr "Versionsinformation för pgRouting 2.6.2" -msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" -msgstr "Från punkt :math:`1` och toppunkt :math:`16` inom ett avstånd av :math:`3.3` med ``equicost`` på en riktad graf" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.2 `__" -msgid "Negative values represent a point" -msgstr "Negativa värden representerar en punkt" +msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" +msgstr "`#1152 `__: Fixar körsträcka när vertex inte är en del av grafen" -msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "Hitta köravståndet från de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." +msgid "`#1098 `__: Fixes windows test" +msgstr "`#1098 `__: Åtgärdar Windows-test" -msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." -msgstr "Punkt :math:`-1` motsvarar den närmaste kanten från punkt :math:`(2,9, 1,8)`." +msgid "`#1165 `__: Fixes build for python3 and perl5" +msgstr "`#1165 `__: Fixar byggandet för python3 och perl5" -msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." -msgstr "Punkt :math:`-2` motsvarar nästa nära kant från punkt :math:`(2,9, 1,8)`." +msgid "pgRouting 2.6.1 Release Notes" +msgstr "Versionsinformation för pgRouting 2.6.1" -msgid "Driving side does not matter" -msgstr "Körsidan spelar ingen roll" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.1 `__" -msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." -msgstr "Från punkt :math:`1` inom ett avstånd av :math:`3.3`, spelar ingen roll körsida, med detaljer." +msgid "Fixes server crash on several functions." +msgstr "Fixar serverkrasch på flera funktioner." -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +msgid "pgr_floydWarshall" +msgstr "pgr_floydWarshall" -msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "``pgr_withPointsKSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra." +msgid "pgr_johnson" +msgstr "pgr_johnson" -msgid "pgr_withPointsKSP(One to Many)" -msgstr "pgr_withPointsKSP(One to Many)" +msgid "pgr_bdDijstra" +msgstr "pgr_bdDijstra" -msgid "pgr_withPointsKSP(Many to One)" -msgstr "pgr_withPointsKSP(Many to One)" +msgid "pgr_alphashape" +msgstr "pgr_alphashape" -msgid "pgr_withPointsKSP(Many to Many)" -msgstr "pgr_withPointsKSP(Many to Many)" +msgid "pgr_dijkstraCostMatrix" +msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_withPointsKSP(Combinations)" -msgstr "pgr_withPointsKSP(Combinations)" +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" -msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." -msgstr "Modifierar grafen så att den innehåller de punkter som definieras i `Points SQL`_ och använder Yen-algoritmen för att hitta de :math:`K` kortaste vägarna." +msgid "pgr_dijkstraVia (proposed)" +msgstr "pgr_dijkstraVia (proposed)" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])" +msgid "pgr_boykovKolmogorov (proposed)" +msgstr "pgr_boykovKolmogorov (proposed)" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])" +msgid "pgr_edgeDisjointPaths (proposed)" +msgstr "pgr_edgeDisjointPaths (proposed)" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])" +msgid "pgr_edmondsKarp (proposed)" +msgstr "pgr_edmondsKarp (proposed)" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])" +msgid "pgr_maxCardinalityMatch (proposed)" +msgstr "pgr_maxCardinalityMatch (proposed)" -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgid "pgr_maxFlow (proposed)" +msgstr "pgr_maxFlow (proposed)" -msgid "**options:** ``[directed, heap_paths, details]``" -msgstr "**options:** ``[directed, heap_paths, details]``" +msgid "pgr_withPoints (proposed)" +msgstr "pgr_withPoints (proposed)" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." -msgstr "Få 2 vägar från punkt :math:`1` till punkt :math:`2` på en riktad graf med **vänster** sida som kör." +msgid "pgr_withPointsCost (proposed)" +msgstr "pgr_withPointsCost (proposed)" -msgid "For a directed graph." -msgstr "För en riktad graf." +msgid "pgr_withPointsKSP (proposed)" +msgstr "pgr_withPointsKSP (proposed)" -msgid "No details are given about distance of other points of the query." -msgstr "Inga detaljer ges om avståndet till andra punkter i frågan." +msgid "pgr_withPointsDD (proposed)" +msgstr "pgr_withPointsDD (proposed)" -msgid "No heap paths are returned." -msgstr "Inga heap-sökvägar returneras." +msgid "pgr_withPointsCostMatrix (proposed)" +msgstr "pgr_withPointsCostMatrix (proposed)" -msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" -msgstr "Hämta 2 vägar från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` i en ostyrd graf" +msgid "pgr_contractGraph (experimental)" +msgstr "pgr_contractGraph (experimental)" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" -msgstr "Hämta en väg från punkt :math:`1` och vertex :math:`6` till punkt :math:`3` i en **riktad** graf med **höger** sida och **detaljer** inställt på **True**" +msgid "pgr_pushRelabel (experimental)" +msgstr "pgr_pushRelabel (experimental)" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" -msgstr "Hämta en väg från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` i en **directed** graf med **left** side driving och **heap_paths** satt till **True**" +msgid "pgr_vrpOneDepot (experimental)" +msgstr "pgr_vrpOneDepot (experimental)" -msgid "Using a combinations table on an **directed** graph" -msgstr "Använda en kombinationstabell på en **riktad** graf" +msgid "pgr_gsoc_vrppdtw (experimental)" +msgstr "pgr_gsoc_vrppdtw (experimental)" -msgid "Number of required paths" -msgstr "Antal nödvändiga sökvägar" +msgid "Fixes for deprecated functions where also applied but not tested" +msgstr "Fixar för föråldrade funktioner som också tillämpas men inte testas" -msgid "withPointsKSP optional parameters" -msgstr "withPointsKSP valfria parametrar" +msgid "Removed compilation warning for g++8" +msgstr "Borttagen kompileringsvarning för g++8" -msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." -msgstr "Skaffa :math:`2` banor med hjälp av vänstersidig körtopologi, från toppunkten :math:`1` till den närmaste platsen på grafen för punkten `(2,9, 1,8)`." +msgid "Fixed a fallthrugh on Astar and bdAstar." +msgstr "Åtgärdat ett fel på Astar och bdAstar." -msgid "Left driving side" -msgstr "Vänster körsida" +msgid "pgRouting 2.6.0 Release Notes" +msgstr "Versionsinformation för pgRouting 2.6.0" -msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." -msgstr "Få :math:`2` banor med hjälp av vänstersidig drivtopologi, från punkt :math:`1` till punkt :math:`3` med detaljer." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.0 `__" -msgid "Right driving side" -msgstr "Höger körsida" +msgid "pgr_lineGraphFull" +msgstr "pgr_lineGraphFull" -msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." -msgstr "Få :math:`2` banor med hjälp av höger sidas drivande topologi från, punkt :math:`1` till punkt :math:`2` med högbanor och detaljer." +msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" +msgstr "Fix pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean[,text])" -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +msgid "without restrictions" +msgstr "utan begränsningar" -msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." -msgstr "``pgr_withPointsVia`` - Rutt som går genom en lista med toppar och/eller punkter." +msgid "calls pgr_dijkstra when both end points have a fraction IN (0,1)" +msgstr "anropar pgr_dijkstra när båda ändpunkterna har en fraktion IN (0,1)" -msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." -msgstr "Med tanke på en graf, en uppsättning punkter på grafens kanter och en lista med hörnpunkter är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en hörnpunkt eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)`." +msgid "calls pgr_withPoints when at least one fraction NOT IN (0,1)" +msgstr "anropar pgr_withPoints när minst en fraktion INTE ÄR I (0,1)" -msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" -msgstr "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgid "with restrictions" +msgstr "med begränsningar" -msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." -msgstr "Hitta rutten som besöker topparna :math:`\\{ -6, 15, -1\\\\}` i den ordningen med höger körsida i riktad graf..." +msgid "calls original trsp code" +msgstr "samtal original trsp kod" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" -msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_" +msgid "Internal code" +msgstr "Intern kod" -msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." -msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-1, 7, -3, 16, 15\\}` i den ordningen i en **riktad** graf." +msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" +msgstr "Rensade den interna koden för trsp(text,heltal,heltal,boolean,boolean [, text])" -msgid "Prim - Family of functions" -msgstr "Prim - Familj av funktioner" +msgid "Removed the use of pointers" +msgstr "Tog bort användningen av pekare" -msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." -msgstr "Prim-algoritmen utvecklades 1930 av den tjeckiske matematikern Vojtěch Jarník. Det är en girig algoritm som hittar ett träd med minsta spännvidd för en viktad oiktad graf. Detta innebär att den hittar en delmängd av kanterna som bildar ett träd som inkluderar varje vertex, där den totala vikten av alla kanter i trädet minimeras. Algoritmen bygger trädet ett vertex i taget, från ett godtyckligt startvertex, och lägger i varje steg till den billigaste möjliga förbindelsen från trädet till ett annat vertex." +msgid "Internal code can accept BIGINT" +msgstr "Intern kod kan acceptera BIGINT" -msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." -msgstr "Den här algoritmen hittar den minsta överspännande skogen i en eventuellt frånkopplad graf; däremot hittar den mest grundläggande formen av Prims algoritm bara minsta överspännande träd i sammanhängande grafer. Men om man kör Prims algoritm separat för varje ansluten komponent i grafen kallas den minsta spännvidden för skog." +msgid "Cleaned the internal code of withPoints" +msgstr "Rensade den interna koden för withPoints" -msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" -msgstr "Från Boost Graph: \"Algoritmen som den implementeras i Boost.Graph ger inte korrekta resultat på grafer med parallella kanter.\"" +msgid "pgRouting 2.5" +msgstr "pgRouting 2.5" -msgid "Boost: `Prim's algorithm `__" -msgstr "Boost: `Prims algoritm `__" +msgid "pgRouting 2.5.5 Release Notes" +msgstr "Versionsinformation för pgRouting 2.5.5" -msgid "Wikipedia: `Prim's algorithm `__" -msgstr "Wikipedia: `Prims algoritm `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.5 `__" -msgid "Proposed Functions" -msgstr "Föreslagna funktioner" +msgid "Fixes driving distance when vertex is not part of the graph" +msgstr "Fixar körsträcka när toppunkten inte är en del av grafen" -msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid "Fixes windows test" +msgstr "Åtgärdar Windows-test" -msgid "Reference" -msgstr "Referens" +msgid "Fixes build for python3 and perl5" +msgstr "Fixar byggsätt för python3 och perl5" -msgid "Release Notes" -msgstr "Versionsinformation" +msgid "pgRouting 2.5.4 Release Notes" +msgstr "Versionsinformation för pgRouting 2.5.4" -msgid "To see the full list of changes check the list of `Git commits `_ on Github." -msgstr "För att se den fullständiga listan över ändringar, se listan över `Git commits `_ på Github." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.4 `__" -msgid "Mayors" -msgstr "Borgmästare" +msgid "pgRouting 2.5.3 Release Notes" +msgstr "Versionsinformation för pgRouting 2.5.3" -msgid "pgRouting 4" -msgstr "pgRouting 4" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.3 `__" -msgid "Minors 4.x" -msgstr "Minors 4.x" +msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" +msgstr "Fix för postgresql 11: Tog bort ett kompileringsfel vid kompilering med postgreSQL" -msgid "pgRouting 4.1" -msgstr "pgRouting 4.1" +msgid "pgRouting 2.5.2 Release Notes" +msgstr "Versionsinformation för pgRouting 2.5.2" -msgid "pgRouting 4.1.0 Release Notes" -msgstr "Versionsinformation för pgRouting 4.1.0" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.2 `__" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.1.0 `__" +msgid "Fix for postgresql 10.1: Removed a compiler condition" +msgstr "Fix för postgresql 10.1: Tog bort ett kompilatorvillkor" -msgid "No changes yet" -msgstr "Inga ändringar ännu" +msgid "pgRouting 2.5.1 Release Notes" +msgstr "Versionsinformation för pgRouting 2.5.1" -msgid "pgRouting 3" -msgstr "pgRouting 3" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.1 `__" -msgid "Minors 3.x" -msgstr "Minors 3.x" +msgid "Fixed prerequisite minimum version of: cmake" +msgstr "Fixad förkunskapskrav för minsta version av: cmake" -msgid "pgRouting 3.8" -msgstr "pgRouting 3.8" +msgid "pgRouting 2.5.0 Release Notes" +msgstr "Versionsinformation för pgRouting 2.5.0" -msgid "pgRouting 3.8.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.8.0" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.0 `__" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.8.0 `__" +msgid "enhancement:" +msgstr "förbättring:" -msgid "Promotion to official function of pgRouting." -msgstr "Befordran till officiell funktion för pgRouting." +msgid "pgr_version is now on SQL language" +msgstr "pgr_version is now on SQL language" -msgid "Metric" -msgstr "Metriska" +msgid "Breaking change on:" +msgstr "Bryter förändring på:" -msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" -msgstr "`#2760 `__: Befordrad till officiell pgr_grad i version 3.8" +msgid "pgr_edgeDisjointPaths:" +msgstr "pgr_edgeDisjointPaths:" -msgid "Utilities" -msgstr "Verktyg" +msgid "Added path_id, cost and agg_cost columns on the result" +msgstr "Lagt till kolumnerna path_id, cost och agg_cost i resultatet" -msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" -msgstr "`#2772 `__: Befordrad till officiell pgr_extractVertices i version 3.8" +msgid "Parameter names changed" +msgstr "Namn på parametrar ändrade" -msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" -msgstr "`#2774 `__: Befordrad till officiell pgr_findCloseEdges i version 3.8" +msgid "The many version results are the union of the One to One version" +msgstr "Resultaten för många versioner är en sammanslagning av One to One-versionen" -msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" -msgstr "`#2873 `__: Befordrad till officiell pgr_separateCrossing i version 3.8" +msgid "New Signatures" +msgstr "Nya signaturer" -msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" -msgstr "`#2874 `__: Befordrad till officiell pgr_separateTouching i version 3.8" +msgid "pgr_bdAstar(One to One)" +msgstr "pgr_bdAstar(One to One)" -msgid "Proposed functions" -msgstr "Föreslagna funktioner" +msgid "pgr_lineGraph" +msgstr "pgr_lineGraph" -msgid "Contraction" -msgstr "Sammandragning" +msgid "pgr_bdastar - use pgr_bdAstar instead" +msgstr "pgr_bdastar - use pgr_bdAstar instead" -msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" -msgstr "`#2790 `__: pgr_contractionDeadEnd ny funktion för sammandragning" +msgid "Renamed functions" +msgstr "Omdöpta funktioner" -msgid "`#2791 `__: pgr_contractionLinear new contraction function" -msgstr "`#2791 `__: pgr_contractionLinear ny funktion för sammandragning" +msgid "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead" +msgstr "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead" -msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" -msgstr "`#2536 `__: Stöd för sammandragningshierarkier (pgr_contractionHierarchies)" +msgid "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead" +msgstr "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead" -msgid "`#2848 `__: Create pgr_separateCrossing new utility function" -msgstr "`#2848 `__: Skapa pgr_separateCrossing ny verktygsfunktion" +msgid "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead" +msgstr "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead" -msgid "`#2849 `__: Create of pgr_separateTouching new utility function" -msgstr "`#2849 `__: Skapande av pgr_separateTouching ny verktygsfunktion" +msgid "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead" +msgstr "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead" -msgid "Official functions changes" -msgstr "Förändringar i officiella funktioner" +msgid "Deprecated Function" +msgstr "Föråldrad funktion" -msgid "`#2786 `__: pgr_contraction(edges) new signature" -msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" +msgid "pgr_pointToEdgeNode" +msgstr "pgr_pointToEdgeNode" -msgid "C/C++ code enhancements" -msgstr "Förbättringar av C/C++-kod" +msgid "pgRouting 2.4" +msgstr "pgRouting 2.4" -msgid "`#2802 `__: Code reorganization on pgr_contraction" -msgstr "`#2802 `__: Omorganisering av kod för pgr_contraction" +msgid "pgRouting 2.4.2 Release Notes" +msgstr "Versionsinformation för pgRouting 2.4.2" -msgid "Other enhancements:" -msgstr "Andra förbättringar:" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.2 `__" -msgid "`#2869 `__:" -msgstr "`#2869 `__:" +msgid "Improvement" +msgstr "Förbättring" -msgid "SQL code enhancements" -msgstr "Förbättringar av SQL-kod" +msgid "Works for postgreSQL 10" +msgstr "Fungerar för postgreSQL 10" -msgid "`#2850 `__: Rewrite pgr_nodeNetwork" -msgstr "`#2850 `__: Skriv om pgr_nodeNetwork" +msgid "Fixed: Unexpected error column \"cname\"" +msgstr "Fast: Oväntad felkolumn \"cname\"" -msgid "Deprecation of SQL functions" -msgstr "Utfasning av SQL-funktioner" +msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgstr "Ersätt __linux__ med __GLIBC__ för glibc-specifika rubriker och funktioner" -msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" -msgstr "`#2749 `__: Avveckla pgr_AlphaShape i 3.8" +msgid "pgRouting 2.4.1 Release Notes" +msgstr "Versionsinformation för pgRouting 2.4.1" -msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" -msgstr "`#2750 `__: Avveckla pgr_CreateTopology i 3.8" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.1 `__" -msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" -msgstr "`#2753 `__: Avveckla pgr_analyzeGraph i 3.8" +msgid "Fixed compiling error on macOS" +msgstr "Fixat kompileringsfel på macOS" -msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" -msgstr "`#2754 `__: Avveckla pgr_analyzeOneWay i 3.8" +msgid "Condition error on pgr_withPoints" +msgstr "Villkorligt fel på pgr_withPoints" -msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" -msgstr "`#2826 `__: Avveckla pgr_createVerticesTable i 3.8" +msgid "pgRouting 2.4.0 Release Notes" +msgstr "Versionsinformation för pgRouting 2.4.0" -msgid "In the deprecated functions:" -msgstr "I de föråldrade funktionerna:" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.0 `__" -msgid "Migration section is created." -msgstr "Migrationsavsnittet skapas." +msgid "Deprecated signatures." +msgstr "Föråldrade signaturer." -msgid "The use of the functions is removed in the documentation." -msgstr "Användningen av funktionerna har tagits bort i dokumentationen." +msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" +msgstr "pgr_bddijkstra - use pgr_bdDijkstra instead" -msgid "pgRouting 3.7" -msgstr "pgRouting 3.7" +msgid "pgr_pointsToVids" +msgstr "pgr_pointsToVids" -msgid "pgRouting 3.7.3 Release Notes" -msgstr "Versionsinformation för pgRouting 3.7.3" +msgid "Bug fixes on proposed functions" +msgstr "Buggfixar på föreslagna funktioner" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.3 `__" +msgid "pgr_withPointsKSP: fixed ordering" +msgstr "pgr_withPointsKSP: fixed ordering" -msgid "`#2731 `__: Build Failure on Ubuntu 22" -msgstr "`#2731 `__: Byggfel på Ubuntu 22" +msgid "TRSP original code is used with no changes on the compilation warnings" +msgstr "TRSP:s originalkod används utan ändringar i sammanställningsvarningarna" -msgid "pgRouting 3.7.2 Release Notes" -msgstr "Versionsinformation för pgRouting 3.7.2" +msgid "pgRouting 2.3" +msgstr "pgRouting 2.3" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.2 `__" +msgid "pgRouting 2.3.2 Release Notes" +msgstr "Versionsinformation för pgRouting 2.3.2" -msgid "`#2713 `__: cmake missing some policies and min version" -msgstr "`#2713 `__: cmake saknar vissa policyer och min-version" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.2 `__" -msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" -msgstr "Använda gamla policyer: CMP0148, CMP0144, CMP0167" +msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." +msgstr "Fixad pgr_gsoc_vrppdtw-krasch när alla order får plats på en lastbil." -msgid "Minimum cmake version 3.12" -msgstr "Minsta cmake-version 3.12" +msgid "Fixed pgr_trsp:" +msgstr "Fixat pgr_trsp:" -msgid "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" -msgstr "`#2707 `__: Byggfel i pgRouting 3.7.1 på Alpine" +msgid "Alternate code is not executed when the point is in reality a vertex" +msgstr "Alternativ kod utförs inte när punkten i själva verket är en topp" -msgid "`#2706 `__: winnie crashing on pgr_betweennessCentrality" -msgstr "`#2706 `__: winnie kraschar på pgr_betweennessCentrality" +msgid "Fixed ambiguity on seq" +msgstr "Fixad tvetydighet på seq" -msgid "pgRouting 3.7.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.7.1" +msgid "pgRouting 2.3.1 Release Notes" +msgstr "Versionsinformation för pgRouting 2.3.1" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.1 `__" -msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" -msgstr "`#2680 `__: går inte att kompilera under mingw64 gcc 13.2" +msgid "Leaks on proposed max_flow functions" +msgstr "Läckor om föreslagna max_flow-funktioner" -msgid "`#2689 `__: When point is a vertex, the withPoints family do not return results." -msgstr "`#2689 `__: När en punkt är en vertex ger inte withPoints-familjen något resultat." +msgid "Regression error on pgr_trsp" +msgstr "Regressionsfel på pgr_trsp" -msgid "C/C++ code enhancemet" -msgstr "Förbättring av C/C++-kod" +msgid "Types discrepancy on pgr_createVerticesTable" +msgstr "Typer diskrepans på pgr_createVerticesTable" -msgid "TRSP family" -msgstr "TRSP-familjen" +msgid "pgRouting 2.3.0 Release Notes" +msgstr "Versionsinformation för pgRouting 2.3.0" -msgid "pgRouting 3.7.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.7.0" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.0 `__" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.0 `__" +msgid "pgr_eucledianTSP" +msgstr "pgr_eucledianTSP" -msgid "Support" -msgstr "Support" +msgid "pgr_maxFlowPushRelabel(One to One)" +msgstr "pgr_maxFlowPushRelabel(One to One)" -msgid "`#2656 `__: Stop support of PostgreSQL12 on pgrouting v3.7" -msgstr "`#2656 `__: Stoppa stöd för PostgreSQL12 på pgrouting v3.7" +msgid "pgr_maxFlowPushRelabel(One to Many)" +msgstr "pgr_maxFlowPushRelabel(One to Many)" -msgid "Stopping support of PostgreSQL 12" -msgstr "Stoppa stöd för PostgreSQL 12" +msgid "pgr_maxFlowPushRelabel(Many to One)" +msgstr "pgr_maxFlowPushRelabel(Many to One)" -msgid "CI does not test for PostgreSQL 12" -msgstr "CI testar inte för PostgreSQL 12" +msgid "pgr_maxFlowPushRelabel(Many to Many)" +msgstr "pgr_maxFlowPushRelabel(Many to Many)" -msgid "pgr_betweennessCentrality" -msgstr "pgr_betweennessCentrality" +msgid "pgr_maxFlowEdmondsKarp(One to One)" +msgstr "pgr_maxFlowEdmondsKarp(One to One)" -msgid "`#2605 `__: Standardize spanning tree functions output" -msgstr "`#2605 `__: Standardisera utdata för funktioner för spänningsträd" +msgid "pgr_maxFlowEdmondsKarp(One to Many)" +msgstr "pgr_maxFlowEdmondsKarp(One to Many)" -msgid "Functions:" -msgstr "Funktioner:" +msgid "pgr_maxFlowEdmondsKarp(Many to One)" +msgstr "pgr_maxFlowEdmondsKarp(Many to One)" -msgid "Experimental promoted to proposed." -msgstr "Experimentell befordrad till föreslagen." +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" +msgstr "pgr_maxFlowEdmondsKarp(Many to Many)" -msgid "`#2635 `__: pgr_LineGraph ignores directed flag and use negative values for identifiers." -msgstr "`#2635 `__: pgr_LineGraph ignorerar directed flag och använder negativa värden för identifierare." +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" +msgstr "pgr_maxFlowBoykovKolmogorov (One to One)" -msgid "``pgr_lineGraph``" -msgstr "``pgr_lineGraph``" +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" +msgstr "pgr_maxFlowBoykovKolmogorov (One to Many)" -msgid "Code enhancement" -msgstr "Förbättring av kod" +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" +msgstr "pgr_maxFlowBoykovKolmogorov (Many to One)" -msgid "`#2599 `__: Driving distance cleanup" -msgstr "`#2599 `__: Körsträcka uppstädning" +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" +msgstr "pgr_maxFlowBoykovKolmogorov (Many to Many)" -msgid "`#2607 `__: Read postgresql data on C++" -msgstr "`#2607 `__: Läsa postgresql-data på C++" +msgid "pgr_maximumCardinalityMatching" +msgstr "pgr_maximumCardinalityMatching" -msgid "`#2614 `__: Clang tidy does not work" -msgstr "`#2614 `__: Clang tidy fungerar inte" +msgid "pgr_contractGraph" +msgstr "pgr_contractGraph" -msgid "pgRouting 3.6" -msgstr "pgRouting 3.6" +msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" +msgstr "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" -msgid "pgRouting 3.6.3 Release Notes" -msgstr "Versionsinformation för pgRouting 3.6.3" +msgid "pgr_aStar - use pgr_aStar instead" +msgstr "pgr_aStar - use pgr_aStar instead" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.3 `__" +msgid "pgr_flip_edges" +msgstr "pgr_flip_edges" -msgid "Explicit minimum requirements:" -msgstr "Uttryckliga minimikrav:" +msgid "pgr_vidsToDmatrix" +msgstr "pgr_vidsToDmatrix" -msgid "postgres 11.0.0" -msgstr "postgres 11.0.0" +msgid "pgr_pointsToDMatrix" +msgstr "pgr_pointsToDMatrix" -msgid "postgis 3.0.0" -msgstr "postgis 3.0.0" +msgid "pgr_textToPoints" +msgstr "pgr_textToPoints" -msgid "g++ 13+ is supported" -msgstr "g++ 13+ stöds" +msgid "pgRouting 2.2" +msgstr "pgRouting 2.2" -msgid "Code fixes" -msgstr "Kodkorrigeringar" +msgid "pgRouting 2.2.4 Release Notes" +msgstr "Versionsinformation för pgRouting 2.2.4" -msgid "Fix warnings from cpplint." -msgstr "Fixa varningar från cpplint." +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.4 `__" -msgid "Fix warnings from clang 18." -msgstr "Fixa varningar från clang 18." +msgid "Bogus uses of extern \"C\"" +msgstr "Felaktig användning av extern \"C\"" -msgid "CI tests" -msgstr "CI-test" +msgid "Build error on Fedora 24 + GCC 6.0" +msgstr "Byggfel på Fedora 24 + GCC 6.0" -msgid "Add a clang tidy test on changed files." -msgstr "Lägg till ett clang tidy-test på ändrade filer." +msgid "Regression error pgr_nodeNetwork" +msgstr "Regressionsfel pgr_nodeNetwork" -msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" -msgstr "Uppdateringstest inte gjort på versioner: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" +msgid "pgRouting 2.2.3 Release Notes" +msgstr "Versionsinformation för pgRouting 2.2.3" -msgid "Documentation" -msgstr "Dokumentation" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.3 `__" -msgid "Results of documentation queries adujsted to boost 1.83.0 version:" -msgstr "Resultat av dokumentationsförfrågningar adujsted till boost 1.83.0 version:" +msgid "Fixed compatibility issues with PostgreSQL 9.6." +msgstr "Fixade kompatibilitetsproblem med PostgreSQL 9.6." -msgid "pgr_stoerWagner" -msgstr "pgr_stoerWagner" +msgid "pgRouting 2.2.2 Release Notes" +msgstr "Versionsinformation för pgRouting 2.2.2" -msgid "pgtap tests" -msgstr "pgtap-test" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.2 `__" -msgid "bug fixes" -msgstr "buggfixar" +msgid "Fixed regression error on pgr_drivingDistance" +msgstr "Åtgärdat regressionsfel på pgr_drivingDistance" -msgid "pgRouting 3.6.2 Release Notes" -msgstr "Versionsinformation för pgRouting 3.6.2" +msgid "pgRouting 2.2.1 Release Notes" +msgstr "Versionsinformation för pgRouting 2.2.1" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.1 `__" -msgid "Upgrade fix" -msgstr "Fix för uppgradering" +msgid "Server crash fix on pgr_alphaShape" +msgstr "Fix för serverkrasch på pgr_alphaShape" -msgid "The upgrade was failing for same minor" -msgstr "Uppgraderingen misslyckades på grund av samma mindre" +msgid "Bug fix on With Points family of functions" +msgstr "Buggfix för funktionerna i With Points-familjen" -msgid "Fix warnings from cpplint" -msgstr "Fixa varningar från cpplint" +msgid "pgRouting 2.2.0 Release Notes" +msgstr "Versionsinformation för pgRouting 2.2.0" -msgid "Others" -msgstr "Andra" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.0 `__" -msgid "Adjust NEWS generator" -msgstr "Justera NEWS-generatorn" +msgid "Improvements" +msgstr "Förbättringar" -msgid "Name change to `NEWS.md` for better visualization on GitHub" -msgstr "Namnändring till `NEWS.md` för bättre visualisering på GitHub" +msgid "pgr_nodeNetwork" +msgstr "pgr_nodeNetwork" -msgid "pgRouting 3.6.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.6.1" +msgid "Adding a row_where and outall optional parameters" +msgstr "Lägga till en row_where och outall valfria parametrar" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.1 `__" +msgid "Signature fix" +msgstr "Signaturfix" -msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" -msgstr "`#2588 `__: pgrouting 3.6.0 går inte att bygga under OSX" +msgid "pgr_dijkstra -- to match what is documented" +msgstr "pgr_dijkstra -- to match what is documented" -msgid "pgRouting 3.6.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.6.0" +msgid "pgr_Johnson" +msgstr "pgr_Johnson" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.0 `__" +msgid "pgr_dijkstraCost(One to One)" +msgstr "pgr_dijkstraCost(One to One)" -msgid "`#2516 `__: Standardize output pgr_aStar" -msgstr "`#2516 `__: Standardisera utdata pgr_aStar" +msgid "pgr_dijkstraCost(One to Many)" +msgstr "pgr_dijkstraCost(One to Many)" -msgid "Standardize output columns to |short-generic-result|" -msgstr "Standardisera utdatakolumner till |short-generic-result|" +msgid "pgr_dijkstraCost(Many to One)" +msgstr "pgr_dijkstraCost(Many to One)" -msgid "`#2523 `__: Standardize output pgr_bdAstar" -msgstr "`#2523 `__: Standardisera utdata pgr_bdAstar" +msgid "pgr_dijkstraCost(Many to Many)" +msgstr "pgr_dijkstraCost(Many to Many)" -msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" -msgstr "`#2547 `__: Standardisera utdata och modifiera signatur pgr_KSP" +msgid "Proposed Functionality" +msgstr "Föreslagen funktionalitet" -msgid "`#2548 `__: Standardize output pgr_drivingDistance" -msgstr "`#2548 `__: Standardisera utdata pgr_drivingDistance" +msgid "pgr_withPoints(One to One)" +msgstr "pgr_withPoints(One to One)" -msgid "Proposed functions changes" -msgstr "Föreslagna ändringar av funktioner" +msgid "pgr_withPoints(One to Many)" +msgstr "pgr_withPoints(One to Many)" -msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" -msgstr "`#2544 `__: Standardisera utdata och modifiera signaturen pgr_withPointsDD" +msgid "pgr_withPoints(Many to One)" +msgstr "pgr_withPoints(Many to One)" -msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" -msgstr "`#2546 `__: Standardisera utdata och modifiera signaturen pgr_withPointsKSP" +msgid "pgr_withPoints(Many to Many)" +msgstr "pgr_withPoints(Many to Many)" -msgid "`#2504 `__: To C++ pg data get, fetch and check." -msgstr "`#2504 `__: Till C++ pg-data hämta, hämta och kontrollera." +msgid "pgr_withPointsCost(One to One)" +msgstr "pgr_withPointsCost(One to One)" -msgid "Stopping support for compilation with MSVC." -msgstr "Stoppar stöd för kompilering med MSVC." +msgid "pgr_withPointsCost(One to Many)" +msgstr "pgr_withPointsCost(One to Many)" -msgid "`#2505 `__: Using namespace." -msgstr "`#2505 `__: Använder namnrymd." +msgid "pgr_withPointsCost(Many to One)" +msgstr "pgr_withPointsCost(Many to One)" -msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." -msgstr "`#2512 `__: [Dijkstra] Borttagning av duplicerad kod på Dijkstra." +msgid "pgr_withPointsCost(Many to Many)" +msgstr "pgr_withPointsCost(Many to Many)" -msgid "`#2517 `__: Astar code simplification." -msgstr "`#2517 `__: Förenkling av Astar-kod." +msgid "pgr_withPointsDD(single vertex)" +msgstr "pgr_withPointsDD(single vertex)" -msgid "`#2521 `__: Dijkstra code simplification." -msgstr "`#2521 `__: Förenkling av Dijkstra-kod." +msgid "pgr_withPointsDD(multiple vertices)" +msgstr "pgr_withPointsDD(multiple vertices)" -msgid "`#2522 `__: bdAstar code simplification." -msgstr "`#2522 `__: Förenkling av bdAstar-koden." +msgid "pgr_apspWarshall use pgr_floydWarshall instead" +msgstr "pgr_apspWarshall use pgr_floydWarshall instead" -msgid "`#2490 `__: Automatic page history links." -msgstr "`#2490 `__: Automatiska länkar till sidhistorik." +msgid "pgr_apspJohnson use pgr_Johnson instead" +msgstr "pgr_apspJohnson use pgr_Johnson instead" -msgid "..rubric:: Standardize SQL" -msgstr "..rubric:: Standardize SQL" +msgid "pgr_kDijkstraCost use pgr_dijkstraCost instead" +msgstr "pgr_kDijkstraCost use pgr_dijkstraCost instead" -msgid "`#2555 `__: Standardize deprecated messages" -msgstr "`#2555 `__: Standardisera föråldrade meddelanden" +msgid "pgr_kDijkstraPath use pgr_dijkstra instead" +msgstr "pgr_kDijkstraPath use pgr_dijkstra instead" -msgid "On new internal function: do not use named parameters and default parameters." -msgstr "För nya interna funktioner: använd inte namngivna parametrar och standardparametrar." +msgid "Renamed and Deprecated Function" +msgstr "Omdöpta och utfasade funktioner" -msgid "pgRouting 3.5" -msgstr "pgRouting 3.5" +msgid "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix" +msgstr "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix" -msgid "pgRouting 3.5.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.5.1" +msgid "pgRouting 2.1" +msgstr "pgRouting 2.1" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.1 `__" +msgid "pgRouting 2.1.0 Release Notes" +msgstr "Versionsinformation för pgRouting 2.1.0" -msgid "Documentation fixes" -msgstr "Dokumentationsfixar" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.1.0 `__" -msgid "Changes on the documentation to the following:" -msgstr "Ändringar i dokumentationen till följande:" +msgid "Refactored" +msgstr "Refaktoriserad" -msgid "pgr_degree" -msgstr "pgr_degree" +msgid "pgr_dijkstra(One to One)" +msgstr "pgr_dijkstra(One to One)" -msgid "pgr_ksp" -msgstr "pgr_ksp" +msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." +msgstr "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." -msgid "Automatic page history links" -msgstr "Automatiska länkar till sidhistorik" +msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" +msgstr "Föreslagna funktioner från Steve Woodbridge, (Klassificeras som bekvämlighet av författaren.)" -msgid "using bootstrap_version 2 because 3+ does not do dropdowns" -msgstr "använder bootstrap_version 2 eftersom 3+ inte gör dropdowns" +msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." +msgstr "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." -msgid "Issue fixes" -msgstr "Problemkorrigeringar" +msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." +msgstr "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." -msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" -msgstr "`#2565 `__: pgr_lengauerTarjanDominatorTree utlöser ett påstående" +msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." +msgstr "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." -msgid "SQL enhancements" -msgstr "Förbättringar av SQL" +msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgstr "pgr_pointsToVids - convert an array of point geometries into vertex ids." -msgid "`#2561 `__: Not use wildcards on SQL" -msgstr "`#2561 `__: Använd inte jokertecken i SQL" +msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." +msgstr "pgr_pointsToDMatrix - Create a distance matrix from an array of points." -msgid "`#2559 `__: pgtap test using sampledata" -msgstr "`#2559 `__: pgtap-test med sampledata" +msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgstr "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." -msgid "Build fixes" -msgstr "Byggfixar" +msgid "Added proposed functions from GSoc Projects:" +msgstr "Lagt till föreslagna funktioner från GSoc Projects:" -msgid "Fix winnie build" -msgstr "Fixa winnie build" +msgid "pgr_vrppdtw" +msgstr "pgr_vrppdtw" -msgid "Fix clang warnings" -msgstr "Fixa clang-varningar" +msgid "pgr_vrponedepot" +msgstr "pgr_vrponedepot" -msgid "Grouping headers of postgres readers" -msgstr "Gruppering av rubriker för postgres-läsare" +msgid "pgr_getColumnName" +msgstr "pgr_getColumnName" -msgid "pgRouting 3.5.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.5.0" +msgid "pgr_getTableName" +msgstr "pgr_getTableName" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.0 `__" +msgid "pgr_isColumnCndexed" +msgstr "pgr_isColumnCndexed" -msgid "Dijkstra" -msgstr "Dijkstra" +msgid "pgr_isColumnInTable" +msgstr "pgr_isColumnInTable" -msgid "pgRouting 3.4" -msgstr "pgRouting 3.4" +msgid "pgr_quote_ident" +msgstr "pgr_quote_ident" -msgid "pgRouting 3.4.2 Release Notes" -msgstr "Versionsinformation för pgRouting 3.4.2" +msgid "pgr_versionless" +msgstr "pgr_versionless" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.2 `__" +msgid "pgr_startPoint" +msgstr "pgr_startPoint" -msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." -msgstr "`#2394 `__: pgr_bdAstar ackumulerar heuristisk kostnad i besökt nodkostnad." +msgid "pgr_endPoint" +msgstr "pgr_endPoint" -msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." -msgstr "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variabeln ska vara av typen Record." +msgid "pgr_pointToId" +msgstr "pgr_pointToId" -msgid "pgRouting 3.4.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.4.1" +msgid "No longer supported" +msgstr "Stöds inte längre" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.1 `__" +msgid "Removed the 1.x legacy functions" +msgstr "Borttagning av äldre funktioner från 1.x" -msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" -msgstr "`#2401 `__: pgRouting 3.4.0 bygger inte dokument när sphinx är för låg eller saknas" +msgid "Some bug fixes in other functions" +msgstr "Några buggfixar i andra funktioner" -msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" -msgstr "`#2398 `__: v3.4.0 uppgraderar inte från 3.3.3" +msgid "Refactoring Internal Code" +msgstr "Refaktorisering av intern kod" -msgid "pgRouting 3.4.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.4.0" +msgid "A C and C++ library for developer was created" +msgstr "Ett C- och C++-bibliotek för utvecklare skapades" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.0 `__" +msgid "encapsulates postgreSQL related functions" +msgstr "kapslar in postgreSQL-relaterade funktioner" -msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" -msgstr "`#1891 `__: pgr_ksp ger inte alla korrekta kortaste vägar" +msgid "encapsulates Boost.Graph graphs" +msgstr "kapslar in Boost.Graph-grafer" -msgid "New proposed functions." -msgstr "Nya föreslagna funktioner." +msgid "Directed Boost.Graph" +msgstr "Riktad Boost.graf" -msgid "With points" -msgstr "Med punkt" +msgid "Undirected Boost.graph." +msgstr "Oriktad Boost.graf." -msgid "pgr_withPointsVia(One Via)" -msgstr "pgr_withPointsVia(One Via)" +msgid "allow any-integer in the id's" +msgstr "tillåta valfritt heltal i id:et" -msgid "Turn Restrictions" -msgstr "Begränsningar för sväng" +msgid "allow any-numerical on the cost/reverse_cost columns" +msgstr "tillåta valfri numerisk i kostnads-/omvända_kostnadskolumnerna" -msgid "Via with turn restrictions" -msgstr "Via med svängrestriktioner" +msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" +msgstr "Istället för att generera många bibliotek: - Alla funktioner är inkapslade i ett bibliotek - Biblioteket har prefixet 2-1-0" -msgid "pgr_trspVia(One Via)" -msgstr "pgr_trspVia(One Via)" +msgid "pgRouting 2.0" +msgstr "pgRouting 2.0" -msgid "pgr_trspVia_withPoints(One Via)" -msgstr "pgr_trspVia_withPoints(One Via)" +msgid "pgRouting 2.0.1 Release Notes" +msgstr "Versionsinformation för pgRouting 2.0.1" -msgid "pgr_trsp_withPoints(One to One)" -msgstr "pgr_trsp_withPoints(One to One)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.1 `__" -msgid "pgr_trsp_withPoints(One to Many)" -msgstr "pgr_trsp_withPoints(One to Many)" +msgid "Minor bug fixes." +msgstr "Mindre buggfixar." -msgid "pgr_trsp_withPoints(Many to One)" -msgstr "pgr_trsp_withPoints(Many to One)" +msgid "No track of the bug fixes were kept." +msgstr "Inga uppgifter om buggfixarna sparades." -msgid "pgr_trsp_withPoints(Many to Many)" -msgstr "pgr_trsp_withPoints(Many to Many)" +msgid "pgRouting 2.0.0 Release Notes" +msgstr "Versionsinformation för pgRouting 2.0.0" -msgid "pgr_trsp_withPoints(Combinations)" -msgstr "pgr_trsp_withPoints(Combinations)" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.0 `__" -msgid "Topology" -msgstr "Topologi" +msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" +msgstr "Med lanseringen av pgRouting 2.0.0 har biblioteket övergett bakåtkompatibilitet till `pgRouting 1.0`_-utgåvor. Huvudmålen för denna utgåva är:" -msgid "pgr_findCloseEdges(One point)" -msgstr "pgr_findCloseEdges(One point)" +msgid "Major restructuring of pgRouting." +msgstr "Stor omstrukturering av pgRouting." -msgid "pgr_findCloseEdges(Many points)" -msgstr "pgr_findCloseEdges(Many points)" +msgid "Standardization of the function naming" +msgstr "Standardisering av namngivning av funktioner" -msgid "pgr_cuthillMckeeOrdering" -msgstr "pgr_cuthillMckeeOrdering" +msgid "Preparation of the project for future development." +msgstr "Förberedelse av projektet för framtida utveckling." -msgid "Unclassified" -msgstr "Oklassificerade" +msgid "As a result of this effort:" +msgstr "Som ett resultat av denna insats:" -msgid "pgr_hawickCircuits" -msgstr "pgr_hawickCircuits" +msgid "pgRouting has a simplified structure" +msgstr "pgRouting har en förenklad struktur" -msgid "Flow functions" -msgstr "Flödesfunktioner" +msgid "Significant new functionality has being added" +msgstr "Betydande ny funktionalitet har lagts till" -msgid "pgr_maxCardinalityMatch(text)" -msgstr "pgr_maxCardinalityMatch(text)" +msgid "Documentation has being integrated" +msgstr "Dokumentation har integrerats" -msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" -msgstr "Föråldrad: pgr_maxCardinalityMatch(text,boolean)" +msgid "Testing has being integrated" +msgstr "Testning har integrerats" -msgid "Deprecated Functions" -msgstr "Föråldrade funktioner" +msgid "And made it easier for multiple developers to make contributions." +msgstr "Och gjort det enklare för flera utvecklare att bidra." -msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" +msgid "Important Changes" +msgstr "Viktiga förändringar" -msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" -msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" +msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" +msgstr "Graph Analytics - verktyg för att upptäcka och åtgärda vissa problem med kopplingar i en graf" -msgid "pgRouting 3.3" -msgstr "pgRouting 3.3" +msgid "A collection of useful utility functions" +msgstr "En samling användbara nyttofunktioner" -msgid "pgRouting 3.3.5 Release Notes" -msgstr "Versionsinformation för pgRouting 3.3.5" +msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" +msgstr "Två nya algoritmer för korta vägar för alla par (pgr_apspJohnson, pgr_apspWarshall)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.5 `__" +msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" +msgstr "Dubbelriktade Dijkstra- och A-star-sökalgoritmer (pgr_bdAstar, pgr_bdDijkstra)" -msgid "pgRouting 3.3.4 Release Notes" -msgstr "Versionsinformation för pgRouting 3.3.4" +msgid "One to many nodes search (pgr_kDijkstra)" +msgstr "Sökning från en till många noder (pgr_kDijkstra)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.4 `__" +msgid "K alternate paths shortest path (pgr_ksp)" +msgstr "K alternativa vägar kortaste vägen (pgr_ksp)" -msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" -msgstr "`#2400 `__: pgRouting 3.3.3 kan inte byggas i fokal" +msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" +msgstr "Ny TSP-lösare som förenklar koden och byggprocessen (pgr_tsp), har tagit bort beroendet av \"Gaul Library\"" -msgid "pgRouting 3.3.3 Release Notes" -msgstr "Versionsinformation för pgRouting 3.3.3" +msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" +msgstr "Turn Begränsad kortaste väg (pgr_trsp) som ersätter Shooting Star" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.3 `__" +msgid "Dropped support for Shooting Star" +msgstr "Slopat stöd för Shooting Star" -msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." -msgstr "Ignorerar den valfria booleska parametern, eftersom algoritmen endast fungerar för oriktade grafer." +msgid "Built a test infrastructure that is run before major code changes are checked in" +msgstr "Byggt upp en testinfrastruktur som körs innan större kodändringar checkas in" -msgid "pgRouting 3.3.2 Release Notes" -msgstr "Versionsinformation för pgRouting 3.3.2" +msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." +msgstr "Testat och åtgärdat de flesta av de utestående buggarna som rapporterats mot 1.x och som finns i 2.0-dev-kodbasen." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.2 `__" +msgid "Improved build process for Windows" +msgstr "Förbättrad byggprocess för Windows" -msgid "Revised documentation" -msgstr "Reviderad dokumentation" +msgid "Automated testing on Linux and Windows platforms trigger by every commit" +msgstr "Automatiserad testning på Linux- och Windows-plattformar som utlöses av varje åtagande" -msgid "Simplifying table names and table columns, for example:" -msgstr "Förenkling av t.ex. tabellnamn och tabellkolumner:" +msgid "Modular library design" +msgstr "Modulär biblioteksdesign" -msgid "``edges`` instead of ``edge_table``" -msgstr "``edges`` i stället för ``edge_table``" +msgid "Compatibility with PostgreSQL 9.1 or newer" +msgstr "Kompatibilitet med PostgreSQL 9.1 eller nyare" -msgid "Removing unused columns ``category_id`` and ``reverse_category_id``." -msgstr "Ta bort oanvända kolumner ``category_id`` och ``reverse_category_id``." +msgid "Compatibility with PostGIS 2.0 or newer" +msgstr "Kompatibilitet med PostGIS 2.0 eller nyare" -msgid "``combinations`` instead of ``combinations_table``" -msgstr "``combinations`` i stället för ``combinations_table``" +msgid "Installs as PostgreSQL EXTENSION" +msgstr "Installeras som PostgreSQL EXTENSION" -msgid "Using PostGIS standard for geometry column." -msgstr "Använda PostGIS-standard för geometrikolumn." +msgid "Return types re factored and unified" +msgstr "Returtyperna är faktorerade och enhetliga" -msgid "``geom`` instead of ``the_geom``" -msgstr "``geom`` i stället för ``the_geom``" +msgid "Support for table SCHEMA in function parameters" +msgstr "Stöd för tabellen SCHEMA i funktionsparametrar" -msgid "Avoiding usage of functions that modify indexes, columns etc on tables." -msgstr "Undvika användning av funktioner som modifierar index, kolumner etc. i tabeller." +msgid "Support for ``st_`` PostGIS function prefix" +msgstr "Stöd för PostGIS-funktionsprefixet ``st_``" -msgid "Using ``pgr_extractVertices`` to create a routing topology" -msgstr "Använda ``pgr_extractVertices`` för att skapa en routningstopologi" +msgid "Added ``pgr_`` prefix to functions and types" +msgstr "Lagt till prefixet ``pgr_`` för funktioner och typer" -msgid "Restructure of the pgRouting concepts page." -msgstr "Omstrukturering av sidan med pgRouting-koncept." +msgid "Better documentation: https://docs.pgrouting.org" +msgstr "Bättre dokumentation: https://docs.pgrouting.org" -msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" -msgstr "`#2276 `__: edgeDisjointPaths-problem med start_vid och kombinationer" +msgid "shooting_star is discontinued" +msgstr "shooting_star är avvecklad" -msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" -msgstr "`#2312 `__: pgr_extractVertices fel när målet inte är BIGINT" +msgid "pgRouting 1" +msgstr "pgRouting 1" -msgid "`#2357 `__: Apply clang-tidy performance-*" -msgstr "`#2357 `__: Tillämpa clang-tidy prestanda-*" +msgid "pgRouting 1.0" +msgstr "pgRouting 1.0" -msgid "pgRouting 3.3.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.3.1" +msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." +msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 1.x `_ på Github. Följande release notes har kopierats från den tidigare filen ``RELEASE_NOTES`` och behålls som en referens." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.1 `__" +msgid "Changes for release 1.05" +msgstr "Ändringar för version 1.05" -msgid "`#2216 `__: Warnings when using clang" -msgstr "`#2216 `__: Varningar vid användning av clang" +msgid "Changes for release 1.03" +msgstr "Ändringar för version 1.03" -msgid "`#2266 `__: Error processing restrictions" -msgstr "`#2266 `__: Fel vid bearbetning av restriktioner" +msgid "Much faster topology creation" +msgstr "Mycket snabbare skapande av topologi" -msgid "pgRouting 3.3.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.3.0" +msgid "Changes for release 1.02" +msgstr "Ändringar för version 1.02" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.0 `__" +msgid "Shooting* bug fixes" +msgstr "Fotografering* buggfixar" -msgid "`#2057 `__: trspViaEdges columns in different order" -msgstr "`#2057 `__: trspViaEdges-kolumner i olika ordning" +msgid "Compilation problems solved" +msgstr "Kompileringsproblem lösta" -msgid "`#2087 `__: pgr_extractVertices to proposed" -msgstr "`#2087 `__: pgr_extractVertices till förslag" +msgid "Changes for release 1.01" +msgstr "Ändringar för version 1.01" -msgid "`#2201 `__: pgr_depthFirstSearch to proposed" -msgstr "`#2201 `__: pgr_depthFirstSearch till proposed" +msgid "Changes for release 1.0" +msgstr "Ändringar för version 1.0" -msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" -msgstr "`#2202 `__: pgr_sequentialVertexColoring till föreslagen" +msgid "Core and extra functions are separated" +msgstr "Kärn- och extrafunktioner separeras" -msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" -msgstr "`#2203 `__: pgr_dijkstraNear och pgr_dijkstraNearCost till föreslagna" +msgid "Cmake build process" +msgstr "Byggprocess med Cmake" -msgid "Coloring" -msgstr "Färgläggning" +msgid "Changes for release 1.0.0b" +msgstr "Ändringar för version 1.0.0b" -msgid "Experimental promoted to Proposed" -msgstr "Experimentell befordrad till Föreslagen" +msgid "Additional SQL file with more simple names for wrapper functions" +msgstr "Ytterligare SQL-fil med enklare namn för wrapper-funktioner" -msgid "pgr_dijkstraNear(Combinations)" -msgstr "pgr_dijkstraNear(Combinations)" +msgid "Changes for release 1.0.0a" +msgstr "Ändringar för version 1.0.0a" -msgid "pgr_dijkstraNear(Many to Many)" -msgstr "pgr_dijkstraNear(Many to Many)" +msgid "Shooting* shortest path algorithm for real road networks" +msgstr "Algoritm för kortaste väg för verkliga vägnät" -msgid "pgr_dijkstraNear(Many to One)" -msgstr "pgr_dijkstraNear(Many to One)" +msgid "Several SQL bugs were fixed" +msgstr "Flera SQL-buggar har åtgärdats" -msgid "pgr_dijkstraNear(One to Many)" -msgstr "pgr_dijkstraNear(One to Many)" +msgid "Changes for release 0.9.9" +msgstr "Ändringar för version 0.9.9" -msgid "pgr_dijkstraNearCost(Combinations)" -msgstr "pgr_dijkstraNearCost(Combinations)" +msgid "PostgreSQL 8.2 support" +msgstr "Stöd för PostgreSQL 8.2" -msgid "pgr_dijkstraNearCost(Many to Many)" -msgstr "pgr_dijkstraNearCost(Many to Many)" +msgid "Shortest path functions return empty result if they could not find any path" +msgstr "Kortaste vägen-funktioner returnerar ett tomt resultat om de inte kunde hitta någon väg" -msgid "pgr_dijkstraNearCost(Many to One)" -msgstr "pgr_dijkstraNearCost(Many to One)" +msgid "Changes for release 0.9.8" +msgstr "Ändringar för version 0.9.8" -msgid "pgr_dijkstraNearCost(One to Many)" -msgstr "pgr_dijkstraNearCost(One to Many)" +msgid "Renumbering scheme was added to shortest path functions" +msgstr "Omnumreringssystem lades till för funktioner för kortaste vägen" -msgid "pgr_extractVertices" -msgstr "pgr_extractVertices" +msgid "Directed shortest path functions were added" +msgstr "Directed shortest path-funktioner lades till" -msgid "Traversal" -msgstr "Traversal" +msgid "routing_postgis.sql was modified to use dijkstra in TSP search" +msgstr "routing_postgis.sql modifierades för att använda dijkstra i TSP-sökning" -msgid "pgr_depthFirstSearch(Multiple vertices)" -msgstr "pgr_depthFirstSearch(Multiple vertices)" +msgid "Function Families" +msgstr "Funktionsfamiljer" -msgid "pgr_depthFirstSearch(Single vertex)" -msgstr "pgr_depthFirstSearch(Single vertex)" +msgid "Sample Data" +msgstr "Exempeldata" -msgid "pgRouting 3.2" -msgstr "pgRouting 3.2" +msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." +msgstr "Dokumentationen innehåller mycket enkla exempel på frågor som baseras på ett litet exempelnätverk som liknar en stad. Följ instruktionerna nedan för att kunna utföra de flesta av exempelfrågorna." -msgid "pgRouting 3.2.2 Release Notes" -msgstr "Versionsinformation för pgRouting 3.2.2" +msgid "Main graph" +msgstr "Huvudgraf" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.2 `__" +msgid "A graph consists of a set of edges and a set of vertices." +msgstr "En graf består av en uppsättning kanter och en uppsättning hörn." -msgid "`#2093 `__: Compilation on Visual Studio" -msgstr "`#2093 `__: Kompilering i Visual Studio" +msgid "The following city is to be inserted into the database:" +msgstr "Följande stad ska läggas in i databasen:" -msgid "`#2189 `__: Build error on RHEL 7" -msgstr "`#2189 `__: Byggfel på RHEL 7" +msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." +msgstr "Information som är känd vid denna tidpunkt är geometrin för kanterna, kostnadsvärden, kapacitetsvärden, kategorivärden och vissa platser som inte finns i grafen." -msgid "pgRouting 3.2.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.2.1" +msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." +msgstr "Processen för att få en fungerande topologi börjar med att lägga in kanterna. Efter det beräknas allt annat." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.1 `__" +msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." +msgstr "Databasdesignen för dokumentationen av pgRouting, håller i samma rad 2 segment, ett i geometrins riktning och det andra i motsatt riktning. Därför har viss information prefixet ``reverse_`` som motsvarar segmentet i geometrins motsatta riktning." -msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" -msgstr "`#1883 `__: pgr_TSPEuclidean kraschar anslutningen i Windows" +msgid "Identifier of the starting vertex of the geometry ``geom``." +msgstr "Identifierare av startpunkten för geometrin ``geom``." -msgid "The solution is to use Boost::graph::metric_tsp_approx" -msgstr "Lösningen är att använda Boost::graph::metric_tsp_approx" +msgid "Identifier of the ending vertex of the geometry ``geom``" +msgstr "Identifierare för geometrins slutpunkt ``geom``" -msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" -msgstr "För att inte bryta användarens kod ignoreras de valfria parametrarna som är relaterade till TSP Annaeling" +msgid "Cost to traverse from `source` to ``target``." +msgstr "Kostnad för att gå från `källa` till `mål`." -msgid "The function with the annaeling optional parameters is deprecated" -msgstr "Funktionen med de valfria parametrarna annaeling är föråldrad" +msgid "Cost to traverse from `target` to ``source``." +msgstr "Kostnad för att gå från `mål` till `källa`." -msgid "pgRouting 3.2.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.2.0" +msgid "Flow capacity from `source` to ``target``." +msgstr "Flödeskapacitet från `källa` till `mål`." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.0 `__" +msgid "Flow capacity from `target` to ``source``." +msgstr "Flödeskapacitet från `mål` till `källa`." -msgid "`#1850 `__: Change Boost min version to 1.56" -msgstr "`#1850 `__: Ändra Boost min-version till 1.56" +msgid "``category``" +msgstr "``category``" -msgid "Removing support for Boost v1.53, v1.54 & v1.55" -msgstr "Borttagande av stöd för Boost v1.53, v1.54 & v1.55" +msgid "``reverse_category``" +msgstr "``reverse_category``" -msgid "Dijkstra Near" -msgstr "Dijkstra Nära" +msgid ":math:`x` coordinate of the starting vertex of the geometry." +msgstr ":math:`x` coordinate of the starting vertex of the geometry." -msgid "pgr_isPlanar" -msgstr "pgr_isPlanar" +msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``." +msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_X(ST_StartPoint(geom))``." -msgid "pgr_lengauerTarjanDominatorTree" -msgstr "pgr_lengauerTarjanDominatorTree" +msgid ":math:`y` coordinate of the ending vertex of the geometry." +msgstr ":math:`y` coordinate of the ending vertex of the geometry." -msgid "pgr_makeConnected" -msgstr "pgr_makeConnected" +msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." +msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_Y(ST_EndPoint(geom))``." -msgid "Astar" -msgstr "Astar" +msgid "The geometry of the segments." +msgstr "Segmentens geometri." -msgid "Bidirectional Astar" -msgstr "Dubbelriktad Astar" +msgid "Starting on PostgreSQL 12::" +msgstr "Börjar på PostgreSQL 12::" -msgid "Bidirectional Dijkstra" -msgstr "Dubbelriktad Dijkstra" +msgid "Optionally indexes on different columns can be created. The recommendation is to have" +msgstr "Eventuellt kan index på olika kolumner skapas. Rekommendationen är att ha" -msgid "pgRouting 3.1" -msgstr "pgRouting 3.1" +msgid "``id`` indexed." +msgstr "``id`` indexerad." -msgid "pgRouting 3.1.4 Release Notes" -msgstr "Versionsinformation för pgRouting 3.1.4" +msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgstr "kolumnerna ``källa`` och ``mål`` indexerade för att snabba upp pgRouting-frågor." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.4 `__" +msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." +msgstr "``geom`` indexerad för att påskynda geometriska processer som kan behövas i frontend." -msgid "Issues fixes" -msgstr "Problemlösningar" +msgid "For this small example the indexes are skipped, except for ``id``" +msgstr "I det här lilla exemplet hoppas indexen över, utom för ``id``" -msgid "pgRouting 3.1.3 Release Notes" -msgstr "Versionsinformation för pgRouting 3.1.3" +msgid "Edges data" +msgstr "Data om kanter" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.3 `__" +msgid "Inserting into the database the information of the edges:" +msgstr "Lägga in informationen om kanterna i databasen:" -msgid "`#1825 `__: Boost versions are not honored" -msgstr "`#1825 `__: Boost-versioner respekteras inte" +msgid "Negative values on the cost, capacity and category means that the edge do not exist." +msgstr "Negativa värden på kostnad, kapacitet och kategori innebär att kanten inte existerar." -msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" -msgstr "`#1849 `__: Boost 1.75.0 geometri \"point_xy.hpp\" byggfel i macOS-miljö" +msgid "Vertices" +msgstr "Hörn" -msgid "`#1861 `__: vrp functions crash server" -msgstr "`#1861 `__: vrp-funktioner kraschar server" +msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" +msgstr "Vertexinformationen beräknas utifrån kantidentifieraren och geometrin och sparas i en tabell. Sparar all information som tillhandahålls av :doc:`pgr_extractVertices`:" -msgid "pgRouting 3.1.2 Release Notes" -msgstr "Versionsinformation för pgRouting 3.1.2" +msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." +msgstr "I det här fallet, eftersom ``CREATE``-satsen inte användes, behövs definitionen av ett index på tabellen." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.2 `__" +msgid "The structure of the table is:" +msgstr "Tabellens struktur är:" -msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" -msgstr "`#1304 `__: FreeBSD 12 64-bit kraschar på pgr_vrOneDepot-tester Experimentell funktion" +msgid "Vertices data" +msgstr "Data om vertikaler" -msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" -msgstr "`#1356 `__: tools/testers/pg_prove_tests.sh misslyckas när PostgreSQL-porten inte är godkänd" +msgid "The saved information of the vertices is:" +msgstr "Den sparade informationen om topparna är:" -msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" -msgstr "`#1725 `__: Serverkrasch på pgr_pickDeliver och pgr_vrpOneDepot på openbsd" +msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." +msgstr "Här kan du lägga till fler kolumner i tabellen vertices. Namn och typer på ytterligare kolumner beror på tillämpningen." -msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" -msgstr "`#1760 `__: TSP-serverkrasch på ubuntu 20.04 #1760" +msgid "The topology" +msgstr "Topologin" -msgid "`#1770 `__: Remove warnings when using clang compiler" -msgstr "`#1770 `__: Ta bort varningar vid användning av clang-kompilatorn" +msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." +msgstr "Denna fråga baseras på toppdata och skapar en topologi genom att fylla i kolumnerna \"källa\" och \"mål\" i tabellen \"kanter\"." -msgid "pgRouting 3.1.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.1.1" +msgid "Topology data" +msgstr "Topologidata" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.1 `__" +msgid "Points outside the graph" +msgstr "Punkter utanför grafen" -msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" -msgstr "`#1733 `__: pgr_bdAstar misslyckas när käll- eller målvertexen inte finns i grafen" +msgid "Support tables" +msgstr "Stödbord" -msgid "`#1647 `__: Linear Contraction contracts self loops" -msgstr "`#1647 `__: Linjär sammandragning kontrakterar självloopar" +msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." +msgstr "Många funktioner kan användas med kombinationer av paren ``(källa, mål)`` när man vill ha en rutt från ``källa`` till ``mål``." -msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" -msgstr "`#1640 `__: pgr_withPoints misslyckas när points_sql är tom" +msgid "For convenience of this documentation, some combinations will be stored on a table:" +msgstr "För att underlätta denna dokumentation kommer vissa kombinationer att lagras på en tabell:" -msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" -msgstr "`#1616 `__: Banutvärdering på C++ uppdateras inte innan resultaten går tillbaka till C" +msgid "Inserting the data:" +msgstr "Infoga data:" -msgid "`#1300 `__: pgr_chinesePostman crash on test data" -msgstr "`#1300 `__: pgr_chinesePostman kraschar på testdata" +msgid "Combinations data" +msgstr "Kombinationer data" -msgid "pgRouting 3.1.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.1.0" +msgid "Some functions accept soft restrictions about the segments." +msgstr "Vissa funktioner accepterar mjuka begränsningar för segmenten." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.0 `__" +msgid "Images" +msgstr "Bilder" -msgid "pgr_dijkstra(combinations)" -msgstr "pgr_dijkstra(combinations)" +msgid "Red arrows correspond when ``cost`` > 0 in the edge table." +msgstr "Röda pilar motsvarar när ``cost`` > 0 i kanttabellen." -msgid "pgr_dijkstraCost(combinations)" -msgstr "pgr_dijkstraCost(combinations)" +msgid "Blue arrows correspond when ``reverse_cost`` > 0 in the edge table." +msgstr "Blå pilar motsvarar när ``reverse_cost`` > 0 i edge-tabellen." -msgid "Build changes" -msgstr "Förändringar i byggnaden" +msgid "Points are outside the graph." +msgstr "Punkterna ligger utanför grafen." -msgid "Minimal requirement for Sphinx: version 1.8" -msgstr "Minimikrav för Sphinx: version 1.8" +msgid "Click on the graph to enlarge." +msgstr "Klicka på grafen för att förstora den." -msgid "pgRouting 3.0" -msgstr "pgRouting 3.0" +msgid "Directed graph with ``cost`` and ``reverse_cost``" +msgstr "Riktad graf med ``kostnad`` och ``omvänd_kostnad``" -msgid "pgRouting 3.0.6 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.6" +msgid "When working with city networks, this is recommended for point of view of vehicles." +msgstr "När du arbetar med stadsnät rekommenderas detta för fordonens synvinkel." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.6 `__" +msgid "Directed, with cost and reverse_cost" +msgstr "Riktad, med kostnad och omvänd_kostnad" -msgid "pgRouting 3.0.5 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.5" +msgid "Undirected graph with ``cost`` and ``reverse_cost``" +msgstr "Oriktad graf med ``kostnad`` och ``omvända_kostnader``" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.5 `__" +msgid "When working with city networks, this is recommended for point of view of pedestrians." +msgstr "När du arbetar med stadsnät rekommenderas detta för fotgängarnas synvinkel." -msgid "Backport issue fixes" -msgstr "Fixar problem med backport" +msgid "Undirected, with cost and reverse cost" +msgstr "Ostyrd, med kostnad och omvänd kostnad" -msgid "pgRouting 3.0.4 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.4" +msgid "Directed graph with ``cost``" +msgstr "Riktad graf med ``kostnad``" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.4 `__" +msgid "Directed, with cost" +msgstr "Riktad, med kostnad" -msgid "pgRouting 3.0.3 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.3" +msgid "Undirected graph with ``cost``" +msgstr "Oriktad graf med ``kostnad``" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.3 `__" +msgid "Undirected, with cost" +msgstr "Ostyrd, med kostnad" -msgid "pgRouting 3.0.2 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.2" +msgid "Pick & Deliver Data" +msgstr "Hämta och leverera data" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.2 `__" +msgid "Spanning Tree - Category" +msgstr "Spanning Tree - Kategori" -msgid "`#1378 `__: Visual Studio build failing" -msgstr "`#1378 `__: Visual Studio-byggnad misslyckas" +msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." +msgstr "Ett spännträd för en odelad graf är ett träd som innehåller alla hörn i G med minsta möjliga antal kanter." -msgid "pgRouting 3.0.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.1" +msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." +msgstr "För en frånkopplad graf finns det inte ett enda träd, utan en spänningsskog, som består av ett spänningsträd för varje ansluten komponent." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.1 `__" +msgid "Characteristics:" +msgstr "Kännetecken:" -msgid "`#232 `__: Honor client cancel requests in C /C++ code" -msgstr "`#232 `__: Uppfylla begäran om avbrytande av klient i C/C++-kod" +msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." +msgstr "pgRouting community support är tillgängligt via `pgRouting webbplats `_, `dokumentation `_, handledning, e-postlistor och andra. Om du letar efter :ref:`kommersiellt stöd `, hittar du nedan en lista över företag som tillhandahåller pgRouting-utveckling och konsulttjänster." -msgid "pgRouting 3.0.0 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.0" +msgid "Reporting Problems" +msgstr "Rapportering av problem" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.0 `__" +msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" +msgstr "Buggar rapporteras och hanteras i en `issue tracker `_. Vänligen följ dessa steg:" -msgid "Fixed Issues" -msgstr "Korrigerade problem" +msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." +msgstr "Sök bland ärendena för att se om ditt problem redan har rapporterats. Om så är fallet kan du lägga till extra sammanhang som du kan ha hittat, eller åtminstone ange att du också har problemet. Detta hjälper oss att prioritera vanliga problem." -msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" -msgstr "`#1153 `__: Bytte namn på pgr_eucledianTSP till pgr_TSPeuclidean" +msgid "If your problem is unreported, create a `new issue `__ for it." +msgstr "Om ditt problem inte har rapporterats, skapa en ny fråga `__ för det." -msgid "`#1188 `__: Removed CGAL dependency" -msgstr "`#1188 `__: Borttaget CGAL-beroende" +msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." +msgstr "I din rapport inkluderar du uttryckliga instruktioner för att replikera ditt problem. De bästa ärendena innehåller den exakta SQL som krävs för att replikera ett problem." -msgid "`#1002 `__: Fixed contraction issues:" -msgstr "`#1002 `__: Fixade problem med sammandragning:" +msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." +msgstr "Om du kan testa äldre versioner av PostGIS för ditt problem, vänligen gör det. Notera den tidigaste versionen som problemet uppträder i ditt ärende." -msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" -msgstr "`#1004 `__: Kontrakt när förbjudna toppar inte tillhör grafen" +msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." +msgstr "För de versioner där du kan replikera problemet, notera operativsystemet och versionen av pgRouting, PostGIS och PostgreSQL." -msgid "`#1005 `__: Intermideate results eliminated" -msgstr "`#1005 `__: Medelmåttiga resultat eliminerade" +msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." +msgstr "Vi rekommenderar att du använder följande wrapper på problemet för att hitta det steg som orsakar problemet." -msgid "`#1006 `__: No loss of information" -msgstr "`#1006 `__: Ingen förlust av information" +msgid "Mailing List, Matrix, GIS StackExchange" +msgstr "Mailinglista, matris, GIS StackExchange" -msgid "New Functions" -msgstr "Nya funktioner" +msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" +msgstr "Det finns två e-postlistor för pgRouting som är värd på OSGeo diskurserver:" -msgid "Kruskal family" -msgstr "Familjen Kruskal" +msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +msgstr "E-postlista för användare: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" -msgid "pgr_kruskal" -msgstr "pgr_kruskal" +msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" +msgstr "E-postlista för utvecklare: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" -msgid "pgr_kruskalBFS" -msgstr "pgr_kruskalBFS" +msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" +msgstr "Prenumerera: https://discourse.osgeo.org/g/pgrouting-dev" -msgid "pgr_kruskalDD" -msgstr "pgr_kruskalDD" +msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." +msgstr "För allmänna frågor och ämnen om hur du använder pgRouting, vänligen skriv till e-postlistan för användare." -msgid "pgr_kruskalDFS" -msgstr "pgr_kruskalDFS" +msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." +msgstr "Om du vill chatta med andra pgRouting-användare och bidragsgivare kan du gå med i vår matriskanal: `pgRouting matriskanal `_." -msgid "Prim family" -msgstr "Familjen Prim" +msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." +msgstr "Du kan också ställa frågan på `GIS StackExchange `_ och märka frågan med ``pgrouting``. Hitta alla frågor taggade med ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting eller prenumerera på `pgRouting questions feed `_." -msgid "pgr_prim" -msgstr "pgr_prim" +msgid "Commercial Support" +msgstr "Kommersiellt stöd" -msgid "pgr_primDD" -msgstr "pgr_primDD" +msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" +msgstr "För användare som behöver professionell support, utveckling och konsulttjänster kan du överväga att kontakta någon av följande organisationer, som har bidragit väsentligt till utvecklingen av pgRouting:" -msgid "pgr_primDFS" -msgstr "pgr_primDFS" +msgid "**Company**" +msgstr "**Company**" -msgid "pgr_primBFS" -msgstr "pgr_primBFS" +msgid "**Offices in**" +msgstr "**Kontor i**" -msgid "Proposed moved to official on pgRouting" -msgstr "Föreslagen flyttad till officiell på pgRouting" +msgid "**Website**" +msgstr "**Webbplats**" -msgid "aStar Family" -msgstr "aStar-familjen" +msgid "Germany, Japan" +msgstr "Tyskland, Japan" -msgid "pgr_aStarCost(One to One)" -msgstr "pgr_aStarCost(One to One)" +msgid "https://georepublic.info" +msgstr "https://georepublic.info" -msgid "pgr_aStarCost(One to Many)" -msgstr "pgr_aStarCost(One to Many)" +msgid "United States" +msgstr "USA" -msgid "pgr_aStarCost(Many to One)" -msgstr "pgr_aStarCost(Many to One)" +msgid "https://www.paragoncorporation.com" +msgstr "https://www.paragoncorporation.com" -msgid "pgr_aStarCost(Many to Many)" -msgstr "pgr_aStarCost(Many to Many)" +msgid "Netlab" +msgstr "Netlab" -msgid "pgr_aStarCostMatrix" -msgstr "pgr_aStarCostMatrix" +msgid "Capranica, Italy" +msgstr "Capranica, Italien" -msgid "bdAstar Family" -msgstr "bdAstar Familj" +msgid "https://www.osgeo.org/service-providers/netlab/" +msgstr "https://www.osgeo.org/service-providers/netlab/" -msgid "pgr_bdAstarCost(One to One)" -msgstr "pgr_bdAstarCost(One to One)" +msgid "Transformation - Family of functions" +msgstr "Transformation - Familj av funktioner" -msgid "pgr_bdAstarCost(One to Many)" -msgstr "pgr_bdAstarCost(One to Many)" +msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." +msgstr "Denna familj av funktioner används för att omvandla en given indatagraf :math:`G(V,E)` till en ny graf :math:`G'(V',E')`." -msgid "pgr_bdAstarCost(Many to One)" -msgstr "pgr_bdAstarCost(Many to One)" +msgid "Traversal - Family of functions" +msgstr "Traversal - Familj av funktioner" -msgid "pgr_bdAstarCost(Many to Many)" -msgstr "pgr_bdAstarCost(Many to Many)" +msgid "Utility functions" +msgstr "Verktygsfunktioner" -msgid "pgr_bdAstarCostMatrix" -msgstr "pgr_bdAstarCostMatrix" +msgid "Via - Category" +msgstr "Via - Kategori" -msgid "bdDijkstra Family" -msgstr "familjen bdDijkstra" +msgid "This category intends to solve the general problem:" +msgstr "Denna kategori avser att lösa det allmänna problemet:" -msgid "pgr_bdDijkstraCost(One to One)" -msgstr "pgr_bdDijkstraCost(One to One)" +msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" +msgstr "Givet en graf och en lista med toppar, hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla toppar" -msgid "pgr_bdDijkstraCost(One to Many)" -msgstr "pgr_bdDijkstraCost(One to Many)" +msgid "In other words, find a continuous route that visits all the vertices in the order given." +msgstr "Med andra ord, hitta en kontinuerlig rutt som besöker alla toppar i den ordning som anges." -msgid "pgr_bdDijkstraCost(Many to One)" -msgstr "pgr_bdDijkstraCost(Many to One)" +msgid "path" +msgstr "väg" -msgid "pgr_bdDijkstraCost(Many to Many)" -msgstr "pgr_bdDijkstraCost(Many to Many)" +msgid "represents a section of a **route**." +msgstr "representerar en del av en **rutt**." -msgid "pgr_bdDijkstraCostMatrix" -msgstr "pgr_bdDijkstraCostMatrix" +msgid "route" +msgstr "rutt" -msgid "Flow Family" -msgstr "Flödesfamilj" +msgid "is a sequence of **paths**" +msgstr "är en sekvens av **vägar**" -msgid "pgr_pushRelabel(One to One)" -msgstr "pgr_pushRelabel(One to One)" +msgid "**Used in:**" +msgstr "**Används i:**" -msgid "pgr_pushRelabel(One to Many)" -msgstr "pgr_pushRelabel(One to Many)" +msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." +msgstr "Förutom de obligatoriska parametrar som varje funktion har, finns det valfria parametrar som beror på vilken typ av funktion det är." -msgid "pgr_pushRelabel(Many to One)" -msgstr "pgr_pushRelabel(Many to One)" +msgid "Used in all Via functions" +msgstr "Används i alla Via-funktioner" -msgid "pgr_pushRelabel(Many to Many)" -msgstr "pgr_pushRelabel(Many to Many)" +msgid "Depending on the function one or more inner queries are needed." +msgstr "Beroende på funktion behövs en eller flera inre frågor." -msgid "pgr_edmondsKarp(One to One)" -msgstr "pgr_edmondsKarp(One to One)" +msgid "withPoints - Category" +msgstr "withPoints - Kategori" -msgid "pgr_edmondsKarp(One to Many)" -msgstr "pgr_edmondsKarp(One to Many)" +msgid "When points are added to the graph." +msgstr "När punkter läggs till i diagrammet." -msgid "pgr_edmondsKarp(Many to One)" -msgstr "pgr_edmondsKarp(Many to One)" +msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." +msgstr "Kategorin **with points** ändrar grafen i farten genom att lägga till punkter på kanterna enligt vad som krävs av SQL-frågan `Points`_." -msgid "pgr_edmondsKarp(Many to Many)" -msgstr "pgr_edmondsKarp(Many to Many)" +msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." +msgstr "Funktionerna inom denna kategori ger möjlighet att bearbeta mellan godtyckliga punkter utanför den ursprungliga grafen." -msgid "pgr_boykovKolmogorov (One to One)" -msgstr "pgr_boykovKolmogorov (One to One)" +msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." +msgstr "Denna kategori av funktioner var tänkt för att dirigera fordon, men kan lika gärna fungera för någon annan applikation som inte involverar fordon." -msgid "pgr_boykovKolmogorov (One to Many)" -msgstr "pgr_boykovKolmogorov (One to Many)" +msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." +msgstr "När man får en punktidentifierare ``pid`` som mappas till en kant med en identifierare ``edge_id``, med en fraktion från källan till målet längs kanten ``fraktion`` och lite ytterligare information om vilken sida av kanten punkten ligger på ``side``, kan bearbetning från godtyckliga punkter göras på fasta nätverk." -msgid "pgr_boykovKolmogorov (Many to One)" -msgstr "pgr_boykovKolmogorov (Many to One)" +msgid "All this functions consider as many traits from the \"real world\" as possible:" +msgstr "Alla dessa funktioner tar hänsyn till så många egenskaper från den \"verkliga världen\" som möjligt:" -msgid "pgr_boykovKolmogorov (Many to Many)" -msgstr "pgr_boykovKolmogorov (Many to Many)" +msgid "Kind of graph:" +msgstr "Typ av graf:" -msgid "pgr_maxCardinalityMatching" -msgstr "pgr_maxCardinalityMatching" +msgid "**directed** graph" +msgstr "**directed** graph" -msgid "pgr_edgeDisjointPaths(One to One)" -msgstr "pgr_edgeDisjointPaths(One to One)" +msgid "**undirected** graph" +msgstr "**Omdirigerad** graf" -msgid "pgr_edgeDisjointPaths(One to Many)" -msgstr "pgr_edgeDisjointPaths(One to Many)" +msgid "Arriving at the point:" +msgstr "Anländer till punkten:" -msgid "pgr_edgeDisjointPaths(Many to One)" -msgstr "pgr_edgeDisjointPaths(Many to One)" +msgid "Compulsory arrival on the side of the segment where the point is located." +msgstr "Obligatorisk ankomst på den sida av segmentet där punkten är belägen." -msgid "pgr_edgeDisjointPaths(Many to Many)" -msgstr "pgr_edgeDisjointPaths(Many to Many)" +msgid "On either side of the segment." +msgstr "På vardera sidan om segmentet." -msgid "Components family" -msgstr "Komponenter familj" +msgid "Countries with:" +msgstr "Länder med:" -msgid "pgr_connectedComponents" -msgstr "pgr_connectedComponents" +msgid "**Right** side driving" +msgstr "*körning på *höger** sida" -msgid "pgr_strongComponents" -msgstr "pgr_strongComponents" +msgid "**Left** side driving" +msgstr "**Vänster** sida körning" -msgid "pgr_biconnectedComponents" -msgstr "pgr_biconnectedComponents" +msgid "Some points are:" +msgstr "Några punkter är:" -msgid "pgr_articulationPoints" -msgstr "pgr_articulationPoints" +msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." +msgstr "**Permanent**: t.ex. en uppsättning punkter för kunder som lagras i en tabell i databasen." -msgid "pgr_bridges" -msgstr "pgr_bridges" +msgid "The graph has been modified to permanently have those points as vertices." +msgstr "Grafen har ändrats så att den permanent har dessa punkter som hörn." -msgid "Contraction:" -msgstr "Sammandragning:" +msgid "There is a table on the database that describes the points" +msgstr "Det finns en tabell i databasen som beskriver punkterna" -msgid "Removed unnecessary column seq" -msgstr "Tog bort onödig kolumn seq" +msgid "**Temporal**: for example points given through a web application" +msgstr "**Temporal**: till exempel punkt som ges via en webbapplikation" -msgid "Bug Fixes" -msgstr "Buggfixar" +msgid "The numbering of the points are handled with negative sign." +msgstr "Numreringen av punkterna hanteras med negativt tecken." -msgid "pgr_maxFlowMinCost" -msgstr "pgr_maxFlowMinCost" +msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." +msgstr "Denna teckenändring är till för att undvika förvirring när det finns en topp med samma identifierare som punktens identifierare." -msgid "pgr_maxFlowMinCost_Cost" -msgstr "pgr_maxFlowMinCost_Cost" +msgid "Original point identifiers are to be positive." +msgstr "Ursprungliga punktidentifierare ska vara positiva." -msgid "pgr_dagShortestpath" -msgstr "pgr_dagShortestpath" +msgid "Transformation to negative is done internally." +msgstr "Omvandling till negativ sker internt." -msgid "VRP category" -msgstr "VRP-kategori" +msgid "Interpretation of the sign on the node information of the output" +msgstr "Tolkning av tecknet på noden information om utdata" -msgid "pgr_pickDeliverEuclidean" -msgstr "pgr_pickDeliverEuclidean" +msgid "positive sign is a vertex of the original graph" +msgstr "positivt tecken är ett toppunkt i den ursprungliga grafen" -msgid "pgr_pickDeliver" -msgstr "pgr_pickDeliver" +msgid "negative sign is a point of the `Points SQL`_" +msgstr "negativt tecken är en punkt i `Points SQL`_" -msgid "Chinese Postman family" -msgstr "Chinese Postman family" +msgid "About points" +msgstr "Om punkt" -msgid "pgr_chinesePostman" -msgstr "pgr_chinesePostman" +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." +msgstr "I detta avsnitt kommer följande stad (se :doc:`sampledata`) att användas som exempel: några intressanta punkter såsom restaurang, snabbköp, postkontor etc." -msgid "pgr_chinesePostmanCost" -msgstr "pgr_chinesePostmanCost" +msgid "The graph is **directed**" +msgstr "Grafen är **riktad**" -msgid "Breadth First Search family" -msgstr "Breadth First Search family" +msgid "Red arrows show the ``(source, target)`` of the edge on the edge table" +msgstr "Röda pilar visar ``(källa, mål)`` för kanten i kanttabellen" -msgid "Bellman Ford family" -msgstr "Bellman Ford family" +msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" +msgstr "Blå pilar visar ``(mål, källa)`` för kanten i kanttabellen" -msgid "Moved to legacy" -msgstr "Flyttat till legacy" +msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" +msgstr "Varje punktposition visar var den är belägen i förhållande till kanten ``(källa, mål)``" -msgid "pgr_labelGraph - Use the components family of functions instead." -msgstr "pgr_labelGraph - Use the components family of functions instead." +msgid "On the right for points **2** and **4**." +msgstr "Till höger för punkterna **2** och **4**." -msgid "Max flow - functions were renamed on v2.5.0" -msgstr "Maxflöde - funktioner döptes om i v2.5.0" +msgid "On the left for points **1**, **3** and **5**." +msgstr "Till vänster för punkterna **1**, **3** och **5**." -msgid "pgr_maxFlowPushRelabel" -msgstr "pgr_maxFlowPushRelabel" +msgid "On both sides for point **6**." +msgstr "På båda sidor för punkt **6**." -msgid "pgr_maxFlowBoykovKolmogorov" -msgstr "pgr_maxFlowBoykovKolmogorov" +msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" +msgstr "Representationen på databasen följer `Points SQL`_-beskrivningen, och för detta exempel:" -msgid "pgr_maxFlowEdmondsKarp" -msgstr "pgr_maxFlowEdmondsKarp" +msgid "Driving side" +msgstr "Körning på sidan" -msgid "pgr_maximumcardinalitymatching" -msgstr "pgr_maximumcardinalitymatching" +msgid "In the following images:" +msgstr "I följande bilder:" -msgid "VRP" -msgstr "VRP" +msgid "The squared vertices are the temporary vertices," +msgstr "De kvadrerade topparna är de tillfälliga topparna," -msgid "pgr_gsoc_vrppdtw" -msgstr "pgr_gsoc_vrppdtw" +msgid "The temporary vertices are added according to the driving side," +msgstr "De tillfälliga topparna läggs till enligt körsidan," -msgid "TSP old signatures" -msgstr "TSP gamla signaturer" +msgid "visually showing the differences on how depending on the driving side the data is interpreted." +msgstr "visar visuellt skillnaderna i hur data tolkas beroende på vilken sida som kör." -msgid "pgr_pointsAsPolygon" -msgstr "pgr_pointsAsPolygon" +msgid "Point **1** located on edge ``(6, 5)``" +msgstr "Punkt **1** belägen på kanten ``(6, 5)``" -msgid "pgr_alphaShape old signature" -msgstr "pgr_alphaShape old signature" +msgid "Point **2** located on edge ``(16, 17)``" +msgstr "Punkt **2** belägen på kanten ``(16, 17)``" -msgid "pgRouting 2" -msgstr "pgRouting 2" +msgid "Point **3** located on edge ``(8, 12)``" +msgstr "Punkt **3** belägen på kanten ``(8, 12)``" -msgid "Minors 2.x" -msgstr "Minors 2.x" +msgid "Point **4** located on edge ``(1, 3)``" +msgstr "Punkt **4** belägen på kanten ``(1, 3)``" -msgid "pgRouting 2.6" -msgstr "pgRouting 2.6" +msgid "Point **5** located on edge ``(10, 11)``" +msgstr "Punkt **5** belägen på kanten ``(10, 11)``" -msgid "pgRouting 2.6.3 Release Notes" -msgstr "Versionsinformation för pgRouting 2.6.3" +msgid "Point **6** located on edges ``(6, 7)`` and ``(7, 6)``" +msgstr "Punkt **6** belägen på kanterna ``(6, 7)`` och ``(7, 6)``" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.3 `__" +msgid "Point **1** located on edge ``(5, 6)``" +msgstr "Punkt **1** belägen på kanten ``(5, 6)``" -msgid "`#1219 `__: Implicit cast for via_path integer to text" -msgstr "`#1219 `__: Implicit kast för via_path heltal till text" +msgid "Point **2** located on edge ``(17, 16)``" +msgstr "Punkt **2** belägen på kanten ``(17, 16)``" -msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" -msgstr "`#1193 `__: Fixat att pgr_pointsAsPolygon bröts när strängar jämfördes i WHERE-satsen" +msgid "Point **4** located on edge ``(3, 1)``" +msgstr "Punkt **4** belägen på kanten ``(3, 1)``" -msgid "`#1185 `__: Improve FindPostgreSQL.cmake" -msgstr "`#1185 `__: Förbättra FindPostgreSQL.cmake" +msgid "Like having all points to be considered in both sides ``b``" +msgstr "Som att ha alla punkter att överväga på båda sidor ``b``" -msgid "pgRouting 2.6.2 Release Notes" -msgstr "Versionsinformation för pgRouting 2.6.2" +msgid "Preferred usage on **undirected** graphs" +msgstr "Företrädesvis användning på **undirected** grafer" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.2 `__" +msgid "On the :doc:`TRSP-family` this option is not valid" +msgstr "På :doc:`TRSP-family` är detta alternativ inte giltigt" -msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" -msgstr "`#1152 `__: Fixar körsträcka när vertex inte är en del av grafen" +msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``" +msgstr "Punkt **1** belägen på kanten ``(5, 6)`` och ``(6, 5)``" -msgid "`#1098 `__: Fixes windows test" -msgstr "`#1098 `__: Åtgärdar Windows-test" +msgid "Point **2** located on edge ``(17, 16)``and ``16, 17``" +msgstr "Punkt **2** belägen på kanten ``(17, 16)`` och ``16, 17``" -msgid "`#1165 `__: Fixes build for python3 and perl5" -msgstr "`#1165 `__: Fixar byggandet för python3 och perl5" +msgid "Point **4** located on edge ``(3, 1)`` and ``(1, 3)``" +msgstr "Punkt **4** belägen på kanten ``(3, 1)`` och ``(1, 3)``" -msgid "pgRouting 2.6.1 Release Notes" -msgstr "Versionsinformation för pgRouting 2.6.1" +msgid "Creating temporary vertices" +msgstr "Skapa tillfälliga vertikaler" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.1 `__" +msgid "This section will demonstrate how a temporary vertex is created internally on the graph." +msgstr "I detta avsnitt visas hur ett tillfälligt toppunkt skapas internt i grafen." -msgid "Fixes server crash on several functions." -msgstr "Fixar serverkrasch på flera funktioner." +msgid "Problem" +msgstr "Problem" -msgid "pgr_floydWarshall" -msgstr "pgr_floydWarshall" +msgid "For edge:" +msgstr "För kant:" -msgid "pgr_johnson" -msgstr "pgr_johnson" +msgid "insert point:" +msgstr "infoga punkt:" -msgid "pgr_bdDijstra" -msgstr "pgr_bdDijstra" +msgid "On a right hand side driving network" +msgstr "På ett körfält med höger sida" -msgid "pgr_alphashape" -msgstr "pgr_alphashape" +msgid "Arrival to point ``-2`` can be achieved only via vertex **16**." +msgstr "Ankomst till punkt ``-2`` kan endast ske via toppunkt **16**." -msgid "pgr_dijkstraCostMatrix" -msgstr "pgr_dijkstraCostMatrix" +msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept." +msgstr "Påverkar inte kanten ``(17, 16)``, därför behålls kanten." -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" +msgid "It only affects the edge ``(16, 17)``, therefore the edge is removed." +msgstr "Det påverkar bara kanten ``(16, 17)``, därför tas kanten bort." -msgid "pgr_dijkstraVia (proposed)" -msgstr "pgr_dijkstraVia (proposed)" +msgid "Create two new edges:" +msgstr "Skapa två nya kanter:" -msgid "pgr_boykovKolmogorov (proposed)" -msgstr "pgr_boykovKolmogorov (proposed)" +msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" +msgstr "Kant ``(16, -2)`` med kostnad ``0.4`` (ursprunglig kostnad * fraktion == :math:`1 * 0.4`)" -msgid "pgr_edgeDisjointPaths (proposed)" -msgstr "pgr_edgeDisjointPaths (proposed)" +msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" +msgstr "Kant ``(-2, 17)`` med kostnad ``0,6`` (den återstående kostnaden)" -msgid "pgr_edmondsKarp (proposed)" -msgstr "pgr_edmondsKarp (proposed)" +msgid "The total cost of the additional edges is equal to the original cost." +msgstr "Den totala kostnaden för de extra kanterna är lika stor som den ursprungliga kostnaden." -msgid "pgr_maxCardinalityMatch (proposed)" -msgstr "pgr_maxCardinalityMatch (proposed)" +msgid "If more points are on the same edge, the process is repeated recursevly." +msgstr "Om fler punkter ligger på samma kant upprepas processen om och om igen." -msgid "pgr_maxFlow (proposed)" -msgstr "pgr_maxFlow (proposed)" +msgid "On a left hand side driving network" +msgstr "På en vänster sida av körfältet" -msgid "pgr_withPoints (proposed)" -msgstr "pgr_withPoints (proposed)" +msgid "Arrival to point ``-2`` can be achieved only via vertex **17**." +msgstr "Ankomst till punkt ``-2`` kan endast ske via toppunkt **17**." -msgid "pgr_withPointsCost (proposed)" -msgstr "pgr_withPointsCost (proposed)" +msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept." +msgstr "Påverkar inte kanten ``(16, 17)``, därför behålls kanten." -msgid "pgr_withPointsKSP (proposed)" -msgstr "pgr_withPointsKSP (proposed)" +msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." +msgstr "Det påverkar bara kanten ``(17, 16)``, därför tas kanten bort." -msgid "pgr_withPointsDD (proposed)" -msgstr "pgr_withPointsDD (proposed)" +msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" +msgstr "Arbeta med den ursprungliga kanten ``(16, 17)`` eftersom bråkdelen är en bråkdel av den ursprungliga:" -msgid "pgr_withPointsCostMatrix (proposed)" -msgstr "pgr_withPointsCostMatrix (proposed)" +msgid "Flip the Edges and add them to the graph:" +msgstr "Vänd på kanterna och lägg till dem i grafen:" -msgid "pgr_contractGraph (experimental)" -msgstr "pgr_contractGraph (experimental)" +msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." +msgstr "Kanten ``(17, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen." -msgid "pgr_pushRelabel (experimental)" -msgstr "pgr_pushRelabel (experimental)" +msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." +msgstr "Kanten ``(-2, 16)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen." -msgid "pgr_vrpOneDepot (experimental)" -msgstr "pgr_vrpOneDepot (experimental)" +msgid "When driving side does not matter" +msgstr "När körsidan inte spelar någon roll" -msgid "pgr_gsoc_vrppdtw (experimental)" -msgstr "pgr_gsoc_vrppdtw (experimental)" +msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." +msgstr "Ankomst till punkt ``-2`` kan uppnås via topparna **16** eller **17**." -msgid "Fixes for deprecated functions where also applied but not tested" -msgstr "Fixar för föråldrade funktioner som också tillämpas men inte testas" +msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." +msgstr "Påverkar kanterna ``(16, 17)`` och ``(17, 16)``, därför tas kanterna bort." -msgid "Removed compilation warning for g++8" -msgstr "Borttagen kompileringsvarning för g++8" +msgid "Create four new edges:" +msgstr "Skapa fyra nya kanter:" -msgid "Fixed a fallthrugh on Astar and bdAstar." -msgstr "Åtgärdat ett fel på Astar och bdAstar." +msgid "Flip the Edges and add all the edges to the graph:" +msgstr "Vänd på Edges och lägg till alla kanter i grafen:" -msgid "pgRouting 2.6.0 Release Notes" -msgstr "Versionsinformation för pgRouting 2.6.0" +msgid "Edge ``(16, -2)`` is added to the graph." +msgstr "Kanten ``(16, -2)`` läggs till i grafen." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.0 `__" +msgid "Edge ``(-2, 17)`` is added to the graph." +msgstr "Kanten ``(-2, 17)`` läggs till i grafen." -msgid "pgr_lineGraphFull" -msgstr "pgr_lineGraphFull" +msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." +msgstr "Kanten ``(16, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen." -msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" -msgstr "Fix pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean[,text])" +msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." +msgstr "Kanten ``(-2, 17)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen." -msgid "without restrictions" -msgstr "utan begränsningar" +msgid "withPoints - Family of functions" +msgstr "withPoints - Familj av funktioner" -msgid "calls pgr_dijkstra when both end points have a fraction IN (0,1)" -msgstr "anropar pgr_dijkstra när båda ändpunkterna har en fraktion IN (0,1)" +msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm." +msgstr "Denna familj av funktioner tillhör :doc:`withPoints-category` och de funktioner som ingår i dem är på ett eller annat sätt baserade på dijkstra-algoritmen." -msgid "calls pgr_withPoints when at least one fraction NOT IN (0,1)" -msgstr "anropar pgr_withPoints när minst en fraktion INTE ÄR I (0,1)" +msgid "Depending on the name:" +msgstr "Beroende på namnet:" -msgid "with restrictions" -msgstr "med begränsningar" +msgid "pgr_withPoints is pgr_dijkstra **with points**" +msgstr "pgr_withPoints is pgr_dijkstra **with points**" -msgid "calls original trsp code" -msgstr "samtal original trsp kod" +msgid "pgr_withPointsCost is pgr_dijkstraCost **with points**" +msgstr "pgr_withPointsCost is pgr_dijkstraCost **with points**" -msgid "Internal code" -msgstr "Intern kod" +msgid "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**" +msgstr "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**" -msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" -msgstr "Rensade den interna koden för trsp(text,heltal,heltal,boolean,boolean [, text])" +msgid "pgr_withPointsKSP is pgr_ksp **with points**" +msgstr "pgr_withPointsKSP is pgr_ksp **with points**" -msgid "Removed the use of pointers" -msgstr "Tog bort användningen av pekare" +msgid "pgr_withPointsDD is pgr_drivingDistance **with points**" +msgstr "pgr_withPointsDD is pgr_drivingDistance **with points**" -msgid "Internal code can accept BIGINT" -msgstr "Intern kod kan acceptera BIGINT" +msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" +msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" -msgid "Cleaned the internal code of withPoints" -msgstr "Rensade den interna koden för withPoints" +#~ msgid "No changes yet" +#~ msgstr "Inga ändringar ännu" -msgid "pgRouting 2.5" -msgstr "pgRouting 2.5" +#~ msgid "pgRouting 4.0.0-alpha1 Release Notes" +#~ msgstr "pgRouting 4.0.0-alpha1 Release Notes" -msgid "pgRouting 2.5.5 Release Notes" -msgstr "Versionsinformation för pgRouting 2.5.5" +#~ msgid "Individuals in this release v4.0.0 (in alphabetical order)" +#~ msgstr "Personer i denna utgåva v4.0.0 (i alfabetisk ordning)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.5 `__" +#~ msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" +#~ msgstr "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" -msgid "Fixes driving distance when vertex is not part of the graph" -msgstr "Fixar körsträcka när toppunkten inte är en del av grafen" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgid "Fixes windows test" -msgstr "Åtgärdar Windows-test" +#~ msgid "See also" +#~ msgstr "Se även" -msgid "Fixes build for python3 and perl5" -msgstr "Fixar byggsätt för python3 och perl5" +#~ msgid "``pgr_bellmanFord - Experimental``" +#~ msgstr "``pgr_bellmanFord - Experimentell``" -msgid "pgRouting 2.5.4 Release Notes" -msgstr "Versionsinformation för pgRouting 2.5.4" +#~ msgid "It is expected to terminate faster than pgr_aStar" +#~ msgstr "Den förväntas avslutas snabbare än pgr_aStar" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.4 `__" +#, fuzzy +#~ msgid "The user's documentation is build by default" +#~ msgstr "För användardokumentation" -msgid "pgRouting 2.5.3 Release Notes" -msgstr "Versionsinformation för pgRouting 2.5.3" +#, fuzzy +#~ msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation is build by default" +#~ msgstr "För användardokumentation" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.3 `__" +#, fuzzy +#~ msgid "Developers's Documentation is not build when" +#~ msgstr "För dokumentation för utvecklare" -msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" -msgstr "Fix för postgresql 11: Tog bort ett kompileringsfel vid kompilering med postgreSQL" +#~ msgid "New experimental functions" +#~ msgstr "Nya experimentella funktioner" -msgid "pgRouting 2.5.2 Release Notes" -msgstr "Versionsinformation för pgRouting 2.5.2" +#, fuzzy +#~ msgid "`#2913 `__: pgr_DAGshortestPath" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.2 `__" +#, fuzzy +#~ msgid "`#2909 `__: pgr_turnRestrictedPaths" +#~ msgstr "`#2909 `__ pgr_turnRestrictedPaths" -msgid "Fix for postgresql 10.1: Removed a compiler condition" -msgstr "Fix för postgresql 10.1: Tog bort ett kompilatorvillkor" +#~ msgid "`#2681 `__: pgr_trspviaedges" +#~ msgstr "`#2681 `__: pgr_trspviaedges" -msgid "pgRouting 2.5.1 Release Notes" -msgstr "Versionsinformation för pgRouting 2.5.1" +#~ msgid "`#2682 `__: pgr_trspviavertices" +#~ msgstr "`#2682 `__: pgr_trspviavertices" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.1 `__" +#, fuzzy +#~ msgid "`#2748 `__ _pgr_alphashape(text,double precision)" +#~ msgstr "`#2748 `__: pgr_alphaShape" -msgid "Fixed prerequisite minimum version of: cmake" -msgstr "Fixad förkunskapskrav för minsta version av: cmake" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_checkverttab(text,text[],integer,text)" +#~ msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "pgRouting 2.5.0 Release Notes" -msgstr "Versionsinformation för pgRouting 2.5.0" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_createindex(text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.0 `__" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_createindex(text,text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" -msgid "enhancement:" -msgstr "förbättring:" +#, fuzzy +#~ msgid "`#2913 `__ _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" -msgid "pgr_version is now on SQL language" -msgstr "pgr_version is now on SQL language" +#, fuzzy +#~ msgid "`#2913 `__ _pgr_dagshortestpath(text,text,boolean,boolean)" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" -msgid "Breaking change on:" -msgstr "Bryter förändring på:" +#, fuzzy +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" -msgid "pgr_edgeDisjointPaths:" -msgstr "pgr_edgeDisjointPaths:" +#, fuzzy +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" -msgid "Added path_id, cost and agg_cost columns on the result" -msgstr "Lagt till kolumnerna path_id, cost och agg_cost i resultatet" +#, fuzzy +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" -msgid "Parameter names changed" -msgstr "Namn på parametrar ändrade" +#, fuzzy +#~ msgid "`#2735 `__ _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +#~ msgstr "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean,boolean)" -msgid "The many version results are the union of the One to One version" -msgstr "Resultaten för många versioner är en sammanslagning av One to One-versionen" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_endpoint(geometry)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" -msgid "New Signatures" -msgstr "Nya signaturer" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumnname(text,text,integer,text)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" -msgid "pgr_bdAstar(One to One)" -msgstr "pgr_bdAstar(One to One)" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumnname(text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" -msgid "pgr_lineGraph" -msgstr "pgr_lineGraph" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumntype(text,text,integer,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" -msgid "pgr_bdastar - use pgr_bdAstar instead" -msgstr "pgr_bdastar - use pgr_bdAstar instead" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumntype(text,text,text,integer,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" -msgid "Renamed functions" -msgstr "Omdöpta funktioner" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_gettablename(text,integer,text)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" -msgid "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead" -msgstr "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_iscolumnindexed(text,text,integer,text)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" -msgid "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead" -msgstr "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_iscolumnindexed(text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" -msgid "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead" -msgstr "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_iscolumnintable(text,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" -msgid "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead" -msgstr "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead" +#, fuzzy +#~ msgid "`#2899 `__ _pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "`#2899 `__: pgr_maxCardinalityMatch" -msgid "Deprecated Function" -msgstr "Föråldrad funktion" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_startpoint(geometry)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" -msgid "pgr_pointToEdgeNode" -msgstr "pgr_pointToEdgeNode" +#, fuzzy +#~ msgid "`#2682 `__ _pgr_trspviavertices(text,integer[],boolean,boolean,text)" +#~ msgstr "`#2682 `__: pgr_trspviavertices" -msgid "pgRouting 2.4" -msgstr "pgRouting 2.4" +#, fuzzy +#~ msgid "`#2919 `__ _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "pgRouting 2.4.2 Release Notes" -msgstr "Versionsinformation för pgRouting 2.4.2" +#, fuzzy +#~ msgid "`#2919 `__ _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.2 `__" +#, fuzzy +#~ msgid "`#2919 `__ _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "`#2701 `__ pgr_trsp_withPoints" -msgid "Improvement" -msgstr "Förbättring" +#, fuzzy +#~ msgid "`#2901 `__ _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "Works for postgreSQL 10" -msgstr "Fungerar för postgreSQL 10" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_versionless(text,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" -msgid "Fixed: Unexpected error column \"cname\"" -msgstr "Fast: Oväntad felkolumn \"cname\"" +#, fuzzy +#~ msgid "`#2890 `__ _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" -msgstr "Ersätt __linux__ med __GLIBC__ för glibc-specifika rubriker och funktioner" +#, fuzzy +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean,boolean)" -msgid "pgRouting 2.4.1 Release Notes" -msgstr "Versionsinformation för pgRouting 2.4.1" +#, fuzzy +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.1 `__" +#, fuzzy +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean,boolean)" -msgid "Fixed compiling error on macOS" -msgstr "Fixat kompileringsfel på macOS" +#, fuzzy +#~ msgid "`#2741 `__ _pgr_withpointsvia(text,bigint[],double precision[],boolean)" +#~ msgstr "`#2700 `__ pgr_withPointsVia" -msgid "Condition error on pgr_withPoints" -msgstr "Villkorligt fel på pgr_withPoints" +#, fuzzy +#~ msgid "`#2741 `__ _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "pgRouting 2.4.0 Release Notes" -msgstr "Versionsinformation för pgRouting 2.4.0" +#, fuzzy +#~ msgid "`#2899 `__ pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "`#2899 `__: pgr_maxCardinalityMatch" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.0 `__" +#, fuzzy +#~ msgid "`#2681 `__ pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" -msgid "Deprecated signatures." -msgstr "Föråldrade signaturer." +#, fuzzy +#~ msgid "`#2682 `__ pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +#~ msgstr "`#2682 `__: pgr_trspviavertices" -msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" -msgstr "pgr_bddijkstra - use pgr_bdDijkstra instead" +#, fuzzy +#~ msgid "`#2919 `__ pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "pgr_pointsToVids" -msgstr "pgr_pointsToVids" +#, fuzzy +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)" -msgid "Bug fixes on proposed functions" -msgstr "Buggfixar på föreslagna funktioner" +#, fuzzy +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "pgr_withPointsKSP: fixed ordering" -msgstr "pgr_withPointsKSP: fixed ordering" +#, fuzzy +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "TRSP original code is used with no changes on the compilation warnings" -msgstr "TRSP:s originalkod används utan ändringar i sammanställningsvarningarna" +#, fuzzy +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken,boolean)" -msgid "pgRouting 2.3" -msgstr "pgRouting 2.3" +#, fuzzy +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "`#2701 `__ pgr_trsp_withPoints" -msgid "pgRouting 2.3.2 Release Notes" -msgstr "Versionsinformation för pgRouting 2.3.2" +#, fuzzy +#~ msgid "`#2901 `__ pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.2 `__" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" -msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." -msgstr "Fixad pgr_gsoc_vrppdtw-krasch när alla order får plats på en lastbil." +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" -msgid "Fixed pgr_trsp:" -msgstr "Fixat pgr_trsp:" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" -msgid "Alternate code is not executed when the point is in reality a vertex" -msgstr "Alternativ kod utförs inte när punkten i själva verket är en topp" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" -msgid "Fixed ambiguity on seq" -msgstr "Fixad tvetydighet på seq" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" -msgid "pgRouting 2.3.1 Release Notes" -msgstr "Versionsinformation för pgRouting 2.3.1" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,text,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.1 `__" +#, fuzzy +#~ msgid "`#2890 `__ pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "Leaks on proposed max_flow functions" -msgstr "Läckor om föreslagna max_flow-funktioner" +#, fuzzy +#~ msgid "`#2890 `__ pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +#~ msgstr "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken,boolean)" -msgid "Regression error on pgr_trsp" -msgstr "Regressionsfel på pgr_trsp" +#, fuzzy +#~ msgid "`#2895 `__ pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "Types discrepancy on pgr_createVerticesTable" -msgstr "Typer diskrepans på pgr_createVerticesTable" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "pgRouting 2.3.0 Release Notes" -msgstr "Versionsinformation för pgRouting 2.3.0" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.0 `__" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)" -msgid "pgr_eucledianTSP" -msgstr "pgr_eucledianTSP" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)" -msgid "pgr_maxFlowPushRelabel(One to One)" -msgstr "pgr_maxFlowPushRelabel(One to One)" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpoints(text,text,text,boolean,character,boolean)" +#~ msgstr "`#2905 `__ pgr_withPointsCost" -msgid "pgr_maxFlowPushRelabel(One to Many)" -msgstr "pgr_maxFlowPushRelabel(One to Many)" +#, fuzzy +#~ msgid "`#2919 `__ pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "pgr_maxFlowPushRelabel(Many to One)" -msgstr "pgr_maxFlowPushRelabel(Many to One)" +#~ msgid "_pgr_drivingdistance => _pgr_drivingdistancev4" +#~ msgstr "_pgr_drivingdistance => _pgr_drivingdistancev4" -msgid "pgr_maxFlowPushRelabel(Many to Many)" -msgstr "pgr_maxFlowPushRelabel(Many to Many)" +#~ msgid "_pgr_withpointsdd => _pgr_withpointsddv4" +#~ msgstr "_pgr_withpointsdd => _pgr_withpointsddv4" -msgid "pgr_maxFlowEdmondsKarp(One to One)" -msgstr "pgr_maxFlowEdmondsKarp(One to One)" +#~ msgid "_pgr_withpointsksp => _pgr_withpointsksp_v4" +#~ msgstr "_pgr_withpointsksp => _pgr_withpointsksp_v4" -msgid "pgr_maxFlowEdmondsKarp(One to Many)" -msgstr "pgr_maxFlowEdmondsKarp(One to Many)" +#~ msgid "_pgr_trspvia_withpoints => _pgr_trspvia_withpoints_v4" +#~ msgstr "_pgr_trspvia_withpoints => _pgr_trspvia_withpoints_v4" -msgid "pgr_maxFlowEdmondsKarp(Many to One)" -msgstr "pgr_maxFlowEdmondsKarp(Many to One)" +#~ msgid "_pgr_trsp_withpoints => _pgr_trsp_withpoints_v4" +#~ msgstr "_pgr_trsp_withpoints => _pgr_trsp_withpoints_v4" -msgid "pgr_maxFlowEdmondsKarp(Many to Many)" -msgstr "pgr_maxFlowEdmondsKarp(Many to Many)" +#~ msgid "_pgr_withpointsvia => _pgr_withpointsvia_v4" +#~ msgstr "_pgr_withpointsvia => _pgr_withpointsvia_v4" -msgid "pgr_maxFlowBoykovKolmogorov (One to One)" -msgstr "pgr_maxFlowBoykovKolmogorov (One to One)" +#, fuzzy +#~ msgid "`#2748 `__ _pgr_alphashape" +#~ msgstr "`#2748 `__: pgr_alphaShape" -msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" -msgstr "pgr_maxFlowBoykovKolmogorov (One to Many)" +#, fuzzy +#~ msgid "`#2913 `__ _pgr_dagshortestpath" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" -msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" -msgstr "pgr_maxFlowBoykovKolmogorov (Many to One)" +#~ msgid "The ``pgr_aStarCost`` function summarizes of the cost of the shortest path using the A* algorithm." +#~ msgstr "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av A*-algoritmen." -msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" -msgstr "pgr_maxFlowBoykovKolmogorov (Many to Many)" +#~ msgid "The results are equivalent to the union of the results of the pgr_bdAStar(One to One) on the:" +#~ msgstr "Resultaten motsvarar sammanslagningen av resultaten av pgr_bdAStar(One to One) på:" -msgid "pgr_maximumCardinalityMatching" -msgstr "pgr_maximumCardinalityMatching" +#~ msgid "The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path using the bidirectional A* algorithm." +#~ msgstr "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." -msgid "pgr_contractGraph" -msgstr "pgr_contractGraph" +#~ msgid "``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +#~ msgstr "``pgr_bdAstarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_aStar`." -msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" -msgstr "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" +#~ msgid "Using internally the :doc:`pgr_bdAstar` algorithm" +#~ msgstr "Intern användning av :doc:`pgr_bdAstar`-algoritmen" -msgid "pgr_aStar - use pgr_aStar instead" -msgstr "pgr_aStar - use pgr_aStar instead" +#~ msgid "Signature change on pgr_bdDijsktra(One to One)" +#~ msgstr "Ändring av signatur på pgr_bdDijsktra(One to One)" -msgid "pgr_flip_edges" -msgstr "pgr_flip_edges" +#~ msgid "The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm." +#~ msgstr "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade Dijkstra-algoritmen." -msgid "pgr_vidsToDmatrix" -msgstr "pgr_vidsToDmatrix" +#~ msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, that we need a more general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +#~ msgstr "Det är välkänt att de kortaste vägarna mellan en enda källa och alla andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som du behöver korsa från källan till en annan topp. Vi kan också tolka en sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om inte alla kanter i grafen har samma vikt behöver vi en mer allmän algoritm, som Dijkstras algoritm, som går på :math:`O(|E|log|V|)` tid." -msgid "pgr_pointsToDMatrix" -msgstr "pgr_pointsToDMatrix" +#~ msgid "New experimental function" +#~ msgstr "Ny experimentell funktion" -msgid "pgr_textToPoints" -msgstr "pgr_textToPoints" +#~ msgid "..rubric:: Version 3.0.0" +#~ msgstr "..rubric:: Version 3.0.0" -msgid "pgRouting 2.2" -msgstr "pgRouting 2.2" +#~ msgid "``pgr_dijkstraNear`` - Proposed" +#~ msgstr "``pgr_dijkstraNear`` - Förslag" -msgid "pgRouting 2.2.4 Release Notes" -msgstr "Versionsinformation för pgRouting 2.2.4" +#~ msgid "``pgr_dijkstraNearCost`` - Proposed" +#~ msgstr "``pgr_dijkstraNearCost`` - Förslag" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.4 `__" +#~ msgid "Boost `floyd-Warshall `_" +#~ msgstr "Boost `floyd-Warshall `_" -msgid "Bogus uses of extern \"C\"" -msgstr "Felaktig användning av extern \"C\"" +#, fuzzy +#~ msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs" +#~ msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf" -msgid "Build error on Fedora 24 + GCC 6.0" -msgstr "Byggfel på Fedora 24 + GCC 6.0" +#~ msgid "|boost| graph inside." +#~ msgstr "|boost| graf inuti." -msgid "Regression error pgr_nodeNetwork" -msgstr "Regressionsfel pgr_nodeNetwork" +#, fuzzy +#~ msgid "``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph" +#~ msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf" -msgid "pgRouting 2.2.3 Release Notes" -msgstr "Versionsinformation för pgRouting 2.2.3" +#, fuzzy +#~ msgid "|Boost| Boost Graph inside" +#~ msgstr "|Boost-graf inuti" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.3 `__" +#, fuzzy +#~ msgid "..rubric::Summary" +#~ msgstr "..rubric:: Standardize SQL" -msgid "Fixed compatibility issues with PostgreSQL 9.6." -msgstr "Fixade kompatibilitetsproblem med PostgreSQL 9.6." +#~ msgid "Additionally there are 2 categories under this family" +#~ msgstr "Dessutom finns det 2 kategorier under denna familj" -msgid "pgRouting 2.2.2 Release Notes" -msgstr "Versionsinformation för pgRouting 2.2.2" +#~ msgid "They will likely officially be part of the next mayor release:" +#~ msgstr "De kommer sannolikt officiellt att vara en del av nästa borgmästarutgåva:" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.2 `__" +#~ msgid "The functions make use of ANY-INTEGER and ANY-NUMERICAL" +#~ msgstr "Funktionerna använder sig av ANY-INTEGER och ANY-NUMERICAL" -msgid "Fixed regression error on pgr_drivingDistance" -msgstr "Åtgärdat regressionsfel på pgr_drivingDistance" +#~ msgid "Name might not change. (But still can)" +#~ msgstr "Namnet kanske inte ändras. (Men kan fortfarande göra det)" -msgid "pgRouting 2.2.1 Release Notes" -msgstr "Versionsinformation för pgRouting 2.2.1" +#~ msgid "Signature might not change. (But still can)" +#~ msgstr "Signaturen kanske inte ändras. (Men kan fortfarande göra det)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.1 `__" +#~ msgid "Functionality might not change. (But still can)" +#~ msgstr "Funktionaliteten kanske inte ändras. (Men kan fortfarande göra det)" -msgid "Server crash fix on pgr_alphaShape" -msgstr "Fix för serverkrasch på pgr_alphaShape" +#~ msgid "Possible server crash" +#~ msgstr "Möjlig serverkrasch" -msgid "Bug fix on With Points family of functions" -msgstr "Buggfix för funktionerna i With Points-familjen" +#~ msgid "These functions might create a server crash" +#~ msgstr "Dessa funktioner kan orsaka en serverkrasch" -msgid "pgRouting 2.2.0 Release Notes" -msgstr "Versionsinformation för pgRouting 2.2.0" +#~ msgid "Might need c/c++ coding." +#~ msgstr "Kan behöva c/c++-kodning." -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.0 `__" +#~ msgid "May lack documentation." +#~ msgstr "Kan sakna dokumentation." -msgid "Improvements" -msgstr "Förbättringar" +#~ msgid "Documentation examples might need to be automatically generated." +#~ msgstr "Dokumentationsexempel kan behöva genereras automatiskt." -msgid "pgr_nodeNetwork" -msgstr "pgr_nodeNetwork" +#~ msgid "Might depend on a proposed function of pgRouting" +#~ msgstr "Kan bero på en föreslagen funktion för pgRouting" -msgid "Adding a row_where and outall optional parameters" -msgstr "Lägga till en row_where och outall valfria parametrar" +#~ msgid "Might depend on a deprecated function of pgRouting" +#~ msgstr "Kan vara beroende av en föråldrad funktion i pgRouting" -msgid "Signature fix" -msgstr "Signaturfix" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 4.0.0 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 4.0.0 `__" -msgid "pgr_dijkstra -- to match what is documented" -msgstr "pgr_dijkstra -- to match what is documented" +#~ msgid "`#2701 `__ pgr_trsp" +#~ msgstr "`#2701 `__ pgr_trsp" -msgid "pgr_Johnson" -msgstr "pgr_Johnson" +#~ msgid "`#2701 `__ pgr_trspVia" +#~ msgstr "`#2701 `__ pgr_trspVia" -msgid "pgr_dijkstraCost(One to One)" -msgstr "pgr_dijkstraCost(One to One)" +#~ msgid "`#2701 `__ pgr_trspVia_withPoints" +#~ msgstr "`#2701 `__ pgr_trspVia_withPoints" -msgid "pgr_dijkstraCost(One to Many)" -msgstr "pgr_dijkstraCost(One to Many)" +#~ msgid "`#2701 `__ pgr_trsp_withPoints" +#~ msgstr "`#2701 `__ pgr_trsp_withPoints" -msgid "pgr_dijkstraCost(Many to One)" -msgstr "pgr_dijkstraCost(Many to One)" +#~ msgid "`#2700 `__ pgr_withPoints" +#~ msgstr "`#2700 `__ pgr_withPoints" -msgid "pgr_dijkstraCost(Many to Many)" -msgstr "pgr_dijkstraCost(Many to Many)" +#~ msgid "`#2700 `__ pgr_withPointsCost" +#~ msgstr "`#2700 `__ pgr_medPointsCost" -msgid "Proposed Functionality" -msgstr "Föreslagen funktionalitet" +#~ msgid "`#2700 `__ pgr_withPointsCostMatrix" +#~ msgstr "`#2700 `__ pgr_withPointsCostMatrix" -msgid "pgr_withPoints(One to One)" -msgstr "pgr_withPoints(One to One)" +#~ msgid "`#2700 `__ pgr_withPointsDD" +#~ msgstr "`#2700 `__ pgr_medPointsDD" -msgid "pgr_withPoints(One to Many)" -msgstr "pgr_withPoints(One to Many)" +#~ msgid "`#2700 `__ pgr_withPointsKSP" +#~ msgstr "`#2700 `__ pgr_withPointsKSP" -msgid "pgr_withPoints(Many to One)" -msgstr "pgr_withPoints(Many to One)" +#~ msgid "`#2700 `__ pgr_withPointsVia" +#~ msgstr "`#2700 `__ pgr_withPointsVia" -msgid "pgr_withPoints(Many to Many)" -msgstr "pgr_withPoints(Many to Many)" +#~ msgid "`#2718 `__ pgr_aStar(Combinations)" +#~ msgstr "`#2718 `__ pgr_aStar(Kombinationer)" -msgid "pgr_withPointsCost(One to One)" -msgstr "pgr_withPointsCost(One to One)" +#~ msgid "`#2718 `__ pgr_aStarCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_aStarCost(Kombinationer)" -msgid "pgr_withPointsCost(One to Many)" -msgstr "pgr_withPointsCost(One to Many)" +#~ msgid "`#2718 `__ pgr_bdAstar(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdAstar(Kombinationer)" -msgid "pgr_withPointsCost(Many to One)" -msgstr "pgr_withPointsCost(Many to One)" +#~ msgid "`#2718 `__ pgr_bdAstarCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdAstarCost(Kombinationer)" -msgid "pgr_withPointsCost(Many to Many)" -msgstr "pgr_withPointsCost(Many to Many)" +#~ msgid "`#2718 `__ pgr_bdDijkstra(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdDijkstra(Kombinationer)" -msgid "pgr_withPointsDD(single vertex)" -msgstr "pgr_withPointsDD(single vertex)" +#~ msgid "`#2718 `__ pgr_bdDijkstraCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdDijkstraCost(Kombinationer)" -msgid "pgr_withPointsDD(multiple vertices)" -msgstr "pgr_withPointsDD(multiple vertices)" +#~ msgid "`#2718 `__ pgr_dijkstra(Combinations)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" -msgid "pgr_apspWarshall use pgr_floydWarshall instead" -msgstr "pgr_apspWarshall use pgr_floydWarshall instead" +#~ msgid "`#2718 `__ pgr_dijkstraCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_dijkstraCost(Kombinationer)" -msgid "pgr_apspJohnson use pgr_Johnson instead" -msgstr "pgr_apspJohnson use pgr_Johnson instead" +#~ msgid "`#2718 `__ pgr_KSP(All signatures)" +#~ msgstr "`#2718 `__ pgr_KSP(Alla signaturer)" -msgid "pgr_kDijkstraCost use pgr_dijkstraCost instead" -msgstr "pgr_kDijkstraCost use pgr_dijkstraCost instead" +#~ msgid "`#2718 `__ pgr_boykovKolmogorov(Combinations)" +#~ msgstr "`#2718 `__ pgr_boykovKolmogorov(Kombinationer)" -msgid "pgr_kDijkstraPath use pgr_dijkstra instead" -msgstr "pgr_kDijkstraPath use pgr_dijkstra instead" +#~ msgid "`#2718 `__ pgr_edmondsKarp(Combinations)" +#~ msgstr "`#2718 `__ pgr_edmondsKarp(Kombinationer)" -msgid "Renamed and Deprecated Function" -msgstr "Omdöpta och utfasade funktioner" +#~ msgid "`#2718 `__ pgr_maxFlow(Combinations)" +#~ msgstr "`#2718 `__ pgr_maxFlow(Kombinationer)" -msgid "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix" -msgstr "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix" +#~ msgid "`#2718 `__ pgr_pushRelabel(Combinations)" +#~ msgstr "`#2718 `__ pgr_pushRelabel(Kombinationer)" -msgid "pgRouting 2.1" -msgstr "pgRouting 2.1" +#~ msgid "`#2904 `__ Standardize output columns of functions with different output columns within overloads" +#~ msgstr "`#2904 `__ Standardisera utdatakolumner för funktioner med olika utdatakolumner inom överbelastningar" -msgid "pgRouting 2.1.0 Release Notes" -msgstr "Versionsinformation för pgRouting 2.1.0" +#~ msgid "`#2905 `__ pgr_withPoints" +#~ msgstr "`#2905 `__ pgr_withPoints" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.1.0 `__" +#~ msgid "`#2906 `__ pgr_bdDijkstra" +#~ msgstr "`#2906 `__ pgr_bdDijkstra" -msgid "Refactored" -msgstr "Refaktoriserad" +#~ msgid "`#2907 `__ pgr_bellmanFord" +#~ msgstr "`#2907 `__ pgr_bellmanFord" -msgid "pgr_dijkstra(One to One)" -msgstr "pgr_dijkstra(One to One)" +#~ msgid "`#2908 `__ pgr_binaryBreadthFirstSearch" +#~ msgstr "`#2908 `__ pgr_binaryBreadthFirstSearch" -msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." -msgstr "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." +#~ msgid "`#2910 `__ pgr_edwardMoore" +#~ msgstr "`#2910 `__ pgr_edwardMoore" -msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" -msgstr "Föreslagna funktioner från Steve Woodbridge, (Klassificeras som bekvämlighet av författaren.)" +#~ msgid "`#2913 `__ pgr_DAGshortestPath" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" -msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." -msgstr "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." +#~ msgid "`#2905 `__ pgr_withPointsCost" +#~ msgstr "`#2905 `__ pgr_withPointsCost" -msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." -msgstr "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." +#~ msgid "`#2905 `__ pgr_withPointsCostMatrix" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" -msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." -msgstr "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." +#~ msgid "`#2909 `__ pgr_edgeDisjointPaths" +#~ msgstr "`#2909 `__ pgr_edgeDisjointPaths" -msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." -msgstr "pgr_pointsToVids - convert an array of point geometries into vertex ids." +#~ msgid "`#2909 `__ pgr_turnRestrictedPaths" +#~ msgstr "`#2909 `__ pgr_turnRestrictedPaths" -msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." -msgstr "pgr_pointsToDMatrix - Create a distance matrix from an array of points." +#~ msgid "`#2924 `__ pgr_edgeColoring" +#~ msgstr "`#2924 `__ pgr_edgeColoring" -msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." -msgstr "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +#~ msgid "`#2924 `__ pgr_bipartite" +#~ msgstr "`#2924 `__ pgr_bipartite" -msgid "Added proposed functions from GSoc Projects:" -msgstr "Lagt till föreslagna funktioner från GSoc Projects:" +#~ msgid "`#2927 `__ pgr_sequentialVertexColoring" +#~ msgstr "`#2927 `__ pgr_sequentialVertexColoring" -msgid "pgr_vrppdtw" -msgstr "pgr_vrppdtw" +#~ msgid "`#2931 `__ pgr_breadthFirstSearch" +#~ msgstr "`#2931 `__ pgr_breadthFirstSearch" -msgid "pgr_vrponedepot" -msgstr "pgr_vrponedepot" +#~ msgid "`#2931 `__ pgr_depthFirstSearch" +#~ msgstr "`#2931 `__ pgr_depthFirstSearch" -msgid "pgr_getColumnName" -msgstr "pgr_getColumnName" +#~ msgid "`#2934 `__ pgr_topologicalSort" +#~ msgstr "`#2934 `__ pgr_topologicalSort" -msgid "pgr_getTableName" -msgstr "pgr_getTableName" +#~ msgid "`#2934 `__ pgr_transitiveClosure" +#~ msgstr "`#2934 `__ pgr_transitiveClosure" -msgid "pgr_isColumnCndexed" -msgstr "pgr_isColumnCndexed" +#~ msgid "`#2751 `__: pgr_createTopology" +#~ msgstr "`#2751 `__: pgr_createTopology" -msgid "pgr_isColumnInTable" -msgstr "pgr_isColumnInTable" +#~ msgid "#2748 _pgr_alphashape(text,double precision)" +#~ msgstr "#2748 _pgr_alphashape(text,dubbel precision)" -msgid "pgr_quote_ident" -msgstr "pgr_quote_ident" +#~ msgid "#2861 _pgr_checkverttab(text,text[],integer,text)" +#~ msgstr "#2861 _pgr_checkverttab(text,text[],heltal,text)" -msgid "pgr_versionless" -msgstr "pgr_versionless" +#~ msgid "#2861 _pgr_createindex(text,text,text,integer,text)" +#~ msgstr "#2861 _pgr_createindex(text,text,text,heltal,text)" -msgid "pgr_startPoint" -msgstr "pgr_startPoint" +#~ msgid "#2861 _pgr_createindex(text,text,text,text,integer,text)" +#~ msgstr "#2861 _pgr_createindex(text,text,text,text,text,heltal,text)" -msgid "pgr_endPoint" -msgstr "pgr_endPoint" +#~ msgid "#2913 _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)" +#~ msgstr "#2913 _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)" -msgid "pgr_pointToId" -msgstr "pgr_pointToId" +#~ msgid "#2913 _pgr_dagshortestpath(text,text,boolean,boolean)" +#~ msgstr "#2913 _pgr_dagshortestpath(text,text,boolean,boolean)" -msgid "No longer supported" -msgstr "Stöds inte längre" +#~ msgid "#2730 _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +#~ msgstr "#2730 _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" -msgid "Removed the 1.x legacy functions" -msgstr "Borttagning av äldre funktioner från 1.x" +#~ msgid "#2730 _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +#~ msgstr "#2730 _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" -msgid "Some bug fixes in other functions" -msgstr "Några buggfixar i andra funktioner" +#~ msgid "#2730 _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +#~ msgstr "#2730 _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" -msgid "Refactoring Internal Code" -msgstr "Refaktorisering av intern kod" +#~ msgid "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +#~ msgstr "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgid "A C and C++ library for developer was created" -msgstr "Ett C- och C++-bibliotek för utvecklare skapades" +#~ msgid "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +#~ msgstr "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgid "encapsulates postgreSQL related functions" -msgstr "kapslar in postgreSQL-relaterade funktioner" +#~ msgid "#2730 _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +#~ msgstr "#2730 _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgid "encapsulates Boost.Graph graphs" -msgstr "kapslar in Boost.Graph-grafer" +#~ msgid "#2730 _pgr_dijkstra(text,text,boolean,boolean,boolean)" +#~ msgstr "#2730 _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgid "Directed Boost.Graph" -msgstr "Riktad Boost.graf" +#~ msgid "#2735 _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +#~ msgstr "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean,boolean)" -msgid "Undirected Boost.graph." -msgstr "Oriktad Boost.graf." +#~ msgid "#2861 _pgr_endpoint(geometry)" +#~ msgstr "#2861 _pgr_slutpunkt(geometri)" -msgid "allow any-integer in the id's" -msgstr "tillåta valfritt heltal i id:et" +#~ msgid "#2861 _pgr_getcolumnname(text,text,integer,text)" +#~ msgstr "#2861 _pgr_getcolumnname(text,text,heltal,text)" -msgid "allow any-numerical on the cost/reverse_cost columns" -msgstr "tillåta valfri numerisk i kostnads-/omvända_kostnadskolumnerna" +#~ msgid "#2861 _pgr_getcolumnname(text,text,text,integer,text)" +#~ msgstr "#2861 _pgr_getcolumnname(text,text,text,heltal,text)" -msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" -msgstr "Istället för att generera många bibliotek: - Alla funktioner är inkapslade i ett bibliotek - Biblioteket har prefixet 2-1-0" +#~ msgid "#2861 _pgr_getcolumntype(text,text,integer,text)" +#~ msgstr "#2861 _pgr_getcolumntype(text,text,heltal,text)" -msgid "pgRouting 2.0" -msgstr "pgRouting 2.0" +#~ msgid "#2861 _pgr_getcolumntype(text,text,text,integer,text)" +#~ msgstr "#2861 _pgr_getcolumntype(text,text,text,heltal,text)" -msgid "pgRouting 2.0.1 Release Notes" -msgstr "Versionsinformation för pgRouting 2.0.1" +#~ msgid "#2861 _pgr_gettablename(text,integer,text)" +#~ msgstr "#2861 _pgr_gettablename(text,heltal,text)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.1 `__" +#~ msgid "#2861 _pgr_iscolumnindexed(text,text,integer,text)" +#~ msgstr "#2861 _pgr_iscolumnindexed(text,text,heltal,text)" -msgid "Minor bug fixes." -msgstr "Mindre buggfixar." +#~ msgid "#2861 _pgr_iscolumnindexed(text,text,text,integer,text)" +#~ msgstr "#2861 _pgr_iscolumnindexed(text,text,text,heltal,text)" -msgid "No track of the bug fixes were kept." -msgstr "Inga uppgifter om buggfixarna sparades." +#~ msgid "#2861 _pgr_iscolumnintable(text,text)" +#~ msgstr "#2861 _pgr_iscolumnintable(text,text)" -msgid "pgRouting 2.0.0 Release Notes" -msgstr "Versionsinformation för pgRouting 2.0.0" +#~ msgid "#2745 _pgr_kruskal(text,anyarray,text,bigint,double precision)" +#~ msgstr "#2745 _pgr_kruskal(text,valfri matris,text,bigint,dubbel precision)" -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" -msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.0 `__" +#~ msgid "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +#~ msgstr "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean,boolean)" -msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" -msgstr "Med lanseringen av pgRouting 2.0.0 har biblioteket övergett bakåtkompatibilitet till `pgRouting 1.0`_-utgåvor. Huvudmålen för denna utgåva är:" +#~ msgid "#2897 _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +#~ msgstr "#2897 _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" -msgid "Major restructuring of pgRouting." -msgstr "Stor omstrukturering av pgRouting." +#~ msgid "#2897 _pgr_ksp(text,text,integer,boolean,boolean)" +#~ msgstr "#2897 _pgr_ksp(text,text,heltal,boolean,boolean)" -msgid "Standardization of the function naming" -msgstr "Standardisering av namngivning av funktioner" +#~ msgid "#2899 _pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "#2899 _pgr_maxcardinalitymatch(text,boolean)" -msgid "Preparation of the project for future development." -msgstr "Förberedelse av projektet för framtida utveckling." +#~ msgid "#2861 _pgr_msg(integer,text,text)" +#~ msgstr "#2861 _pgr_msg(heltal,text,text)" -msgid "As a result of this effort:" -msgstr "Som ett resultat av denna insats:" +#~ msgid "#2861 _pgr_onerror(boolean,integer,text,text,text,text)" +#~ msgstr "#2861 _pgr_onerror(boolean,heltal,text,text,text,text,text)" -msgid "pgRouting has a simplified structure" -msgstr "pgRouting har en förenklad struktur" +#~ msgid "#2861 _pgr_pointtoid(geometry,double precision,text,integer)" +#~ msgstr "#2861 _pgr_pointtoid(geometri,dubbel precision,text,heltal)" -msgid "Significant new functionality has being added" -msgstr "Betydande ny funktionalitet har lagts till" +#~ msgid "#2743 _pgr_prim(text,anyarray,text,bigint,double precision)" +#~ msgstr "#2743 _pgr_prim(text,valfri matris,text,bigint,dubbel precision)" -msgid "Documentation has being integrated" -msgstr "Dokumentation har integrerats" +#~ msgid "#2861 _pgr_quote_ident(text)" +#~ msgstr "#2861 _pgr_quote_ident(text)" -msgid "Testing has being integrated" -msgstr "Testning har integrerats" +#~ msgid "#2861 _pgr_startpoint(geometry)" +#~ msgstr "#2861 _pgr_startpunkt(geometri)" -msgid "And made it easier for multiple developers to make contributions." -msgstr "Och gjort det enklare för flera utvecklare att bidra." +#~ msgid "#2683 _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +#~ msgstr "#2683 _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" -msgid "Important Changes" -msgstr "Viktiga förändringar" +#~ msgid "#2683 _pgr_trsp(text,text,anyarray,anyarray,boolean)" +#~ msgstr "#2683 _pgr_trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" -msgstr "Graph Analytics - verktyg för att upptäcka och åtgärda vissa problem med kopplingar i en graf" +#~ msgid "#2683 _pgr_trsp(text,text,anyarray,bigint,boolean)" +#~ msgstr "#2683 _pgr_trsp(text,text,valfri matris,bigint,boolean)" -msgid "A collection of useful utility functions" -msgstr "En samling användbara nyttofunktioner" +#~ msgid "#2683 _pgr_trsp(text,text,bigint,anyarray,boolean)" +#~ msgstr "#2683 _pgr_trsp(text,text,bigint,anyarray,boolean)" -msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" -msgstr "Två nya algoritmer för korta vägar för alla par (pgr_apspJohnson, pgr_apspWarshall)" +#~ msgid "#2683 _pgr_trsp(text,text,bigint,bigint,boolean)" +#~ msgstr "#2683 _pgr_trsp(text,text,bigint,bigint,boolean)" -msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" -msgstr "Dubbelriktade Dijkstra- och A-star-sökalgoritmer (pgr_bdAstar, pgr_bdDijkstra)" +#~ msgid "#2682 _pgr_trspviavertices(text,integer[],boolean,boolean,text)" +#~ msgstr "#2682 _pgr_trspviavertices(text,heltal[],boolean,boolean,text)" -msgid "One to many nodes search (pgr_kDijkstra)" -msgstr "Sökning från en till många noder (pgr_kDijkstra)" +#~ msgid "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "K alternate paths shortest path (pgr_ksp)" -msgstr "K alternativa vägar kortaste vägen (pgr_ksp)" +#~ msgid "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)" -msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" -msgstr "Ny TSP-lösare som förenklar koden och byggprocessen (pgr_tsp), har tagit bort beroendet av \"Gaul Library\"" +#~ msgid "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)" -msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" -msgstr "Turn Begränsad kortaste väg (pgr_trsp) som ersätter Shooting Star" +#~ msgid "#2901 _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "Dropped support for Shooting Star" -msgstr "Slopat stöd för Shooting Star" +#~ msgid "#2901 _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "Built a test infrastructure that is run before major code changes are checked in" -msgstr "Byggt upp en testinfrastruktur som körs innan större kodändringar checkas in" +#~ msgid "#2861 _pgr_versionless(text,text)" +#~ msgstr "#2861 _pgr_versionless(text,text)" -msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." -msgstr "Testat och åtgärdat de flesta av de utestående buggarna som rapporterats mot 1.x och som finns i 2.0-dev-kodbasen." +#~ msgid "#2890 _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "Improved build process for Windows" -msgstr "Förbättrad byggprocess för Windows" +#~ msgid "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean,boolean)" -msgid "Automated testing on Linux and Windows platforms trigger by every commit" -msgstr "Automatiserad testning på Linux- och Windows-plattformar som utlöses av varje åtagande" +#~ msgid "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "Modular library design" -msgstr "Modulär biblioteksdesign" +#~ msgid "#2895 _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean,boolean)" -msgid "Compatibility with PostgreSQL 9.1 or newer" -msgstr "Kompatibilitet med PostgreSQL 9.1 eller nyare" +#~ msgid "#2741 _pgr_withpointsvia(text,bigint[],double precision[],boolean)" +#~ msgstr "#2741 _pgr_withpointsvia(text,bigint[],dubbel precision[],boolean)" -msgid "Compatibility with PostGIS 2.0 or newer" -msgstr "Kompatibilitet med PostGIS 2.0 eller nyare" +#~ msgid "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "Installs as PostgreSQL EXTENSION" -msgstr "Installeras som PostgreSQL EXTENSION" +#~ msgid "#2683 _trsp(text,text,anyarray,anyarray,boolean)" +#~ msgstr "#2683 _trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "Return types re factored and unified" -msgstr "Returtyperna är faktorerade och enhetliga" +#~ msgid "#2683 _v4trsp(text,text,anyarray,anyarray,boolean)" +#~ msgstr "#2683 _v4trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "Support for table SCHEMA in function parameters" -msgstr "Stöd för tabellen SCHEMA i funktionsparametrar" +#~ msgid "#2683 _v4trsp(text,text,text,boolean)" +#~ msgstr "#2683 _v4trsp(text,text,text,boolean)" -msgid "Support for ``st_`` PostGIS function prefix" -msgstr "Stöd för PostGIS-funktionsprefixet ``st_``" +#~ msgid "#2748 pgr_alphashape(geometry,double precision)" +#~ msgstr "#2748 pgr_alphashape(geometri,dubbel precision)" -msgid "Added ``pgr_`` prefix to functions and types" -msgstr "Lagt till prefixet ``pgr_`` för funktioner och typer" +#~ msgid "#2752 pgr_analyzegraph(text,double precision,text,text,text,text,text)" +#~ msgstr "#2752 pgr_analyzegraph(text,dubbel precision,text,text,text,text,text,text)" -msgid "Better documentation: https://docs.pgrouting.org" -msgstr "Bättre dokumentation: https://docs.pgrouting.org" +#~ msgid "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +#~ msgstr "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean,text,text,text)" -msgid "shooting_star is discontinued" -msgstr "shooting_star är avvecklad" +#~ msgid "#2798 pgr_contraction(text,bigint[],integer,bigint[],boolean)" +#~ msgstr "#2798 pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "pgRouting 1" -msgstr "pgRouting 1" +#~ msgid "#2751 pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +#~ msgstr "#2751 pgr_createtopology(text,dubbel precision,text,text,text,text,text,text,boolean)" -msgid "pgRouting 1.0" -msgstr "pgRouting 1.0" +#~ msgid "#2827 pgr_createverticestable(text,text,text,text,text)" +#~ msgstr "#2827 pgr_createverticestable(text,text,text,text,text,text)" -msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." -msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 1.x `_ på Github. Följande release notes har kopierats från den tidigare filen ``RELEASE_NOTES`` och behålls som en referens." +#~ msgid "#2888 pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +#~ msgstr "#2888 pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean,boolean)" -msgid "Changes for release 1.05" -msgstr "Ändringar för version 1.05" +#~ msgid "#2888 pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +#~ msgstr "#2888 pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean,boolean)" -msgid "Changes for release 1.03" -msgstr "Ändringar för version 1.03" +#~ msgid "#2899 pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "#2899 pgr_maxcardinalitymatch(text,boolean)" -msgid "Much faster topology creation" -msgstr "Mycket snabbare skapande av topologi" +#~ msgid "#2886 pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +#~ msgstr "#2886 pgr_nodenetwork(text,dubbel precision,text,text,text,text,text,boolean)" -msgid "Changes for release 1.02" -msgstr "Ändringar för version 1.02" +#~ msgid "#2683 pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +#~ msgstr "#2683 pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" -msgid "Shooting* bug fixes" -msgstr "Fotografering* buggfixar" +#~ msgid "#2683 pgr_trsp(text,integer,integer,boolean,boolean,text)" +#~ msgstr "#2683 pgr_trsp(text,heltal,heltal,boolean,boolean,text)" -msgid "Compilation problems solved" -msgstr "Kompileringsproblem lösta" +#~ msgid "#2681 pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +#~ msgstr "#2681 pgr_trspviaedges(text,heltal[],dubbel precision[],boolean,boolean,text)" -msgid "Changes for release 1.01" -msgstr "Ändringar för version 1.01" +#~ msgid "#2682 pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +#~ msgstr "#2682 pgr_trspviavertices(text,valfri matris,boolean,boolean,text)" -msgid "Changes for release 1.0" -msgstr "Ändringar för version 1.0" +#~ msgid "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "Core and extra functions are separated" -msgstr "Kärn- och extrafunktioner separeras" +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "Cmake build process" -msgstr "Byggprocess med Cmake" +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "Changes for release 1.0.0b" -msgstr "Ändringar för version 1.0.0b" +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "Additional SQL file with more simple names for wrapper functions" -msgstr "Ytterligare SQL-fil med enklare namn för wrapper-funktioner" +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken,boolean)" -msgid "Changes for release 1.0.0a" -msgstr "Ändringar för version 1.0.0a" +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)" -msgid "Shooting* shortest path algorithm for real road networks" -msgstr "Algoritm för kortaste väg för verkliga vägnät" +#~ msgid "#2901 pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "Several SQL bugs were fixed" -msgstr "Flera SQL-buggar har åtgärdats" +#~ msgid "#2901 pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "Changes for release 0.9.9" -msgstr "Ändringar för version 0.9.9" +#~ msgid "#2919 pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +#~ msgstr "#2919 pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgid "PostgreSQL 8.2 support" -msgstr "Stöd för PostgreSQL 8.2" +#~ msgid "#2919 pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,valfri matris,valfri matris,boolean,tecken)" -msgid "Shortest path functions return empty result if they could not find any path" -msgstr "Kortaste vägen-funktioner returnerar ett tomt resultat om de inte kunde hitta någon väg" +#~ msgid "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -msgid "Changes for release 0.9.8" -msgstr "Ändringar för version 0.9.8" +#~ msgid "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -msgid "Renumbering scheme was added to shortest path functions" -msgstr "Omnumreringssystem lades till för funktioner för kortaste vägen" +#~ msgid "#2919 pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgid "Directed shortest path functions were added" -msgstr "Directed shortest path-funktioner lades till" +#~ msgid "#2919 pgr_withpointscost(text,text,text,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,text,boolean,tecken)" -msgid "routing_postgis.sql was modified to use dijkstra in TSP search" -msgstr "routing_postgis.sql modifierades för att använda dijkstra i TSP-sökning" +#~ msgid "#2890 pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "Function Families" -msgstr "Funktionsfamiljer" +#~ msgid "#2890 pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +#~ msgstr "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken,boolean)" -msgid "Sample Data" -msgstr "Exempeldata" +#~ msgid "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." -msgstr "Dokumentationen innehåller mycket enkla exempel på frågor som baseras på ett litet exempelnätverk som liknar en stad. Följ instruktionerna nedan för att kunna utföra de flesta av exempelfrågorna." +#~ msgid "#2919 pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "Main graph" -msgstr "Huvudgraf" +#~ msgid "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgid "A graph consists of a set of edges and a set of vertices." -msgstr "En graf består av en uppsättning kanter och en uppsättning hörn." +#~ msgid "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)" -msgid "The following city is to be inserted into the database:" -msgstr "Följande stad ska läggas in i databasen:" +#~ msgid "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)" -msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." -msgstr "Information som är känd vid denna tidpunkt är geometrin för kanterna, kostnadsvärden, kapacitetsvärden, kategorivärden och vissa platser som inte finns i grafen." +#~ msgid "#2919 pgr_withpoints(text,text,text,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,text,boolean,tecken,boolean)" -msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." -msgstr "Processen för att få en fungerande topologi börjar med att lägga in kanterna. Efter det beräknas allt annat." +#~ msgid "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." -msgstr "Databasdesignen för dokumentationen av pgRouting, håller i samma rad 2 segment, ett i geometrins riktning och det andra i motsatt riktning. Därför har viss information prefixet ``reverse_`` som motsvarar segmentet i geometrins motsatta riktning." +#~ msgid "#2683 _trsp" +#~ msgstr "#2683 _trsp" -msgid "Identifier of the starting vertex of the geometry ``geom``." -msgstr "Identifierare av startpunkten för geometrin ``geom``." +#~ msgid "#2683 _v4trsp" +#~ msgstr "#2683 _v4trsp" -msgid "Identifier of the ending vertex of the geometry ``geom``" -msgstr "Identifierare för geometrins slutpunkt ``geom``" +#~ msgid "#2748 _pgr_alphashape" +#~ msgstr "#2748 _pgr_alphashape" -msgid "Cost to traverse from `source` to ``target``." -msgstr "Kostnad för att gå från `källa` till `mål`." +#~ msgid "#2913 _pgr_dagshortestpath" +#~ msgstr "#2913 _pgr_dagshortestpath" -msgid "Cost to traverse from `target` to ``source``." -msgstr "Kostnad för att gå från `mål` till `källa`." +#~ msgid "Validity of **driving side** parameter" +#~ msgstr "Giltighet för parametern **förarsida**" -msgid "Flow capacity from `source` to ``target``." -msgstr "Flödeskapacitet från `källa` till `mål`." +#~ msgid "**driving side** parameter is unnamed compulsory, and valid values differ for directed and undirected graphs." +#~ msgstr "*parametern *driving side** är obligatorisk utan namn och giltiga värden skiljer sig åt för riktade och oriktade grafer." -msgid "Flow capacity from `target` to ``source``." -msgstr "Flödeskapacitet från `mål` till `källa`." +#~ msgid "Does not have a default value." +#~ msgstr "Har inget förinställt värde." -msgid "``category``" -msgstr "``category``" +#~ msgid "Using an invalid value throws an ``ERROR``." +#~ msgstr "Om du använder ett ogiltigt värde får du ett ``ERROR``." -msgid "``reverse_category``" -msgstr "``reverse_category``" +#~ msgid "And ``driving side`` parameter changed from named optional to unnamed compulsory **driving side** and its validity differ for directed and undirected graphs." +#~ msgstr "Parametern ``driving side`` ändrades från namngiven valfri till icke namngiven obligatorisk **driving side** och dess giltighet skiljer sig åt för riktade och oriktade grafer." -msgid ":math:`x` coordinate of the starting vertex of the geometry." -msgstr ":math:`x` coordinate of the starting vertex of the geometry." +#~ msgid "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +#~ msgstr "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``." -msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_X(ST_StartPoint(geom))``." +#~ msgid ":ref:`install-short`" +#~ msgstr ":ref:`install-short`" -msgid ":math:`y` coordinate of the ending vertex of the geometry." -msgstr ":math:`y` coordinate of the ending vertex of the geometry." +#~ msgid ":ref:`install_get_sources`" +#~ msgstr ":ref:`install_get_sources`" -msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." -msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_Y(ST_EndPoint(geom))``." +#~ msgid ":ref:`install_enable_db`" +#~ msgstr ":ref:`install_enable_db`" -msgid "The geometry of the segments." -msgstr "Segmentens geometri." +#~ msgid ":ref:`install_dependencies`" +#~ msgstr ":ref:`install_dependencies`" -msgid "Starting on PostgreSQL 12::" -msgstr "Börjar på PostgreSQL 12::" +#~ msgid ":ref:`install_configuring`" +#~ msgstr ":ref:`install_configuring`" -msgid "Optionally indexes on different columns can be created. The recommendation is to have" -msgstr "Eventuellt kan index på olika kolumner skapas. Rekommendationen är att ha" +#~ msgid ":ref:`install_build`" +#~ msgstr ":ref:`install_build`" -msgid "``id`` indexed." -msgstr "``id`` indexerad." +#~ msgid ":ref:`install_testing`" +#~ msgstr ":ref:`install_testing`" -msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." -msgstr "kolumnerna ``källa`` och ``mål`` indexerade för att snabba upp pgRouting-frågor." +#~ msgid "To use pgRouting PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +#~ msgstr "För att använda pgRouting måste PostGIS installeras, läs informationen om installation i denna `Installationsguide `__" -msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." -msgstr "``geom`` indexerad för att påskynda geometriska processer som kan behövas i frontend." +#~ msgid "Postgresql version = Supported versions by PostgreSQL" +#~ msgstr "Postgresql-version = Versioner som stöds av PostgreSQL" -msgid "For this small example the indexes are skipped, except for ``id``" -msgstr "I det här lilla exemplet hoppas indexen över, utom för ``id``" +#~ msgid "The Boost Graph Library (BGL). Version >= 1.56" +#~ msgstr "Boost Graph Library (BGL). Version >= 1.56" -msgid "Edges data" -msgstr "Data om kanter" +#~ msgid "CMake >= 3.2" +#~ msgstr "CMake >= 3.2" -msgid "Inserting into the database the information of the edges:" -msgstr "Lägga in informationen om kanterna i databasen:" +#~ msgid "optional dependencies" +#~ msgstr "valfria beroenden" -msgid "Negative values on the cost, capacity and category means that the edge do not exist." -msgstr "Negativa värden på kostnad, kapacitet och kategori innebär att kanten inte existerar." +#~ msgid "Sphinx >= 1.1" +#~ msgstr "Sphinx >= 1.1" -msgid "Vertices" -msgstr "Hörn" +#~ msgid "Latex" +#~ msgstr "Latex" -msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" -msgstr "Vertexinformationen beräknas utifrån kantidentifieraren och geometrin och sparas i en tabell. Sparar all information som tillhandahålls av :doc:`pgr_extractVertices`:" +#~ msgid "PostGIS version >= 2.2" +#~ msgstr "PostGIS version >= 2.2" -msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." -msgstr "I det här fallet, eftersom ``CREATE``-satsen inte användes, behövs definitionen av ett index på tabellen." +#~ msgid "Database dependencies" +#~ msgstr "Beroenden till databaser" -msgid "The structure of the table is:" -msgstr "Tabellens struktur är:" +#~ msgid "Configuring PostgreSQL" +#~ msgstr "Konfigurera PostgreSQL" -msgid "Vertices data" -msgstr "Data om vertikaler" +#~ msgid "Entering psql console" +#~ msgstr "Gå in i psql-konsolen" -msgid "The saved information of the vertices is:" -msgstr "Den sparade informationen om topparna är:" +#~ msgid "To exit psql console" +#~ msgstr "Så här avslutar du psql-konsolen" -msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." -msgstr "Här kan du lägga till fler kolumner i tabellen vertices. Namn och typer på ytterligare kolumner beror på tillämpningen." +#~ msgid "Entering psql console directly without switching roles can be done by the following commands" +#~ msgstr "Du kan gå in i psql-konsolen direkt utan att byta roll med följande kommandon" -msgid "The topology" -msgstr "Topologin" +#~ msgid "Then use the above given method to exit out of the psql console" +#~ msgstr "Använd sedan ovanstående metod för att avsluta psql-konsolen" -msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." -msgstr "Denna fråga baseras på toppdata och skapar en topologi genom att fylla i kolumnerna \"källa\" och \"mål\" i tabellen \"kanter\"." +#~ msgid "Checking PostgreSQL version" +#~ msgstr "Kontrollera PostgreSQL-versionen" -msgid "Topology data" -msgstr "Topologidata" +#~ msgid "or" +#~ msgstr "eller" -msgid "Points outside the graph" -msgstr "Punkter utanför grafen" +#~ msgid "Enter the psql console using above given method and then enter" +#~ msgstr "Gå in i psql-konsolen med hjälp av ovanstående metod och ange sedan" -msgid "Support tables" -msgstr "Stödbord" +#~ msgid "Creating PostgreSQL role" +#~ msgstr "Skapa PostgreSQL-roll" -msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." -msgstr "Många funktioner kan användas med kombinationer av paren ``(källa, mål)`` när man vill ha en rutt från ``källa`` till ``mål``." +#~ msgid "Default role provided by PostgreSQL is postgres. To create new roles you can use the above provided commands. The prompt will ask the user to type name of the role and then provide affirmation. Proceed with the steps and you will succeed in creating PostgreSQL role successfully." +#~ msgstr "Standardrollen som tillhandahålls av PostgreSQL är postgres. För att skapa nya roller kan du använda ovanstående kommandon. Prompten kommer att be användaren att skriva namnet på rollen och sedan ge bekräftelse. Fortsätt med stegen så kommer du att lyckas skapa PostgreSQL-rollen framgångsrikt." -msgid "For convenience of this documentation, some combinations will be stored on a table:" -msgstr "För att underlätta denna dokumentation kommer vissa kombinationer att lagras på en tabell:" +#~ msgid "To add password to the role or change previously created password of the role use the following commands" +#~ msgstr "Använd följande kommandon om du vill lägga till ett lösenord för rollen eller ändra ett tidigare skapat lösenord för rollen" -msgid "Inserting the data:" -msgstr "Infoga data:" +#~ msgid "To get additional details on the flags associated with ``createuser`` below given command can be used" +#~ msgstr "För att få ytterligare information om de flaggor som är associerade med ``createuser`` kan nedanstående kommando användas" -msgid "Combinations data" -msgstr "Kombinationer data" +#~ msgid "Creating Database in PostgreSQL" +#~ msgstr "Skapa databas i PostgreSQL" -msgid "Some functions accept soft restrictions about the segments." -msgstr "Vissa funktioner accepterar mjuka begränsningar för segmenten." +#~ msgid "Connecting to a PostgreSQL Database" +#~ msgstr "Ansluta till en PostgreSQL-databas" -msgid "Images" -msgstr "Bilder" +#~ msgid "Enter the psql console and type the following commands" +#~ msgstr "Gå till psql-konsolen och skriv följande kommandon" -msgid "Red arrows correspond when ``cost`` > 0 in the edge table." -msgstr "Röda pilar motsvarar när ``cost`` > 0 i kanttabellen." +#~ msgid "For documentation and testing" +#~ msgstr "För dokumentation och testning" -msgid "Blue arrows correspond when ``reverse_cost`` > 0 in the edge table." -msgstr "Blå pilar motsvarar när ``reverse_cost`` > 0 i edge-tabellen." +#~ msgid "Create the build directory" +#~ msgstr "Skapa byggkatalogen" -msgid "Points are outside the graph." -msgstr "Punkterna ligger utanför grafen." +#~ msgid "WITH_DOC" +#~ msgstr "MED_DOK" -msgid "Click on the graph to enlarge." -msgstr "Klicka på grafen för att förstora den." +#~ msgid "Turn on/off building the documentation" +#~ msgstr "Aktivera/avaktivera skapandet av dokumentation" -msgid "Directed graph with ``cost`` and ``reverse_cost``" -msgstr "Riktad graf med ``kostnad`` och ``omvänd_kostnad``" +#~ msgid "Configuring cmake to create documentation before building pgRouting" +#~ msgstr "Konfigurera cmake för att skapa dokumentation innan pgRouting byggs" -msgid "When working with city networks, this is recommended for point of view of vehicles." -msgstr "När du arbetar med stadsnät rekommenderas detta för fordonens synvinkel." +#~ msgid "Most of the effort of the documentation has been on the html files." +#~ msgstr "Det mesta av arbetet med dokumentationen har lagts på html-filerna." -msgid "Directed, with cost and reverse_cost" -msgstr "Riktad, med kostnad och omvänd_kostnad" +#~ msgid "The following instructions start from *path/to/pgrouting/build*" +#~ msgstr "Följande instruktioner startar från *stig/till/pgrouting/build*" -msgid "Undirected graph with ``cost`` and ``reverse_cost``" -msgstr "Oriktad graf med ``kostnad`` och ``omvända_kostnader``" +#~ msgid "The sql signatures are configured and build in the ``cmake`` command." +#~ msgstr "Sql-signaturerna konfigureras och byggs i kommandot ``cmake``." -msgid "When working with city networks, this is recommended for point of view of pedestrians." -msgstr "När du arbetar med stadsnät rekommenderas detta för fotgängarnas synvinkel." +#~ msgid "MinGW on Windows" +#~ msgstr "MinGW på Windows" -msgid "Undirected, with cost and reverse cost" -msgstr "Ostyrd, med kostnad och omvänd kostnad" +#~ msgid "The following instructions start from *path/to/pgrouting*" +#~ msgstr "Följande instruktioner börjar från *väg/till/grouting*" -msgid "Directed graph with ``cost``" -msgstr "Riktad graf med ``kostnad``" +#~ msgid "To remove the build when the configuration changes, use the following code:" +#~ msgstr "Använd följande kod för att ta bort build när konfigurationen ändras:" -msgid "Directed, with cost" -msgstr "Riktad, med kostnad" +#~ msgid "and start the build process as mentioned previously." +#~ msgstr "och starta byggprocessen som tidigare nämnts." -msgid "Undirected graph with ``cost``" -msgstr "Oriktad graf med ``kostnad``" +#~ msgid "The following instructions start from *path/to/pgrouting/*" +#~ msgstr "Följande instruktioner startar från *stig/till/pgrouting/*" -msgid "Undirected, with cost" -msgstr "Ostyrd, med kostnad" +#~ msgid "Individuals in this release v3.8.x (in alphabetical order)" +#~ msgstr "Individer i denna utgåva v3.8.x (i alfabetisk ordning)" -msgid "Pick & Deliver Data" -msgstr "Hämta och leverera data" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgid "Spanning Tree - Category" -msgstr "Spanning Tree - Kategori" +#~ msgid "New **experimental** function" +#~ msgstr "Ny **experimentell** funktion" -msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." -msgstr "Ett spännträd för en odelad graf är ett träd som innehåller alla hörn i G med minsta möjliga antal kanter." +#~ msgid "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +#~ msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." -msgstr "För en frånkopplad graf finns det inte ett enda träd, utan en spänningsskog, som består av ett spänningsträd för varje ansluten komponent." +#~ msgid "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +#~ msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" -msgid "Characteristics:" -msgstr "Kännetecken:" +#~ msgid "``pgr_dijkstraVia`` - Proposed" +#~ msgstr "``pgr_dijkstraVia`` - Förslag" -msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." -msgstr "pgRouting community support är tillgängligt via `pgRouting webbplats `_, `dokumentation `_, handledning, e-postlistor och andra. Om du letar efter :ref:`kommersiellt stöd `, hittar du nedan en lista över företag som tillhandahåller pgRouting-utveckling och konsulttjänster." +#~ msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +#~ msgstr "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen." -msgid "Reporting Problems" -msgstr "Rapportering av problem" +#~ msgid "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" -msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" -msgstr "Buggar rapporteras och hanteras i en `issue tracker `_. Vänligen följ dessa steg:" +#~ msgid "**driving side**" +#~ msgstr "**körning på sidan**" -msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." -msgstr "Sök bland ärendena för att se om ditt problem redan har rapporterats. Om så är fallet kan du lägga till extra sammanhang som du kan ha hittat, eller åtminstone ange att du också har problemet. Detta hjälper oss att prioritera vanliga problem." +#~ msgid "[``r``, ``R``] for right driving side (for directed graph only)" +#~ msgstr "[``r``, ``R``] för höger körsida (endast för riktad graf)" -msgid "If your problem is unreported, create a `new issue `__ for it." -msgstr "Om ditt problem inte har rapporterats, skapa en ny fråga `__ för det." +#~ msgid "[``l``, ``L``] for left driving side (for directed graph only)" +#~ msgstr "[``l``, ``L``] för vänster körsida (endast för riktad graf)" -msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." -msgstr "I din rapport inkluderar du uttryckliga instruktioner för att replikera ditt problem. De bästa ärendena innehåller den exakta SQL som krävs för att replikera ett problem." +#~ msgid "[``b``, ``B``] for both (only for undirected graph)" +#~ msgstr "[``b``, ``B``] för båda (endast för oriktad graf)" -msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." -msgstr "Om du kan testa äldre versioner av PostGIS för ditt problem, vänligen gör det. Notera den tidigaste versionen som problemet uppträder i ditt ärende." +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" -msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." -msgstr "För de versioner där du kan replikera problemet, notera operativsystemet och versionen av pgRouting, PostGIS och PostgreSQL." +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" -msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." -msgstr "Vi rekommenderar att du använder följande wrapper på problemet för att hitta det steg som orsakar problemet." +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" -msgid "Mailing List, Matrix, GIS StackExchange" -msgstr "Mailinglista, matris, GIS StackExchange" +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" -msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" -msgstr "Det finns två e-postlistor för pgRouting som är värd på OSGeo diskurserver:" +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" -msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" -msgstr "E-postlista för användare: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +#~ msgid "**options:** ``[directed, driving_side, details]``" +#~ msgstr "**options:** ``[directed, driving_side, details]``" -msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" -msgstr "E-postlista för utvecklare: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" -msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" -msgstr "Prenumerera: https://discourse.osgeo.org/g/pgrouting-dev" +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" -msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." -msgstr "För allmänna frågor och ämnen om hur du använder pgRouting, vänligen skriv till e-postlistan för användare." +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" -msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." -msgstr "Om du vill chatta med andra pgRouting-användare och bidragsgivare kan du gå med i vår matriskanal: `pgRouting matriskanal `_." +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" -msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." -msgstr "Du kan också ställa frågan på `GIS StackExchange `_ och märka frågan med ``pgrouting``. Hitta alla frågor taggade med ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting eller prenumerera på `pgRouting questions feed `_." +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" -msgid "Commercial Support" -msgstr "Kommersiellt stöd" +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" -msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" -msgstr "För användare som behöver professionell support, utveckling och konsulttjänster kan du överväga att kontakta någon av följande organisationer, som har bidragit väsentligt till utvecklingen av pgRouting:" +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" -msgid "**Company**" -msgstr "**Company**" +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" -msgid "**Offices in**" -msgstr "**Kontor i**" +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" -msgid "**Website**" -msgstr "**Webbplats**" +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" -msgid "Germany, Japan" -msgstr "Tyskland, Japan" +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" -msgid "https://georepublic.info" -msgstr "https://georepublic.info" +#~ msgid "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])" -msgid "United States" -msgstr "USA" +#~ msgid "Using the default ``driving_side`` value" +#~ msgstr "Använda standardvärdet för ``driving_side``" -msgid "https://www.paragoncorporation.com" -msgstr "https://www.paragoncorporation.com" +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" -msgid "Netlab" -msgstr "Netlab" +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" -msgid "Capranica, Italy" -msgstr "Capranica, Italien" +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" -msgid "https://www.osgeo.org/service-providers/netlab/" -msgstr "https://www.osgeo.org/service-providers/netlab/" +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" -msgid "Transformation - Family of functions" -msgstr "Transformation - Familj av funktioner" +#~ msgid "``r``, ``R`` for right driving side," +#~ msgstr "``R``, ``R`` för höger körsida," -msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." -msgstr "Denna familj av funktioner används för att omvandla en given indatagraf :math:`G(V,E)` till en ny graf :math:`G'(V',E')`." +#~ msgid "``l``, ``L`` for left driving side." +#~ msgstr "``L``, ``L`` för vänster körsida." -msgid "Traversal - Family of functions" -msgstr "Traversal - Familj av funktioner" +#~ msgid "``b``, ``B`` for both." +#~ msgstr "``B``, ``B`` för båda." -msgid "Utility functions" -msgstr "Verktygsfunktioner" +#~ msgid "Valid values differ for directed and undirected graphs:" +#~ msgstr "Giltiga värden skiljer sig åt för riktade och oriktade grafer:" -msgid "Via - Category" -msgstr "Via - Kategori" +#~ msgid "In directed graphs: [``r``, ``R``, ``l``, ``L``]." +#~ msgstr "I riktade grafer: [``r``, ``R``, ``l``, ``L``]." -msgid "This category intends to solve the general problem:" -msgstr "Denna kategori avser att lösa det allmänna problemet:" +#~ msgid "In undirected graphs: [``b``, ``B``]." +#~ msgstr "I oriktade grafer: [``b``, ``B``]." -msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" -msgstr "Givet en graf och en lista med toppar, hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla toppar" +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "In other words, find a continuous route that visits all the vertices in the order given." -msgstr "Med andra ord, hitta en kontinuerlig rutt som besöker alla toppar i den ordning som anges." +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "path" -msgstr "väg" +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "represents a section of a **route**." -msgstr "representerar en del av en **rutt**." +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "route" -msgstr "rutt" +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" -msgid "is a sequence of **paths**" -msgstr "är en sekvens av **vägar**" +#~ msgid "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" -msgid "**Used in:**" -msgstr "**Används i:**" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.8.0 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.8.0 `__" -msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." -msgstr "Förutom de obligatoriska parametrar som varje funktion har, finns det valfria parametrar som beror på vilken typ av funktion det är." +#~ msgid "Other enhancements: `#2869 `__" +#~ msgstr "Andra förbättringar: `#2869 `__" -msgid "Used in all Via functions" -msgstr "Används i alla Via-funktioner" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.3 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.7.3 `__" -msgid "Depending on the function one or more inner queries are needed." -msgstr "Beroende på funktion behövs en eller flera inre frågor." +#~ msgid "`#2731 `__ Build Failure on Ubuntu 22" +#~ msgstr "`#2731 `__ Byggfel på Ubuntu 22" -msgid "withPoints - Category" -msgstr "withPoints - Kategori" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.2 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.7.2 `__" -msgid "When points are added to the graph." -msgstr "När punkter läggs till i diagrammet." +#~ msgid "`#2713 `__ cmake missing some policies and min version" +#~ msgstr "`#2713 `__ cmake saknar vissa policyer och min-version" -msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." -msgstr "Kategorin **with points** ändrar grafen i farten genom att lägga till punkter på kanterna enligt vad som krävs av SQL-frågan `Points`_." +#~ msgid "`#2707 `__ Build failure in pgRouting 3.7.1 on Alpine" +#~ msgstr "`#2707 `__ Byggfel i pgRouting 3.7.1 på Alpine" -msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." -msgstr "Funktionerna inom denna kategori ger möjlighet att bearbeta mellan godtyckliga punkter utanför den ursprungliga grafen." +#~ msgid "`#2706 `__ winnie crashing on pgr_betweennessCentrality" +#~ msgstr "`#2706 `__ winnie kraschar på pgr_betweennessCentrality" -msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." -msgstr "Denna kategori av funktioner var tänkt för att dirigera fordon, men kan lika gärna fungera för någon annan applikation som inte involverar fordon." +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.1 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.7.1 `__" -msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." -msgstr "När man får en punktidentifierare ``pid`` som mappas till en kant med en identifierare ``edge_id``, med en fraktion från källan till målet längs kanten ``fraktion`` och lite ytterligare information om vilken sida av kanten punkten ligger på ``side``, kan bearbetning från godtyckliga punkter göras på fasta nätverk." +#~ msgid "`#2680 `__ fails to compile under mingw64 gcc 13.2" +#~ msgstr "`#2680 `__ kan inte kompileras under mingw64 gcc 13.2" -msgid "All this functions consider as many traits from the \"real world\" as possible:" -msgstr "Alla dessa funktioner tar hänsyn till så många egenskaper från den \"verkliga världen\" som möjligt:" +#~ msgid "`#2689 `__ When point is a vertex, the withPoints family do not return results." +#~ msgstr "`#2689 `__ När punkten är en vertex ger inte withPoints-familjen några resultat." -msgid "Kind of graph:" -msgstr "Typ av graf:" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.0 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.7.0 `__" -msgid "**directed** graph" -msgstr "**directed** graph" +#~ msgid "`#2656 `__ Stop support of PostgreSQL12 on pgrouting v3.7" +#~ msgstr "`#2656 `__ Stoppa stöd för PostgreSQL12 på pgrouting v3.7" -msgid "**undirected** graph" -msgstr "**Omdirigerad** graf" +#~ msgid "`#2605 `__ Standardize spanning tree functions output" +#~ msgstr "`#2605 `__ Standardisera utdata för funktioner för spänningsträd" -msgid "Arriving at the point:" -msgstr "Anländer till punkten:" +#~ msgid "`#2635 `__ pgr_LineGraph ignores directed flag and use negative values for identifiers." +#~ msgstr "`#2635 `__ pgr_LineGraph ignorerar directed flag och använder negativa värden för identifierare." -msgid "Compulsory arrival on the side of the segment where the point is located." -msgstr "Obligatorisk ankomst på den sida av segmentet där punkten är belägen." +#~ msgid "`#2599 `__ Driving distance cleanup" +#~ msgstr "`#2599 `__ Körsträcka uppstädning" -msgid "On either side of the segment." -msgstr "På vardera sidan om segmentet." +#~ msgid "`#2607 `__ Read postgresql data on C++" +#~ msgstr "`#2607 `__ Läsa postgresql-data på C++" -msgid "Countries with:" -msgstr "Länder med:" +#~ msgid "`#2614 `__ Clang tidy does not work" +#~ msgstr "`#2614 `__ Clang tidy fungerar inte" -msgid "**Right** side driving" -msgstr "*körning på *höger** sida" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.3 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.6.3 `__" -msgid "**Left** side driving" -msgstr "**Vänster** sida körning" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.2 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.6.2 `__" -msgid "Some points are:" -msgstr "Några punkter är:" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.1 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.6.1 `_" -msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." -msgstr "**Permanent**: t.ex. en uppsättning punkter för kunder som lagras i en tabell i databasen." +#~ msgid "`#2588 `__ pgrouting 3.6.0 fails to build on OSX" +#~ msgstr "`#2588 `__ pgrouting 3.6.0 går inte att bygga under OSX" -msgid "The graph has been modified to permanently have those points as vertices." -msgstr "Grafen har ändrats så att den permanent har dessa punkter som hörn." +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.0 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.6.0 `_" -msgid "There is a table on the database that describes the points" -msgstr "Det finns en tabell i databasen som beskriver punkterna" +#~ msgid "`#2516 `__ Standardize output pgr_aStar" +#~ msgstr "`#2516 `__ Standardisera utdata pgr_aStar" -msgid "**Temporal**: for example points given through a web application" -msgstr "**Temporal**: till exempel punkt som ges via en webbapplikation" +#~ msgid "`#2523 `__ Standardize output pgr_bdAstar" +#~ msgstr "`#2523 `__ Standardisera utdata pgr_bdAstar" -msgid "The numbering of the points are handled with negative sign." -msgstr "Numreringen av punkterna hanteras med negativt tecken." +#~ msgid "`#2547 `__ Standardize output and modifying signature pgr_KSP" +#~ msgstr "`#2547 `__ Standardisera utdata och ändra signatur pgr_KSP" -msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." -msgstr "Denna teckenändring är till för att undvika förvirring när det finns en topp med samma identifierare som punktens identifierare." +#~ msgid "`#2548 `__ Standardize output pgr_drivingDistance" +#~ msgstr "`#2548 `__ Standardisera utdata pgr_drivingDistance" -msgid "Original point identifiers are to be positive." -msgstr "Ursprungliga punktidentifierare ska vara positiva." +#~ msgid "`#2544 `__ Standardize output and modifying signature pgr_withPointsDD" +#~ msgstr "`#2544 `__ Standardisera utdata och ändra signaturen pgr_withPointsDD" -msgid "Transformation to negative is done internally." -msgstr "Omvandling till negativ sker internt." +#~ msgid "`#2546 `__ Standardize output and modifying signature pgr_withPointsKSP" +#~ msgstr "`#2546 `__ Standardisera utdata och ändra signaturen pgr_withPointsKSP" -msgid "Interpretation of the sign on the node information of the output" -msgstr "Tolkning av tecknet på noden information om utdata" +#~ msgid "`#2504 `__ To C++ pg data get, fetch and check." +#~ msgstr "`#2504 `__ Till C++ pg-data hämta, hämta och kontrollera." -msgid "positive sign is a vertex of the original graph" -msgstr "positivt tecken är ett toppunkt i den ursprungliga grafen" +#~ msgid "`#2505 `__ Using namespace." +#~ msgstr "`#2505 `__ Använder namnområde." -msgid "negative sign is a point of the `Points SQL`_" -msgstr "negativt tecken är en punkt i `Points SQL`_" +#~ msgid "`#2512 `__ [Dijkstra] Removing duplicate code on Dijkstra." +#~ msgstr "`#2512 `__ [Dijkstra] Borttagning av duplicerad kod på Dijkstra." -msgid "About points" -msgstr "Om punkt" +#~ msgid "`#2517 `__ Astar code simplification." +#~ msgstr "`#2517 `__ Förenkling av Astar-koden." -msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." -msgstr "I detta avsnitt kommer följande stad (se :doc:`sampledata`) att användas som exempel: några intressanta punkter såsom restaurang, snabbköp, postkontor etc." +#~ msgid "`#2521 `__ Dijkstra code simplification." +#~ msgstr "`#2521 `__ Dijkstra kodförenkling." -msgid "The graph is **directed**" -msgstr "Grafen är **riktad**" +#~ msgid "`#2522 `__ bdAstar code simplification." +#~ msgstr "`#2522 `__ bdAstar kodförenkling." -msgid "Red arrows show the ``(source, target)`` of the edge on the edge table" -msgstr "Röda pilar visar ``(källa, mål)`` för kanten i kanttabellen" +#~ msgid "`#2490 `__ Automatic page history links." +#~ msgstr "`#2490 `__ Automatiska länkar till sidans historik." -msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" -msgstr "Blå pilar visar ``(mål, källa)`` för kanten i kanttabellen" +#~ msgid "`#2555 `__ Standardize deprecated messages" +#~ msgstr "`#2555 `__ Standardisera föråldrade meddelanden" -msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" -msgstr "Varje punktposition visar var den är belägen i förhållande till kanten ``(källa, mål)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.5.1 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av den här versionen, se `Git stängd milstolpe för 3.5.1 `_" -msgid "On the right for points **2** and **4**." -msgstr "Till höger för punkterna **2** och **4**." +#~ msgid "`#2565 `__ pgr_lengauerTarjanDominatorTree triggers an assertion" +#~ msgstr "`#2565 `__ pgr_lengauerTarjanDominatorTree utlöser ett påstående" -msgid "On the left for points **1**, **3** and **5**." -msgstr "Till vänster för punkterna **1**, **3** och **5**." +#~ msgid "`#2561 `__ Not use wildcards on SQL" +#~ msgstr "`#2561 `__ Använd inte jokertecken i SQL" -msgid "On both sides for point **6**." -msgstr "På båda sidor för punkt **6**." +#~ msgid "`#2559 `__ pgtap test using sampledata" +#~ msgstr "`#2559 `__ pgtap-test med sampledata" -msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" -msgstr "Representationen på databasen följer `Points SQL`_-beskrivningen, och för detta exempel:" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.5.0 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.5.0 `_" -msgid "Driving side" -msgstr "Körning på sidan" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.2 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.2 `_" -msgid "In the following images:" -msgstr "I följande bilder:" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.1 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.1 `_" -msgid "The squared vertices are the temporary vertices," -msgstr "De kvadrerade topparna är de tillfälliga topparna," +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.0 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.0 `_" -msgid "The temporary vertices are added according to the driving side," -msgstr "De tillfälliga topparna läggs till enligt körsidan," +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.4 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.4 `_" -msgid "visually showing the differences on how depending on the driving side the data is interpreted." -msgstr "visar visuellt skillnaderna i hur data tolkas beroende på vilken sida som kör." +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.3 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.3 `_" -msgid "Point **1** located on edge ``(6, 5)``" -msgstr "Punkt **1** belägen på kanten ``(6, 5)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.2 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.2 `_" -msgid "Point **2** located on edge ``(16, 17)``" -msgstr "Punkt **2** belägen på kanten ``(16, 17)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.3.1 `_ på Github." -msgid "Point **3** located on edge ``(8, 12)``" -msgstr "Punkt **3** belägen på kanten ``(8, 12)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.3.0 `_ på Github." -msgid "Point **4** located on edge ``(1, 3)``" -msgstr "Punkt **4** belägen på kanten ``(1, 3)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.2 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.2 `_ på Github." -msgid "Point **5** located on edge ``(10, 11)``" -msgstr "Punkt **5** belägen på kanten ``(10, 11)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.1 `_ på Github." -msgid "Point **6** located on edges ``(6, 7)`` and ``(7, 6)``" -msgstr "Punkt **6** belägen på kanterna ``(6, 7)`` och ``(7, 6)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.0 `_ på Github." -msgid "Point **1** located on edge ``(5, 6)``" -msgstr "Punkt **1** belägen på kanten ``(5, 6)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.4 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.4 `_ på Github." -msgid "Point **2** located on edge ``(17, 16)``" -msgstr "Punkt **2** belägen på kanten ``(17, 16)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.3 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.3 `_ på Github." -msgid "Point **4** located on edge ``(3, 1)``" -msgstr "Punkt **4** belägen på kanten ``(3, 1)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.2 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.2 `_ på Github." -msgid "Like having all points to be considered in both sides ``b``" -msgstr "Som att ha alla punkter att överväga på båda sidor ``b``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.1 `_ på Github." -msgid "Preferred usage on **undirected** graphs" -msgstr "Företrädesvis användning på **undirected** grafer" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.0 `_ på Github." -msgid "On the :doc:`TRSP-family` this option is not valid" -msgstr "På :doc:`TRSP-family` är detta alternativ inte giltigt" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.6 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.6 `_ på Github." -msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``" -msgstr "Punkt **1** belägen på kanten ``(5, 6)`` och ``(6, 5)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.5 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.5 `_ på Github." -msgid "Point **2** located on edge ``(17, 16)``and ``16, 17``" -msgstr "Punkt **2** belägen på kanten ``(17, 16)`` och ``16, 17``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.4 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.4 `_ på Github." -msgid "Point **4** located on edge ``(3, 1)`` and ``(1, 3)``" -msgstr "Punkt **4** belägen på kanten ``(3, 1)`` och ``(1, 3)``" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.2 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.2 `_ på Github." -msgid "Creating temporary vertices" -msgstr "Skapa tillfälliga vertikaler" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.1 `_ på Github." -msgid "This section will demonstrate how a temporary vertex is created internally on the graph." -msgstr "I detta avsnitt visas hur ett tillfälligt toppunkt skapas internt i grafen." +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.0 `_ på Github." -msgid "Problem" -msgstr "Problem" +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.3 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.3 `_ på Github." -msgid "For edge:" -msgstr "För kant:" +#~ msgid "`#1219 `__ Implicit cast for via_path integer to text" +#~ msgstr "`#1219 `__ Implicit kast för via_path integer till text" -msgid "insert point:" -msgstr "infoga punkt:" +#~ msgid "`#1193 `__ Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +#~ msgstr "`#1193 `__ Fixat att pgr_pointsAsPolygon gick sönder när strängar jämfördes i WHERE-satsen" -msgid "On a right hand side driving network" -msgstr "På ett körfält med höger sida" +#~ msgid "`#1185 `__ Improve FindPostgreSQL.cmake" +#~ msgstr "`#1185 `__ Förbättra FindPostgreSQL.cmake" -msgid "Arrival to point ``-2`` can be achieved only via vertex **16**." -msgstr "Ankomst till punkt ``-2`` kan endast ske via toppunkt **16**." +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.2 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.2 `_ på Github." -msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept." -msgstr "Påverkar inte kanten ``(17, 16)``, därför behålls kanten." +#~ msgid "`#1152 `__ Fixes driving distance when vertex is not part of the graph" +#~ msgstr "`#1152 `__ Korrigerar körsträcka när toppunkten inte är en del av grafen" -msgid "It only affects the edge ``(16, 17)``, therefore the edge is removed." -msgstr "Det påverkar bara kanten ``(16, 17)``, därför tas kanten bort." +#~ msgid "`#1098 `__ Fixes windows test" +#~ msgstr "`#1098 `__ Åtgärdar Windows-test" -msgid "Create two new edges:" -msgstr "Skapa två nya kanter:" +#~ msgid "`#1165 `__ Fixes build for python3 and perl5" +#~ msgstr "`#1165 `__ Fixar byggsätt för python3 och perl5" -msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" -msgstr "Kant ``(16, -2)`` med kostnad ``0.4`` (ursprunglig kostnad * fraktion == :math:`1 * 0.4`)" +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.1 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.1 `_ på Github." -msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" -msgstr "Kant ``(-2, 17)`` med kostnad ``0,6`` (den återstående kostnaden)" +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.0 `_ på Github." -msgid "The total cost of the additional edges is equal to the original cost." -msgstr "Den totala kostnaden för de extra kanterna är lika stor som den ursprungliga kostnaden." +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.5 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.5 `_ på Github." -msgid "If more points are on the same edge, the process is repeated recursevly." -msgstr "Om fler punkter ligger på samma kant upprepas processen om och om igen." +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.4 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.4 `_ på Github." -msgid "On a left hand side driving network" -msgstr "På en vänster sida av körfältet" +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.3 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.3 `_ på Github." -msgid "Arrival to point ``-2`` can be achieved only via vertex **17**." -msgstr "Ankomst till punkt ``-2`` kan endast ske via toppunkt **17**." +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.2 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.2 `_ på Github." -msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept." -msgstr "Påverkar inte kanten ``(16, 17)``, därför behålls kanten." +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.1 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.1 `_ på Github." -msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." -msgstr "Det påverkar bara kanten ``(17, 16)``, därför tas kanten bort." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.5.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.5.0 `_ på Github." -msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" -msgstr "Arbeta med den ursprungliga kanten ``(16, 17)`` eftersom bråkdelen är en bråkdel av den ursprungliga:" +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.4.2 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.4.2 `_ på Github." -msgid "Flip the Edges and add them to the graph:" -msgstr "Vänd på kanterna och lägg till dem i grafen:" +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.4.1 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.4.1 `_ på Github." -msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." -msgstr "Kanten ``(17, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.4.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.4.0 `_ på Github." -msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." -msgstr "Kanten ``(-2, 16)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.2 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.3.2 `_ på Github." -msgid "When driving side does not matter" -msgstr "När körsidan inte spelar någon roll" +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.1 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.3.1 `_ på Github." -msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." -msgstr "Ankomst till punkt ``-2`` kan uppnås via topparna **16** eller **17**." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.3.0 `_ på Github." -msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." -msgstr "Påverkar kanterna ``(16, 17)`` och ``(17, 16)``, därför tas kanterna bort." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.4 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.4 `_ på Github." -msgid "Create four new edges:" -msgstr "Skapa fyra nya kanter:" +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.3 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.3 `_ på Github." -msgid "Flip the Edges and add all the edges to the graph:" -msgstr "Vänd på Edges och lägg till alla kanter i grafen:" +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.2 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.2 `_ på Github." -msgid "Edge ``(16, -2)`` is added to the graph." -msgstr "Kanten ``(16, -2)`` läggs till i grafen." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.1 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.1 `_ på Github." -msgid "Edge ``(-2, 17)`` is added to the graph." -msgstr "Kanten ``(-2, 17)`` läggs till i grafen." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av denna utgåva, se `Git stängda problem för 2.2.0 `_ på Github." -msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." -msgstr "Kanten ``(16, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.1.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av denna utgåva, se `Git stängda problem för 2.1.0 `_ på Github." -msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." -msgstr "Kanten ``(-2, 17)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen." +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.0.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.0.0 `_ på Github." -msgid "withPoints - Family of functions" -msgstr "withPoints - Familj av funktioner" +#~ msgid "Mailing List and GIS StackExchange" +#~ msgstr "Mailinglista och GIS StackExchange" -msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm." -msgstr "Denna familj av funktioner tillhör :doc:`withPoints-category` och de funktioner som ingår i dem är på ett eller annat sätt baserade på dijkstra-algoritmen." +#~ msgid "There are two mailing lists for pgRouting hosted on OSGeo mailing list server:" +#~ msgstr "Det finns två e-postlistor för pgRouting som finns på OSGeo mailing list server:" -msgid "Depending on the name:" -msgstr "Beroende på namnet:" +#~ msgid "User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" +#~ msgstr "E-postlista för användare: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" -msgid "pgr_withPoints is pgr_dijkstra **with points**" -msgstr "pgr_withPoints is pgr_dijkstra **with points**" +#, fuzzy +#~ msgid "Regina Obe, Saloni kumari, Vicky Vergara" +#~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" -msgid "pgr_withPointsCost is pgr_dijkstraCost **with points**" -msgstr "pgr_withPointsCost is pgr_dijkstraCost **with points**" +#, fuzzy +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgid "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**" -msgstr "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**" +#, fuzzy +#~ msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graphs acyclic graph." +#~ msgstr ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." -msgid "pgr_withPointsKSP is pgr_ksp **with points**" -msgstr "pgr_withPointsKSP is pgr_ksp **with points**" +#, fuzzy +#~ msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara" +#~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" -msgid "pgr_withPointsDD is pgr_drivingDistance **with points**" -msgstr "pgr_withPointsDD is pgr_drivingDistance **with points**" +#, fuzzy +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" -msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" +#~ msgid "Aurélie Bousquet, Regina Obe, Vicky Vergara" +#~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index 452aa90fab..df5917cabc 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -12,7 +12,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-12-10 19:55+0000\n" +"POT-Creation-Date: 2026-03-04 00:25+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) \n" @@ -3548,10479 +3548,10563 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" -msgid "pgRouting 4.0" -msgstr "pgRouting 4.0" - #, fuzzy -msgid "pgRouting 4.0.0-alpha1 Release Notes" -msgstr "pgRouting 4.0.0 发布说明" +msgid "pgRouting 4.1.0 Release Notes" +msgstr "pgRouting 3.1.0 发布说明" #, fuzzy -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" -msgid "Build" -msgstr "构建" - -msgid "C++ standard is std17" -msgstr "" - -msgid "Using this standard, all supported toolchains across our CI matrix will work." -msgstr "" - -msgid "The code is not yet modified to use std17:" -msgstr "" - -msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." -msgstr "" - #, fuzzy -msgid "The user's documentation is built by default." -msgstr "用于用户文档" +msgid "Code enhancements" +msgstr "代码改进" #, fuzzy -msgid "The doxygen documentation is built by default." -msgstr "用于用户文档" +msgid "`#3049 `__: Use enumeration on drivers and process." +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "For developers:" -msgstr "对于开发者文档" - -msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." -msgstr "" +msgid "`#3054 `__: Change error message when edges_sql is empty" +msgstr "`#1640 `__: pgr_withPoints 在 points_sql 为空时失败" -msgid "Tidy checks are done on CI." -msgstr "" +#, fuzzy +msgid "`#3055 `__: bdDijkstra: use the shortest_path process and driver" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "Documentation build" -msgstr "文档" +msgid "`#3056 `__: edwardMoore: use the shortest_path process and driver" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "The doxygen documentation is built by default" -msgstr "用于用户文档" +msgid "`#3060 `__: dagShortestPath: use the shortest_path process and driver" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "The HTML documentation is built by default" -msgstr "用于用户文档" +msgid "`#3064 `__: Astar: create and use a process and driver for Astar" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" -msgstr "用于用户文档" +msgid "`#3075 `__: Spanning tree: create and use a process and driver" +msgstr "`#2683 `__: pgr_trsp" -msgid "`WITH-DOC` is not used anymore" -msgstr "" +#, fuzzy +msgid "`#3086 `__: MaxFlow: create and use a process and driver" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "User Documentation is not built when" -msgstr "对于开发者文档" +msgid "`#3089 `__: edgeDisjoint and bellmanFord use shortestPath driver and process" +msgstr "`#2683 `__: pgr_trsp" -msgid "Sphinx is not found" -msgstr "" +msgid "All releases" +msgstr "所有版本" -msgid "When all Sphinx formats are OFF" -msgstr "" +msgid "Kruskal - Family of functions" +msgstr "Kruskal - 函数族" -msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" -msgstr "" +msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgstr "克鲁斯卡尔算法是一种贪婪的最小生成树算法，它在每个循环中查找并添加连接森林中任意两棵树的最小可能权重的边。" -msgid "When all languages are OFF" -msgstr "" +msgid "**The main Characteristics are:**" +msgstr "**主要特点是：**" -msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" -msgstr "" +msgid "The total weight of all the edges in the tree or forest is minimized." +msgstr "树或森林中所有边的总权重最小化。" -msgid "Documentation output location: ``build/doc/_build/``" -msgstr "" +msgid "Kruskal's running time: :math:`O(E * log E)`" +msgstr "克鲁斯卡尔的运行时间： :math:`O(E * log E)`" -msgid "For example: for HTML output is on `build/doc/_build/html` directory" -msgstr "" +msgid "Metrics - Family of functions" +msgstr "Metrics - 功能系列" -#, fuzzy -msgid "Developers' Documentation is not built when" -msgstr "对于开发者文档" +msgid "Migration guide" +msgstr "迁移指南" -msgid "Doxygen is not found" -msgstr "" +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." +msgstr "多个函数的签名发生了变化，和/或已被新函数取代。" -msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" -msgstr "" +msgid "Results can be different because of the changes." +msgstr "结果可能会因变化而不同。" -msgid "Summary of changes by function" -msgstr "" +msgid "All deprecated functions will be removed on next major version 4.0.0" +msgstr "所有已弃用函数将在下一个主版本 4.0.0 中被移除" -msgid "pgr_aStar" -msgstr "pgr_aStar" +#, fuzzy +msgid "Migration to standardized columns" +msgstr "限制迁移" -msgid "Combinations signature promoted to official." -msgstr "组合签名已升级为正式版本。" +msgid "There has been an effort to standardize function output columns names and types." +msgstr "" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgid "pgr_bandwidth" -msgstr "pgr_bandwidth" +#, fuzzy +msgid "|matrix-result|" +msgstr "|matrix-result| 的集合" -msgid "New experimental function." -msgstr "新实验性功能。" +msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgid "pgr_bdAstar" -msgstr "pgr_bdAstar" +#, fuzzy +msgid "|short-generic-result|" +msgstr "返回集合 |short-generic-result|" -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" +msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgid "pgr_bdDijkstra" -msgstr "pgr_bdDijkstra" +msgid "|result-spantree|" +msgstr "|result-spantree|" #, fuzzy -msgid "Output columns standardized to |short-generic-result|" -msgstr "输出列是 |old-generic-result|" - -msgid "pgr_bdDijkstraCost" -msgstr "pgr_bdDijkstraCost" +msgid "Function" +msgstr "新函数:" -msgid "pgr_bellmanFord" -msgstr "pgr_bellmanFord" +msgid ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_dijkstra`" -msgid "pgr_binaryBreadthFirstSearch" -msgstr "pgr_binaryBreadthFirstSearch" +#, fuzzy +msgid "`Migration of single path functions`_" +msgstr "`迁移限制`_" -msgid "pgr_bipartite" -msgstr "pgr_bipartite" +#, fuzzy +msgid ":doc:`pgr_aStar`" +msgstr ":doc:`pgr_aStarCost`" #, fuzzy -msgid "Output columns standardized to |result_node_color|" -msgstr "输出列是 |ksp-result|" +msgid ":doc:`pgr_bdAstar`" +msgstr ":doc:`pgr_bdAstarCost`" -msgid "pgr_boykovKolmogorov" -msgstr "pgr_boykovKolmogorov" +msgid ":doc:`pgr_drivingDistance`" +msgstr ":doc:`pgr_drivingDistance`" -msgid "pgr_breadthFirstSearch" -msgstr "pgr_breadthFirstSearch" +#, fuzzy +msgid "`Migration of spanning tree functions`_" +msgstr "`迁移限制`_" -msgid ":" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_withPointsDD`" +msgstr ":doc:`pgr_withPoints`" -msgid "Standardizing output columns to |result-spantree|" -msgstr "将输出列标准化为 |result-spantree|" +#, fuzzy +msgid ":doc:`pgr_bdDijkstra`" +msgstr ":doc:`pgr_dijkstra`" -msgid "pgr_contraction" -msgstr "pgr_contraction" +#, fuzzy +msgid ":doc:`pgr_binaryBreadthFirstSearch`" +msgstr "pgr_binaryBreadthFirstSearch" -msgid "Breaking change, signatures no longer available:" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_bipartite`" +msgstr ":doc:`pgr_prim`" -msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +#, fuzzy +msgid "`Migration of output column name change`_" +msgstr "`迁移限制`_" -msgid "pgr_dagShortestPath" -msgstr "pgr_dagShortestPath" +#, fuzzy +msgid ":doc:`pgr_breadthFirstSearch`" +msgstr "pgr_binaryBreadthFirstSearch" -msgid "pgr_depthFirstSearch" +#, fuzzy +msgid ":doc:`pgr_depthFirstSearch`" msgstr "pgr_depthFirstSearch" -msgid "pgr_dijkstra" -msgstr "pgr_dijkstra" - -msgid "pgr_dijkstraCost" -msgstr "pgr_dijkstraCost" +#, fuzzy +msgid ":doc:`pgr_edgeColoring`" +msgstr "pgr_edgeColoring" -msgid "pgr_dijkstraNear" -msgstr "pgr_dijkstraNear" +#, fuzzy +msgid "`Migration of multiple paths functions`_" +msgstr "`迁移限制`_" -msgid "Function promoted to official." -msgstr "函数正式发布。" +#, fuzzy +msgid ":doc:`pgr_sequentialVertexColoring`" +msgstr "pgr_sequentialVertexColoring" -msgid "pgr_dijkstraNearCost" -msgstr "pgr_dijkstraNearCost" +#, fuzzy +msgid ":doc:`pgr_topologicalSort`" +msgstr "pgr_topologicalSort" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" +msgid ":doc:`pgr_withPoints`" +msgstr ":doc:`pgr_withPoints`" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +#, fuzzy +msgid "`Migration of cost functions`_" +msgstr "`迁移限制`_" #, fuzzy -msgid "Output columns standardized to |result_edge_color|" -msgstr "输出列是 |ksp-result|" +msgid "Migration of cost functions" +msgstr "限制迁移" -msgid "pgr_edgeDisjointPaths" -msgstr "pgr_edgeDisjointPaths" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgstr "" + +msgid "The following functions need to be migrated when they are being used in an application." +msgstr "" #, fuzzy -msgid "Output columns standardized to |generic-result|" -msgstr "输出列是 |old-generic-result|" +msgid "Version" +msgstr "版本3.0" -msgid "pgr_edmondsKarp" -msgstr "pgr_edmondsKarp" +msgid "From" +msgstr "" -msgid "pgr_edwardMoore" -msgstr "pgr_edwardMoore" - -msgid "Version 3.2.0" -msgstr "版本3.2.0" - -msgid "New experimental signature:" -msgstr "新实验性签名：" - -msgid "pgr_edwardMoore(Combinations)" -msgstr "pgr_edwardMoore(组合)" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" -msgid "Version 3.0.0" -msgstr "版本3.0.0" +msgid "v < 4.0" +msgstr "" -msgid "pgr_kingOrdering" -msgstr "pgr_kingOrdering" +#, fuzzy +msgid "|matrix-pid|" +msgstr "返回 |matrix-pid| 的集合" -msgid "pgr_KSP" -msgstr "pgr_KSP" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" -msgid "All signatures promoted to official." -msgstr "所有签名均已升级为正式版本。" +#, fuzzy +msgid "**to** |matrix-result|" +msgstr "|matrix-result| 的集合" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +#, fuzzy +msgid "Migration of |matrix-pid|" +msgstr "限制迁移" -msgid "pgr_maxCardinalityMatch(text,boolean)" -msgstr "pgr_maxCardinalityMatch(text,boolean)" +msgid "Signatures to be migrated:" +msgstr "要迁移的签名：" -msgid "pgr_maxFlow" -msgstr "pgr_maxFlow" +msgid "One to One" +msgstr "One to One" -msgid "pgr_pushRelabel" -msgstr "pgr_pushRelabel" +msgid "One to Many" +msgstr "One to Many" -msgid "pgr_sequentialVertexColoring" -msgstr "pgr_sequentialVertexColoring" +msgid "Many to One" +msgstr "Many to One" -msgid "pgr_sloanOrdering" -msgstr "pgr_sloanOrdering" +msgid "Many to Many" +msgstr "Many to Many" -msgid "pgr_topologicalSort" -msgstr "pgr_topologicalSort" +msgid "Combinations" +msgstr "组合" #, fuzzy -msgid "Standardize output to |result_node_order|" -msgstr "返回集合 |result-node-color|" +msgid "Breaking change" +msgstr "重大变更：" -msgid "pgr_transitiveClosure" -msgstr "pgr_transitiveClosure" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgstr "" #, fuzzy -msgid "Standardized output to |result-closure|" -msgstr "将输出列标准化为 |result-spantree|" - -msgid "pgr_trsp" -msgstr "pgr_trsp" - -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" - -msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" - -msgid "pgr_trspVia" -msgstr "pgr_trspVia" +msgid "New output columns are |matrix-result|" +msgstr "输出列是 |ksp-result|" -#, fuzzy -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgstr "" -msgid "pgr_trspVia_withPoints" -msgstr "pgr_trspVia_withPoints" +msgid "Examples" +msgstr "示例" #, fuzzy -msgid "**Driving side** parameter is positional unnamed." -msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" +msgid "Examples for One to One for cost functions" +msgstr "成本函数结果列" #, fuzzy -msgid "Valid values depend on kind of graph" -msgstr "有效值因有向图和无向图而异：" +msgid "Using ``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" #, fuzzy -msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" -msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "from" +msgstr "从" -msgid "pgr_trsp_withPoints" -msgstr "pgr_trsp_withPoints" +msgid "to" +msgstr "到" #, fuzzy -msgid "**Driving side** parameter is positional unnamed and compulsory." -msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" +msgid "Examples for One to Many for cost functions" +msgstr "成本函数结果列" #, fuzzy -msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Examples for Many to One for cost functions" +msgstr "成本函数结果列" #, fuzzy -msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Examples for Many to Many for cost functions" +msgstr "成本函数结果列" #, fuzzy -msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" -msgid "pgr_TSP" -msgstr "pgr_TSP" +#, fuzzy +msgid "Examples for Combinations for cost functions" +msgstr "成本函数结果列" #, fuzzy -msgid "Results change depending on input order" -msgstr "结果按以下顺序递增排序：" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "Only for undirected graphs" -msgstr "在无向图上：" +msgid "Migration of multiple paths functions" +msgstr "限制迁移" #, fuzzy -msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" +msgstr "将输出列标准化为 |short-generic-result|" -msgid "pgr_TSPeuclidean" -msgstr "pgr_TSPeuclidean" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" -#, fuzzy -msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" -msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "v < 3.6" +msgstr "" -msgid "pgr_turnRestrictedPath" -msgstr "pgr_turnRestrictedPath" +msgid ":ref:`from_ksp_result`" +msgstr ":ref:`from_ksp_result`" -#, fuzzy -msgid "Output columns standardized to |nksp-result|" -msgstr "输出列是 |ksp-result|" +msgid "``pgr_edgeDisjointPaths``" +msgstr "``pgr_edgeDisjointPaths``" -msgid "pgr_withPoints" -msgstr "pgr_withPoints" +msgid ":ref:`from_result_disjoint`" +msgstr ":ref:`from_result_disjoint`" #, fuzzy -msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Migration of |ksp-result|" +msgstr "返回 |old-pid-result| 的集合" #, fuzzy -msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "|nksp-result|" +msgstr "|ksp-result|" #, fuzzy -msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Before updating pgRouting, enumerate the |ksp-result|" +msgstr "结果列的重大变化" + +msgid "One to One example using ``pgr_KSP``" +msgstr "" + +msgid "Using `this `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Migration of |result-disjoint|" +msgstr "|result-dij-dd|" #, fuzzy -msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Before updating pgRouting, enumerate the |result-disjoint|" +msgstr "结果列的重大变化" -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" +msgid "Skip when applicable, ``start_vid``" +msgstr "" #, fuzzy -msgid "**Driving side** parameter is unnamed and compulsory." -msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" +msgid "Skip when applicable, ``end_vid``" +msgstr "然后按 ``end_vid``" #, fuzzy -msgid "Output columns standardized to |matrix-result|" -msgstr "输出列是 |ksp-result|" +msgid "One to One example using ``pgr_edgeDisjointPaths``" +msgstr "``pgr_edgeDisjointPaths``" #, fuzzy -msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -msgstr "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -msgstr "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgid "Before updating pgRouting enumerate the columns: |ksp-result|" +msgstr "结果列的重大变化" #, fuzzy -msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "Migration of single path functions" +msgstr "限制迁移" #, fuzzy -msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" +msgstr "将输出列标准化为 |short-generic-result|" -#, fuzzy -msgid "pgr_withpointscost(text,text,text,boolean,character)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "``pgr_dijkstra``" +msgstr "``pgr_dijkstra``" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" +msgid "v < 3.5" +msgstr "" #, fuzzy -msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "|old-generic-result|" +msgstr "|nksp-result|" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" +msgid "``pgr_aStar``" +msgstr "``pgr_aStar``" -msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" -msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "``pgr_bellmanFord``" +msgstr "``pgr_bellmanFord``" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" +msgid "``pgr_dagShortestPath``" +msgstr "``pgr_dagShortestPath``" #, fuzzy -msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" - -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" +msgid "|result-1-1|" +msgstr "|result-bfs|" -#, fuzzy -msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "``pgr_edwardMoore``" +msgstr "``pgr_edwardMoore``" -msgid "Functions promoted to official" -msgstr "正式版功能函数" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" #, fuzzy -msgid "`#2701 `__: pgr_trsp" -msgstr "`#2683 `__: pgr_trsp" +msgid "|old-pid-result|" +msgstr "|ksp-result|" #, fuzzy -msgid "`#2701 `__: pgr_trspVia" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "Migration of |old-generic-result|" +msgstr "返回 |old-generic-result| 的集合" -#, fuzzy -msgid "`#2701 `__: pgr_trspVia_withPoints" -msgstr "`#2683 `__: pgr_trsp" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" +msgstr "" #, fuzzy -msgid "`#2701 `__: pgr_trsp_withPoints" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration of |old-pid-result|" +msgstr "返回 |old-pid-result| 的集合" -#, fuzzy -msgid "`#2700 `__: pgr_withPoints" -msgstr "`#2683 `__: pgr_trsp" +msgid "To get the old version column names, depending on the signature:" +msgstr "" #, fuzzy -msgid "`#2700 `__: pgr_withPointsCost" -msgstr "`#2683 `__: pgr_trsp" +msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" +msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" #, fuzzy -msgid "`#2700 `__: pgr_withPointsCostMatrix" -msgstr "`#2683 `__: pgr_trsp" +msgid "Rename the columns:" +msgstr "结果列" #, fuzzy -msgid "`#2700 `__: pgr_withPointsDD" -msgstr "`#2683 `__: pgr_trsp" +msgid "``start_vid`` to ``start_pid``" +msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。" #, fuzzy -msgid "`#2700 `__: pgr_withPointsKSP" -msgstr "`#2683 `__: pgr_trsp" +msgid "``end_vid`` to ``end_pid``" +msgstr "``end_vid`` 升序" -#, fuzzy -msgid "`#2700 `__: pgr_withPointsVia" -msgstr "`#2683 `__: pgr_trsp" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" +msgstr "" #, fuzzy -msgid "`#2983 `__: pgr_dijkstraNear" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration of |result-1-1|" +msgstr "返回 |result-1-1| 的集合" #, fuzzy -msgid "`#2983 `__: pgr_dijkstraNearCost" -msgstr "`#2683 `__: pgr_trsp" +msgid "To get the old version column names:" +msgstr "获取原始列名：" #, fuzzy -msgid "`#2983 `__: pgr_dijkstraVia" -msgstr "`#2683 `__: pgr_trsp" - -msgid "Signatures promoted to official" -msgstr "正式版函数签名" +msgid "Filter out the columns: ``start_vid`` and ``end_vid``" +msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" #, fuzzy -msgid "`#2718 `__: pgr_aStar(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Examples with One to One with one route result" +msgstr "使用示例（无结果输出）" #, fuzzy -msgid "`#2718 `__: pgr_aStarCost(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Using ``pgr_aStar``" +msgstr "``pgr_aStar``" #, fuzzy -msgid "`#2718 `__: pgr_bdAstar(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" -#, fuzzy -msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Before updating pgRouting enumerate the columns: |result-1-1|" +msgstr "" #, fuzzy -msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Using ``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" #, fuzzy -msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "`#2718 `__: pgr_dijkstra(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Using ``pgr_DAGshortestPath``" +msgstr "``pgr_bdAstar``" #, fuzzy -msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" -#, fuzzy -msgid "`#2718 `__: pgr_KSP(All signatures)" -msgstr "`#2683 `__: pgr_trsp" +msgid "This applies to all signatures of ``pgr_DAGshortestPath``" +msgstr "" #, fuzzy -msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Examples for One to Many with one route result" +msgstr "使用示例（无结果输出）" #, fuzzy -msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Using ``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" #, fuzzy -msgid "`#2718 `__: pgr_maxFlow(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" + +msgid "Before updating pgRouting enumerate the columns: |result-1-m|" +msgstr "" #, fuzzy -msgid "`#2718 `__: pgr_pushRelabel(Combinations)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Using ``pgr_withPoints``" +msgstr "使用 :doc:`pgr_withPoints`" #, fuzzy -msgid "New experimental functions." -msgstr "新实验性函数" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" -msgid "Metrics" -msgstr "Metrics" +msgid "|pid-1-m|" +msgstr "" #, fuzzy -msgid "`#2951 `__: pgr_bandwidth" -msgstr "`#2683 `__: pgr_trsp" - -msgid "Ordering" -msgstr "排序" +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." +msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" #, fuzzy -msgid "`#2954 `__: pgr_kingOrdering" -msgstr "`#2683 `__: pgr_trsp" +msgid "Examples for Many to One with one route result" +msgstr "使用示例（无结果输出）" #, fuzzy -msgid "`#2955 `__: pgr_sloanOrdering" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" -msgid "SQL signatures and output standardization" +msgid "Before updating pgRouting enumerate the columns: |result-m-1|" msgstr "" #, fuzzy -msgid "`#2904 `__: Standardize output columns of functions with different output" -msgstr "`#2057 `__: trspViaEdges 列的顺序不同" +msgid "Using ``pgr_dijkstra``" +msgstr "``pgr_dijkstra``" #, fuzzy -msgid "columns within overloads" -msgstr "函数的重载" +msgid "Migrating `this v3.4 `__ example." +msgstr "使用 `这个 `__ 示例。" -#, fuzzy -msgid "Standardized to |short-generic-result|" -msgstr "将输出列标准化为 |short-generic-result|" +msgid "Examples for Many to Many with one route result" +msgstr "" #, fuzzy -msgid "`#2905 `__: pgr_withPoints" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" -#, fuzzy -msgid "`#2906 `__: pgr_bdDijkstra" -msgstr "`#2683 `__: pgr_trsp" +msgid "|pid-m-m|" +msgstr "" -#, fuzzy -msgid "`#2907 `__: pgr_bellmanFord" -msgstr "`#2683 `__: pgr_trsp" +msgid "Examples for combinations with one route result" +msgstr "" #, fuzzy -msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migrating `this v3.8 `this `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "`#2910 `__: pgr_edwardMoore" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration of spanning tree functions" +msgstr "生成树函数的结果列" -#, fuzzy -msgid "`#2913 `__: pgr_dagShortestPath" -msgstr "`#2683 `__: pgr_trsp" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" +msgstr "" -#, fuzzy -msgid "Standardized to |matrix-result|" -msgstr "输出列是 |ksp-result|" +msgid "``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" -#, fuzzy -msgid "`#2905 `__: pgr_withPointsCost" -msgstr "`#2683 `__: pgr_trsp" +msgid ":ref:`from_result_dij_dd`" +msgstr ":ref:`from_result_dij_dd`" -#, fuzzy -msgid "`#2905 `__: pgr_withPointsCostMatrix" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" -#, fuzzy -msgid "Standardized to |generic-result|" -msgstr "将输出列标准化为 |short-generic-result|" +msgid ":ref:`from_result_generic_no_seq`" +msgstr ":ref:`from_result_generic_no_seq`" -#, fuzzy -msgid "`#2909 `__: pgr_edgeDisjointPaths" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" -#, fuzzy -msgid "`#2909 `__: pgr_turnRestrictedPath" -msgstr "`#2683 `__: pgr_trsp" +msgid "v < 3.7" +msgstr "" -#, fuzzy -msgid "Standardized to |result_edge_color|" -msgstr "返回集合 |result-edge-color|" +msgid ":ref:`from_result_bfs`" +msgstr ":ref:`from_result_bfs`" -#, fuzzy -msgid "`#2924 `__: pgr_edgeColoring" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" -#, fuzzy -msgid "Standardized to |result_node_color|" -msgstr "返回集合 |result-node-color|" +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" -#, fuzzy -msgid "`#2924 `__: pgr_bipartite" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" -#, fuzzy -msgid "`#2927 `__: pgr_sequentialVertexColoring" -msgstr "`#2202 `__: pgr_sequentialVertexColoring 变为提议状态" +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" -#, fuzzy -msgid "Standardized to |result-spantree|" -msgstr "将输出列标准化为 |result-spantree|" - -#, fuzzy -msgid "`#2931 `__: pgr_breadthFirstSearch" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" -#, fuzzy -msgid "`#2931 `__: pgr_depthFirstSearch" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_breadthFisrtSearch``" +msgstr "``pgr_breadthFisrtSearch``" -#, fuzzy -msgid "Standardized to |result_node_order|" -msgstr "返回集合 |result-node-color|" +msgid "v < 4.0.0" +msgstr "" -#, fuzzy -msgid "`#2934 `__: pgr_topologicalSort" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_depthFisrtSearch``" +msgstr "``pgr_depthFisrtSearch``" #, fuzzy -msgid "Standardized to |result-closure|" -msgstr "将输出列标准化为 |result-spantree|" +msgid "to |result-spantree|" +msgstr "|result-spantree|" #, fuzzy -msgid "`#2934 `__: pgr_transitiveClosure" -msgstr "`#2683 `__: pgr_trsp" - -msgid "Removal of SQL deprecated signatures" -msgstr "移除已弃用的 SQL 函数签名" +msgid "Migration from |result-bfs|." +msgstr "限制迁移" -msgid "`#2798 `__: pgr_contraction" -msgstr "`#2798 `__: pgr_contraction" +msgid "Single vertex" +msgstr "单个顶点" -msgid "`#2683 `__: pgr_trsp" -msgstr "`#2683 `__: pgr_trsp" +msgid "Multiple vertices" +msgstr "多个顶点" -#, fuzzy -msgid "`#2683 `__: pgr_trspVia" -msgstr "`#2683 `__: pgr_trsp" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|" +msgstr "" #, fuzzy -msgid "`#2888 `__: pgr_findCloseEdges" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" +msgid "Single vertex example using ``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" #, fuzzy -msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "Migrating `this v3.6 `__ example." +msgstr "与 `this `__ 示例比较。" -#, fuzzy -msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "Before updating pgRouting enumerate the columns: |result-bfs|." +msgstr "" #, fuzzy -msgid "`#2890 `__: pgr_withPointsDD" -msgstr "`#2683 `__: pgr_trsp" +msgid "Multiple vertices example using ``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" #, fuzzy -msgid "`#2895 `__: pgr_withPointsKSP" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migrating `this v3.6 `__ example." +msgstr "与 `this `__ 示例比较。" #, fuzzy -msgid "`#2899 `__: pgr_maxCardinalityMatch" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration from |result-dij-dd|" +msgstr "|result-dij-dd|" -#, fuzzy -msgid "`#2901 `__: pgr_TSP" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration depends on the signature." +msgstr "" #, fuzzy -msgid "`#2901 `__: pgr_TSPeuclidean" -msgstr "`#2683 `__: pgr_trsp" - -msgid "Removal of SQL deprecated functions" -msgstr "移除已弃用的SQL函数" +msgid "For single vertex:" +msgstr "Prim 单个节点" #, fuzzy -msgid "`#2681 `__: pgr_trspViaedges" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "Before updating pgRouting, enumerate |result-1-1| columns" +msgstr "结果列的重大变化" #, fuzzy -msgid "`#2682 `__: pgr_trspViaVertices" -msgstr "`#2682 `__: pgr_trspviavertices" +msgid "For multiple vertices:" +msgstr "Prim 多个顶点" -msgid "`#2748 `__: pgr_alphaShape" -msgstr "`#2748 `__: pgr_alphaShape" +msgid "Changes must be done after updating pgRouting." +msgstr "" #, fuzzy -msgid "`#2751 `__: pgr_createTopology" -msgstr "`#2751 `__: pgr_createTopology" - -msgid "`#2752 `__: pgr_analyzeGraph" -msgstr "`#2752 `__: pgr_analyzeGraph" - -msgid "`#2755 `__: pgr_analyzeOneWay" -msgstr "`#2755 `__: pgr_analyzeOneWay" - -msgid "`#2827 `__: pgr_createVerticesTable" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "To get the old version column names |result-dij-dd-m|:" +msgstr "获取原始列名：" #, fuzzy -msgid "`#2886 `__: pgr_nodeNetwork" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" +msgid "filter out the column ``pred`` and ``depth`` and" +msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" #, fuzzy -msgid "Removal of SQL deprecated internal functions" -msgstr "移除已弃用的SQL内部函数" +msgid "rename ``start_vid`` to ``from_v``." +msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。" #, fuzzy -msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" -msgstr "`#2748 `__: pgr_alphaShape" +msgid "Single vertex example using ``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" #, fuzzy -msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" -msgstr "`#2786 `__:pgr_contraction(edges) 新签名" +msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" +msgstr "输出列为 |result-1-1-no-seq|" #, fuzzy -msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" -msgstr "`#2786 `__:pgr_contraction(edges) 新签名" +msgid "Multiple vertices example using ``pgr_drivingDistance``" +msgstr "``pgr_drivingDistance``" #, fuzzy -msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" -#, fuzzy -msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgstr "" #, fuzzy -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Migration of |result-generic-no-seq|" +msgstr "|result-generic-no-seq|" -#, fuzzy -msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgstr "`#2798 `__: pgr_contraction" +msgid "After updating pgRouting:" +msgstr "" #, fuzzy -msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Enumerate |result-1-1-no-seq| columns" +msgstr "输出列为 |result-1-1-no-seq|" #, fuzzy -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgstr "要进行迁移，请在 **distance** 参数之后使用一个未命名的有效值作为 **行驶方向** ：" #, fuzzy -msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "Enumerate |result-m-1-no-seq| columns" +msgstr "输出列为 |result-1-1-no-seq|" #, fuzzy -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgstr "`#2798 `__: pgr_contraction" +msgid "Default value of **driving side** parameter" +msgstr "右驾驶侧" #, fuzzy -msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgstr "`#2798 `__: pgr_contraction" +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." +msgstr "**driving side** 参数是未命名的强制参数，有向图和无向图的有效值不同。" -#, fuzzy -msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" -msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" +msgstr "在有向图中：有效值为 [``r``, ``R``, ``l``, ``L``]" #, fuzzy -msgid "`#2861 `__ _pgr_endPoint(geometry)" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" +msgid "Default value = 'r';" +msgstr "有默认值" -#, fuzzy -msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" +msgid "In undirected graph: valid values are [``b``, ``B``]" +msgstr "在无向图中：有效值为 [``b``, ``B``]" #, fuzzy -msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" -msgstr "`#2786 `__:pgr_contraction(edges) 新签名" +msgid "Default value = 'b';" +msgstr "有默认值" #, fuzzy -msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "Single vertex example using ``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" #, fuzzy -msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" +msgid "Multiple vertices example using ``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" #, fuzzy -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy -msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" -msgstr "`#2786 `__:pgr_contraction(edges) 新签名" +msgid "Migration of output column name change" +msgstr "限制迁移" #, fuzzy -msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "The standardized result columns:" +msgstr "成本函数结果列" #, fuzzy -msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgstr "`#2087 `__: pgr_extractVertices 变为提议状态" +msgid "|result_edge_color|" +msgstr "返回集合 |result-edge-color|" #, fuzzy -msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "|result_node_color|" +msgstr "返回集合 |result-node-color|" #, fuzzy -msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "|result_node_order|" +msgstr "返回集合 |result-node-color|" -#, fuzzy -msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "Changes on column names must be done after updating pgRouting." +msgstr "" -#, fuzzy -msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_edgeColoring``" +msgstr "``pgr_edgeColoring``" -#, fuzzy -msgid "`#2861 `__ _pgr_msg(integer,text,text)" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid ":ref:`from_old_edge_color`" +msgstr ":ref:`from_old_edge_color`" -#, fuzzy -msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "``pgr_bipartite``" +msgstr "``pgr_bipartite``" -#, fuzzy -msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" -msgstr "`#2786 `__:pgr_contraction(edges) 新签名" +msgid ":ref:`from_old_node_color`" +msgstr ":ref:`from_old_node_color`" -#, fuzzy -msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" -msgstr "`#2087 `__: pgr_extractVertices 变为提议状态" +msgid "``pgr_sequentialVertexColoring``" +msgstr "``pgr_sequentialVertexColoring``" -#, fuzzy -msgid "`#2861 `__ _pgr_quote_ident(text)" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" - -#, fuzzy -msgid "`#2861 `__ _pgr_startPoint(geometry)" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "``pgr_topologicalSort``" +msgstr "``pgr_topologicalSort``" -#, fuzzy -msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid ":ref:`from_toposort`" +msgstr ":ref:`from_toposort`" -#, fuzzy -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "``pgr_transitiveClosure``" +msgstr "``pgr_transitiveClosure``" -#, fuzzy -msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid ":ref:`from_old_closure`" +msgstr ":ref:`from_old_closure`" #, fuzzy -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration from |result-old-closure|" +msgstr "|result-dij-dd|" #, fuzzy -msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration to: |result-old-closure|" +msgstr "|result-generic-no-seq|" -#, fuzzy -msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgstr "`#2682 `__: pgr_trspviavertices" +msgid "After update:" +msgstr "" #, fuzzy -msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "Remove column ``seq``" +msgstr "删除了不必要的列 seq" -#, fuzzy -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" +msgstr "" #, fuzzy -msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration from |result-toposort|" +msgstr "限制迁移" #, fuzzy -msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "Migration to: |result_node_order|" +msgstr "|result-generic-no-seq|" #, fuzzy -msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "Rename ``sorted_v`` to ``node``" +msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。" #, fuzzy -msgid "`#2861 `__ _pgr_versionLess(text,text)" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "Migration from |old-edge-color|" +msgstr "返回 |old-pid-result| 的集合" #, fuzzy -msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Migration to: |result_edge_color|" +msgstr "|result-generic-no-seq|" -#, fuzzy -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." +msgstr "" #, fuzzy -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "Migration from |old-node-color|" +msgstr "返回 |old-pid-result| 的集合" #, fuzzy -msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "Migration to: |result_node_color|" +msgstr "|result-generic-no-seq|" -#, fuzzy -msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." +msgstr "" #, fuzzy -msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Migration of deleted functions" +msgstr "限制迁移" #, fuzzy -msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Functions no longer on pgRouting" +msgstr "为 pgRouting 添加功能" -#, fuzzy -msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration of ``pgr_alphaShape``" +msgstr "迁移 ``pgr_alphaShape``" -#, fuzzy -msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Deprecated" +msgstr "已停用" #, fuzzy -msgid "Summary of functions and signatures no longer on pgrouting" -msgstr "为 pgRouting 添加功能" +msgid "`v3.8.0 `__" +msgstr "`v3.4.0 `__" -#, fuzzy -msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" -msgstr "`#2748 `__: pgr_alphaShape" +msgid "Removed" +msgstr "已删除的功能" -#, fuzzy -msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgstr "`#2752 `__: pgr_analyzeGraph" +msgid "`v4.0.0 `__" +msgstr "`v4.0.0 `__" -#, fuzzy -msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" -msgstr "_pgr_createindex(text,text,text,text,integer,text)" +msgid "**Before Deprecation:** The following was calculated:" +msgstr "** 弃用前：** 原计算方式如下：" -#, fuzzy -msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "`#2798 `__: pgr_contraction" +msgid "An alphaShape was calculated" +msgstr "已计算 alphaShape" -#, fuzzy -msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" -msgstr "_pgr_createindex(text,text,text,text,integer,text)" +msgid "**After Deprecation:**" +msgstr "**停用后：**" -#, fuzzy -msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" -msgstr "`#2827 `__: pgr_createVerticesTable" +msgid "PostGIS has two ways of generating alphaShape." +msgstr "PostGIS 提供两种生成 alphaShape 的方法。" -#, fuzzy -msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "If you have SFCGAL, which you can install using" +msgstr "如果你有 SFCGAL，可以通过以下方式安装" -#, fuzzy -msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgstr "自 PostGIS 3.5 起，请使用 `CG_AlphaShape `__ 函数" -#, fuzzy -msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgstr "对于 PostGIS 3.5+ 版本，请继续使用旧函数名 ``ST_AlphaShape``" -#, fuzzy -msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgstr "`#2850 `__:重写 pgr_nodeNetwork" +msgid "Other PostGIS options are" +msgstr "" -#, fuzzy -msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "`ST_ConvexHull `__" +msgstr "" -#, fuzzy -msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "`#2683 `__: pgr_trsp" +msgid "`ST_ConcaveHull `__" +msgstr "" #, fuzzy -msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "`#2681 `__: pgr_trspviaedges" +msgid "Migration of ``pgr_nodeNetwork``" +msgstr "迁移 ``pgr_bdAstar``" -#, fuzzy -msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "`#2682 `__: pgr_trspviavertices" +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." +msgstr "" #, fuzzy -msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "**Migration**" +msgstr "迁移" #, fuzzy -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" +msgstr "使用 ``pgr_separateTouching`` 和 ``pgr_separateCrossing`` 。" -#, fuzzy -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Migration of ``pgr_createTopology``" +msgstr "迁移 ``pgr_createTopology``" -#, fuzzy -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "A table with `_vertices_pgr` was created." +msgstr "创建了一个包含 `_vertices_pgr` 的表。" -#, fuzzy -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgstr "**弃用后：** 用户需自行构建完整拓扑。" -#, fuzzy -msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Build a routing topology" +msgstr "构建路由拓扑" -#, fuzzy -msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." +msgstr "使用大多数 pgRouting 函数的基本信息 ``id, source, target, cost, [reverse_cost]`` 在 pgRouting 中被称为路由拓扑。" -#, fuzzy -msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." +msgstr "``reverse_cost`` 是可选的，但强烈建议使用，以便由于几何列的大小而减小数据库的大小。 话虽如此，在本文档中使用了 ``reverse_cost`` 。" -#, fuzzy -msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -msgstr "`#2683 `__: pgr_trsp" +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." +msgstr "当数据带有几何图形并且没有路由拓扑时，则需要此步骤。" -#, fuzzy -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -msgstr "`#2683 `__: pgr_trsp" +msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." +msgstr "几何图的所有开始和结束顶点都需要一个标识符，该标识符将存储在数据表的 ``source`` 列和 ``target`` 列中。 同样， ``cost`` 和 ``reverse_cost`` 需要具有在两个方向上遍历边的值。" -#, fuzzy -msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgstr "`#2683 `__: pgr_trsp" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgstr "如果这些列不存在，则需要将它们添加到相关表中。 （参见 `ALTER TABLE `__ ）" -#, fuzzy -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgstr "`#2683 `__: pgr_trsp" +msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." +msgstr "函数 :doc:`pgr_extractVertices` 用于根据边标识符和图边的几何形状创建顶点表。" -#, fuzzy -msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgstr "最后使用存储在顶点表上的数据填充 ``source`` 和 ``target`` 。" -#, fuzzy -msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration of ``pgr_createVerticesTable``" +msgstr "迁移 ``pgr_createVerticesTable``" -#, fuzzy -msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgstr "**弃用后：** 用户需自行创建顶点表、索引等结构，可调用 :doc:`pgr_extractVertices` 函数实现该功能。" -#, fuzzy -msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Migration of ``pgr_analyzeOneWay``" +msgstr "迁移 ``pgr_analyzeOneWay``" -#, fuzzy -msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "Number of potential problems in directionality" +msgstr "方向性潜在问题数量分析" -#, fuzzy -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" - -#, fuzzy -msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "WHERE" +msgstr "WHERE" -#, fuzzy -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Directionality problems were calculated based on codes." +msgstr "方向性问题已根据预设规则代码完成计算。" -#, fuzzy -msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "Dead ends." +msgstr "死胡同。" -#, fuzzy -msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" -msgstr "`#2683 `__: pgr_trsp" +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgstr "当某个节点仅存在单向通行路径（仅有进入或仅有离开的边线）时，将导致路由问题：" -#, fuzzy -msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." +msgstr "通过保存或直接调用 :doc:`pgr_extractVertices` 获取断头路信息，并判断相邻边线是否为单行道。" -#, fuzzy -msgid "Code enhancements" -msgstr "代码改进" +msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgstr "在本例中 :doc:`pgr_extractVertices` 已经应用。" -msgid "Removal of unused C/C++ code" -msgstr "移除未使用的C/C++代码" +msgid "Bridges." +msgstr "桥梁。" -msgid "Refactor the Script to build the update PostgreSQL file." -msgstr "" +msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." +msgstr "另一个路由问题可能出现在以下情况：当无向图中存在这样一条边——删除该边会增加图的连通分量数量（即该边是桥接边），而该桥接边却是单向通行的。" -msgid "One process & driver for:" -msgstr "" +msgid "To determine if the bridges are or not one way." +msgstr "判断桥梁是否为单行道。" -msgid "allpairs: johnson and Floyd-Warshall" -msgstr "" +msgid "Migration of ``pgr_analyzeGraph``" +msgstr "迁移 ``pgr_analyzeGraph``" -msgid "Shortest path: Dijkstra and withPoints using Dijkstra" -msgstr "" +msgid "Number of isolated segments." +msgstr "隔离段的数量。" -msgid "Deprecation of internal C/C++ functions" -msgstr "弃用内部C/C++函数" +msgid "Number of dead ends." +msgstr "死胡同数量。" -msgid "Deprecated functions are substituted by new function." -msgstr "" +msgid "Number of potential gaps found near dead ends." +msgstr "在断头路附近发现的潜在缺口数量。" -#, fuzzy -msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" -msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" +msgid "Number of intersections. (between 2 edges)" +msgstr "交叉点数量。(两条边之间）" -#, fuzzy -msgid "_pgr_withPointsDD => _pgr_withPointsddv4" -msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" +msgid "Graph component" +msgstr "图形组件" -msgid "_pgr_kruskal => _pgr_kruskalv4" -msgstr "" +msgid "A connected subgraph that is not part of any larger connected subgraph." +msgstr "不属于任何较大连通子图的连通子图。" -msgid "_pgr_prim => _pgr_primv4" -msgstr "" +msgid "Isolated segment" +msgstr "隔离段" -#, fuzzy -msgid "_pgr_dijkstra => _pgr_dijkstra_v4" -msgstr "pgr_bddijkstra - 使用 pgr_bdDijkstra代替" +msgid "A graph component with only one segment." +msgstr "单一孤立路段组成的网络组件。" -#, fuzzy -msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" -msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" +msgid "Dead ends" +msgstr "死端" -#, fuzzy -msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" -msgstr "pgr_withPoints 是 **带有点** 的 pgr_dijkstra" +msgid "A vertex that participates in only one edge." +msgstr "仅关联单条边线的顶点。" -#, fuzzy -msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" -msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" +msgid "gaps" +msgstr "差距" -#, fuzzy -msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" -msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" +msgid "Space between two geometries." +msgstr "两个几何对象之间的空间。" -msgid "Internal C/C++ functions in legacy" -msgstr "遗留代码中内部 C/C++ 函数" +msgid "Intersection" +msgstr "交叉路口" -#, fuzzy -msgid "`#2683 `__ _trsp" -msgstr "`#2683 `__: pgr_trsp" +msgid "Is a topological relationship between two geometries." +msgstr "是两个几何体之间的拓扑关系。" -#, fuzzy -msgid "`#2683 `__ _v4trsp" -msgstr "`#2683 `__: pgr_trsp" +msgid "Migration." +msgstr "迁移。" -#, fuzzy -msgid "`#2748 `__ _pgr_alphaShape" -msgstr "`#2748 `__: pgr_alphaShape" +msgid "Components." +msgstr "组件。" -#, fuzzy -msgid "`#2913 `__ _pgr_dagShortestPath" -msgstr "`#2683 `__: pgr_trsp" +msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgstr "不仅统计孤立线段，还要识别图中的所有连通子图（组件）。" -msgid "All releases" -msgstr "所有版本" +msgid "Depending of the final application requirements use:" +msgstr "根据最终应用需求选择：" -msgid "Kruskal - Family of functions" -msgstr "Kruskal - 函数族" +msgid ":doc:`pgr_connectedComponents`" +msgstr ":doc:`pgr_connectedComponents`" -msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." -msgstr "克鲁斯卡尔算法是一种贪婪的最小生成树算法，它在每个循环中查找并添加连接森林中任意两棵树的最小可能权重的边。" +msgid ":doc:`pgr_strongComponents`" +msgstr ":doc:`pgr_strongComponents`" -msgid "**The main Characteristics are:**" -msgstr "**主要特点是：**" +msgid ":doc:`pgr_biconnectedComponents`" +msgstr ":doc:`pgr_biconnectedComponents`" -msgid "The total weight of all the edges in the tree or forest is minimized." -msgstr "树或森林中所有边的总权重最小化。" +msgid "For example:" +msgstr "示例：" -msgid "Kruskal's running time: :math:`O(E * log E)`" -msgstr "克鲁斯卡尔的运行时间： :math:`O(E * log E)`" +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgstr "使用 :doc:`pgr_degree` 确定图形的所有死角，而不是计算死角。" -msgid "Metrics - Family of functions" -msgstr "Metrics - 功能系列" +msgid "Potential gaps near dead ends." +msgstr "断头路附近的潜在缺口。" -msgid "Migration guide" -msgstr "迁移指南" +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgstr "使用 :doc:`pgr_findCloseEdges` 来确定图形中的几何间隙，而不是计算几何图形之间的潜在间隙。" -msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." -msgstr "多个函数的签名发生了变化，和/或已被新函数取代。" +msgid "Topological relationships." +msgstr "拓扑关系。" -msgid "Results can be different because of the changes." -msgstr "结果可能会因变化而不同。" +msgid "Instead of counting intersections, determine topological relationships between geometries." +msgstr "确定几何图形之间的拓扑关系，而不是计算交叉点。" -msgid "All deprecated functions will be removed on next major version 4.0.0" -msgstr "所有已弃用函数将在下一个主版本 4.0.0 中被移除" +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "可以使用几个 PostGIS 函数： `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, 等。" -#, fuzzy -msgid "Migration to standardized columns" -msgstr "限制迁移" +msgid "Migration of ``pgr_trsp`` (Vertices)" +msgstr "迁移 ``pgr_trsp`` (顶点）" -msgid "There has been an effort to standardize function output columns names and types." -msgstr "" +msgid "Signature:" +msgstr "签名：" -msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" +msgid "`v3.4.0 `__" +msgstr "`v3.4.0 `__" -#, fuzzy -msgid "|matrix-result|" -msgstr "|matrix-result| 的集合" +msgid ":doc:`pgr_trsp`" +msgstr ":doc:`pgr_trsp`" -msgid ":ref:`pgRouting-concepts:Result columns for single path functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`" +msgid "`Migration of restrictions`_" +msgstr "`迁移限制`_" -#, fuzzy -msgid "|short-generic-result|" -msgstr "返回集合 |short-generic-result|" +msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgstr "当没有限制条件时，使用 ``pgr_dijkstra`` 。" -msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" -msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`" +msgid "Use :doc:`pgr_dijkstra` instead." +msgstr "使用 :doc:`pgr_dijkstra` 替代。" -msgid "|result-spantree|" -msgstr "|result-spantree|" +msgid "To get the original column names:" +msgstr "获取原始列名：" -#, fuzzy -msgid "Function" -msgstr "新函数:" +msgid "``id1`` is the node" +msgstr "``id1`` 是节点" -msgid ":doc:`pgr_dijkstra`" -msgstr ":doc:`pgr_dijkstra`" +msgid "``id2`` is the edge" +msgstr "``id2`` 是边" -#, fuzzy -msgid "`Migration of single path functions`_" -msgstr "`迁移限制`_" +msgid "Use ``pgr_trsp`` when there are restrictions." +msgstr "当存在限制条件时，使用 ``pgr_trsp`` 。" -#, fuzzy -msgid ":doc:`pgr_aStar`" -msgstr ":doc:`pgr_aStarCost`" +msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgstr "使用 :doc:`pgr_trsp` (One to One) 替代。" -#, fuzzy -msgid ":doc:`pgr_bdAstar`" -msgstr ":doc:`pgr_bdAstarCost`" +msgid "Migration of ``pgr_trsp`` (Edges)" +msgstr "迁移 ``pgr_trsp`` (边)" -msgid ":doc:`pgr_drivingDistance`" -msgstr ":doc:`pgr_drivingDistance`" +msgid ":doc:`pgr_trsp_withPoints`" +msgstr ":doc:`pgr_trsp_withPoints`" -#, fuzzy -msgid "`Migration of spanning tree functions`_" -msgstr "`迁移限制`_" +msgid "Migration of ``pgr_trspViaVertices``" +msgstr "迁移 ``pgr_trspViaVertices``" -#, fuzzy -msgid ":doc:`pgr_withPointsDD`" -msgstr ":doc:`pgr_withPoints`" +msgid ":doc:`pgr_dijkstraVia`" +msgstr ":doc:`pgr_dijkstraVia`" -#, fuzzy -msgid ":doc:`pgr_bdDijkstra`" -msgstr ":doc:`pgr_dijkstra`" +msgid ":doc:`pgr_trspVia`" +msgstr ":doc:`pgr_trspVia`" -#, fuzzy -msgid ":doc:`pgr_binaryBreadthFirstSearch`" -msgstr "pgr_binaryBreadthFirstSearch" +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgstr "无限制条件时，使用 ``pgr_dijkstraVia``" -#, fuzzy -msgid ":doc:`pgr_bipartite`" -msgstr ":doc:`pgr_prim`" - -#, fuzzy -msgid "`Migration of output column name change`_" -msgstr "`迁移限制`_" +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "使用 :doc:`pgr_dijkstraVia` 替代。" -#, fuzzy -msgid ":doc:`pgr_breadthFirstSearch`" -msgstr "pgr_binaryBreadthFirstSearch" +msgid "``id1`` is the path identifier" +msgstr "``id1`` 是路径标识符" -#, fuzzy -msgid ":doc:`pgr_depthFirstSearch`" -msgstr "pgr_depthFirstSearch" +msgid "``id2`` is the node" +msgstr "``id2`` 是节点" -#, fuzzy -msgid ":doc:`pgr_edgeColoring`" -msgstr "pgr_edgeColoring" +msgid "``id3`` is the edge" +msgstr "``id3`` 是边" -#, fuzzy -msgid "`Migration of multiple paths functions`_" -msgstr "`迁移限制`_" +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr "当存在限制条件时，使用 ``pgr_trspVia``" -#, fuzzy -msgid ":doc:`pgr_sequentialVertexColoring`" -msgstr "pgr_sequentialVertexColoring" +msgid "Use :doc:`pgr_trspVia` instead." +msgstr "使用 :doc:`pgr_trspVia` 替代。" -#, fuzzy -msgid ":doc:`pgr_topologicalSort`" -msgstr "pgr_topologicalSort" +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "迁移 ``pgr_trspViaEdges``" -msgid ":doc:`pgr_withPoints`" -msgstr ":doc:`pgr_withPoints`" +msgid ":doc:`pgr_withPointsVia`" +msgstr ":doc:`pgr_withPointsVia`" -#, fuzzy -msgid "`Migration of cost functions`_" -msgstr "`迁移限制`_" +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr ":doc:`pgr_trspVia_withPoints`" -#, fuzzy -msgid "Migration of cost functions" -msgstr "限制迁移" +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgstr "无限制条件时，使用 ``pgr_withPointsVia``" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" -msgstr "" +msgid "Use :doc:`pgr_withPointsVia` instead." +msgstr "使用 :doc:`pgr_withPointsVia` 替代。" -msgid "The following functions need to be migrated when they are being used in an application." -msgstr "" +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr "当存在限制条件时，使用 ``pgr_trspVia_withPoints``" -#, fuzzy -msgid "Version" -msgstr "版本3.0" +msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgstr "使用 :doc:`pgr_trspVia_withPoints` 替代。" -msgid "From" +msgid "Not yet classified migrations" msgstr "" -msgid "``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" - -msgid "v < 4.0" -msgstr "" +msgid "Migration of ``pgr_withPointsKSP``" +msgstr "迁移 ``pgr_withPointsKSP``" -#, fuzzy -msgid "|matrix-pid|" -msgstr "返回 |matrix-pid| 的集合" +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "从 `v3.6.0 `__ :doc:`pgr_withPointsKSP` 开始对结果列进行标准化。" -msgid "``pgr_withPointsCostMatrix``" -msgstr "``pgr_withPointsCostMatrix``" +msgid "|ksp-result|" +msgstr "|ksp-result|" #, fuzzy -msgid "**to** |matrix-result|" -msgstr "|matrix-result| 的集合" +msgid "|generic-result|" +msgstr "|nksp-result|" #, fuzzy -msgid "Migration of |matrix-pid|" -msgstr "限制迁移" +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgstr "而且 ``driving side`` 参数从命名的可选参数变为未命名的必选参数 **行驶方向**，其有效性对于有向图和无向图有所不同。" -msgid "Signatures to be migrated:" -msgstr "要迁移的签名：" +msgid "``pgr_withPointsKSP`` (`One to One`)" +msgstr "``pgr_withPointsKSP`` (`One to One`)" -msgid "One to One" -msgstr "One to One" +msgid "Before Migration" +msgstr "迁移前" -msgid "One to Many" -msgstr "One to Many" +msgid "Output columns were |old-pid-result|" +msgstr "输出列是 |old-pid-result|" -msgid "Many to One" -msgstr "Many to One" +msgid "the columns ``start_vid`` and ``end_vid`` do not exist." +msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" -msgid "Many to Many" -msgstr "Many to Many" +msgid "Migration" +msgstr "迁移" -msgid "Combinations" -msgstr "组合" +msgid "Be aware of the existence of the additional result Columns." +msgstr "注意附加结果列的存在。" #, fuzzy -msgid "Breaking change" -msgstr "重大变更：" +msgid "New output columns are |generic-result|" +msgstr "新的输出列是 |nksp-result|" -msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" -msgstr "" +msgid "Using `this `__ example." +msgstr "使用 `这个 `__ 示例。" -#, fuzzy -msgid "New output columns are |matrix-result|" -msgstr "输出列是 |ksp-result|" +msgid "``start_vid`` contains the **start vid** parameter value." +msgstr "``start_vid`` 包含 **起始 vid** 参数值。" -msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." -msgstr "" +msgid "``end_vid`` contains the **end vid** parameter value." +msgstr "``end_vid`` 包含 **结束 vid** 参数值。" -msgid "Examples" -msgstr "示例" +msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgstr "如果需要，过滤掉附加列，例如，返回原始列：" -#, fuzzy -msgid "Examples for One to One for cost functions" -msgstr "成本函数结果列" +msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgstr "无限制条件时，使用 ``pgr_withPoints`` 。" -#, fuzzy -msgid "Using ``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr "使用 :doc:`pgr_withPoints` (One to One) 替代。" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgstr "当存在限制条件时，使用 ``pgr_trsp_withPoints`` 。" -msgid "from" -msgstr "从" +msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgstr "使用 :doc:`pgr_trsp_withPoints` 替代。" -msgid "to" -msgstr "到" +msgid "Migration of ``pgr_maxCardinalityMatch``" +msgstr "迁移 ``pgr_maxCardinalityMatch``" -#, fuzzy -msgid "Examples for One to Many for cost functions" -msgstr "成本函数结果列" +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgstr ":doc:`pgr_maxCardinalityMatch` 仅适用于无向图，因此 ``有向`` 标志已被删除。" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Starting from `v3.4.0 `__" +msgstr "开始于 `v3.4.0 `__" -#, fuzzy -msgid "Examples for Many to One for cost functions" -msgstr "成本函数结果列" +msgid "Signature to be migrated:" +msgstr "待迁移签名：" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Migration is needed, because:" +msgstr "需要迁移，因为：" -#, fuzzy -msgid "Examples for Many to Many for cost functions" -msgstr "成本函数结果列" +msgid "Use ``cost`` and ``reverse_cost`` on the inner query" +msgstr "在内部查询上使用 ``cost`` 和 ``reverse_cost``" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Results are ordered" +msgstr "结果已排序" -#, fuzzy -msgid "Examples for Combinations for cost functions" -msgstr "成本函数结果列" +msgid "Works for undirected graphs." +msgstr "适用于无向图。" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "New signature" +msgstr "新签名" -#, fuzzy -msgid "Migration of multiple paths functions" -msgstr "限制迁移" +msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." +msgstr "``pgr_maxCardinalityMatch(text)`` 仅仅返回 ``边`` 列." -#, fuzzy -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" -msgstr "将输出列标准化为 |short-generic-result|" +msgid "The optional flag ``directed`` is removed." +msgstr "可选的 ``directed`` 标志被删除。" -msgid "``pgr_KSP``" -msgstr "``pgr_KSP``" +msgid "Before migration" +msgstr "迁移前" -msgid "v < 3.6" -msgstr "" +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgstr "所使用的列是 ``going`` 和 ``coming`` ，用于表示边的存在。" -msgid ":ref:`from_ksp_result`" -msgstr ":ref:`from_ksp_result`" +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgstr "``directed`` 标志用于指示是 **有向** 图还是 **无向** 图。" -msgid "``pgr_edgeDisjointPaths``" -msgstr "``pgr_edgeDisjointPaths``" +msgid "The flag ``directed`` is ignored." +msgstr "``directed`` 标志被忽略。" -msgid ":ref:`from_result_disjoint`" -msgstr ":ref:`from_result_disjoint`" +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgstr "无论它的值如何，它都会给出将图视为 **无向** 的结果。" -#, fuzzy -msgid "Migration of |ksp-result|" -msgstr "返回 |old-pid-result| 的集合" +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgstr "使用 ``cost`` 和 ``reverse_cost`` 列来表示边的存在。" -#, fuzzy -msgid "|nksp-result|" -msgstr "|ksp-result|" +msgid "Do not use the flag ``directed``." +msgstr "不要使用 ``directed`` 标志。" -#, fuzzy -msgid "Before updating pgRouting, enumerate the |ksp-result|" -msgstr "结果列的重大变化" +msgid "In the query returns only ``edge`` column." +msgstr "查询中仅返回 ``edge`` 列。" -msgid "One to One example using ``pgr_KSP``" -msgstr "" +msgid "Migration of restrictions" +msgstr "限制迁移" -msgid "Using `this `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "The structure of the restrictions have changed:" +msgstr "限制的结构发生了变化：" -#, fuzzy -msgid "Migration of |result-disjoint|" -msgstr "|result-dij-dd|" +msgid "Old restrictions structure" +msgstr "旧的限制结构" -#, fuzzy -msgid "Before updating pgRouting, enumerate the |result-disjoint|" -msgstr "结果列的重大变化" +msgid "On the deprecated signatures:" +msgstr "关于已弃用的签名：" -msgid "Skip when applicable, ``start_vid``" -msgstr "" +msgid "Column ``rid`` is ignored" +msgstr "列 ``rid`` 被忽略" -#, fuzzy -msgid "Skip when applicable, ``end_vid``" -msgstr "然后按 ``end_vid``" +msgid "``via_path``" +msgstr "``via_path``" -#, fuzzy -msgid "One to One example using ``pgr_edgeDisjointPaths``" -msgstr "``pgr_edgeDisjointPaths``" +msgid "Must be in reverse order." +msgstr "必须是相反的顺序。" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Is of type ``TEXT``." +msgstr "属于 ``TEXT`` 类型。" -#, fuzzy -msgid "Before updating pgRouting enumerate the columns: |ksp-result|" -msgstr "结果列的重大变化" +msgid "When more than one via edge must be separated with ``,``." +msgstr "当多个过孔边必须用 ``,`` 分隔时。" -#, fuzzy -msgid "Migration of single path functions" -msgstr "限制迁移" +msgid "``target_id``" +msgstr "``target_id``" -#, fuzzy -msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" -msgstr "将输出列标准化为 |short-generic-result|" +msgid "Is the last edge of the forbidden path." +msgstr "是禁止路径的最后一条边。" -msgid "``pgr_dijkstra``" -msgstr "``pgr_dijkstra``" +msgid "Is of type ``INTEGER``." +msgstr "类型为 ``INTEGER`` 。" -msgid "v < 3.5" -msgstr "" +msgid "``to_cost``" +msgstr "``to_cost``" -#, fuzzy -msgid "|old-generic-result|" -msgstr "|nksp-result|" +msgid "Is of type ``FLOAT``." +msgstr "类型为 ``FLOAT`` 。" -msgid "``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "Creation of the old restrictions table" +msgstr "创建旧限制表" -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "Old restrictions fill up" +msgstr "旧限制已满" -msgid "``pgr_bellmanFord``" -msgstr "``pgr_bellmanFord``" +msgid "Old restrictions contents" +msgstr "旧限制内容" -msgid "``pgr_dagShortestPath``" -msgstr "``pgr_dagShortestPath``" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgstr "``rid = 2`` 的限制表示的是路径 :math:`3 \\rightarrow 5 \\rightarrow9`" -#, fuzzy -msgid "|result-1-1|" -msgstr "|result-bfs|" +msgid ":math:`3\\rightarrow5`" +msgstr ":math:`3\\rightarrow5`" -msgid "``pgr_edwardMoore``" -msgstr "``pgr_edwardMoore``" +msgid "is on column ``via_path`` in reverse order" +msgstr "以相反的顺序位于 ``via_path`` 列上" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +msgid "is of type ``TEXT``" +msgstr "类型为 ``TEXT``" -#, fuzzy -msgid "|old-pid-result|" -msgstr "|ksp-result|" +msgid ":math:`9`" +msgstr ":math:`9`" -#, fuzzy -msgid "Migration of |old-generic-result|" -msgstr "返回 |old-generic-result| 的集合" +msgid "is on column ``target_id``" +msgstr "位于列 ``target_id``" -msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" -msgstr "" +msgid "is of type ``INTEGER``" +msgstr "类型为 ``INTEGER``" -#, fuzzy -msgid "Migration of |old-pid-result|" -msgstr "返回 |old-pid-result| 的集合" +msgid "New restrictions structure" +msgstr "新的限制结构" -msgid "To get the old version column names, depending on the signature:" -msgstr "" +msgid "Column ``id`` is ignored" +msgstr "列 ``id`` 被忽略" -#, fuzzy -msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``" -msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" +msgid "Column ``path``" +msgstr "列 ``path``" -#, fuzzy -msgid "Rename the columns:" -msgstr "结果列" +msgid "Is of type ``ARRAY[ANY-INTEGER]``." +msgstr "类型为 ``ARRAY[ANY-INTEGER]`` 。" -#, fuzzy -msgid "``start_vid`` to ``start_pid``" -msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。" +msgid "Contains all the edges involved on the restriction." +msgstr "包含限制所涉及的所有边。" -#, fuzzy -msgid "``end_vid`` to ``end_pid``" -msgstr "``end_vid`` 升序" +msgid "The array has the ordered edges of the restriction." +msgstr "该数组具有限制的有序边。" -msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" -msgstr "" +msgid "Column ``cost``" +msgstr "列 ``cost``" -#, fuzzy -msgid "Migration of |result-1-1|" -msgstr "返回 |result-1-1| 的集合" +msgid "Is of type ``ANY-NUMERICAL``" +msgstr "类型为 ``ANY-NUMERICAL``" -#, fuzzy -msgid "To get the old version column names:" -msgstr "获取原始列名：" +msgid "The creation of the restrictions table" +msgstr "限制表的创建" -#, fuzzy -msgid "Filter out the columns: ``start_vid`` and ``end_vid``" -msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" +msgid "Adding the restrictions" +msgstr "添加限制" -#, fuzzy -msgid "Examples with One to One with one route result" -msgstr "使用示例（无结果输出）" +msgid "Restrictions data" +msgstr "限制数据" -#, fuzzy -msgid "Using ``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgstr "``rid = 2`` 的限制表示的是路径 :math:`3 \\rightarrow5 \\rightarrow9` 。" -#, fuzzy -msgid "Migrating `this v3.5 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "By inspection the path is clear." +msgstr "通过检查，路径是清晰的。" -msgid "Before updating pgRouting enumerate the columns: |result-1-1|" -msgstr "" +msgid "To transform the old restrictions table to the new restrictions structure," +msgstr "要将旧的限制表转换为新的限制结构，" -#, fuzzy -msgid "Using ``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "Create a new table with the new restrictions structure." +msgstr "使用新的限制结构创建一个新表。" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "In this migration guide ``new_restrictions`` is been used." +msgstr "在此迁移指南中使用了 ``new_restrictions`` 。" -#, fuzzy -msgid "Using ``pgr_DAGshortestPath``" -msgstr "``pgr_bdAstar``" +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgstr "为了进行这次迁移，pgRouting 提供了一个用于反转数组的辅助函数 ``_ pgr_array_reverse`` ，这在迁移过程中是必需的。" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "``_pgr_array_reverse``:" +msgstr "``_pgr_array_reverse``:" -msgid "This applies to all signatures of ``pgr_DAGshortestPath``" -msgstr "" +msgid "Was created temporally for this migration" +msgstr "是为此迁移临时创建的" -#, fuzzy -msgid "Examples for One to Many with one route result" -msgstr "使用示例（无结果输出）" +msgid "Is not documented." +msgstr "没有记录。" -#, fuzzy -msgid "Using ``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +msgid "Will be removed on the next mayor version 4.0.0" +msgstr "将在下一个正式版本 4.0.0 中删除" + +msgid "The migrated table contents:" +msgstr "迁移后的表内容：" #, fuzzy -msgid "Migrating `this v3.5 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid ":doc:`pgRouting-concepts`" +msgstr "pgRouting 概念" -msgid "Before updating pgRouting enumerate the columns: |result-1-m|" -msgstr "" +msgid "Ordering - Family of functions" +msgstr "排序 - 函数族" -#, fuzzy -msgid "Using ``pgr_withPoints``" -msgstr "使用 :doc:`pgr_withPoints`" +msgid "pgRouting Concepts" +msgstr "pgRouting 概念" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgstr "这是一个简单的指南，介绍了 pgRouting 入门的一些步骤。 本指南涵盖：" -msgid "|pid-1-m|" -msgstr "" +msgid "Graphs" +msgstr "图" -#, fuzzy -msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." -msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" +msgstr "图是一个有序对 :math:`G = (V ,E)` ，其中：" -#, fuzzy -msgid "Examples for Many to One with one route result" -msgstr "使用示例（无结果输出）" +msgid ":math:`V` is a set of vertices, also called nodes." +msgstr ":math:`V` 是一组顶点，也称为节点。" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgid "Before updating pgRouting enumerate the columns: |result-m-1|" -msgstr "" +msgid "There are different kinds of graphs:" +msgstr "有不同类型的图：" -#, fuzzy -msgid "Using ``pgr_dijkstra``" -msgstr "``pgr_dijkstra``" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -#, fuzzy -msgid "Migrating `this v3.4 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Undirected simple graph" +msgstr "无向simple图" -msgid "Examples for Many to Many with one route result" -msgstr "" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" -#, fuzzy -msgid "Migrating `this v3.8 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" -msgid "|pid-m-m|" -msgstr "" +msgid "Directed simple graph" +msgstr "有向simple图" -msgid "Examples for combinations with one route result" -msgstr "" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -#, fuzzy -msgid "Migrating `this v3.8 `this `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Graphs:" +msgstr "图：" -#, fuzzy -msgid "Migration of spanning tree functions" -msgstr "生成树函数的结果列" +msgid "Do not have geometries." +msgstr "没有几何图形。" -msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" -msgstr "" +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgstr "一些图论问题需要图具有权重，在 pgRouting 中称为 **成本** 。" -msgid "``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" +msgid "In pgRouting there are several ways to represent a graph on the database:" +msgstr "在 pgRouting 中，有多种方法来表示数据库上的图：" -msgid ":ref:`from_result_dij_dd`" -msgstr ":ref:`from_result_dij_dd`" +msgid "With ``cost``" +msgstr "使用 ``cost``" -msgid "``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "(``id``, ``source``, ``target``, ``cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``)" -msgid ":ref:`from_result_generic_no_seq`" -msgstr ":ref:`from_result_generic_no_seq`" +msgid "With ``cost`` and ``reverse_cost``" +msgstr "使用 ``cost`` 和 ``reverse_cost``" -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgid "v < 3.7" -msgstr "" +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgstr "边的标识符。要求在数据库中以一致的方式使用。" -msgid ":ref:`from_result_bfs`" -msgstr ":ref:`from_result_bfs`" +msgid "Identifier of a vertex." +msgstr "顶点的标识符。" -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" +msgid "Weight of the edge (``source``, ``target``):" +msgstr "边 (``source``, ``target``)的权重：" -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgstr "当为负时，图上不存在edge (``source``, ``target``)。" -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" +msgid "``cost`` must exist in the query." +msgstr "查询中必须存在 ``cost`` 。" -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "当为负时，图上不存在边(``target``, ``source``)。" -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgstr "图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。" -msgid "``pgr_breadthFisrtSearch``" -msgstr "``pgr_breadthFisrtSearch``" +msgid "Graph with ``cost``" +msgstr "``cost`` 图" -msgid "v < 4.0.0" -msgstr "" +msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgstr "加权有向图， :math:`G_d(V,E)`:" -msgid "``pgr_depthFisrtSearch``" -msgstr "``pgr_depthFisrtSearch``" +msgid "Graph data is obtained with a query" +msgstr "通过查询获取图数据" -#, fuzzy -msgid "to |result-spantree|" -msgstr "|result-spantree|" +msgid "``SELECT id, source, target, cost FROM edges``" +msgstr "``SELECT id, source, target, cost FROM edges``" -#, fuzzy -msgid "Migration from |result-bfs|." -msgstr "限制迁移" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" -msgid "Single vertex" -msgstr "单个顶点" +msgid "Edges where ``cost`` is non negative are part of the graph." +msgstr "``cost`` 非负的边是图的一部分。" -msgid "Multiple vertices" -msgstr "多个顶点" +msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|" -msgstr "" +msgid "All vertices in ``source`` and ``target`` are part of the graph." +msgstr "``source`` 和 ``target`` 中的所有顶点都是图的一部分。" -#, fuzzy -msgid "Single vertex example using ``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "在有向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性：:math:`source_{id} \\rightarrow target_{id}`" -#, fuzzy -msgid "Migrating `this v3.6 `__ example." -msgstr "与 `this `__ 示例比较。" +msgid "For the following data:" +msgstr "对于以下数据：" -msgid "Before updating pgRouting enumerate the columns: |result-bfs|." -msgstr "" +msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." +msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分。" -#, fuzzy -msgid "Multiple vertices example using ``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid "The data is representing the following graph:" +msgstr "数据代表下图：" -#, fuzzy -msgid "Migrating `this v3.6 `__ example." -msgstr "与 `this `__ 示例比较。" +msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "在无向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 没有方向性：:math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -#, fuzzy -msgid "Migration from |result-dij-dd|" -msgstr "|result-dij-dd|" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" +msgstr "在有向图的术语中，这相当于有两条边： :math:`source_{id} \\leftrightarrow target_{id}`" -msgid "Migration depends on the signature." -msgstr "" +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgstr "边 :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) 不是图的一部分。" -#, fuzzy -msgid "For single vertex:" -msgstr "Prim 单个节点" +msgid "Graph with ``cost`` and ``reverse_cost``" +msgstr "带有 ``cost`` 和 ``reverse_cost`` 的图" -#, fuzzy -msgid "Before updating pgRouting, enumerate |result-1-1| columns" -msgstr "结果列的重大变化" +msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" -#, fuzzy -msgid "For multiple vertices:" -msgstr "Prim 多个顶点" +msgid "The set of edges :math:`E`:" +msgstr "边的集合 :math:`E` ：" -msgid "Changes must be done after updating pgRouting." -msgstr "" +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -#, fuzzy -msgid "To get the old version column names |result-dij-dd-m|:" -msgstr "获取原始列名：" +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgstr "边 :math:`(source \\rightarrow target)` 中的 ``cost`` 是非负数的都属于图的一部分。" -#, fuzzy -msgid "filter out the column ``pred`` and ``depth`` and" -msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "边 :math:`(target \\rightarrow source)` 中的 ``reverse_cost`` 是非负数的都属于图的一部分。" -#, fuzzy -msgid "rename ``start_vid`` to ``from_v``." -msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。" +msgid "The set of vertices :math:`V`:" +msgstr "顶点集 :math:`V` ：" -#, fuzzy -msgid "Single vertex example using ``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" +msgid "In a directed graph both edges have directionality" +msgstr "在有向图中，两条边都有方向性" -#, fuzzy -msgid "Migrating `this v3.5 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性： :math:`source_{id} \\rightarrow target_{id}`" -#, fuzzy -msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" -msgstr "输出列为 |result-1-1-no-seq|" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgstr "边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` 具有方向性： :math:`target_{id} \\rightarrow source_{id}`" -#, fuzzy -msgid "Multiple vertices example using ``pgr_drivingDistance``" -msgstr "``pgr_drivingDistance``" +msgid "Edges not part of the graph:" +msgstr "边不是图的一部分：" -#, fuzzy -msgid "Migrating `this v3.5 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgstr ":math:`2` (:math:`1\\rightarrow 3`)" -msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." -msgstr "" +msgid ":math:`3` (:math:`3 \\rightarrow 2`)" +msgstr ":math:`3` (:math:`3\\rightarrow 2`)" -#, fuzzy -msgid "Migration of |result-generic-no-seq|" -msgstr "|result-generic-no-seq|" +msgid "In a directed graph both edges do not have directionality" +msgstr "在有向图中，两条边都没有方向性" -msgid "After updating pgRouting:" -msgstr "" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "边 :math:`(source_{id}, target_{id}, cost_{id})` 是 :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -#, fuzzy -msgid "Enumerate |result-1-1-no-seq| columns" -msgstr "输出列为 |result-1-1-no-seq|" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgstr "边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})`是 :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -#, fuzzy -msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." -msgstr "要进行迁移，请在 **distance** 参数之后使用一个未命名的有效值作为 **行驶方向** ：" +msgid "In terms of a directed graph is like having four edges:" +msgstr "就有向图而言，就像有四个边：" -#, fuzzy -msgid "Enumerate |result-m-1-no-seq| columns" -msgstr "输出列为 |result-1-1-no-seq|" +msgid ":math:`source_i \\leftrightarrow target_i`" +msgstr ":math:`source_i \\leftrightarrow target_i`" -#, fuzzy -msgid "Default value of **driving side** parameter" -msgstr "右驾驶侧" +msgid ":math:`target_i \\leftrightarrow source_i`" +msgstr ":math:`target_i \\leftrightarrow source_i`" -#, fuzzy -msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." -msgstr "**driving side** 参数是未命名的强制参数，有向图和无向图的有效值不同。" +msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" -msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" -msgstr "在有向图中：有效值为 [``r``, ``R``, ``l``, ``L``]" +msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" -#, fuzzy -msgid "Default value = 'r';" -msgstr "有默认值" +msgid "Graphs without geometries" +msgstr "没有几何信息的图" -msgid "In undirected graph: valid values are [``b``, ``B``]" -msgstr "在无向图中：有效值为 [``b``, ``B``]" +msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgstr "使用 pgRouting 可以解决个人关系、家谱和文件依赖性问题。这些问题通常不会与图形相关的几何图形一起出现。" -#, fuzzy -msgid "Default value = 'b';" -msgstr "有默认值" +msgid "Wiki example" +msgstr "维基示例" -#, fuzzy -msgid "Single vertex example using ``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "Solve the example problem taken from `wikipedia `__):" +msgstr "解决来自 `维基百科 `__):" -#, fuzzy -msgid "Migrating `this v3.5 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." +msgstr "问题是找到从 :math:`1` 到 :math:`5` 的最短路径。" -#, fuzzy -msgid "Multiple vertices example using ``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "Is an undirected graph." +msgstr "是一个无向图。" -#, fuzzy -msgid "Migrating `this v3.5 `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Although visually looks like to have geometries, the drawing is not to scale." +msgstr "虽然视觉上看起来有几何形状，但该图并不是按比例绘制的。" -#, fuzzy -msgid "Migration of output column name change" -msgstr "限制迁移" +msgid "No geometries associated to the vertices or edges" +msgstr "没有与顶点或边关联的几何图形" -#, fuzzy -msgid "The standardized result columns:" -msgstr "成本函数结果列" +msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" +msgstr "有6个顶点 :math:`\\{1,2,3,4,5,6\\}`" -#, fuzzy -msgid "|result_edge_color|" -msgstr "返回集合 |result-edge-color|" +msgid "Has 9 edges:" +msgstr "有九个边：" -#, fuzzy -msgid "|result_node_color|" -msgstr "返回集合 |result-node-color|" +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" -#, fuzzy -msgid "|result_node_order|" -msgstr "返回集合 |result-node-color|" +msgid "The graph can be represented in many ways for example:" +msgstr "该图可以用多种方式表示，例如：" -msgid "Changes on column names must be done after updating pgRouting." -msgstr "" +msgid "Prepare the database" +msgstr "准备数据库" -msgid "``pgr_edgeColoring``" -msgstr "``pgr_edgeColoring``" +msgid "Create a database for the example, access the database and install pgRouting: ::" +msgstr "为示例创建一个数据库，访问数据库并安装 pgRouting： ::" -msgid ":ref:`from_old_edge_color`" -msgstr ":ref:`from_old_edge_color`" +msgid "Create a table" +msgstr "创建表" -msgid "``pgr_bipartite``" -msgstr "``pgr_bipartite``" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgstr "在无向图上执行基本路由所需的基本元素是：" -msgid ":ref:`from_old_node_color`" -msgstr ":ref:`from_old_node_color`" +msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgid "``pgr_sequentialVertexColoring``" -msgstr "``pgr_sequentialVertexColoring``" +msgid "Using this table design for this example:" +msgstr "本示例使用此表设计：" -msgid "``pgr_topologicalSort``" -msgstr "``pgr_topologicalSort``" +msgid "Insert the data" +msgstr "插入数据" -msgid ":ref:`from_toposort`" -msgstr ":ref:`from_toposort`" +msgid "Find the shortest path" +msgstr "寻找最短路径" + +msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgstr "为了解决这个例子，使用了 :doc:`pgr_dijkstra`：" + +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "从 :math:`1` 到 :math:`5` 的路径要经过以下顶点： :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" + +msgid "Vertex information" +msgstr "顶点信息" + +msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" +msgstr "要获取顶点信息，请使用 :doc:`pgr_extractVertices`" + +msgid "Graphs with geometries" +msgstr "具有几何图形的图" + +msgid "Create a routing Database" +msgstr "创建路由数据库" + +msgid "The first step is to create a database and load pgRouting in the database." +msgstr "第一步是创建数据库并在数据库中加载 pgRouting。" + +msgid "Typically create a database for each project." +msgstr "通常为每个项目创建一个数据库。" + +msgid "Once having the database to work in, load your data and build the routing application in that database." +msgstr "一旦数据库可以工作，加载数据并在该数据库中构建路由应用程序。" + +msgid "Load Data" +msgstr "加载数据" + +msgid "There are several ways to load your data into pgRouting." +msgstr "有多种方法可以将数据加载到 pgRouting 中。" + +msgid "Manually creating a database." +msgstr "手动创建数据库。" + +msgid "`Graphs without geometries`_" +msgstr "`没有几何形状的图`_" + +msgid ":doc:`sampledata`: a small graph used in the documentation examples" +msgstr ":doc:`sampledata`: 文档示例中使用的小图形" + +msgid "Using `osm2pgrouting `__" +msgstr "使用 `osm2pgrouting `__" + +msgid "There are various open source tools that can help, like:" +msgstr "有多种开源工具可以提供帮助，例如：" + +msgid "shp2pgsql" +msgstr "shp2pgsql" + +msgid "postgresql shapefile loader" +msgstr "postgresql shapefile 加载器" + +msgid "ogr2ogr" +msgstr "ogr2ogr" + +msgid "vector data conversion utility" +msgstr "矢量数据转换实用程序" + +msgid "osm2pgsql" +msgstr "osm2pgsql" + +msgid "load OSM data into postgresql" +msgstr "将OSM数据加载到postgresql中" + +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgstr "请注意，这些工具 **不会** 导入与 pgRouting 兼容的结构中的数据，当发生这种情况时，需要调整拓扑。" + +msgid "Breakup a segments on each segment-segment intersection" +msgstr "在每个线段-线段交叉点上分解线段" + +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgstr "如果缺少，请添加列并为 ``source``, ``target``, ``cost``, ``reverse_cost`` 分配值。" + +msgid "Connect a disconnected graph." +msgstr "连接断开的图。" + +msgid "Create the complete graph topology" +msgstr "创建完整的图拓扑" + +msgid "Create one or more graphs based on the application to be developed." +msgstr "根据要开发的应用程序创建一个或多个图。" + +msgid "Create a contracted graph for the high speed roads" +msgstr "为高速道路创建收缩图" + +msgid "Create graphs per state/country" +msgstr "创建每个州/国家的图" + +msgid "In few words:" +msgstr "简而言之：" + +msgid "Prepare the graph" +msgstr "准备图" + +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgstr "准备什么以及如何准备图将取决于应用程序和/或数据质量和/或信息与 pgRouting 可用的拓扑的接近程度和/或未提及的一些其他因素。" + +msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." +msgstr "准备图的步骤涉及使用 `PostGIS `__ 进行几何操作，其他一些步骤涉及诸如 :doc:`pgr_contraction` 之类的图操作来收缩图。" + +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgstr "该 `workshop `__ 逐步介绍了如何使用开放街道地图数据为小型应用程序准备图。" + +msgid "The use of indexes on the database design in general:" +msgstr "数据库设计上索引的使用一般：" + +msgid "Have the geometries indexed." +msgstr "对几何图形进行索引。" + +msgid "Have the identifiers columns indexed." +msgstr "对标识符列建立索引。" + +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgstr "请查阅 `PostgreSQL `__ 文档和 `PostGIS `__ 文档。" + +msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." +msgstr "来自 OSM 并使用 `osm2pgrouting `__ 作为导入工具的数据附带路由拓扑。 请参阅 `workshop `__ 上使用 ``osm2pgrouting`` 的示例。" + +msgid "Adjust costs" +msgstr "调整成本" + +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgstr "对于本示例， ``cost`` 和 ``reverse_cost`` 值将是几何体长度的两倍。" + +msgid "Update costs to length of geometry" +msgstr "将成本更新为几何形状的长度" + +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgstr "假设样本数据中的 ``cost`` 和 ``reverse_cost`` 列表示：" + +msgid ":math:`1` when the edge exists in the graph" +msgstr "当边存在于图中时为 :math:`1`" + +msgid ":math:`-1` when the edge does not exist in the graph" +msgstr "当图中不存在边时为 :math:`-1`" + +msgid "Using that information updating to the length of the geometries:" +msgstr "使用该信息更新几何形状的长度：" + +msgid "Which gives the following results:" +msgstr "给出以下结果：" -msgid "``pgr_transitiveClosure``" -msgstr "``pgr_transitiveClosure``" +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgstr "请注意，为了能够遵循文档示例，一切都基于原始图。" -msgid ":ref:`from_old_closure`" -msgstr ":ref:`from_old_closure`" +msgid "Returning to the original data:" +msgstr "回到原始数据：" -#, fuzzy -msgid "Migration from |result-old-closure|" -msgstr "|result-dij-dd|" +msgid "Update costs based on codes" +msgstr "根据代码更新成本" -#, fuzzy -msgid "Migration to: |result-old-closure|" -msgstr "|result-generic-no-seq|" +msgid "Other datasets, can have a column with values like" +msgstr "其他数据集可以有一列包含如下值" -msgid "After update:" -msgstr "" +msgid "``FT`` vehicle flow on the direction of the geometry" +msgstr "``FT`` 几何方向上的车流" -#, fuzzy -msgid "Remove column ``seq``" -msgstr "删除了不必要的列 seq" +msgid "``TF`` vehicle flow opposite of the direction of the geometry" +msgstr "``TF`` 车流与几何方向相反" -msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" -msgstr "" +msgid "``B`` vehicle flow on both directions" +msgstr "``B`` 双向车流" -#, fuzzy -msgid "Migration from |result-toposort|" -msgstr "限制迁移" +msgid "Preparing a code column for the example:" +msgstr "为示例准备代码列：" -#, fuzzy -msgid "Migration to: |result_node_order|" -msgstr "|result-generic-no-seq|" +msgid "Adjusting the costs based on the codes:" +msgstr "根据代码调整成本：" -#, fuzzy -msgid "Rename ``sorted_v`` to ``node``" -msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。" +msgid "Check the Routing Topology" +msgstr "检查路由拓扑" -#, fuzzy -msgid "Migration from |old-edge-color|" -msgstr "返回 |old-pid-result| 的集合" +msgid "There are lots of possible problems in a graph." +msgstr "图中可能存在很多问题。" -#, fuzzy -msgid "Migration to: |result_edge_color|" -msgstr "|result-generic-no-seq|" +msgid "The data used may not have been designed with routing in mind." +msgstr "使用的数据在设计时可能没有考虑路由。" -msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``." -msgstr "" +msgid "A graph has some very specific requirements." +msgstr "图有一些非常具体的要求。" -#, fuzzy -msgid "Migration from |old-node-color|" -msgstr "返回 |old-pid-result| 的集合" +msgid "The graph is disconnected." +msgstr "该图已断开连接。" -#, fuzzy -msgid "Migration to: |result_node_color|" -msgstr "|result-generic-no-seq|" +msgid "There are unwanted intersections." +msgstr "存在不需要的交叉点。" -msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." -msgstr "" +msgid "The graph is too large and needs to be contracted." +msgstr "图太大，需要收缩。" -#, fuzzy -msgid "Migration of deleted functions" -msgstr "限制迁移" +msgid "A sub graph is needed for the application." +msgstr "该应用程序需要一个子图。" -#, fuzzy -msgid "Functions no longer on pgRouting" -msgstr "为 pgRouting 添加功能" +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgstr "以及 pgRouting 用户（即应用程序开发人员）可能遇到的许多其他问题。" -msgid "Migration of ``pgr_alphaShape``" -msgstr "迁移 ``pgr_alphaShape``" +msgid "Crossing edges" +msgstr "交叉边" -msgid "Deprecated" -msgstr "已停用" +msgid "To get the crossing edges:" +msgstr "要获取交叉边：" -#, fuzzy -msgid "`v3.8.0 `__" -msgstr "`v3.4.0 `__" +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgstr "这些信息是正确的，例如，就车辆而言，是隧道还是横跨另一条道路的桥梁。" -msgid "Removed" -msgstr "已删除的功能" +msgid "It might be incorrect, for example:" +msgstr "它可能是不正确的，例如：" -msgid "`v4.0.0 `__" -msgstr "`v4.0.0 `__" +msgid "When it is actually an intersection of roads, where vehicles can make turns." +msgstr "当它实际上是道路交叉口时，车辆可以转弯。" -msgid "**Before Deprecation:** The following was calculated:" -msgstr "** 弃用前：** 原计算方式如下：" +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgstr "在电力线路方面，电力线能够在隧道或桥梁上甚至切换道路。" -msgid "An alphaShape was calculated" -msgstr "已计算 alphaShape" +msgid "When it is incorrect, it needs fixing:" +msgstr "当不正确时，需要修复：" -msgid "**After Deprecation:**" -msgstr "**停用后：**" +msgid "For vehicles and pedestrians" +msgstr "对于车辆和行人" -msgid "PostGIS has two ways of generating alphaShape." -msgstr "PostGIS 提供两种生成 alphaShape 的方法。" +msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." +msgstr "如果数据来自 OSM 并使用 ``osm2pgrouting`` 导入到数据库，则需要在 `OSM portal `__ 中完成修复并再次导入数据。" -msgid "If you have SFCGAL, which you can install using" -msgstr "如果你有 SFCGAL，可以通过以下方式安装" +msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgstr "一般来说，当数据来自为车辆路线准备数据的供应商时，并且出现问题时，需要从供应商处修复数据" -msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" -msgstr "自 PostGIS 3.5 起，请使用 `CG_AlphaShape `__ 函数" +msgid "For very specific applications" +msgstr "对于非常具体的应用" -msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" -msgstr "对于 PostGIS 3.5+ 版本，请继续使用旧函数名 ``ST_AlphaShape``" +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgstr "从路线车辆或行人的角度来看，数据是正确的。" -msgid "Other PostGIS options are" -msgstr "" +msgid "The data needs a local fix for the specific application." +msgstr "数据需要针对特定应用程序进行本地修复。" -msgid "`ST_ConvexHull `__" -msgstr "" +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "对交叉点进行一一分析后，对于需要局部修复的交叉点，需要 `分割 `__ 边。" -msgid "`ST_ConcaveHull `__" -msgstr "" +msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgstr "需要将新边添加到边表中，需要更新新边中的其余属性，需要删除旧边并需要更新路由拓扑。" -#, fuzzy -msgid "Migration of ``pgr_nodeNetwork``" -msgstr "迁移 ``pgr_bdAstar``" +msgid "Fixing an intersection" +msgstr "修复交叉路口" -msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." -msgstr "" +msgid "In this example the original edge table will be used to store the additional geometries." +msgstr "在此示例中，原始边线表将用于存储新增的几何图形。" -#, fuzzy -msgid "**Migration**" -msgstr "迁移" +msgid "An example use without results" +msgstr "使用示例（无结果输出）" -#, fuzzy -msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" -msgstr "使用 ``pgr_separateTouching`` 和 ``pgr_separateCrossing`` 。" +msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgstr "从 :math:`1` 到 :math:`18` 的路由无解。" -msgid "Migration of ``pgr_createTopology``" -msgstr "迁移 ``pgr_createTopology``" +msgid "Analyze the network for intersections." +msgstr "分析路网的相交情况。" -msgid "A table with `_vertices_pgr` was created." -msgstr "创建了一个包含 `_vertices_pgr` 的表。" +msgid "The analysis tell us that the network has an intersection." +msgstr "分析结果表明该路网存在交叉点。" -msgid "**After Deprecation:** The user is responsible to create the complete topology." -msgstr "**弃用后：** 用户需自行构建完整拓扑。" +msgid "Prepare tables" +msgstr "准备数据表" -msgid "Build a routing topology" -msgstr "构建路由拓扑" +msgid "Additional columns to control the origin of the segments." +msgstr "用于控制路段来源的附加列。" -msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." -msgstr "使用大多数 pgRouting 函数的基本信息 ``id, source, target, cost, [reverse_cost]`` 在 pgRouting 中被称为路由拓扑。" +msgid "Adding new segments." +msgstr "添加新线段。" -msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." -msgstr "``reverse_cost`` 是可选的，但强烈建议使用，以便由于几何列的大小而减小数据库的大小。 话虽如此，在本文档中使用了 ``reverse_cost`` 。" +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." +msgstr "调用 :doc:`pgr_separateCrossing` 并将新的线段添加到边缘表中。" -msgid "When the data comes with geometries and there is no routing topology, then this step is needed." -msgstr "当数据带有几何图形并且没有路由拓扑时，则需要此步骤。" +msgid "Update other values" +msgstr "更新其他数值" -msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions." -msgstr "几何图的所有开始和结束顶点都需要一个标识符，该标识符将存储在数据表的 ``source`` 列和 ``target`` 列中。 同样， ``cost`` 和 ``reverse_cost`` 需要具有在两个方向上遍历边的值。" +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgstr "在此示例中，仅更新了 ``cost`` 和 ``reverse_cost`` 列，其值基于几何长度并通过 ``sign`` 函数保持方向性。" -msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" -msgstr "如果这些列不存在，则需要将它们添加到相关表中。 （参见 `ALTER TABLE `__ ）" +msgid "Update the topology" +msgstr "更新拓扑结构" -msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph." -msgstr "函数 :doc:`pgr_extractVertices` 用于根据边标识符和图边的几何形状创建顶点表。" +msgid "Insert the new vertices if any." +msgstr "如有新顶点，则插入。" -msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." -msgstr "最后使用存储在顶点表上的数据填充 ``source`` 和 ``target`` 。" +msgid "Update source and target information on the edges table." +msgstr "更新边缘表中的源信息和目标信息。" -msgid "Migration of ``pgr_createVerticesTable``" -msgstr "迁移 ``pgr_createVerticesTable``" +msgid "The example has results" +msgstr "示例结果" -msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." -msgstr "**弃用后：** 用户需自行创建顶点表、索引等结构，可调用 :doc:`pgr_extractVertices` 函数实现该功能。" +msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgstr "从 :math:`1` 到 :math:`18` 的路径给出了解决方案。" -msgid "Migration of ``pgr_analyzeOneWay``" -msgstr "迁移 ``pgr_analyzeOneWay``" +msgid "Touching edges" +msgstr "相邻边线" -msgid "Number of potential problems in directionality" -msgstr "方向性潜在问题数量分析" +msgid "Visually the edges seem to be connected, but internally they are not." +msgstr "从视觉上看，这些边缘似乎是相连的，但从内部看却并非如此。" -msgid "WHERE" -msgstr "WHERE" +msgid "The validity of the information is application dependent." +msgstr "信息的有效性取决于应用情况。" -msgid "Directionality problems were calculated based on codes." -msgstr "方向性问题已根据预设规则代码完成计算。" +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgstr "也许对车辆有一个小障碍，但对行人却没有。" -msgid "Dead ends." -msgstr "死胡同。" +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "逐条分析接触边后，需局部修复的边线应通过 `split `__ 。" -msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" -msgstr "当某个节点仅存在单向通行路径（仅有进入或仅有离开的边线）时，将导致路由问题：" +msgid "Fixing a gap" +msgstr "弥补差距" -msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." -msgstr "通过保存或直接调用 :doc:`pgr_extractVertices` 获取断头路信息，并判断相邻边线是否为单行道。" +msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgstr "从 :math:`1` 到 :math:`2` 的路由无解。" -msgid "In this example :doc:`pgr_extractVertices` has already been applied." -msgstr "在本例中 :doc:`pgr_extractVertices` 已经应用。" +msgid "Analyze the network for gaps." +msgstr "分析路网的断点情况。" -msgid "Bridges." -msgstr "桥梁。" +msgid "The analysis tell us that the network has a gap." +msgstr "分析表明该路网存在断点。" -msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." -msgstr "另一个路由问题可能出现在以下情况：当无向图中存在这样一条边——删除该边会增加图的连通分量数量（即该边是桥接边），而该桥接边却是单向通行的。" +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." +msgstr "调用 :doc:`pgr_separateTouching` 并将新的线段添加到边缘表中。" -msgid "To determine if the bridges are or not one way." -msgstr "判断桥梁是否为单行道。" +msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgstr "从 :math:`1` 到 :math:`2` 的路径给出了解决方案。" -msgid "Migration of ``pgr_analyzeGraph``" -msgstr "迁移 ``pgr_analyzeGraph``" +msgid "Connecting components" +msgstr "连接组件" -msgid "Number of isolated segments." -msgstr "隔离段的数量。" +msgid "To get the graph connectivity:" +msgstr "要获取图的连通性：" -msgid "Number of dead ends." -msgstr "死胡同数量。" +msgid "There are three basic ways to connect components:" +msgstr "连接组件有三种基本方法：" -msgid "Number of potential gaps found near dead ends." -msgstr "在断头路附近发现的潜在缺口数量。" +msgid "From the vertex to the starting point of the edge" +msgstr "从顶点到边的起点" -msgid "Number of intersections. (between 2 edges)" -msgstr "交叉点数量。(两条边之间）" +msgid "From the vertex to the ending point of the edge" +msgstr "从顶点到边的终点" -msgid "Graph component" -msgstr "图形组件" +msgid "From the vertex to the closest vertex on the edge" +msgstr "从边上的顶点到最近的顶点" -msgid "A connected subgraph that is not part of any larger connected subgraph." -msgstr "不属于任何较大连通子图的连通子图。" +msgid "This solution requires the edge to be split." +msgstr "该解决方案需要将边缘分割。" -msgid "Isolated segment" -msgstr "隔离段" +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgstr "在这个例子中，将使用 :doc:`pgr_separateCrossing` 和 :doc:`pgr_separateTouching` 。" -msgid "A graph component with only one segment." -msgstr "单一孤立路段组成的网络组件。" +msgid "Get the connectivity" +msgstr "获取连接性" -msgid "Dead ends" -msgstr "死端" +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." +msgstr "在本例中：边表需要增加一列，顶点表将完全重建。" -msgid "A vertex that participates in only one edge." -msgstr "仅关联单条边线的顶点。" +msgid "Insert new edges" +msgstr "插入新边线" -msgid "gaps" -msgstr "差距" +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgstr "使用 :doc:`pgr_separateCrossing` 和 :doc:`pgr_separateTouching` 将结果插入边缘表。" -msgid "Space between two geometries." -msgstr "两个几何对象之间的空间。" +msgid "Create the vertices table" +msgstr "创建顶点表" -msgid "Intersection" -msgstr "交叉路口" +msgid "Using :doc:`pgr_extractVertices` create the table." +msgstr "使用 :doc:`pgr_extractVertices` 创建该表。" -msgid "Is a topological relationship between two geometries." -msgstr "是两个几何体之间的拓扑关系。" +msgid "Contraction of a graph" +msgstr "图的收缩" -msgid "Migration." -msgstr "迁移。" +msgid "The graph can be reduced in size using :doc:`contraction-family`" +msgstr "可以使用 :doc:`contraction-family` 来减小图形的大小" -msgid "Components." -msgstr "组件。" +msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." +msgstr "何时收缩将取决于图的大小、处理时间、数据的正确性、最终应用程序或任何其他未提及的因素。" -msgid "Instead of counting only isolated segments, determine all the components of the graph." -msgstr "不仅统计孤立线段，还要识别图中的所有连通子图（组件）。" +msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." +msgstr "确定收缩是否有用的一个相当好的方法是根据死端的数量和/或线性边的数量。" -msgid "Depending of the final application requirements use:" -msgstr "根据最终应用需求选择：" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgstr "有关如何收缩以及如何使用收缩图的完整方法在 :doc:`contraction-family` 中进行了描述" -msgid ":doc:`pgr_connectedComponents`" -msgstr ":doc:`pgr_connectedComponents`" +msgid "To get the dead ends:" +msgstr "获取死端：" -msgid ":doc:`pgr_strongComponents`" -msgstr ":doc:`pgr_strongComponents`" +msgid "A dead end happens when" +msgstr "死端（Dead End）的形成条件" -msgid ":doc:`pgr_biconnectedComponents`" -msgstr ":doc:`pgr_biconnectedComponents`" +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgstr "死端顶点（Dead End Vertex）的拓扑定义。" -msgid "For example:" -msgstr "示例：" +msgid "The vertex is on the limit of the imported graph." +msgstr "该顶点位于导入图形的边界处。" -msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." -msgstr "使用 :doc:`pgr_degree` 确定图形的所有死角，而不是计算死角。" +msgid "If a larger graph is imported then the vertex might not be a dead end" +msgstr "如果导入了更大的图，则该顶点可能不会是死端" -msgid "Potential gaps near dead ends." -msgstr "断头路附近的潜在缺口。" +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgstr "节点 :math:`4` 在查询中是一个死端，即使从视觉上看它是三条边的终点。" -msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." -msgstr "使用 :doc:`pgr_findCloseEdges` 来确定图形中的几何间隙，而不是计算几何图形之间的潜在间隙。" +msgid "Is node :math:`4` a dead end or not?" +msgstr "节点 :math:`4` 是死端还是非死端？" -msgid "Topological relationships." -msgstr "拓扑关系。" +msgid "The answer to that question will depend on the application." +msgstr "这个问题的答案将取决于应用情况。" -msgid "Instead of counting intersections, determine topological relationships between geometries." -msgstr "确定几何图形之间的拓扑关系，而不是计算交叉点。" +msgid "Is there such a small curb:" +msgstr "有这么小的路边吗：" -msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgstr "可以使用几个 PostGIS 函数： `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, 等。" +msgid "That does not allow a vehicle to use that visual intersection?" +msgstr "这不允许车辆使用该视觉交叉路口？" -msgid "Migration of ``pgr_trsp`` (Vertices)" -msgstr "迁移 ``pgr_trsp`` (顶点）" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgstr "是否适用于行人，因此行人可以轻松地在小路边行走？" -msgid "Signature:" -msgstr "签名：" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgstr "电力和电线的应用是否可以轻松地延伸到小路边顶部？" -msgid "`v3.4.0 `__" -msgstr "`v3.4.0 `__" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgstr "是否有一个大悬崖，从鹰的角度看，死胡同靠近该路段？" -msgid ":doc:`pgr_trsp`" -msgstr ":doc:`pgr_trsp`" +msgid "Depending on the answer, modification of the data might be needed." +msgstr "根据分析结果，可能需要对数据进行修改。" -msgid "`Migration of restrictions`_" -msgstr "`迁移限制`_" +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." +msgstr "当存在大量断头节点时，可调用 :doc:`contraction-family` 函数族收缩图形结构以加速处理。" -msgid "Use ``pgr_dijkstra`` when there are no restrictions." -msgstr "当没有限制条件时，使用 ``pgr_dijkstra`` 。" +msgid "Linear edges" +msgstr "线性边" -msgid "Use :doc:`pgr_dijkstra` instead." -msgstr "使用 :doc:`pgr_dijkstra` 替代。" +msgid "To get the linear edges:" +msgstr "要获得线性边：" -msgid "To get the original column names:" -msgstr "获取原始列名：" +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgstr "当这些顶点表示减速带、停止信号，并且应用程序将其纳入考虑时，这些线性顶点是正确的。" -msgid "``id1`` is the node" -msgstr "``id1`` 是节点" +msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." +msgstr "当图中存在许多不需要考虑的线性顶点时，为了加速处理，可以使用 :doc:`contraction-family` 函数来简化问题。" -msgid "``id2`` is the edge" -msgstr "``id2`` 是边" +msgid "Function's structure" +msgstr "函数的结构" -msgid "Use ``pgr_trsp`` when there are restrictions." -msgstr "当存在限制条件时，使用 ``pgr_trsp`` 。" +msgid "Once the graph preparation work has been done above, it is time to use a" +msgstr "完成上述图准备工作后，就可以使用" -msgid "Use :doc:`pgr_trsp` (One to One) instead." -msgstr "使用 :doc:`pgr_trsp` (One to One) 替代。" +msgid "The general form of a pgRouting function call is:" +msgstr "pgRouting 函数调用的一般形式是：" -msgid "Migration of ``pgr_trsp`` (Edges)" -msgstr "迁移 ``pgr_trsp`` (边)" +msgid "\\ \\" +msgstr "\\ \\" -msgid ":doc:`pgr_trsp_withPoints`" -msgstr ":doc:`pgr_trsp_withPoints`" +msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgstr "pgr_(`Inner queries`_ , **parameters**, [``Optional parameters``)" -msgid "Migration of ``pgr_trspViaVertices``" -msgstr "迁移 ``pgr_trspViaVertices``" +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." +msgstr "`Inner queries`_ ：是强制参数，是包含 SQL 查询的 ``TEXT`` 字符串。" -msgid ":doc:`pgr_dijkstraVia`" -msgstr ":doc:`pgr_dijkstraVia`" +msgid "**parameters**: Additional compulsory parameters needed by the function." +msgstr "**parameters**：函数需要的附加强制参数。" -msgid ":doc:`pgr_trspVia`" -msgstr ":doc:`pgr_trspVia`" +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgstr "``Optional parameters`` ：是非强制命名参数，省略时具有默认值。" -msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" -msgstr "无限制条件时，使用 ``pgr_dijkstraVia``" +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgstr "强制参数是位置参数，可选参数是命名参数。" -msgid "Use :doc:`pgr_dijkstraVia` instead." -msgstr "使用 :doc:`pgr_dijkstraVia` 替代。" +msgid "For example, for this :doc:`pgr_dijkstra` signature:" +msgstr "例如，对于这个 :doc:`pgr_dijkstra` 签名：" -msgid "``id1`` is the path identifier" -msgstr "``id1`` 是路径标识符" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "``id2`` is the node" -msgstr "``id2`` 是节点" +msgid "`Edges SQL`_:" +msgstr "`Edges SQL`_:" -msgid "``id3`` is the edge" -msgstr "``id3`` 是边" +msgid "Is the first parameter." +msgstr "是第一个参数。" -msgid "Use ``pgr_trspVia`` when there are restrictions" -msgstr "当存在限制条件时，使用 ``pgr_trspVia``" +msgid "It is compulsory." +msgstr "这是强制性的。" -msgid "Use :doc:`pgr_trspVia` instead." -msgstr "使用 :doc:`pgr_trspVia` 替代。" +msgid "It is an inner query." +msgstr "这是一个内部查询。" -msgid "Migration of ``pgr_trspViaEdges``" -msgstr "迁移 ``pgr_trspViaEdges``" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgstr "它没有名称，因此 **Edges SQL** 给出了需要使用哪种内部查询的想法" -msgid ":doc:`pgr_withPointsVia`" -msgstr ":doc:`pgr_withPointsVia`" +msgid "**start vid**:" +msgstr "**start vid**:" -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid "Is the second parameter." +msgstr "是第二个参数。" -msgid "Use ``pgr_withPointsVia`` when there are no restrictions" -msgstr "无限制条件时，使用 ``pgr_withPointsVia``" +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." +msgstr "它没有名称，因此 **start vid** 给出了第二个参数的值应包含的内容。" -msgid "Use :doc:`pgr_withPointsVia` instead." -msgstr "使用 :doc:`pgr_withPointsVia` 替代。" +msgid "Is the third parameter." +msgstr "是第三个参数。" -msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" -msgstr "当存在限制条件时，使用 ``pgr_trspVia_withPoints``" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgstr "它没有名称，因此 **end vid** 给出了第三个参数的值应包含的内容" -msgid "Use :doc:`pgr_trspVia_withPoints` instead." -msgstr "使用 :doc:`pgr_trspVia_withPoints` 替代。" +msgid "Is the fourth parameter." +msgstr "是第四个参数。" -msgid "Not yet classified migrations" -msgstr "" +msgid "It is optional." +msgstr "是可选的。" -msgid "Migration of ``pgr_withPointsKSP``" -msgstr "迁移 ``pgr_withPointsKSP``" +msgid "It has a name." +msgstr "它有一个名字。" -msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." -msgstr "从 `v3.6.0 `__ :doc:`pgr_withPointsKSP` 开始对结果列进行标准化。" +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgstr "参数的完整描述可以在每个函数的 `Parameters`_ 部分找到。" -msgid "|ksp-result|" -msgstr "|ksp-result|" +msgid "Function's overloads" +msgstr "函数的重载" -#, fuzzy -msgid "|generic-result|" -msgstr "|nksp-result|" +msgid "A function might have different overloads. The most common are called:" +msgstr "一个函数可能有不同的重载。 最常见的是：" -#, fuzzy -msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." -msgstr "而且 ``driving side`` 参数从命名的可选参数变为未命名的必选参数 **行驶方向**，其有效性对于有向图和无向图有所不同。" +msgid "`One to One`_" +msgstr "`One to One`_" -msgid "``pgr_withPointsKSP`` (`One to One`)" -msgstr "``pgr_withPointsKSP`` (`One to One`)" +msgid "`One to Many`_" +msgstr "`One to Many`_" -msgid "Before Migration" -msgstr "迁移前" +msgid "`Many to One`_" +msgstr "`Many to One`_" -msgid "Output columns were |old-pid-result|" -msgstr "输出列是 |old-pid-result|" +msgid "`Many to Many`_" +msgstr "`Many to Many`_" -msgid "the columns ``start_vid`` and ``end_vid`` do not exist." -msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" +msgid "`Combinations`_" +msgstr "`组合`_" -msgid "Migration" -msgstr "迁移" +msgid "Depending on the overload the parameters types change." +msgstr "根据过载，参数类型会发生变化。" -msgid "Be aware of the existence of the additional result Columns." -msgstr "注意附加结果列的存在。" +msgid "**One**: **ANY-INTEGER**" +msgstr "**一**: **ANY-INTEGER**" -#, fuzzy -msgid "New output columns are |generic-result|" -msgstr "新的输出列是 |nksp-result|" +msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgstr "**Many**: ``ARRAY`` [**ANY-INTEGER**]" -msgid "Using `this `__ example." -msgstr "使用 `这个 `__ 示例。" +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgstr "根据函数的不同，重载可能会有所不同。 但参数类型改变的概念保持不变。" -msgid "``start_vid`` contains the **start vid** parameter value." -msgstr "``start_vid`` 包含 **起始 vid** 参数值。" +msgid "When routing from:" +msgstr "当路由来自：" -msgid "``end_vid`` contains the **end vid** parameter value." -msgstr "``end_vid`` 包含 **结束 vid** 参数值。" +msgid "From **one** starting vertex" +msgstr "从 **一** 起始顶点" -msgid "If needed filter out the additional columns, for example, to return the original columns:" -msgstr "如果需要，过滤掉附加列，例如，返回原始列：" +msgid "to **one** ending vertex" +msgstr "到 **一** 结束顶点" -msgid "Use ``pgr_withPoints`` when there are no restrictions." -msgstr "无限制条件时，使用 ``pgr_withPoints`` 。" +msgid "to **many** ending vertices" +msgstr "到 **多** 结束顶点" -msgid "Use :doc:`pgr_withPoints` (One to One) instead." -msgstr "使用 :doc:`pgr_withPoints` (One to One) 替代。" +msgid "From **many** starting vertices" +msgstr "从 **多** 起始顶点" -msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." -msgstr "当存在限制条件时，使用 ``pgr_trsp_withPoints`` 。" +msgid "From **many** different starting vertices" +msgstr "从 **多个** 不同的起始顶点" -msgid "Use :doc:`pgr_trsp_withPoints` instead." -msgstr "使用 :doc:`pgr_trsp_withPoints` 替代。" +msgid "to **many** different ending vertices" +msgstr "到 **多个** 不同的结束顶点" -msgid "Migration of ``pgr_maxCardinalityMatch``" -msgstr "迁移 ``pgr_maxCardinalityMatch``" +msgid "Every tuple specifies a pair of a start vertex and an end vertex" +msgstr "每个元组指定一对起始顶点和结束顶点" -msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." -msgstr ":doc:`pgr_maxCardinalityMatch` 仅适用于无向图，因此 ``有向`` 标志已被删除。" +msgid "Users can define the combinations as desired." +msgstr "用户可以根据需要定义组合。" -msgid "Starting from `v3.4.0 `__" -msgstr "开始于 `v3.4.0 `__" +msgid "Needs a `Combinations SQL`_" +msgstr "需要 `Combinations SQL`_" -msgid "Signature to be migrated:" -msgstr "待迁移签名：" +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." +msgstr "有几种有效的内部查询类型，返回的列也取决于函数。哪种类型的内部查询将取决于函数的要求。为了简化类型的种类，使用了 **ANY-INTEGER** 和 **ANY-NUMERICAL** 。" -msgid "Migration is needed, because:" -msgstr "需要迁移，因为：" +msgid "Edges SQL for" +msgstr "边 SQL" -msgid "Use ``cost`` and ``reverse_cost`` on the inner query" -msgstr "在内部查询上使用 ``cost`` 和 ``reverse_cost``" +msgid "Some uncategorised functions" +msgstr "一些未分类的函数" -msgid "Results are ordered" -msgstr "结果已排序" +msgid "General without ``id``" +msgstr "一般没有 ``id``" -msgid "Works for undirected graphs." -msgstr "适用于无向图。" +msgid "General with (X,Y)" +msgstr "通常带有（X,Y)" -msgid "New signature" -msgstr "新签名" +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgstr "当为负时：edge (``source``, ``target``)不存在，因此它不是图的一部分。" -msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." -msgstr "``pgr_maxCardinalityMatch(text)`` 仅仅返回 ``边`` 列." +msgid "Weight of the edge (``target``, ``source``)," +msgstr "边 (``target``, ``source``)的权重，" -msgid "The optional flag ``directed`` is removed." -msgstr "可选的 ``directed`` 标志被删除。" +msgid "``x1``" +msgstr "``x1``" -msgid "Before migration" -msgstr "迁移前" +msgid "X coordinate of ``source`` vertex." +msgstr "``source`` 顶点的X坐标。" -msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." -msgstr "所使用的列是 ``going`` 和 ``coming`` ，用于表示边的存在。" +msgid "``y1``" +msgstr "``y1``" -msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." -msgstr "``directed`` 标志用于指示是 **有向** 图还是 **无向** 图。" +msgid "Y coordinate of ``source`` vertex." +msgstr "``source`` 顶点的Y坐标。" -msgid "The flag ``directed`` is ignored." -msgstr "``directed`` 标志被忽略。" +msgid "``x2``" +msgstr "``x2``" -msgid "Regardless of it's value it gives the result considering the graph as **undirected**." -msgstr "无论它的值如何，它都会给出将图视为 **无向** 的结果。" +msgid "X coordinate of ``target`` vertex." +msgstr "``target`` 顶点的X坐标。" -msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." -msgstr "使用 ``cost`` 和 ``reverse_cost`` 列来表示边的存在。" +msgid "``y2``" +msgstr "``y2``" -msgid "Do not use the flag ``directed``." -msgstr "不要使用 ``directed`` 标志。" +msgid "Y coordinate of ``target`` vertex." +msgstr "``target`` 顶点的Y坐标。" -msgid "In the query returns only ``edge`` column." -msgstr "查询中仅返回 ``edge`` 列。" +msgid "Flow" +msgstr "流" -msgid "Migration of restrictions" -msgstr "限制迁移" +msgid "Edges SQL for :doc:`flow-family`" +msgstr "用于流数据系列 ( :doc:`flow-family`) 的Edges SQL" -msgid "The structure of the restrictions have changed:" -msgstr "限制的结构发生了变化：" +msgid "Edges SQL for the following functions of :doc:`flow-family`" +msgstr "Edges SQL 适用于 :doc:`flow-family` 的以下函数" -msgid "Old restrictions structure" -msgstr "旧的限制结构" +msgid "Used in combination signatures" +msgstr "结合签名使用" -msgid "On the deprecated signatures:" -msgstr "关于已弃用的签名：" +msgid "Points SQL for" +msgstr "用于Points SQL" -msgid "Column ``rid`` is ignored" -msgstr "列 ``rid`` 被忽略" +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgstr "大多数 pgRouting 函数的主要参数是选择图的边的查询。" -msgid "``via_path``" -msgstr "``via_path``" +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgstr "根据函数的族或类别，它将具有附加参数，其中一些是强制性的，一些是可选的。" -msgid "Must be in reverse order." -msgstr "必须是相反的顺序。" +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgstr "强制参数是无名的，并且必须按要求的顺序给出。 可选参数是命名参数，并且具有默认值。" -msgid "Is of type ``TEXT``." -msgstr "属于 ``TEXT`` 类型。" +msgid "Parameters for the Via functions" +msgstr "Via 函数的参数" -msgid "When more than one via edge must be separated with ``,``." -msgstr "当多个过孔边必须用 ``,`` 分隔时。" +msgid "SQL query as described." +msgstr "如所述的 SQL 查询。" -msgid "``target_id``" -msgstr "``target_id``" +msgid "When ``true`` Graph is considered `Directed`" +msgstr "当为 ``true`` 时，图被视为 `有向` 图" -msgid "Is the last edge of the forbidden path." -msgstr "是禁止路径的最后一条边。" +msgid "When ``false`` the graph is considered as Undirected." +msgstr "当为 ``false`` 时，图被视为无向图。" -msgid "Is of type ``INTEGER``." -msgstr "类型为 ``INTEGER`` 。" +msgid "``strict``" +msgstr "``strict``" -msgid "``to_cost``" -msgstr "``to_cost``" +msgid "``false``" +msgstr "``false``" -msgid "Is of type ``FLOAT``." -msgstr "类型为 ``FLOAT`` 。" +msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" +msgstr "当为 ``true`` 时，如果路径丢失，则停止并返回 **EMPTY SET**" -msgid "Creation of the old restrictions table" -msgstr "创建旧限制表" +msgid "When ``false`` ignores missing paths returning all paths found" +msgstr "当 ``false`` 忽略丢失的路径时，返回找到的所有路径" -msgid "Old restrictions fill up" -msgstr "旧限制已满" +msgid "``U_turn_on_edge``" +msgstr "``U_turn_on_edge``" -msgid "Old restrictions contents" -msgstr "旧限制内容" +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgstr "当 为 ``true`` 时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话说，允许使用具有相同标识符的边来进行掉头。" -msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" -msgstr "``rid = 2`` 的限制表示的是路径 :math:`3 \\rightarrow 5 \\rightarrow9`" +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgstr "当为 ``false`` 时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，只有在找不到其他路径时才使用具有相同标识符的边来进行掉头。" -msgid ":math:`3\\rightarrow5`" -msgstr ":math:`3\\rightarrow5`" +msgid "For the TRSP functions" +msgstr "对于 TRSP 函数" -msgid "is on column ``via_path`` in reverse order" -msgstr "以相反的顺序位于 ``via_path`` 列上" +msgid "Array of identifiers of destination vertices." +msgstr "目标顶点的标识符数组。" -msgid "is of type ``TEXT``" -msgstr "类型为 ``TEXT``" +msgid "There are several kinds of columns returned are depending of the function." +msgstr "根据函数的不同，返回的列有多种。" -msgid ":math:`9`" -msgstr ":math:`9`" +#, fuzzy +msgid "Result columns for single path functions" +msgstr "生成树函数的结果列" -msgid "is on column ``target_id``" -msgstr "位于列 ``target_id``" +#, fuzzy +msgid "Used in functions that return one path solution per departure and destination." +msgstr "在返回一个路径解的函数中使用" -msgid "is of type ``INTEGER``" -msgstr "类型为 ``INTEGER``" +msgid ":doc:`pgr_dijkstraNear`" +msgstr ":doc:`pgr_dijkstraNear`" -msgid "New restrictions structure" -msgstr "新的限制结构" +#, fuzzy +msgid "Returns |short-generic-result|" +msgstr "返回集合 |short-generic-result|" + +msgid "``path_seq``" +msgstr "``path_seq``" -msgid "Column ``id`` is ignored" -msgstr "列 ``id`` 被忽略" +msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgstr "路径中的相对位置。 路径开头的值为 **1** 。" -msgid "Column ``path``" -msgstr "列 ``path``" +msgid "Identifier of the starting vertex of the current path." +msgstr "当前路径起始顶点的标识符。" -msgid "Is of type ``ARRAY[ANY-INTEGER]``." -msgstr "类型为 ``ARRAY[ANY-INTEGER]`` 。" +msgid "Identifier of the ending vertex of the current path." +msgstr "当前路径结束顶点的标识符。" -msgid "Contains all the edges involved on the restriction." -msgstr "包含限制所涉及的所有边。" +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." +msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符。" -msgid "The array has the ordered edges of the restriction." -msgstr "该数组具有限制的有序边。" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后一个节点。" -msgid "Column ``cost``" -msgstr "列 ``cost``" +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgstr "从使用 ``edge`` 的 ``node`` 遍历到路径序列中的下一个节点的成本。" -msgid "Is of type ``ANY-NUMERICAL``" -msgstr "类型为 ``ANY-NUMERICAL``" +#, fuzzy +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" -msgid "The creation of the restrictions table" -msgstr "限制表的创建" +#, fuzzy +msgid "Result columns for multiple paths functions" +msgstr "生成树函数的结果列" -msgid "Adding the restrictions" -msgstr "添加限制" +#, fuzzy +msgid "Used in functions that return many paths solutions per departure and destination." +msgstr "在返回一个路径解的函数中使用" -msgid "Restrictions data" -msgstr "限制数据" +#, fuzzy +msgid ":doc:`pgr_KSP`" +msgstr ":doc:`pgr_aStarCost`" -msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." -msgstr "``rid = 2`` 的限制表示的是路径 :math:`3 \\rightarrow5 \\rightarrow9` 。" +#, fuzzy +msgid ":doc:`pgr_withPointsKSP`" +msgstr ":doc:`pgr_withPoints`" -msgid "By inspection the path is clear." -msgstr "通过检查，路径是清晰的。" +msgid "Returns set of |generic-result|" +msgstr "返回 |generic-result| 的集合" -msgid "To transform the old restrictions table to the new restrictions structure," -msgstr "要将旧的限制表转换为新的限制结构，" +msgid "``path_id``" +msgstr "``path_id``" -msgid "Create a new table with the new restrictions structure." -msgstr "使用新的限制结构创建一个新表。" +msgid "Path identifier." +msgstr "路径标识符。" -msgid "In this migration guide ``new_restrictions`` is been used." -msgstr "在此迁移指南中使用了 ``new_restrictions`` 。" +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1** 。" -msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." -msgstr "为了进行这次迁移，pgRouting 提供了一个用于反转数组的辅助函数 ``_ pgr_array_reverse`` ，这在迁移过程中是必需的。" +msgid "Result columns for cost functions" +msgstr "成本函数结果列" -msgid "``_pgr_array_reverse``:" -msgstr "``_pgr_array_reverse``:" +#, fuzzy +msgid "Used by:" +msgstr "用于：" -msgid "Was created temporally for this migration" -msgstr "是为此迁移临时创建的" +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" -msgid "Is not documented." -msgstr "没有记录。" +msgid "Result columns for flow functions" +msgstr "流量函数的结果列" -msgid "Will be removed on the next mayor version 4.0.0" -msgstr "将在下一个正式版本 4.0.0 中删除" +msgid "Result columns for spanning tree functions" +msgstr "生成树函数的结果列" -msgid "The migrated table contents:" -msgstr "迁移后的表内容：" +#, fuzzy +msgid "Used in functions that return a tree solution per departure." +msgstr "在返回一个路径解的函数中使用" #, fuzzy -msgid ":doc:`pgRouting-concepts`" -msgstr "pgRouting 概念" +msgid "Result columns for simple spanning tree functions" +msgstr "生成树函数的结果列" -msgid "Ordering - Family of functions" -msgstr "排序 - 函数族" +msgid "Returns set of ``(edge, cost)``" +msgstr "返回集合 ``(edge, cost)``" -msgid "pgRouting Concepts" -msgstr "pgRouting 概念" +msgid "Cost to traverse the edge." +msgstr "穿越边的成本。" -msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" -msgstr "这是一个简单的指南，介绍了 pgRouting 入门的一些步骤。 本指南涵盖：" +msgid "Performance Tips" +msgstr "性能技巧" -msgid "Graphs" -msgstr "图" +msgid "For the Routing functions" +msgstr "对于路由功能" -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" -msgstr "图是一个有序对 :math:`G = (V ,E)` ，其中：" +msgid "To get faster results bound the queries to an area of interest of routing." +msgstr "为了获得更快的结果，将查询绑定到路由感兴趣的区域。" -msgid ":math:`V` is a set of vertices, also called nodes." -msgstr ":math:`V` 是一组顶点，也称为节点。" +msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." +msgstr "在此示例中，使用内部查询 SQL，该 SQL 不包括路由函数中的某些边并且位于结果区域内。" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgid "Given this area:" +msgstr "针对该区域：" -msgid "There are different kinds of graphs:" -msgstr "有不同类型的图：" +msgid "Calculate a route:" +msgstr "计算路线：" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgid "How to contribute" +msgstr "如何贡献" -msgid "Undirected simple graph" -msgstr "无向simple图" +msgid "Wiki" +msgstr "维基" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgid "Edit an existing `pgRouting Wiki `__ page." +msgstr "编辑现有的 `pgRouting 维基 `__ 页面。" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgid "Or create a new Wiki page" +msgstr "或者创建一个新的维基 页面" -msgid "Directed simple graph" -msgstr "有向simple图" +msgid "Create a page on the `pgRouting Wiki `__" +msgstr "在 `pgRouting 维基 `__ 上创建页面" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "Give the title an appropriate name" +msgstr "给标题起一个合适的名称" -msgid "Graphs:" -msgstr "图：" +msgid "`Example `__" +msgstr "`示例 `__" -msgid "Do not have geometries." -msgstr "没有几何图形。" +msgid "Adding Functionality to pgRouting" +msgstr "为 pgRouting 添加功能" -msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." -msgstr "一些图论问题需要图具有权重，在 pgRouting 中称为 **成本** 。" +msgid "Consult the `developer's documentation `__" +msgstr "查阅 `开发者文档 `__" -msgid "In pgRouting there are several ways to represent a graph on the database:" -msgstr "在 pgRouting 中，有多种方法来表示数据库上的图：" +msgid "Installation" +msgstr "安装" -msgid "With ``cost``" -msgstr "使用 ``cost``" +msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" +msgstr "有关下载和安装适用于不同操作系统的二进制文件的说明、本文档中未包含的其他注释和更正，可以在 `安装维基 `__ 中找到" -msgid "(``id``, ``source``, ``target``, ``cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``)" +#, fuzzy +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgstr "使用pgRouting需要安装PostGIS，请阅读本 `安装指南 `__ 中有关安装的信息" -msgid "With ``cost`` and ``reverse_cost``" -msgstr "使用 ``cost`` 和 ``reverse_cost``" +msgid "Short Version" +msgstr "简洁版本" -msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgid "Extracting the tar ball" +msgstr "解压 tar 压缩文件" -msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." -msgstr "边的标识符。要求在数据库中以一致的方式使用。" +msgid "To compile assuming you have all the dependencies in your search path:" +msgstr "假设您的搜索路径中有所有依赖项，则进行编译：" -msgid "Identifier of a vertex." -msgstr "顶点的标识符。" +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." +msgstr "安装 pgRouting 后，需要在您想要使用它的每个数据库中启用它。" -msgid "Weight of the edge (``source``, ``target``):" -msgstr "边 (``source``, ``target``)的权重：" +msgid "Get the sources" +msgstr "获取源码" -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." -msgstr "当为负时，图上不存在edge (``source``, ``target``)。" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgstr "pgRouting 最新版本可以在 https://github.com/pgRouting/pgrouting/releases/latest 中找到" -msgid "``cost`` must exist in the query." -msgstr "查询中必须存在 ``cost`` 。" +msgid "To download this release:" +msgstr "要下载此版本：" -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." -msgstr "当为负时，图上不存在边(``target``, ``source``)。" +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgstr "转到 :ref:`install-short` 以获取有关提取 tar 包和编译 pgRouting 的更多说明。" -msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." -msgstr "图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。" +msgid "git" +msgstr "git" -msgid "Graph with ``cost``" -msgstr "``cost`` 图" +msgid "To download the repository" +msgstr "下载存储库" -msgid "The weighted directed graph, :math:`G_d(V,E)`:" -msgstr "加权有向图， :math:`G_d(V,E)`:" +msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." +msgstr "请参阅 :ref:`install-short` 获取有关编译 pgRouting 的更多说明（从 GitHub 下载 pgRouting 存储库时不涉及 tar 文件）。" -msgid "Graph data is obtained with a query" -msgstr "通过查询获取图数据" +msgid "Enabling and upgrading in the database" +msgstr "在数据库中启用和升级" -msgid "``SELECT id, source, target, cost FROM edges``" -msgstr "``SELECT id, source, target, cost FROM edges``" +msgid "Enabling the database" +msgstr "启用数据库" -msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" -msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." +msgstr "pgRouting 是 PostgreSQL 扩展，依赖 PostGIS 向最终用户提供功能。 下面给出的代码演示了在数据库中启用 PostGIS 和 pgRouting。" -msgid "Edges where ``cost`` is non negative are part of the graph." -msgstr "``cost`` 非负的边是图的一部分。" +msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgstr "在数据库中启用 PostGIS 和 pgRouting 后检查它们的版本。" -msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgid "Upgrading the database" +msgstr "升级数据库" -msgid "All vertices in ``source`` and ``target`` are part of the graph." -msgstr "``source`` 和 ``target`` 中的所有顶点都是图的一部分。" +#, fuzzy +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgstr "要将数据库中的 pgRouting 升级到 4.0.0 版本，请使用以下命令：" -msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "在有向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性：:math:`source_{id} \\rightarrow target_{id}`" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgstr "更多信息可以在 https://www.postgresql.org/docs/current/sql-createextension.html 中找到" -msgid "For the following data:" -msgstr "对于以下数据：" +msgid "Dependencies" +msgstr "依赖" -msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." -msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分。" +msgid "Compilation Dependencies" +msgstr "编译依赖" -msgid "The data is representing the following graph:" -msgstr "数据代表下图：" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgstr "为了能够编译 pgRouting，请确保满足以下依赖项：" -msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "在无向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 没有方向性：:math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "C and C++0x compilers" +msgstr "C 和 C++0x编译器" -msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" -msgstr "在有向图的术语中，这相当于有两条边： :math:`source_{id} \\leftrightarrow target_{id}`" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgstr "使用 Boost 1.56 到 Boost 1.74 进行编译需要具有 C++03 或 C++ 11 标准支持的 C ++编译器" -msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." -msgstr "边 :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) 不是图的一部分。" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgstr "使用 Boost 1.75 进行编译需要具有 C++ 14 标准支持的 C++ 编译器" -msgid "Graph with ``cost`` and ``reverse_cost``" -msgstr "带有 ``cost`` 和 ``reverse_cost`` 的图" +#, fuzzy +msgid "Postgresql version >= 13" +msgstr "PostgreSQL version 9.3" -msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" -msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" +#, fuzzy +msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgstr "Boost 图库 (BGL)。 版本 >= 1.56" -msgid "The set of edges :math:`E`:" -msgstr "边的集合 :math:`E` ：" +#, fuzzy +msgid "CMake >= 3.12" +msgstr "CMake >= 3.2" -msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid "For user's documentation" +msgstr "用于用户文档" -msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." -msgstr "边 :math:`(source \\rightarrow target)` 中的 ``cost`` 是非负数的都属于图的一部分。" +#, fuzzy +msgid "Sphinx >= 4.0" +msgstr "Sphinx >= 1.1" -msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." -msgstr "边 :math:`(target \\rightarrow source)` 中的 ``reverse_cost`` 是非负数的都属于图的一部分。" +msgid "For developer's documentation" +msgstr "对于开发者文档" -msgid "The set of vertices :math:`V`:" -msgstr "顶点集 :math:`V` ：" +msgid "Doxygen >= 1.7" +msgstr "Doxygen >= 1.7" -msgid "In a directed graph both edges have directionality" -msgstr "在有向图中，两条边都有方向性" +msgid "For testing" +msgstr "供测试用" -msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性： :math:`source_{id} \\rightarrow target_{id}`" +msgid "pgtap" +msgstr "pgtap" -msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" -msgstr "边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` 具有方向性： :math:`target_{id} \\rightarrow source_{id}`" +msgid "pg_prove" +msgstr "pg_prove" -msgid "Edges not part of the graph:" -msgstr "边不是图的一部分：" +msgid "For using:" +msgstr "用于使用：" -msgid ":math:`2` (:math:`1 \\rightarrow 3`)" -msgstr ":math:`2` (:math:`1\\rightarrow 3`)" +#, fuzzy +msgid "PostGIS version >= 3.0.0" +msgstr "PostGIS版本 >= 2.2" -msgid ":math:`3` (:math:`3 \\rightarrow 2`)" -msgstr ":math:`3` (:math:`3\\rightarrow 2`)" +msgid "Example: Installing dependencies on linux" +msgstr "示例：在 Linux 上安装依赖项" -msgid "In a directed graph both edges do not have directionality" -msgstr "在有向图中，两条边都没有方向性" +msgid "Installing the compilation dependencies" +msgstr "安装编译依赖项" -msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "边 :math:`(source_{id}, target_{id}, cost_{id})` 是 :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Build dependencies" +msgstr "构建依赖关系" -msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgstr "边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})`是 :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Optional dependencies" +msgstr "可选依赖项" -msgid "In terms of a directed graph is like having four edges:" -msgstr "就有向图而言，就像有四个边：" +#, fuzzy +msgid "For documentation" +msgstr "用于用户文档" -msgid ":math:`source_i \\leftrightarrow target_i`" -msgstr ":math:`source_i \\leftrightarrow target_i`" +msgid "Configuring" +msgstr "配置" -msgid ":math:`target_i \\leftrightarrow source_i`" -msgstr ":math:`target_i \\leftrightarrow source_i`" +msgid "pgRouting uses the `cmake` system to do the configuration." +msgstr "pgRouting 使用 `cmake` 系统进行配置。" -msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" -msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgid "Configurable variables" +msgstr "可配置变量" -msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" -msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgid "To see the variables that can be configured" +msgstr "查看可以配置的变量" -msgid "Graphs without geometries" -msgstr "没有几何信息的图" +msgid "The build directory is different from the source directory" +msgstr "构建目录与源目录不同" -msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." -msgstr "使用 pgRouting 可以解决个人关系、家谱和文件依赖性问题。这些问题通常不会与图形相关的几何图形一起出现。" +msgid "Configuring The Documentation" +msgstr "配置文档" -msgid "Wiki example" -msgstr "维基示例" +msgid "User and developers documentation are not build if prerequisites are not found." +msgstr "" -msgid "Solve the example problem taken from `wikipedia `__):" -msgstr "解决来自 `维基百科 `__):" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgstr "文档的大部分工作都集中在 HTML 文件上。 构建文档的一些变量：" -msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." -msgstr "问题是找到从 :math:`1` 到 :math:`5` 的最短路径。" +msgid "Variable" +msgstr "变量" -msgid "Is an undirected graph." -msgstr "是一个无向图。" +msgid "Comment" +msgstr "解释" -msgid "Although visually looks like to have geometries, the drawing is not to scale." -msgstr "虽然视觉上看起来有几何形状，但该图并不是按比例绘制的。" +msgid "BUILD_HTML" +msgstr "BUILD_HTML" -msgid "No geometries associated to the vertices or edges" -msgstr "没有与顶点或边关联的几何图形" +msgid "BOOL=ON" +msgstr "BOOL=ON" -msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" -msgstr "有6个顶点 :math:`\\{1,2,3,4,5,6\\}`" +msgid "If ON, turn on/off building HTML for user's documentation" +msgstr "如果打开，则打开/关闭为用户文档构建 HTML" -msgid "Has 9 edges:" -msgstr "有九个边：" +msgid "BUILD_DOXY" +msgstr "BUILD_DOXY" -msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" -msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgid "If ON, turn on/off building HTML for developer's documentation" +msgstr "如果打开，则打开/关闭为开发人员文档构建 HTML" -msgid "The graph can be represented in many ways for example:" -msgstr "该图可以用多种方式表示，例如：" +msgid "BUILD_LATEX" +msgstr "BUILD_LATEX" -msgid "Prepare the database" -msgstr "准备数据库" +msgid "BOOL=OFF" +msgstr "BOOL=OFF" -msgid "Create a database for the example, access the database and install pgRouting: ::" -msgstr "为示例创建一个数据库，访问数据库并安装 pgRouting： ::" +msgid "If ON, turn on/off building PDF" +msgstr "如果打开，则打开/关闭构建 PDF" -msgid "Create a table" -msgstr "创建表" +msgid "BUILD_MAN" +msgstr "BUILD_MAN" -msgid "The basic elements needed to perform basic routing on an undirected graph are:" -msgstr "在无向图上执行基本路由所需的基本元素是：" +msgid "If ON, turn on/off building MAN pages" +msgstr "如果为 ON，则打开/关闭构建 MAN 页面" -msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgid "DOC_USE_BOOTSTRAP" +msgstr "DOC_USE_BOOTSTRAP" -msgid "Using this table design for this example:" -msgstr "本示例使用此表设计：" +msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" +msgstr "如果打开，则对用户文档的 HTML 页面使用 sphinx-bootstrap" -msgid "Insert the data" -msgstr "插入数据" +msgid "EN" +msgstr "" -msgid "Find the shortest path" -msgstr "寻找最短路径" +#, fuzzy +msgid "if OFF the English documentation will no be built" +msgstr "有关此文档何时构建的信息" -msgid "To solve this example :doc:`pgr_dijkstra` is used:" -msgstr "为了解决这个例子，使用了 :doc:`pgr_dijkstra`：" +msgid "ES" +msgstr "" -msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" -msgstr "从 :math:`1` 到 :math:`5` 的路径要经过以下顶点： :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +#, fuzzy +msgid "if OFF the Spanish documentation will no be built" +msgstr "有关此文档何时构建的信息" -msgid "Vertex information" -msgstr "顶点信息" +msgid "SV" +msgstr "" -msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" -msgstr "要获取顶点信息，请使用 :doc:`pgr_extractVertices`" +#, fuzzy +msgid "if OFF the Swedish documentation will no be built" +msgstr "有关此文档何时构建的信息" -msgid "Graphs with geometries" -msgstr "具有几何图形的图" +msgid "ZH_HANS" +msgstr "" -msgid "Create a routing Database" -msgstr "创建路由数据库" +msgid "if OFF the Chinese simplified documentation will no be built" +msgstr "" -msgid "The first step is to create a database and load pgRouting in the database." -msgstr "第一步是创建数据库并在数据库中加载 pgRouting。" +msgid "Building" +msgstr "构建" -msgid "Typically create a database for each project." -msgstr "通常为每个项目创建一个数据库。" +msgid "Using ``make`` to build the code and the documentation" +msgstr "使用 ``make`` 构建代码和文档" -msgid "Once having the database to work in, load your data and build the routing application in that database." -msgstr "一旦数据库可以工作，加载数据并在该数据库中构建路由应用程序。" +#, fuzzy +msgid "The following instructions start from ``path/to/pgrouting/build``" +msgstr "以下说明从 *path/to/pgrouting/build* 开始" -msgid "Load Data" -msgstr "加载数据" +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgstr "我们已经在多个平台上进行了测试，安装或重新安装需要所有步骤。" -msgid "There are several ways to load your data into pgRouting." -msgstr "有多种方法可以将数据加载到 pgRouting 中。" +msgid "Linux" +msgstr "Linux" -msgid "Manually creating a database." -msgstr "手动创建数据库。" +#, fuzzy +msgid "The following instructions start from ``path/to/pgrouting``" +msgstr "以下说明从 *path/to/pgrouting* 开始" -msgid "`Graphs without geometries`_" -msgstr "`没有几何形状的图`_" +msgid "Testing" +msgstr "测试" -msgid ":doc:`sampledata`: a small graph used in the documentation examples" -msgstr ":doc:`sampledata`: 文档示例中使用的小图形" +msgid "Currently there is no :code:`make test` and testing is done as follows" +msgstr "目前没有 :code:`make test` ，测试如下" -msgid "Using `osm2pgrouting `__" -msgstr "使用 `osm2pgrouting `__" +msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." +msgstr "pgRouting 是 `PostGIS `__ 和 `PostgreSQL `__ 地理空间数据库的扩展，并添加了路由和其他网络分析功能。 pgRouting的前身 – pgDijkstra，由 `Camptocamp `__ 的Sylvain Pasche编写，后来被Orkney扩展并更名为pgRouting。 该项目现在得到了 `Georepublic `__ 、 `Paragon Corporation `__ 和广大用户社区的支持和维护。" -msgid "There are various open source tools that can help, like:" -msgstr "有多种开源工具可以提供帮助，例如：" +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgstr "pgRouting 是 `OSGeo Community Projects `__ 的一部分，隶属于 `OSGeo Foundation `__ ，并被包含在 `OSGeoLive `__ 。" -msgid "shp2pgsql" -msgstr "shp2pgsql" +msgid "Licensing" +msgstr "许可" -msgid "postgresql shapefile loader" -msgstr "postgresql shapefile 加载器" +msgid "The following licenses can be found in pgRouting:" +msgstr "可以在 pgRouting 中找到以下许可证：" -msgid "ogr2ogr" -msgstr "ogr2ogr" +msgid "**License**" +msgstr "**许可**" -msgid "vector data conversion utility" -msgstr "矢量数据转换实用程序" +msgid "GNU General Public License v2.0 or later" +msgstr "GNU 通用公共许可证 v2.0 或更高版本" -msgid "osm2pgsql" -msgstr "osm2pgsql" +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgstr "pgRouting 的大多数功能都可以在 `GNU General Public License v2.0 or later `_ 。" -msgid "load OSM data into postgresql" -msgstr "将OSM数据加载到postgresql中" +msgid "Boost Software License - Version 1.0" +msgstr "Boost 软件许可证 - 版本 1.0" -msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." -msgstr "请注意，这些工具 **不会** 导入与 pgRouting 兼容的结构中的数据，当发生这种情况时，需要调整拓扑。" +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgstr "一些 Boost 扩展可根据 `Boost Software License - Version 1.0 `_ 。" -msgid "Breakup a segments on each segment-segment intersection" -msgstr "在每个线段-线段交叉点上分解线段" +msgid "MIT-X License" +msgstr "MIT-X License" -msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." -msgstr "如果缺少，请添加列并为 ``source``, ``target``, ``cost``, ``reverse_cost`` 分配值。" +msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgstr "iMaptools.com 贡献的一些代码可在 MIT-X 许可证下使用。" -msgid "Connect a disconnected graph." -msgstr "连接断开的图。" +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgstr "pgRouting 手册根据 `知识共享署名-相同方式共享 3.0 许可证获得许可 `_ 。" -msgid "Create the complete graph topology" -msgstr "创建完整的图拓扑" +msgid "In general license information should be included in the header of each source file." +msgstr "一般来说，许可证信息应包含在每个源文件的标头中。" -msgid "Create one or more graphs based on the application to be developed." -msgstr "根据要开发的应用程序创建一个或多个图。" +msgid "Contributors" +msgstr "贡献者" -msgid "Create a contracted graph for the high speed roads" -msgstr "为高速道路创建收缩图" +msgid "This Release Contributors" +msgstr "此版本贡献者" -msgid "Create graphs per state/country" -msgstr "创建每个州/国家的图" +#, fuzzy +msgid "Individuals in this release |release| (in alphabetical order)" +msgstr "本次 v3.8.x 版本发布的个人贡献者（按字母顺序排列）" -msgid "In few words:" -msgstr "简而言之：" +#, fuzzy +msgid "Mohit Rawat, Regina Obe, Vicky Vergara" +msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" -msgid "Prepare the graph" -msgstr "准备图" +msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgstr "还有所有为我们的产品（osm2pgrouting、pgRouting、pgRoutingLayer、workshop）提供意见、发现问题、提出拉取请求等帮助的开发者。" -msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." -msgstr "准备什么以及如何准备图将取决于应用程序和/或数据质量和/或信息与 pgRouting 可用的拓扑的接近程度和/或未提及的一些其他因素。" +msgid "Translators (in alphabetical order)" +msgstr "翻译（按字母顺序排列）" -msgid "The steps to prepare the graph involve geometry operations using `PostGIS `__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph." -msgstr "准备图的步骤涉及使用 `PostGIS `__ 进行几何操作，其他一些步骤涉及诸如 :doc:`pgr_contraction` 之类的图操作来收缩图。" +msgid "Chinese:" +msgstr "" -msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." -msgstr "该 `workshop `__ 逐步介绍了如何使用开放街道地图数据为小型应用程序准备图。" +msgid "Dapeng Wang" +msgstr "Dapeng Wang" -msgid "The use of indexes on the database design in general:" -msgstr "数据库设计上索引的使用一般：" +msgid "Spanish:" +msgstr "" -msgid "Have the geometries indexed." -msgstr "对几何图形进行索引。" +msgid "Vicky Vergara" +msgstr "" -msgid "Have the identifiers columns indexed." -msgstr "对标识符列建立索引。" +msgid "Swedish:" +msgstr "" -msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." -msgstr "请查阅 `PostgreSQL `__ 文档和 `PostGIS `__ 文档。" +msgid "Daniel Nylander" +msgstr "" -msgid "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop `__." -msgstr "来自 OSM 并使用 `osm2pgrouting `__ 作为导入工具的数据附带路由拓扑。 请参阅 `workshop `__ 上使用 ``osm2pgrouting`` 的示例。" +msgid "Corporate Sponsors in this release (in alphabetical order)" +msgstr "本次发布中的企业赞助商（按字母顺序排列）" -msgid "Adjust costs" -msgstr "调整成本" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "这些是为 pgRouting 项目贡献了开发人员时间、托管或直接提供资金的公司实体：" -msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." -msgstr "对于本示例， ``cost`` 和 ``reverse_cost`` 值将是几何体长度的两倍。" +msgid "`OSGeo `__" +msgstr "`OSGeo `__" -msgid "Update costs to length of geometry" -msgstr "将成本更新为几何形状的长度" +msgid "`OSGeo UK `__" +msgstr "`OSGeo UK `__" -msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" -msgstr "假设样本数据中的 ``cost`` 和 ``reverse_cost`` 列表示：" +msgid "`Google Summer of Code `__" +msgstr "`Google Summer of Code `__" -msgid ":math:`1` when the edge exists in the graph" -msgstr "当边存在于图中时为 :math:`1`" +msgid "`HighGo Software `__" +msgstr "`HighGo Software `__" -msgid ":math:`-1` when the edge does not exist in the graph" -msgstr "当图中不存在边时为 :math:`-1`" +msgid "`Paragon Corporation `__" +msgstr "`Paragon Corporation `__" -msgid "Using that information updating to the length of the geometries:" -msgstr "使用该信息更新几何形状的长度：" +msgid "Contributors Past & Present:" +msgstr "过去与现在的贡献者：" -msgid "Which gives the following results:" -msgstr "给出以下结果：" +msgid "Individuals (in alphabetical order)" +msgstr "个人贡献者（按字母排序）" -msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." -msgstr "请注意，为了能够遵循文档示例，一切都基于原始图。" +#, fuzzy +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgid "Returning to the original data:" -msgstr "回到原始数据：" +msgid "Corporate Sponsors (in alphabetical order)" +msgstr "企业赞助商（按字母顺序排列）" -msgid "Update costs based on codes" -msgstr "根据代码更新成本" +msgid "Camptocamp" +msgstr "Camptocamp" -msgid "Other datasets, can have a column with values like" -msgstr "其他数据集可以有一列包含如下值" +msgid "CSIS (University of Tokyo)" +msgstr "CSIS (University of Tokyo)" -msgid "``FT`` vehicle flow on the direction of the geometry" -msgstr "``FT`` 几何方向上的车流" +msgid "Georepublic" +msgstr "Georepublic" -msgid "``TF`` vehicle flow opposite of the direction of the geometry" -msgstr "``TF`` 车流与几何方向相反" +msgid "Google Summer of Code" +msgstr "Google Summer of Code" -msgid "``B`` vehicle flow on both directions" -msgstr "``B`` 双向车流" +msgid "HighGo Software" +msgstr "HighGo Software" -msgid "Preparing a code column for the example:" -msgstr "为示例准备代码列：" +msgid "iMaptools" +msgstr "iMaptools" -msgid "Adjusting the costs based on the codes:" -msgstr "根据代码调整成本：" +msgid "Leopark" +msgstr "Leopark" -msgid "Check the Routing Topology" -msgstr "检查路由拓扑" +msgid "Orkney" +msgstr "Orkney" -msgid "There are lots of possible problems in a graph." -msgstr "图中可能存在很多问题。" +msgid "OSGeo" +msgstr "OSGeo" -msgid "The data used may not have been designed with routing in mind." -msgstr "使用的数据在设计时可能没有考虑路由。" +msgid "OSGeo UK" +msgstr "OSGeo UK" -msgid "A graph has some very specific requirements." -msgstr "图有一些非常具体的要求。" +msgid "Paragon Corporation" +msgstr "Paragon Corporation" -msgid "The graph is disconnected." -msgstr "该图已断开连接。" +msgid "Versaterm Inc." +msgstr "Versaterm Inc." -msgid "There are unwanted intersections." -msgstr "存在不需要的交叉点。" +msgid "More Information" +msgstr "更多信息" -msgid "The graph is too large and needs to be contracted." -msgstr "图太大，需要收缩。" +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "最新的软件、文档和新闻可在 pgRouting 网站 https://pgrouting.org 上获取。" -msgid "A sub graph is needed for the application." -msgstr "该应用程序需要一个子图。" +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgstr "PostgreSQL 数据库服务器位于 PostgreSQL 主站点 https://www.postgresql.org。" -msgid "and many other problems that the pgRouting user, that is the application developer might encounter." -msgstr "以及 pgRouting 用户（即应用程序开发人员）可能遇到的许多其他问题。" +msgid "PostGIS extension at the PostGIS project web site https://postgis.net." +msgstr "PostGIS 项目网站 https://postgis.net 上的 PostGIS 扩展。" -msgid "Crossing edges" -msgstr "交叉边" +msgid "Boost C++ source libraries at https://www.boost.org." +msgstr "Boost C++ 源库位于 https://www.boost.org。" -msgid "To get the crossing edges:" -msgstr "要获取交叉边：" +msgid ":doc:`migration`" +msgstr ":doc:`migration`" -msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." -msgstr "这些信息是正确的，例如，就车辆而言，是隧道还是横跨另一条道路的桥梁。" +msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_KSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" -msgid "It might be incorrect, for example:" -msgstr "它可能是不正确的，例如：" +msgid "Availability" +msgstr "可用性" -msgid "When it is actually an intersection of roads, where vehicles can make turns." -msgstr "当它实际上是道路交叉口时，车辆可以转弯。" +msgid "Version 4.0.0" +msgstr "Version 4.0.0" -msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." -msgstr "在电力线路方面，电力线能够在隧道或桥梁上甚至切换道路。" +msgid "All signatures promoted to official." +msgstr "所有签名均已升级为正式版本。" -msgid "When it is incorrect, it needs fixing:" -msgstr "当不正确时，需要修复：" +msgid "Version 3.6.0" +msgstr "版本3.6.0" -msgid "For vehicles and pedestrians" -msgstr "对于车辆和行人" +msgid "Standardizing output columns to |nksp-result|" +msgstr "将输出列标准化为 |nksp-result|" -msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." -msgstr "如果数据来自 OSM 并使用 ``osm2pgrouting`` 导入到数据库，则需要在 `OSM portal `__ 中完成修复并再次导入数据。" +msgid "pgr_ksp(One to One)" +msgstr "pgr_ksp(One to One)" -msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" -msgstr "一般来说，当数据来自为车辆路线准备数据的供应商时，并且出现问题时，需要从供应商处修复数据" +msgid "Added ``start_vid`` and ``end_vid`` result columns." +msgstr "增加 ``start_vid`` 和 ``end_vid`` 结果列。" -msgid "For very specific applications" -msgstr "对于非常具体的应用" +msgid "New proposed signatures:" +msgstr "新提议的签名：" -msgid "The data is correct when from the point of view of routing vehicles or pedestrians." -msgstr "从路线车辆或行人的角度来看，数据是正确的。" +msgid "pgr_ksp(One to Many)" +msgstr "pgr_ksp(One to Many)" -msgid "The data needs a local fix for the specific application." -msgstr "数据需要针对特定应用程序进行本地修复。" +msgid "pgr_ksp(Many to One)" +msgstr "pgr_ksp(Many to One)" -msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." -msgstr "对交叉点进行一一分析后，对于需要局部修复的交叉点，需要 `分割 `__ 边。" +msgid "pgr_ksp(Many to Many)" +msgstr "pgr_ksp(Many to Many)" -msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." -msgstr "需要将新边添加到边表中，需要更新新边中的其余属性，需要删除旧边并需要更新路由拓扑。" +msgid "pgr_ksp(Combinations)" +msgstr "pgr_ksp(Combinations)" -msgid "Fixing an intersection" -msgstr "修复交叉路口" +msgid "Version 2.1.0" +msgstr "版本2.1.0" -msgid "In this example the original edge table will be used to store the additional geometries." -msgstr "在此示例中，原始边线表将用于存储新增的几何图形。" +msgid "Signature change" +msgstr "签名变更" -msgid "An example use without results" -msgstr "使用示例（无结果输出）" +msgid "Old signature no longer supported" +msgstr "不再支持旧签名" -msgid "Routing from :math:`1` to :math:`18` gives no solution." -msgstr "从 :math:`1` 到 :math:`18` 的路由无解。" +msgid "Version 2.0.0" +msgstr "版本2.0.0" -msgid "Analyze the network for intersections." -msgstr "分析路网的相交情况。" +msgid "Official function." +msgstr "官方函数。" -msgid "The analysis tell us that the network has an intersection." -msgstr "分析结果表明该路网存在交叉点。" +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgstr "基于Yen算法的K最短路径路由算法。 “K”是所需的最短路径的数量。" -msgid "Prepare tables" -msgstr "准备数据表" +msgid "|Boost| Boost Graph Inside" +msgstr "|Boost| Boost 图内部" -msgid "Additional columns to control the origin of the segments." -msgstr "用于控制路段来源的附加列。" +msgid "Boost Graph inside" +msgstr "内部使用 Boost Graph" -msgid "Adding new segments." -msgstr "添加新线段。" +msgid "Signatures" +msgstr "签名" -msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." -msgstr "调用 :doc:`pgr_separateCrossing` 并将新的线段添加到边缘表中。" +msgid "Summary" +msgstr "总结" -msgid "Update other values" -msgstr "更新其他数值" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." -msgstr "在此示例中，仅更新了 ``cost`` 和 ``reverse_cost`` 列，其值基于几何长度并通过 ``sign`` 函数保持方向性。" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgid "Update the topology" -msgstr "更新拓扑结构" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgid "Insert the new vertices if any." -msgstr "如有新顶点，则插入。" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgid "Update source and target information on the edges table." -msgstr "更新边缘表中的源信息和目标信息。" +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgid "The example has results" -msgstr "示例结果" +msgid "**options:** ``[directed, heap_paths]``" +msgstr "**options:** ``[directed, heap_paths]``" -msgid "Routing from :math:`1` to :math:`18` gives a solution." -msgstr "从 :math:`1` 到 :math:`18` 的路径给出了解决方案。" +msgid "Returns set of |nksp-result|" +msgstr "返回集合 |nksp-result|" -msgid "Touching edges" -msgstr "相邻边线" +msgid "OR EMPTY SET" +msgstr "OR EMPTY SET" -msgid "Visually the edges seem to be connected, but internally they are not." -msgstr "从视觉上看，这些边缘似乎是相连的，但从内部看却并非如此。" +msgid "Example" +msgstr "示例" -msgid "The validity of the information is application dependent." -msgstr "信息的有效性取决于应用情况。" +msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." +msgstr "在有向图上获取从 :math:`6` 到 :math:`17` 的 2 条路径。" -msgid "Maybe there is a small barrier for vehicles but not for pedestrians." -msgstr "也许对车辆有一个小障碍，但对行人却没有。" +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "获取有向图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}` 的 2 条路径。" -msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." -msgstr "逐条分析接触边后，需局部修复的边线应通过 `split `__ 。" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgstr "在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路经。" -msgid "Fixing a gap" -msgstr "弥补差距" +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}` 的2条路经。" -msgid "Routing from :math:`1` to :math:`2` gives no solution." -msgstr "从 :math:`1` 到 :math:`2` 的路由无解。" +msgid "Using a combinations table on an directed graph" +msgstr "在有向图上使用组合表" -msgid "Analyze the network for gaps." -msgstr "分析路网的断点情况。" +msgid "The combinations table:" +msgstr "组合表：" -msgid "The analysis tell us that the network has a gap." -msgstr "分析表明该路网存在断点。" +msgid "The query:" +msgstr "查询：" -msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." -msgstr "调用 :doc:`pgr_separateTouching` 并将新的线段添加到边缘表中。" +msgid "Identifier of the destination vertex." +msgstr "目标顶点的标识符。" -msgid "Routing from :math:`1` to :math:`2` gives a solution." -msgstr "从 :math:`1` 到 :math:`2` 的路径给出了解决方案。" +msgid "**K**" +msgstr "**K**" -msgid "Connecting components" -msgstr "连接组件" +msgid "Number of required paths." +msgstr "所需路径的数量。" -msgid "To get the graph connectivity:" -msgstr "要获取图的连通性：" +msgid "KSP Optional parameters" +msgstr "KSP 可选参数" -msgid "There are three basic ways to connect components:" -msgstr "连接组件有三种基本方法：" +msgid "``heap_paths``" +msgstr "``heap_paths``" -msgid "From the vertex to the starting point of the edge" -msgstr "从顶点到边的起点" +msgid "When ``false`` Returns at most K paths." +msgstr "当 ``false`` 时返回最多 K 条路径。" -msgid "From the vertex to the ending point of the edge" -msgstr "从顶点到边的终点" +msgid "When ``true`` all the calculated paths while processing are returned." +msgstr "当 ``true`` 时，返回处理时的所有计算路径。" -msgid "From the vertex to the closest vertex on the edge" -msgstr "从边上的顶点到最近的顶点" +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgstr "粗略地说，当最短路径有 ``N`` 个边时，对于 ``K`` 值较小且 ``K > 5`` ，堆将包含大约 ``N * K`` 条路径。" -msgid "This solution requires the edge to be split." -msgstr "该解决方案需要将边缘分割。" +msgid "Additional Examples" +msgstr "其他示例" -msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." -msgstr "在这个例子中，将使用 :doc:`pgr_separateCrossing` 和 :doc:`pgr_separateTouching` 。" +msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" +msgstr "在无向图中获取从 :math:`6` 到 :math:`17` 的2条路径" -msgid "Get the connectivity" -msgstr "获取连接性" +msgid "Also get the paths in the heap." +msgstr "还获取堆中的路径。" -msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." -msgstr "在本例中：边表需要增加一列，顶点表将完全重建。" +msgid "Get 2 paths using combinations table on an undirected graph" +msgstr "使用无向图上的组合表获取 2 条路径" -msgid "Insert new edges" -msgstr "插入新边线" +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgstr "在无向图中获取从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路径。" -msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." -msgstr "使用 :doc:`pgr_separateCrossing` 和 :doc:`pgr_separateTouching` 将结果插入边缘表。" +msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgid "Create the vertices table" -msgstr "创建顶点表" +msgid "``pgr_TSP``" +msgstr "``pgr_TSP``" -msgid "Using :doc:`pgr_extractVertices` create the table." -msgstr "使用 :doc:`pgr_extractVertices` 创建该表。" +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSP`` - 使用 *metric* 算法的近似计算。" -msgid "Contraction of a graph" -msgstr "图的收缩" +msgid "Availability:" +msgstr "可用性：" -msgid "The graph can be reduced in size using :doc:`contraction-family`" -msgstr "可以使用 :doc:`contraction-family` 来减小图形的大小" +#, fuzzy +msgid "Results change depending on input order" +msgstr "结果按以下顺序递增排序：" -msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." -msgstr "何时收缩将取决于图的大小、处理时间、数据的正确性、最终应用程序或任何其他未提及的因素。" +#, fuzzy +msgid "Only for undirected graphs" +msgstr "在无向图上：" -msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." -msgstr "确定收缩是否有用的一个相当好的方法是根据死端的数量和/或线性边的数量。" +msgid "Breaking change, signatures no longer available:" +msgstr "" -msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" -msgstr "有关如何收缩以及如何使用收缩图的完整方法在 :doc:`contraction-family` 中进行了描述" +#, fuzzy +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "To get the dead ends:" -msgstr "获取死端：" +msgid "Version 3.2.1" +msgstr "版本3.2.1" -msgid "A dead end happens when" -msgstr "死端（Dead End）的形成条件" +msgid "Metric Algorithm from `Boost library `__" +msgstr "`Boost库 `__ 中的度量算法" -msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." -msgstr "死端顶点（Dead End Vertex）的拓扑定义。" +msgid "Simulated Annealing Algorithm no longer supported" +msgstr "Simulated Annealing算法不再受支持" -msgid "The vertex is on the limit of the imported graph." -msgstr "该顶点位于导入图形的边界处。" +msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgstr "Simulated Annealing 算法相关参数被忽略： `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgid "If a larger graph is imported then the vertex might not be a dead end" -msgstr "如果导入了更大的图，则该顶点可能不会是死端" +msgid "Version 2.3.0" +msgstr "版本2.3.0" -msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." -msgstr "节点 :math:`4` 在查询中是一个死端，即使从视觉上看它是三条边的终点。" +msgid "Results change depending on input order of the `Matrix SQL`_" +msgstr "" -msgid "Is node :math:`4` a dead end or not?" -msgstr "节点 :math:`4` 是死端还是非死端？" +#, fuzzy +msgid "Negative costs are ignored." +msgstr ":math:`0` 值被忽略" -msgid "The answer to that question will depend on the application." -msgstr "这个问题的答案将取决于应用情况。" +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgstr "可以与 :doc:`costMatrix-category` 函数一起使用，最好使用 `directed => false`。" -msgid "Is there such a small curb:" -msgstr "有这么小的路边吗：" +msgid "With ``directed => false``" +msgstr "使用 ``directed => false``" -msgid "That does not allow a vehicle to use that visual intersection?" -msgstr "这不允许车辆使用该视觉交叉路口？" +msgid "Will generate a graph that:" +msgstr "将生成一个图：" -msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" -msgstr "是否适用于行人，因此行人可以轻松地在小路边行走？" +msgid "is undirected" +msgstr "是无向的" -msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" -msgstr "电力和电线的应用是否可以轻松地延伸到小路边顶部？" +msgid "is fully connected (As long as the graph has one component)" +msgstr "是完全连接的（只要图有一个分量）" -msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" -msgstr "是否有一个大悬崖，从鹰的角度看，死胡同靠近该路段？" +msgid "all traveling costs on edges obey the triangle inequality." +msgstr "所有边上的旅行成本都遵循三角不等式。" -msgid "Depending on the answer, modification of the data might be needed." -msgstr "根据分析结果，可能需要对数据进行修改。" +msgid "When ``start_vid = 0 OR end_vid = 0``" +msgstr "当 ``start_vid = 0 OR end_vid = 0``" -msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." -msgstr "当存在大量断头节点时，可调用 :doc:`contraction-family` 函数族收缩图形结构以加速处理。" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +msgstr "生成的解在最坏情况下保证 *不超过最优路径长度的两倍*" -msgid "Linear edges" -msgstr "线性边" +msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgstr "当 ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgid "To get the linear edges:" -msgstr "要获得线性边：" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgstr "由于 `end_vid` 被限制在固定位置，因此**无法保证**在最坏情况下，生成的解长度最多为最优路线长度的两倍。" -msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." -msgstr "当这些顶点表示减速带、停止信号，并且应用程序将其纳入考虑时，这些线性顶点是正确的。" +msgid "With ``directed => true``" +msgstr "当 ``directed => true``" -msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." -msgstr "当图中存在许多不需要考虑的线性顶点时，为了加速处理，可以使用 :doc:`contraction-family` 函数来简化问题。" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +msgstr "**无法保证** 该解在最坏情况下不超过最优路径长度的两倍" -msgid "Function's structure" -msgstr "函数的结构" +msgid "is directed" +msgstr "有向" -msgid "Once the graph preparation work has been done above, it is time to use a" -msgstr "完成上述图准备工作后，就可以使用" +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgstr "某些（或全部）边上的旅行成本可能不满足三角不等式。" -msgid "The general form of a pgRouting function call is:" -msgstr "pgRouting 函数调用的一般形式是：" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" +msgstr "由于需要无向图，有向图变换如下：" -msgid "\\ \\" -msgstr "\\ \\" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgstr "边 `(u, v)` 和 `(v, u)`被认为是相同的边（表示为 `(u, v)`" -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgstr "pgr_(`Inner queries`_ , **parameters**, [``Optional parameters``)" +msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" +msgstr "如果 ``agg_cost`` 在边 `(u, v)` 的一个或多个实例之间不同" -msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." -msgstr "`Inner queries`_ ：是强制参数，是包含 SQL 查询的 ``TEXT`` 字符串。" +msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" +msgstr "边 `(u, v)` 的所有实例的 ``agg_cost`` 最小值将被视为边 `(u, v)` 的 ``agg_cost``" -msgid "**parameters**: Additional compulsory parameters needed by the function." -msgstr "**parameters**：函数需要的附加强制参数。" +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgstr "边上的一些（或全部）旅行成本仍然可能不遵守三角不等式。" -msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." -msgstr "``Optional parameters`` ：是非强制命名参数，省略时具有默认值。" +msgid "When the data does not come from an undirected graph or its not fully connected:" +msgstr "" -msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." -msgstr "强制参数是位置参数，可选参数是命名参数。" +#, fuzzy +msgid "Missing values will be calculated with dijkstra algorithm." +msgstr "缺失值将使用 dijkstra 算法计算。" -msgid "For example, for this :doc:`pgr_dijkstra` signature:" -msgstr "例如，对于这个 :doc:`pgr_dijkstra` 签名：" +#, fuzzy +msgid "When the graph has more than one component:" +msgstr "当图不连通时" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgstr "" -msgid "`Edges SQL`_:" -msgstr "`Edges SQL`_:" +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." +msgstr "" -msgid "Is the first parameter." -msgstr "是第一个参数。" +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +msgstr "" -msgid "It is compulsory." -msgstr "这是强制性的。" +msgid "One cycle attempt to remove crossing edges is done to the TSP results." +msgstr "" -msgid "It is an inner query." -msgstr "这是一个内部查询。" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" -msgstr "它没有名称，因此 **Edges SQL** 给出了需要使用哪种内部查询的想法" +msgid "Returns set of |tsp-result|" +msgstr "返回 |tsp-result| 的集合" -msgid "**start vid**:" -msgstr "**start vid**:" +msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgstr "使用 :doc:`pgr_dijkstraCostMatrix` 生成矩阵信息" -msgid "Is the second parameter." -msgstr "是第二个参数。" +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgstr "**Line 4** 顶点 :math:`\\{2, 4, 13, 14\\}` 不包括在内，因为它们未连接。" -msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." -msgstr "它没有名称，因此 **start vid** 给出了第二个参数的值应包含的内容。" +msgid "`Matrix SQL`_ as described below" +msgstr "`Matrix SQL`_ 如下所述" -msgid "Is the third parameter." -msgstr "是第三个参数。" +msgid "``ANY-INTEGER``" +msgstr "``ANY-INTEGER``" -msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" -msgstr "它没有名称，因此 **end vid** 给出了第三个参数的值应包含的内容" +msgid "``ANY-NUMERICAL``" +msgstr "``ANY-NUMERICAL``" -msgid "Is the fourth parameter." -msgstr "是第四个参数。" +msgid "Cost for going from start_vid to end_vid" +msgstr "从 start_vid 到 end_vid 的成本" -msgid "It is optional." -msgstr "是可选的。" +msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" +msgstr "返回集合 ``(seq, node, cost, agg_cost)``" -msgid "It has a name." -msgstr "它有一个名字。" +msgid "Row sequence." +msgstr "行顺序。" -msgid "The full description of the parameters are found on the `Parameters`_ section of each function." -msgstr "参数的完整描述可以在每个函数的 `Parameters`_ 部分找到。" +msgid "**node**" +msgstr "**node**" -msgid "Function's overloads" -msgstr "函数的重载" +msgid "Identifier of the node/coordinate/point." +msgstr "节点/坐标/点的标识符。" -msgid "A function might have different overloads. The most common are called:" -msgstr "一个函数可能有不同的重载。 最常见的是：" +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgstr "从路径序列中的当前 ``node`` 遍历到下一个 ``node`` 的成本。" -msgid "`One to One`_" -msgstr "`One to One`_" +msgid "``0`` for the last row in the tour sequence." +msgstr "``0`` 表示游览序列中的最后一行。" -msgid "`One to Many`_" -msgstr "`One to Many`_" +msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." +msgstr "从 ``seq = 1`` 的 ``node`` 到当前节点的总成本。" -msgid "`Many to One`_" -msgstr "`Many to One`_" +msgid "``0`` for the first row in the tour sequence." +msgstr "``0`` 表示游览序列中的第一行。" -msgid "`Many to Many`_" -msgstr "`Many to Many`_" +msgid "Start from vertex :math:`1`" +msgstr "从顶点 :math:`1` 开始" -msgid "`Combinations`_" -msgstr "`组合`_" +msgid "**Line 6** ``start_vid => 1``" +msgstr "**Line 6** ``start_vid => 1``" -msgid "Depending on the overload the parameters types change." -msgstr "根据过载，参数类型会发生变化。" +msgid "Using points of interest to generate an asymmetric matrix." +msgstr "使用兴趣点（POI）生成非对称矩阵的步骤如下。" -msgid "**One**: **ANY-INTEGER**" -msgstr "**一**: **ANY-INTEGER**" +msgid "To generate an asymmetric matrix:" +msgstr "生成非对称矩阵：" -msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" -msgstr "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgstr "**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的 ``side`` 信息而被忽略" -msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." -msgstr "根据函数的不同，重载可能会有所不同。 但参数类型改变的概念保持不变。" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" +msgstr "**Line 6** 行 生成非对称矩阵， ``directed => true``" -msgid "When routing from:" -msgstr "当路由来自：" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` 将被视为 ``agg_cost``" -msgid "From **one** starting vertex" -msgstr "从 **一** 起始顶点" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgstr "该解决方案的长度可能是*最佳行程的两倍以上*，因为：" -msgid "to **one** ending vertex" -msgstr "到 **一** 结束顶点" +msgid "Triangle inequality might not be satisfied." +msgstr "三角不等式可能不满足。" -msgid "to **many** ending vertices" -msgstr "到 **多** 结束顶点" +msgid "``start_id != 0 AND end_id != 0``" +msgstr "``start_id != 0 AND end_id != 0``" -msgid "From **many** starting vertices" -msgstr "从 **多** 起始顶点" +msgid "Connected incomplete data" +msgstr "连接不完整数据" -msgid "From **many** different starting vertices" -msgstr "从 **多个** 不同的起始顶点" +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgstr "使用选定的边 :math:`\\{2, 4, 5, 8, 9, 15\\}`，矩阵不完整。" -msgid "to **many** different ending vertices" -msgstr "到 **多个** 不同的结束顶点" +msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." +msgstr "对于 :math:`17 \\rightarrow 10` 的成本值在矩阵中不存在，但使用的值是从 :math:`10 \\rightarrow 17` 中获取的。" -msgid "Every tuple specifies a pair of a start vertex and an end vertex" -msgstr "每个元组指定一对起始顶点和结束顶点" +msgid "``pgr_TSPeuclidean``" +msgstr "``pgr_TSPeuclidean``" -msgid "Users can define the combinations as desired." -msgstr "用户可以根据需要定义组合。" +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSPeuclidean`` - 使用 *metric* 算法进行近似计算。" -msgid "Needs a `Combinations SQL`_" -msgstr "需要 `Combinations SQL`_" +#, fuzzy +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." -msgstr "有几种有效的内部查询类型，返回的列也取决于函数。哪种类型的内部查询将取决于函数的要求。为了简化类型的种类，使用了 **ANY-INTEGER** 和 **ANY-NUMERICAL** 。" +msgid "Using `Boost: metric TSP approx `__" +msgstr "使用 `Boost: metric TSP approx `__" -msgid "Edges SQL for" -msgstr "边 SQL" +msgid "Version 3.0.0" +msgstr "版本3.0.0" -msgid "Some uncategorised functions" -msgstr "一些未分类的函数" +msgid "Name change from pgr_eucledianTSP" +msgstr "pgr_eucledianTSP 的名称更改" -msgid "General without ``id``" -msgstr "一般没有 ``id``" +msgid "New official function." +msgstr "新官方函数说明。" -msgid "General with (X,Y)" -msgstr "通常带有（X,Y)" +msgid "Results change depending on input order of the `Coordinates SQL`_" +msgstr "" -msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." -msgstr "当为负时：edge (``source``, ``target``)不存在，因此它不是图的一部分。" +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgstr "任何重复的标识符都会被忽略，保留的坐标是任意选择的。" -msgid "Weight of the edge (``target``, ``source``)," -msgstr "边 (``target``, ``source``)的权重，" +msgid "The coordinates are quite similar for the same identifier, for example ::" +msgstr "对于相同的标识符，坐标非常相似，例如 ::" -msgid "``x1``" -msgstr "``x1``" +msgid "The coordinates are quite different for the same identifier, for example ::" +msgstr "对于相同的标识符，坐标有很大不同，例如::" -msgid "X coordinate of ``source`` vertex." -msgstr "``source`` 顶点的X坐标。" +msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" -msgid "``y1``" -msgstr "``y1``" +msgid "With default values" +msgstr "有默认值" -msgid "Y coordinate of ``source`` vertex." -msgstr "``source`` 顶点的Y坐标。" +msgid "`Coordinates SQL`_" +msgstr "`Coordinates SQL`_" -msgid "``x2``" -msgstr "``x2``" +msgid "`Coordinates SQL`_ as described below" +msgstr "`Coordinates SQL`_ 如下所述" -msgid "X coordinate of ``target`` vertex." -msgstr "``target`` 顶点的X坐标。" +msgid "Coordinates SQL" +msgstr "坐标SQL" -msgid "``y2``" -msgstr "``y2``" +msgid "``x``" +msgstr "``x``" -msgid "Y coordinate of ``target`` vertex." -msgstr "``target`` 顶点的Y坐标。" +msgid "X value of the coordinate." +msgstr "坐标的X值。" -msgid "Flow" -msgstr "流" +msgid "``y``" +msgstr "``y``" -msgid "Edges SQL for :doc:`flow-family`" -msgstr "用于流数据系列 ( :doc:`flow-family`) 的Edges SQL" +msgid "Y value of the coordinate." +msgstr "坐标的Y值。" -msgid "Edges SQL for the following functions of :doc:`flow-family`" -msgstr "Edges SQL 适用于 :doc:`flow-family` 的以下函数" +msgid "Test 29 cities of Western Sahara" +msgstr "测试西撒哈拉29个城市" -msgid "Used in combination signatures" -msgstr "结合签名使用" +msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgstr "此示例展示了如何使用Waterloo大学的 `示例数据 `__ ，使用29 个城市的数据集 `Western Sahara dataset `__ 进行性能测试" -msgid "Points SQL for" -msgstr "用于Points SQL" +msgid "Creating a table for the data and storing the data" +msgstr "创建数据表并存储数据" -msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." -msgstr "大多数 pgRouting 函数的主要参数是选择图的边的查询。" +msgid "Adding a geometry (for visual purposes)" +msgstr "添加几何图形（用于视觉目的）" -msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." -msgstr "根据函数的族或类别，它将具有附加参数，其中一些是强制性的，一些是可选的。" +msgid "Total tour cost" +msgstr "旅游总费用" -msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." -msgstr "强制参数是无名的，并且必须按要求的顺序给出。 可选参数是命名参数，并且具有默认值。" +msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" +msgstr "获取旅行的总成本，将该值与数据集上给出的最佳旅行长度 27603 进行比较" -msgid "Parameters for the Via functions" -msgstr "Via 函数的参数" +msgid "Getting a geometry of the tour" +msgstr "获取游览的几何形状" -msgid "SQL query as described." -msgstr "如所述的 SQL 查询。" +msgid "Visual results" +msgstr "视觉效果" -msgid "When ``true`` Graph is considered `Directed`" -msgstr "当为 ``true`` 时，图被视为 `有向` 图" +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgstr "从视觉上比较，第一个图展示了 `最优解 `__ ，而第二个图展示了使用 ``pgr_TSPeuclidean`` 所得到的解。" -msgid "When ``false`` the graph is considered as Undirected." -msgstr "当为 ``false`` 时，图被视为无向图。" +msgid "``pgr_aStar`` — Shortest path using the A* algorithm." +msgstr "``pgr_aStar`` — 使用 A* 算法的最短路径。" -msgid "``strict``" -msgstr "``strict``" +msgid "Combinations signature promoted to official." +msgstr "组合签名已升级为正式版本。" -msgid "``false``" -msgstr "``false``" +msgid "Standardizing output columns to |short-generic-result|" +msgstr "将输出列标准化为 |short-generic-result|" -msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" -msgstr "当为 ``true`` 时，如果路径丢失，则停止并返回 **EMPTY SET**" +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_aStar(One to One) 增加了 `start_vid`` 和 ``end_vid`` 列。" -msgid "When ``false`` ignores missing paths returning all paths found" -msgstr "当 ``false`` 忽略丢失的路径时，返回找到的所有路径" +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "pgr_aStar(One to Many) 添加了 ``end_vid`` 列。" -msgid "``U_turn_on_edge``" -msgstr "``U_turn_on_edge``" +msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgstr "pgr_aStar(Many to One) 添加了 ``start_vid`` 列。" -msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." -msgstr "当 为 ``true`` 时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话说，允许使用具有相同标识符的边来进行掉头。" +msgid "Version 3.2.0" +msgstr "版本3.2.0" -msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." -msgstr "当为 ``false`` 时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，只有在找不到其他路径时才使用具有相同标识符的边来进行掉头。" +msgid "New proposed signature:" +msgstr "新提议的签名：" -msgid "For the TRSP functions" -msgstr "对于 TRSP 函数" +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(组合)" -msgid "Array of identifiers of destination vertices." -msgstr "目标顶点的标识符数组。" +msgid "Function promoted to official." +msgstr "函数正式发布。" -msgid "There are several kinds of columns returned are depending of the function." -msgstr "根据函数的不同，返回的列有多种。" +msgid "Version 2.4.0" +msgstr "版本2.4.0" -#, fuzzy -msgid "Result columns for single path functions" -msgstr "生成树函数的结果列" +msgid "pgr_aStar(One to Many)" +msgstr "pgr_aStar(One to Many)" -#, fuzzy -msgid "Used in functions that return one path solution per departure and destination." -msgstr "在返回一个路径解的函数中使用" +msgid "pgr_aStar(Many to One)" +msgstr "pgr_aStar(Many to One)" -msgid ":doc:`pgr_dijkstraNear`" -msgstr ":doc:`pgr_dijkstraNear`" +msgid "pgr_aStar(Many to Many)" +msgstr "pgr_aStar(Many to Many)" -#, fuzzy -msgid "Returns |short-generic-result|" -msgstr "返回集合 |short-generic-result|" +msgid "Signature change on pgr_aStar(One to One)" +msgstr "pgr_aStar(One to One) 函数签名变更" -msgid "``path_seq``" -msgstr "``path_seq``" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgstr "结果相当于 `pgr_aStar(` `One to One`_ `)` 结果的并集：" -msgid "Relative position in the path. Has value **1** for the beginning of a path." -msgstr "路径中的相对位置。 路径开头的值为 **1** 。" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "Identifier of the starting vertex of the current path." -msgstr "当前路径起始顶点的标识符。" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Identifier of the ending vertex of the current path." -msgstr "当前路径结束顶点的标识符。" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." -msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符。" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." -msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后一个节点。" +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." -msgstr "从使用 ``edge`` 的 ``node`` 遍历到路径序列中的下一个节点的成本。" +msgid "**options:** ``[directed, heuristic, factor, epsilon]``" +msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" -#, fuzzy -msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." -msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" +msgid "Returns set of |short-generic-result|" +msgstr "返回集合 |short-generic-result|" -#, fuzzy -msgid "Result columns for multiple paths functions" -msgstr "生成树函数的结果列" +msgid "Optional parameters are `named parameters` and have a default value." +msgstr "可选参数是`命名参数` 并具有默认值。" -#, fuzzy -msgid "Used in functions that return many paths solutions per departure and destination." -msgstr "在返回一个路径解的函数中使用" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" +msgstr "在具有heuristic :math:`2` 的 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`12`" -#, fuzzy -msgid ":doc:`pgr_KSP`" -msgstr ":doc:`pgr_aStarCost`" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgstr "在具有heuristic :math:`3` 和factor :math:`3.5` 的 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`\\{10, 12\\}`" -#, fuzzy -msgid ":doc:`pgr_withPointsKSP`" -msgstr ":doc:`pgr_withPoints`" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgstr "在具有heuristic :math:`4` 的 **无向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :math:`10`" -msgid "Returns set of |generic-result|" -msgstr "返回 |generic-result| 的集合" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgstr "在具有factor :math:`0.5` 的 **有向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :math:`\\{10, 12\\}`" -msgid "``path_id``" -msgstr "``path_id``" +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgstr "在 **有向** 图上使用组合表，且使用factor :math:`0.5`。" -msgid "Path identifier." -msgstr "路径标识符。" +msgid "Example 1" +msgstr "示例1" -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." -msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1** 。" +msgid "Demonstration of repeated values are ignored, and result is sorted." +msgstr "演示中重复的值被忽略，且结果被排序。" -msgid "Result columns for cost functions" -msgstr "成本函数结果列" +msgid "Example 2" +msgstr "示例2" -#, fuzzy -msgid "Used by:" -msgstr "用于：" +msgid "Making **start vids** the same as **end vids**." +msgstr "使 **start vids** 与 **end vids** 相同。" -msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." -msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" +msgid "Example 3" +msgstr "示例3" -msgid "Result columns for flow functions" -msgstr "流量函数的结果列" +msgid "Manually assigned vertex combinations." +msgstr "手动指定的顶点组合。" -msgid "Result columns for spanning tree functions" -msgstr "生成树函数的结果列" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" -#, fuzzy -msgid "Used in functions that return a tree solution per departure." -msgstr "在返回一个路径解的函数中使用" +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr "``pgr_aStarCost`` - 使用 A* 算法计算最短路径的总成本。" -#, fuzzy -msgid "Result columns for simple spanning tree functions" -msgstr "生成树函数的结果列" +msgid "pgr_aStarCost(Combinations)" +msgstr "pgr_aStarCost(组合)" -msgid "Returns set of ``(edge, cost)``" -msgstr "返回集合 ``(edge, cost)``" +msgid "New proposed function." +msgstr "新提议的函数。" -msgid "Cost to traverse the edge." -msgstr "穿越边的成本。" +#, fuzzy +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." +msgstr "``pgr_aStarCost`` 函数通过 A* 算法汇总最短路径的成本。" -msgid "Performance Tips" -msgstr "性能技巧" +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" +msgstr "假设返回的值存储在表中，因此唯一索引将是一对：`(start_vid, end_vid)`" -msgid "For the Routing functions" -msgstr "对于路由功能" +msgid "For undirected graphs, the results are symmetric." +msgstr "对于无向图，结果是对称的。" -msgid "To get faster results bound the queries to an area of interest of routing." -msgstr "为了获得更快的结果，将查询绑定到路由感兴趣的区域。" +msgid "The returned values are ordered in ascending order:" +msgstr "返回值按升序排列：" -msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." -msgstr "在此示例中，使用内部查询 SQL，该 SQL 不包括路由函数中的某些边并且位于结果区域内。" +msgid "`start_vid` ascending" +msgstr "`start_vid` 升序" -msgid "Given this area:" -msgstr "针对该区域：" +msgid "`end_vid` ascending" +msgstr "`end_vid` 升序" -msgid "Calculate a route:" -msgstr "计算路线：" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "How to contribute" -msgstr "如何贡献" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Wiki" -msgstr "维基" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "Edit an existing `pgRouting Wiki `__ page." -msgstr "编辑现有的 `pgRouting 维基 `__ 页面。" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "Or create a new Wiki page" -msgstr "或者创建一个新的维基 页面" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "Create a page on the `pgRouting Wiki `__" -msgstr "在 `pgRouting 维基 `__ 上创建页面" +msgid "Returns set of |matrix-result|" +msgstr "返回 |matrix-result| 的集合" -msgid "Give the title an appropriate name" -msgstr "给标题起一个合适的名称" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgid "`Example `__" -msgstr "`示例 `__" +msgid "``pgr_aStarCostMatrix``" +msgstr "``pgr_aStarCostMatrix``" -msgid "Adding Functionality to pgRouting" -msgstr "为 pgRouting 添加功能" +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgstr "``pgr_aStarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" -msgid "Consult the `developer's documentation `__" -msgstr "查阅 `开发者文档 `__" +msgid "Using internally the :doc:`pgr_aStar` algorithm" +msgstr "内部通过调用 :doc:`pgr_aStar` 算法进行处理" -msgid "Installation" -msgstr "安装" +msgid "Returns a cost matrix." +msgstr "返回成本矩阵。" -msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" -msgstr "有关下载和安装适用于不同操作系统的二进制文件的说明、本文档中未包含的其他注释和更正，可以在 `安装维基 `__ 中找到" +msgid "No ordering is performed" +msgstr "不进行排序" -#, fuzzy -msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" -msgstr "使用pgRouting需要安装PostGIS，请阅读本 `安装指南 `__ 中有关安装的信息" +msgid "let `v` and `u` are nodes on the graph:" +msgstr "设`v` 和 `u` 是图上的节点：" -msgid "Short Version" -msgstr "简洁版本" +msgid "when there is no path from `v` to `u`:" +msgstr "当没有从 `v` 到 `u` 的路径时：" -msgid "Extracting the tar ball" -msgstr "解压 tar 压缩文件" +msgid "cost from `v` to `u` is :math:`\\inf`" +msgstr "从 `v` 到 `u` 的成本是 :math:`\\inf`" -msgid "To compile assuming you have all the dependencies in your search path:" -msgstr "假设您的搜索路径中有所有依赖项，则进行编译：" +msgid "when :math:`v = u` then" +msgstr "当 :math:`v = u` 时" -msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." -msgstr "安装 pgRouting 后，需要在您想要使用它的每个数据库中启用它。" +msgid "cost from `v` to `u` is :math:`0`" +msgstr "从 `v` 到 `u` 的成本是 :math:`0`" -msgid "Get the sources" -msgstr "获取源码" +msgid "When the graph is **undirected** the cost matrix is symmetric" +msgstr "当图 **无向** 时，成本矩阵是对称的" -msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" -msgstr "pgRouting 最新版本可以在 https://github.com/pgRouting/pgrouting/releases/latest 中找到" +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgid "To download this release:" -msgstr "要下载此版本：" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgstr "在 **无向** 图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` 创建对称的成本矩阵" -msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." -msgstr "转到 :ref:`install-short` 以获取有关提取 tar 包和编译 pgRouting 的更多说明。" +msgid "Use with :doc:`pgr_TSP`" +msgstr "使用 :doc:`pgr_TSP`" -msgid "git" -msgstr "git" +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" -msgid "To download the repository" -msgstr "下载存储库" +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgstr "``pgr_articulationPoints`` - 返回无向图的连接点。" -msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." -msgstr "请参阅 :ref:`install-short` 获取有关编译 pgRouting 的更多说明（从 GitHub 下载 pgRouting 存储库时不涉及 tar 文件）。" +msgid "Result columns change: ``seq`` is removed" +msgstr "结果列更改：删除了 ``seq``" -msgid "Enabling and upgrading in the database" -msgstr "在数据库中启用和升级" +msgid "Version 2.5.0" +msgstr "版本2.5.0" -msgid "Enabling the database" -msgstr "启用数据库" +msgid "New experimental function." +msgstr "新实验性功能。" -msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." -msgstr "pgRouting 是 PostgreSQL 扩展，依赖 PostGIS 向最终用户提供功能。 下面给出的代码演示了在数据库中启用 PostGIS 和 pgRouting。" +msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." +msgstr "那些属于多于一个双连通分量的顶点被称为关节点，或者等效地称为割点。关节点是指那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。" -msgid "Checking PostGIS and pgRouting version after enabling them in the database." -msgstr "在数据库中启用 PostGIS 和 pgRouting 后检查它们的版本。" +msgid "Works for **undirected** graphs." +msgstr "适用于 **无向** 图。" -msgid "Upgrading the database" -msgstr "升级数据库" +msgid "``node`` ascending" +msgstr "``node`` 升序" -#, fuzzy -msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" -msgstr "要将数据库中的 pgRouting 升级到 4.0.0 版本，请使用以下命令：" +msgid "Running time: :math:`O(V + E)`" +msgstr "运行时间： :math:`O(V + E)`" -msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" -msgstr "更多信息可以在 https://www.postgresql.org/docs/current/sql-createextension.html 中找到" +msgid "pgr_articulationPoints(`Edges SQL`_)" +msgstr "pgr_articulationPoints(`Edges SQL`_)" -msgid "Dependencies" -msgstr "依赖" +msgid "Returns set of |result-node|" +msgstr "返回集合 |result-node|" -msgid "Compilation Dependencies" -msgstr "编译依赖" +msgid "The articulation points of the graph" +msgstr "图表的连接点" -msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" -msgstr "为了能够编译 pgRouting，请确保满足以下依赖项：" +msgid "Nodes in red are the articulation points." +msgstr "红色节点是关节点。" -msgid "C and C++0x compilers" -msgstr "C 和 C++0x编译器" +msgid "Identifier of the vertex." +msgstr "顶点的标识符。" -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" -msgstr "使用 Boost 1.56 到 Boost 1.74 进行编译需要具有 C++03 或 C++ 11 标准支持的 C ++编译器" +msgid "`Boost: Biconnected components & articulation points `__" +msgstr "`Boost: 双连通分量与割点 `__" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" -msgstr "使用 Boost 1.75 进行编译需要具有 C++ 14 标准支持的 C++ 编译器" +msgid "wikipedia: `Biconnected component `__" +msgstr "维基百科: `双连通分量 `__" #, fuzzy -msgid "Postgresql version >= 13" -msgstr "PostgreSQL version 9.3" +msgid "``pgr_bandwidth`` - Experimental" +msgstr "``pgr_bipartite`` - 实验性" -#, fuzzy -msgid "The Boost Graph Library (BGL) >= 1.56.0" -msgstr "Boost 图库 (BGL)。 版本 >= 1.56" +msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" +msgstr "" -#, fuzzy -msgid "CMake >= 3.12" -msgstr "CMake >= 3.2" +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgstr "" -msgid "For user's documentation" -msgstr "用于用户文档" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" +msgstr "" + +msgid "The bandwidth is the maximum of all these distances" +msgstr "" #, fuzzy -msgid "Sphinx >= 4.0" -msgstr "Sphinx >= 1.1" +msgid "The implementation is for undirected graphs" +msgstr "该实现适用于 **无向** 图。" -msgid "For developer's documentation" -msgstr "对于开发者文档" +msgid "Run time is 0.160789 seconds" +msgstr "" -msgid "Doxygen >= 1.7" -msgstr "Doxygen >= 1.7" +#, fuzzy +msgid "pgr_bandwidth(`Edges SQL`_)" +msgstr "pgr_bipartite(`Edges SQL`_)" -msgid "For testing" -msgstr "供测试用" +#, fuzzy +msgid "Returns ``BIGINT``" +msgstr "``BIGINT``" -msgid "pgtap" -msgstr "pgtap" +#, fuzzy +msgid "For an undirected graph with edges." +msgstr "对于一个undirected graph(无向图)，其边为 :math:'{2,4,5,8}'" -msgid "pg_prove" -msgstr "pg_prove" +#, fuzzy +msgid "Returns a bigint ``(pgr_bandwidth)``" +msgstr "返回一个布尔值 ``(pgr_isplanar)``" -msgid "For using:" -msgstr "用于使用：" +msgid "``pgr_bandwidth``" +msgstr "``pgr_bandwidth``" #, fuzzy -msgid "PostGIS version >= 3.0.0" -msgstr "PostGIS版本 >= 2.2" +msgid "gives the bandwidth of the graph." +msgstr "边不是图的一部分：" -msgid "Example: Installing dependencies on linux" -msgstr "示例：在 Linux 上安装依赖项" +#, fuzzy +msgid "Undirected graph with edges before optimization." +msgstr "在有向图中，两条边都有方向性" -msgid "Installing the compilation dependencies" -msgstr "安装编译依赖项" +#, fuzzy +msgid "Undirected graph with edges after optimization." +msgstr "在有向图中，两条边都有方向性" -msgid "Build dependencies" -msgstr "构建依赖关系" +#, fuzzy +msgid "`Boost: bandwidth `_" +msgstr "`Boost: 是否为二分图 `__" -msgid "Optional dependencies" -msgstr "可选依赖项" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" -#, fuzzy -msgid "For documentation" -msgstr "用于用户文档" +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstar`` — 使用双向 A* 算法的最短路径。" -msgid "Configuring" -msgstr "配置" +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_bdAstar(One to One) 增加了 ``start_vid`` 和 ``end_vid`` 列。" -msgid "pgRouting uses the `cmake` system to do the configuration." -msgstr "pgRouting 使用 `cmake` 系统进行配置。" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgstr "pgr_bdAstar(One to Many) 添加了 ``end_vid`` 列。" -msgid "Configurable variables" -msgstr "可配置变量" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgstr "pgr_bdAstar(Many to One) 添加了 ``start_vid`` 列。" -msgid "To see the variables that can be configured" -msgstr "查看可以配置的变量" +msgid "pgr_bdAstar(Combinations)" +msgstr "pgr_bdAstar(组合)" -msgid "The build directory is different from the source directory" -msgstr "构建目录与源目录不同" +msgid "pgr_bdAstar(One to Many)" +msgstr "pgr_bdAstar(One to Many)" -msgid "Configuring The Documentation" -msgstr "配置文档" +msgid "pgr_bdAstar(Many to One)" +msgstr "pgr_bdAstar(Many to One)" -msgid "User and developers documentation are not build if prerequisites are not found." -msgstr "" +msgid "pgr_bdAstar(Many to Many)" +msgstr "pgr_bdAstar(Many to Many)" -msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" -msgstr "文档的大部分工作都集中在 HTML 文件上。 构建文档的一些变量：" +msgid "Signature change on pgr_bdAstar(One to One)" +msgstr "pgr_bdAstar(One to One) 函数签名变更" -msgid "Variable" -msgstr "变量" +#, fuzzy +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" +msgstr "结果等效于以下情形中 pgr_bdAStar(One to One) 结果的并集：" -msgid "Comment" -msgstr "解释" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "BUILD_HTML" -msgstr "BUILD_HTML" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "BOOL=ON" -msgstr "BOOL=ON" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "If ON, turn on/off building HTML for user's documentation" -msgstr "如果打开，则打开/关闭为用户文档构建 HTML" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "BUILD_DOXY" -msgstr "BUILD_DOXY" +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "If ON, turn on/off building HTML for developer's documentation" -msgstr "如果打开，则打开/关闭为开发人员文档构建 HTML" +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" -msgid "BUILD_LATEX" -msgstr "BUILD_LATEX" +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` - 使用双向 A* 算法计算的最短路径的总成本。" -msgid "BOOL=OFF" -msgstr "BOOL=OFF" +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(组合)" -msgid "If ON, turn on/off building PDF" -msgstr "如果打开，则打开/关闭构建 PDF" +#, fuzzy +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` 函数通过双向 A* 算法汇总最短路径的成本。" -msgid "BUILD_MAN" -msgstr "BUILD_MAN" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "If ON, turn on/off building MAN pages" -msgstr "如果为 ON，则打开/关闭构建 MAN 页面" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "DOC_USE_BOOTSTRAP" -msgstr "DOC_USE_BOOTSTRAP" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" -msgstr "如果打开，则对用户文档的 HTML 页面使用 sphinx-bootstrap" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "EN" -msgstr "" +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -#, fuzzy -msgid "if OFF the English documentation will no be built" -msgstr "有关此文档何时构建的信息" +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" -msgid "ES" -msgstr "" +#, fuzzy +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." +msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" #, fuzzy -msgid "if OFF the Spanish documentation will no be built" -msgstr "有关此文档何时构建的信息" +msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." +msgstr "内部使用 :doc:`pgr_bdAstar` 算法" -msgid "SV" -msgstr "" +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" + +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstra`` — 返回使用双向 Dijkstra 算法计算的最短路径。" #, fuzzy -msgid "if OFF the Swedish documentation will no be built" -msgstr "有关此文档何时构建的信息" +msgid "Output columns standardized to |short-generic-result|" +msgstr "输出列是 |old-generic-result|" -msgid "ZH_HANS" -msgstr "" +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(组合)" -msgid "if OFF the Chinese simplified documentation will no be built" -msgstr "" +msgid "pgr_bdDijkstra(One to Many)" +msgstr "pgr_bdDijkstra(One to Many)" -msgid "Building" -msgstr "构建" +msgid "pgr_bdDijkstra(Many to One)" +msgstr "pgr_bdDijkstra(Many to One)" -msgid "Using ``make`` to build the code and the documentation" -msgstr "使用 ``make`` 构建代码和文档" +msgid "pgr_bdDijkstra(Many to Many)" +msgstr "pgr_bdDijkstra(Many to Many)" #, fuzzy -msgid "The following instructions start from ``path/to/pgrouting/build``" -msgstr "以下说明从 *path/to/pgrouting/build* 开始" +msgid "Signature change on pgr_bdDijkstra(One to One)" +msgstr "函数的签名变更 pgr_bdDijsktra(One to One)" -msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." -msgstr "我们已经在多个平台上进行了测试，安装或重新安装需要所有步骤。" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "Linux" -msgstr "Linux" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -#, fuzzy -msgid "The following instructions start from ``path/to/pgrouting``" -msgstr "以下说明从 *path/to/pgrouting* 开始" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "Testing" -msgstr "测试" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "Currently there is no :code:`make test` and testing is done as follows" -msgstr "目前没有 :code:`make test` ，测试如下" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." -msgstr "pgRouting 是 `PostGIS `__ 和 `PostgreSQL `__ 地理空间数据库的扩展，并添加了路由和其他网络分析功能。 pgRouting的前身 – pgDijkstra，由 `Camptocamp `__ 的Sylvain Pasche编写，后来被Orkney扩展并更名为pgRouting。 该项目现在得到了 `Georepublic `__ 、 `Paragon Corporation `__ 和广大用户社区的支持和维护。" +msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`10`" -msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." -msgstr "pgRouting 是 `OSGeo Community Projects `__ 的一部分，隶属于 `OSGeo Foundation `__ ，并被包含在 `OSGeoLive `__ 。" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" -msgid "Licensing" -msgstr "许可" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" -msgid "The following licenses can be found in pgRouting:" -msgstr "可以在 pgRouting 中找到以下许可证：" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" -msgid "**License**" -msgstr "**许可**" +msgid "Using a combinations table on an **undirected** graph" +msgstr "在 **无向** 图上使用组合表" -msgid "GNU General Public License v2.0 or later" -msgstr "GNU 通用公共许可证 v2.0 或更高版本" +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" -msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." -msgstr "pgRouting 的大多数功能都可以在 `GNU General Public License v2.0 or later `_ 。" +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" -msgid "Boost Software License - Version 1.0" -msgstr "Boost 软件许可证 - 版本 1.0" +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstraCost`` — 返回使用双向 Dijkstra 算法计算最短路径的成本。" -msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." -msgstr "一些 Boost 扩展可根据 `Boost Software License - Version 1.0 `_ 。" +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(组合)" -msgid "MIT-X License" -msgstr "MIT-X License" +#, fuzzy +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgstr "``pgr_bdDijkstraCost`` 函数通过双向 Dijkstra 算法汇总最短路径的成本值。" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." -msgstr "iMaptools.com 贡献的一些代码可在 MIT-X 许可证下使用。" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." -msgstr "pgRouting 手册根据 `知识共享署名-相同方式共享 3.0 许可证获得许可 `_ 。" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "In general license information should be included in the header of each source file." -msgstr "一般来说，许可证信息应包含在每个源文件的标头中。" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" -msgid "Contributors" -msgstr "贡献者" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "This Release Contributors" -msgstr "此版本贡献者" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -#, fuzzy -msgid "Individuals in this release v4.0.0 (in alphabetical order)" -msgstr "本次 v3.8.x 版本发布的个人贡献者（按字母顺序排列）" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -#, fuzzy -msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" -msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" +msgid "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgstr "还有所有为我们的产品（osm2pgrouting、pgRouting、pgRoutingLayer、workshop）提供意见、发现问题、提出拉取请求等帮助的开发者。" +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgstr "``pgr_bdDijkstraCostMatrix`` - 使用 :doc:`pgr_bdDijkstra` 计算成本矩阵。" -msgid "Translators (in alphabetical order)" -msgstr "翻译（按字母顺序排列）" +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgstr "使用双向Dijkstra算法，计算并返回成本矩阵。" -msgid "Chinese:" -msgstr "" +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgid "Dapeng Wang" -msgstr "Dapeng Wang" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgstr "在一个 **无向** 图上的顶点集合 :math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵" -msgid "Spanish:" -msgstr "" +msgid "Use with :doc:`pgr_TSP`." +msgstr "与 :doc:`pgr_TSP` 一起使用。" -msgid "Vicky Vergara" -msgstr "" +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" +msgstr "``pgr_bellmanFord - 实验性``" -msgid "Swedish:" -msgstr "" +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgstr "``pgr_bellmanFord`` — 使用 Bellman-Ford 算法计算的最短路径。" -msgid "Daniel Nylander" -msgstr "" +msgid "New experimental signature:" +msgstr "新实验性签名：" -msgid "Corporate Sponsors in this release (in alphabetical order)" -msgstr "本次发布中的企业赞助商（按字母顺序排列）" +msgid "pgr_bellmanFord(Combinations)" +msgstr "pgr_bellmanFord(组合)" -msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" -msgstr "这些是为 pgRouting 项目贡献了开发人员时间、托管或直接提供资金的公司实体：" +msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." +msgstr "Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点 (``start_vid``) 到终点顶点 (``end_vid``) 的最短路径，其中一些边的权重可以为负数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" -msgid "`OSGeo `__" -msgstr "`OSGeo `__" +msgid "Process is valid for edges with both positive and negative edge weights." +msgstr "该过程对于具有正边权重和负边权重的边都有效。" -msgid "`OSGeo UK `__" -msgstr "`OSGeo UK `__" +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgstr "当起始顶点和结束顶点相同时，不存在路径。聚合成本（agg_cost）将为 :math:`0`。" -msgid "`Google Summer of Code `__" -msgstr "`Google Summer of Code `__" +msgid "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." +msgstr "当起始顶点和结束顶点不同，并且它们之间存在路径且不存在*负循环*时。 agg_cost 将是某个有限值，表示它们之间的最短距离。" -msgid "`HighGo Software `__" -msgstr "`HighGo Software `__" +msgid "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." +msgstr "当起始顶点和结束顶点不同，并且它们之间存在路径，但包含*负循环*时。 在这种情况下，这些顶点的 agg_cost 继续减少，因此无法为它们定义 agg_cost 。" -msgid "`Paragon Corporation `__" -msgstr "`Paragon Corporation `__" +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgstr "当起始顶点和结束顶点不同且不存在路径时，聚合成本（agg_cost）为 :math:`\\infty`。" -msgid "Contributors Past & Present:" -msgstr "过去与现在的贡献者：" +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgstr "出于优化目的，`start_vids`或 `end_vids` 中的任何重复值都将被忽略。" -msgid "Individuals (in alphabetical order)" -msgstr "个人贡献者（按字母排序）" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +msgstr "运行时间： :math:`O(| start\\_vids | * ( V * E))`" -#, fuzzy -msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "Corporate Sponsors (in alphabetical order)" -msgstr "企业赞助商（按字母顺序排列）" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "Camptocamp" -msgstr "Camptocamp" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "CSIS (University of Tokyo)" -msgstr "CSIS (University of Tokyo)" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "Georepublic" -msgstr "Georepublic" +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "Google Summer of Code" -msgstr "Google Summer of Code" +#, fuzzy +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" -msgid "HighGo Software" -msgstr "HighGo Software" +#, fuzzy +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" -msgid "iMaptools" -msgstr "iMaptools" +#, fuzzy +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" +msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" -msgid "Leopark" -msgstr "Leopark" +#, fuzzy +msgid "Using a combinations table on an undirected graph" +msgstr "在无向图上使用组合表。" -msgid "Orkney" -msgstr "Orkney" +msgid "`Boost: Bellman Ford `__" +msgstr "`Boost: Belman Ford `__" -msgid "OSGeo" -msgstr "OSGeo" +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgid "OSGeo UK" -msgstr "OSGeo UK" +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "``pgr_betweennessCentrality`` - 实验性" -msgid "Paragon Corporation" -msgstr "Paragon Corporation" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgstr "``pgr_betweennessCentrality`` - 使用布兰德斯算法计算相对中心度" -msgid "Versaterm Inc." -msgstr "Versaterm Inc." +msgid "Version 3.7.0" +msgstr "版本 3.7.0" -msgid "More Information" -msgstr "更多信息" +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgstr "Brandes 算法利用稀疏图来评估所有顶点的中心度得分。" -msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." -msgstr "最新的软件、文档和新闻可在 pgRouting 网站 https://pgrouting.org 上获取。" +msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." +msgstr "Betweenness centrality（介数中心性）衡量的是一个顶点在所有其他顶点对之间的最短路径中的重要性。具有较高介数中心性得分的顶点，通常能够对网络产生显著的影响，因为它们控制了通过它们的最短路径。" -msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." -msgstr "PostgreSQL 数据库服务器位于 PostgreSQL 主站点 https://www.postgresql.org。" +msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." +msgstr "这些顶点的移除会影响网络，因为大多数顶点之间的最短路径都经过它们，从而破坏了网络的连接性。" -msgid "PostGIS extension at the PostGIS project web site https://postgis.net." -msgstr "PostGIS 项目网站 https://postgis.net 上的 PostGIS 扩展。" +msgid "This implementation work for both directed and undirected graphs." +msgstr "该实现适用于directed 和undirected。" -msgid "Boost C++ source libraries at https://www.boost.org." -msgstr "Boost C++ 源库位于 https://www.boost.org。" +msgid "Running time: :math:`\\Theta(VE)`" +msgstr "运行时间: :math:`Theta(VE)`" -msgid ":doc:`migration`" -msgstr ":doc:`migration`" +msgid "Running space: :math:`\\Theta(VE)`" +msgstr "运行空间: :math:`\\Theta(VE)`" -msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "``pgr_KSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" +msgid "Throws when there are no edges in the graph" +msgstr "当图形中没有边时抛出" -msgid "Availability" -msgstr "可用性" +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgstr "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgid "Version 4.0.0" -msgstr "Version 4.0.0" +msgid "Returns set of ``(vid, centrality)``" +msgstr "返回 ``(vid, centrality)`` 的集合" -msgid "Version 3.6.0" -msgstr "版本3.6.0" +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "对于带边的directed graph:math:`\\{1, 2, 3, 4\\}`." -msgid "Standardizing output columns to |nksp-result|" -msgstr "将输出列标准化为 |nksp-result|" +msgid "Explanation" +msgstr "说明" -msgid "pgr_ksp(One to One)" -msgstr "pgr_ksp(One to One)" +msgid "The betweenness centrality are between parenthesis." +msgstr "介数中心性值位于括号内。" -msgid "Added ``start_vid`` and ``end_vid`` result columns." -msgstr "增加 ``start_vid`` 和 ``end_vid`` 结果列。" +msgid "The leaf vertices have betweenness centrality :math:`0`." +msgstr "叶子节点的介数中心性为 :math:`0`。" -msgid "New proposed signatures:" -msgstr "新提议的签名：" +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +msgstr "顶点 :math:`6` 的间隔中心度高于顶点 :math:`10` 的间隔中心度。" -msgid "pgr_ksp(One to Many)" -msgstr "pgr_ksp(One to Many)" +msgid "Removing vertex :math:`6` will create three graph components." +msgstr "移除顶点 :math:`6` 将创建三个图形组件。" -msgid "pgr_ksp(Many to One)" -msgstr "pgr_ksp(Many to One)" +msgid "Removing vertex :math:`10` will create two graph components." +msgstr "移除节点 :math:`10` 将会产生两个图形组件。" -msgid "pgr_ksp(Many to Many)" -msgstr "pgr_ksp(Many to Many)" +msgid "``vid``" +msgstr "``vid``" -msgid "pgr_ksp(Combinations)" -msgstr "pgr_ksp(Combinations)" +msgid "``centrality``" +msgstr "``centrality``" -msgid "Version 2.1.0" -msgstr "版本2.1.0" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgstr "该节点的相对介数中心性得分（范围为 [0,1]）" -msgid "Signature change" -msgstr "签名变更" +msgid "`Boost: betweenness centrality `_" +msgstr "`Boost: 介数中心性 `_" -msgid "Old signature no longer supported" -msgstr "不再支持旧签名" +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" -msgid "Version 2.0.0" -msgstr "版本2.0.0" +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +msgstr "``pgr_biconnectedComponents`` — 无向图的双连通分量。" -msgid "Official function." -msgstr "官方函数。" +msgid "Result columns change:" +msgstr "结果列发生变化：" -msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." -msgstr "基于Yen算法的K最短路径路由算法。 “K”是所需的最短路径的数量。" +msgid "``n_seq`` is removed" +msgstr "``n_seq`` 被删除" -msgid "|Boost| Boost Graph Inside" -msgstr "|Boost| Boost 图内部" +msgid "``seq`` changed type to ``BIGINT``" +msgstr "``seq`` 将类型更改为 ``BIGINT``" -msgid "Boost Graph inside" -msgstr "内部使用 Boost Graph" +msgid "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." +msgstr "无向图的双连通分量是顶点的最大子集，因此从特定分量中删除顶点不会断开该分量。 与连接组件不同，顶点可以属于多个双连接组件。 顶点可以存在于多个双连通分量中，但每条边只能包含在单个双连通分量中。" -msgid "Signatures" -msgstr "签名" +msgid "Components are described by edges." +msgstr "组件由边描述。" -msgid "Summary" -msgstr "总结" +msgid "``component`` ascending." +msgstr "``component`` 升序。" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "``edge`` ascending." +msgstr "``edge`` 升序。" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgstr "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgstr "pgr_biconnectedComponents(`Edges SQL`_)" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "Returns set of |result-component-E|" +msgstr "返回集合 |result-component-E|" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgstr "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "The biconnected components of the graph" +msgstr "图的双连通分量" -msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgstr "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgid "``component``" +msgstr "``component``" -msgid "**options:** ``[directed, heap_paths]``" -msgstr "**options:** ``[directed, heap_paths]``" +msgid "Component identifier." +msgstr "分量标识符。" -msgid "Returns set of |nksp-result|" -msgstr "返回集合 |nksp-result|" +msgid "Has the value of the minimum edge identifier in the component." +msgstr "具有组件中最小边标识符的值。" -msgid "OR EMPTY SET" -msgstr "OR EMPTY SET" +msgid "Identifier of the edge that belongs to the ``component``." +msgstr "属于该 ``component`` 的边的标识符。" -msgid "Example" -msgstr "示例" +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgstr "``pgr_binaryBreadthFirstSearch`` - 实验性" -msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." -msgstr "在有向图上获取从 :math:`6` 到 :math:`17` 的 2 条路径。" +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgstr "``pgr_binaryBreadthFirstSearch`` — 返回二进制图中的最短路径。" -msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." -msgstr "获取有向图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}` 的 2 条路径。" +msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." +msgstr "任何边权属于集合 {0,X} 的图（其中“X”是任何非负整数）都被称为“二元图”。" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." -msgstr "在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路经。" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgstr "pgr_binaryBreadthFirstSearch(组合)" -msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." -msgstr "在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}` 的2条路经。" +#, fuzzy +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +msgstr "众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。" -msgid "Using a combinations table on an directed graph" -msgstr "在有向图上使用组合表" +msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." +msgstr "然而，如果权重受到更多限制，我们可以使用一种更快的算法。这个算法被称为'二进制广度优先搜索'，也称为'0-1 BFS'，它是标准广度优先搜索问题的一种变体，用于解决单源最短路径（SSSP）问题，当每条边的权重属于集合{0，X}，其中'X'是任意非负实数时，其时间复杂度为 :math:`O(|E|)`。" -msgid "The combinations table:" -msgstr "组合表：" +msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" +msgstr "过程仅在“二元图”上完成。 （“二元图”：边权重属于集合 {0,X} 的任何图，其中“X”是任何非负实整数。）" -msgid "The query:" -msgstr "查询：" +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" +msgstr "运行时间： :math:`O(| start\\_vids | * |E|)`" -msgid "Identifier of the destination vertex." -msgstr "目标顶点的标识符。" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "**K**" -msgstr "**K**" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "Number of required paths." -msgstr "所需路径的数量。" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "KSP Optional parameters" -msgstr "KSP 可选参数" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "``heap_paths``" -msgstr "``heap_paths``" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "When ``false`` Returns at most K paths." -msgstr "当 ``false`` 时返回最多 K 条路径。" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgstr "**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同 (即为 :math:`1`)" -msgid "When ``true`` all the calculated paths while processing are returned." -msgstr "当 ``true`` 时，返回处理时的所有计算路径。" +msgid "`Boost: Breadth First Search `__" +msgstr "`Boost: 广度优先搜索 `__" -msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." -msgstr "粗略地说，当最短路径有 ``N`` 个边时，对于 ``K`` 值较小且 ``K > 5`` ，堆将包含大约 ``N * K`` 条路径。" +msgid "https://cp-algorithms.com/graph/01_bfs.html" +msgstr "https://cp-algorithms.com/graph/01_bfs.html" -msgid "Additional Examples" -msgstr "其他示例" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" -msgstr "在无向图中获取从 :math:`6` 到 :math:`17` 的2条路径" +msgid "``pgr_bipartite`` - Experimental" +msgstr "``pgr_bipartite`` - 实验性" -msgid "Also get the paths in the heap." -msgstr "还获取堆中的路径。" +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +msgstr "``pgr_bipartite`` - 不相邻的顶点集合，同一集合中没有两个顶点相邻。" -msgid "Get 2 paths using combinations table on an undirected graph" -msgstr "使用无向图上的组合表获取 2 条路径" +#, fuzzy +msgid "Output columns standardized to |result_node_color|" +msgstr "输出列是 |ksp-result|" -msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." -msgstr "在无向图中获取从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路径。" +msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgstr "二方图是指有两组顶点的图，这两组顶点相互连接，但内部没有连接。如果可以使用两种颜色对图形着色，从而使一个集合中的顶点着色为相同的颜色，那么就可能是一个二方图。" -msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgid "The algorithm works in undirected graph only." +msgstr "该算法只适用于无向图。" -msgid "``pgr_TSP``" -msgstr "``pgr_TSP``" +msgid "The returned values are not ordered." +msgstr "返回值没有排序。" -msgid "``pgr_TSP`` - Approximation using *metric* algorithm." -msgstr "``pgr_TSP`` - 使用 *metric* 算法的近似计算。" +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgstr "该算法检查图是否是二分图。 如果它是二分的，那么它返回节点以及代表两个不同集合的两种颜色 `0` 和`1`。" -msgid "Availability:" -msgstr "可用性：" +msgid "If graph is not bipartite then algorithm returns empty set." +msgstr "如果图不是两部分的，那么算法会返回空集。" -msgid "Version 3.2.1" -msgstr "版本3.2.1" +msgid "pgr_bipartite(`Edges SQL`_)" +msgstr "pgr_bipartite(`Edges SQL`_)" -msgid "Metric Algorithm from `Boost library `__" -msgstr "`Boost库 `__ 中的度量算法" +msgid "When the graph is bipartite" +msgstr "当图形为两方时" -msgid "Simulated Annealing Algorithm no longer supported" -msgstr "Simulated Annealing算法不再受支持" +msgid "Additional Example" +msgstr "附加示例" -msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgstr "Simulated Annealing 算法相关参数被忽略： `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgid "The odd length cyclic graph can not be bipartite." +msgstr "奇长循环图不可能是两部分的。" -msgid "Version 2.3.0" -msgstr "版本2.3.0" +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgstr "边 :math:`5 \\rightarrow 1` 将使顶点为 :math:`\\{1, 3, 7, 6, 5\\}` 的子图成为奇数长度的循环图，因为循环有 5 个顶点。" -msgid "Results change depending on input order of the `Matrix SQL`_" -msgstr "" +msgid "Edges in blue represent odd length cycle subgraph." +msgstr "蓝色边代表奇数长度循环子图。" -#, fuzzy -msgid "Negative costs are ignored." -msgstr ":math:`0` 值被忽略" +msgid "`Boost: is_bipartite `__" +msgstr "`Boost: 是否为二分图 `__" -msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." -msgstr "可以与 :doc:`costMatrix-category` 函数一起使用，最好使用 `directed => false`。" +msgid "`Wikipedia: bipartite graph `__" +msgstr "`维基百科：二分图 `__" -msgid "With ``directed => false``" -msgstr "使用 ``directed => false``" +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" -msgid "Will generate a graph that:" -msgstr "将生成一个图：" +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgstr "`pgr_boykovKolmogorov`` - 使用 Boykov Kolmogorov 算法计算图边的流量，使从源到目标的流量最大。" -msgid "is undirected" -msgstr "是无向的" +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov (组合)" -msgid "is fully connected (As long as the graph has one component)" -msgstr "是完全连接的（只要图有一个分量）" +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgstr "从 ``pgr_maxFlowBoykovKolmogorov`` 更名而来" -msgid "all traveling costs on edges obey the triangle inequality." -msgstr "所有边上的旅行成本都遵循三角不等式。" +msgid "Function promoted to proposed." +msgstr "函数已升级为提议。" -msgid "When ``start_vid = 0 OR end_vid = 0``" -msgstr "当 ``start_vid = 0 OR end_vid = 0``" +msgid "Running time: Polynomial" +msgstr "运行时间：多项式时间" -msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" -msgstr "生成的解在最坏情况下保证 *不超过最优路径长度的两倍*" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgstr "当 ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." -msgstr "由于 `end_vid` 被限制在固定位置，因此**无法保证**在最坏情况下，生成的解长度最多为最优路线长度的两倍。" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgid "With ``directed => true``" -msgstr "当 ``directed => true``" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" -msgstr "**无法保证** 该解在最坏情况下不超过最优路径长度的两倍" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgid "is directed" -msgstr "有向" +msgid "Returns set of |result-flow|" +msgstr "返回集合 |result-flow|" -msgid "some (or all) traveling costs on edges might not obey the triangle inequality." -msgstr "某些（或全部）边上的旅行成本可能不满足三角不等式。" +msgid "From vertex :math:`11` to vertex :math:`12`" +msgstr "从顶点 :math:`11` 到顶点 :math:`12`" -msgid "As an undirected graph is required, the directed graph is transformed as follows:" -msgstr "由于需要无向图，有向图变换如下：" +msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "从顶点 :math:`11` 到顶点 :math:`\\{5, 10, 12\\}`" -msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" -msgstr "边 `(u, v)` 和 `(v, u)`被认为是相同的边（表示为 `(u, v)`" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" +msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`12`" -msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" -msgstr "如果 ``agg_cost`` 在边 `(u, v)` 的一个或多个实例之间不同" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`\\{5, 10, 12\\}`" -msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" -msgstr "边 `(u, v)` 的所有实例的 ``agg_cost`` 最小值将被视为边 `(u, v)` 的 ``agg_cost``" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgstr "使用组合表，相当于计算从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`{\\10, 15, 14\\}` 的结果。" -msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." -msgstr "边上的一些（或全部）旅行成本仍然可能不遵守三角不等式。" +msgid "`Boost: Boykov Kolmogorov max flow `__" +msgstr "`Boost: Boykov-Kolmogorov 最大流算法 `__" -msgid "When the data does not come from an undirected graph or its not fully connected:" -msgstr "" +msgid "``pgr_breadthFirstSearch`` - Experimental" +msgstr "``pgr_breadthFirstSearch`` - 实验性" -#, fuzzy -msgid "Missing values will be calculated with dijkstra algorithm." -msgstr "缺失值将使用 dijkstra 算法计算。" +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgstr "``pgr_breadthFirstSearch`` — 使用广度优先搜索算法返回遍历顺序。" #, fuzzy -msgid "When the graph has more than one component:" -msgstr "当图不连通时" - -msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." -msgstr "" +msgid "Version 4.0.0:" +msgstr "Version 4.0.0" -msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." -msgstr "" +msgid "Standardizing output columns to |result-spantree|" +msgstr "将输出列标准化为 |result-spantree|" -msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." -msgstr "" +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgstr "提供从根顶点到特定深度的广度优先搜索遍历顺序。" -msgid "One cycle attempt to remove crossing edges is done to the TSP results." -msgstr "" +msgid "The implementation will work on any type of graph." +msgstr "该实现适用于任何类型的图。" -msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgstr "提供从源节点到目标深度级别的广度优先搜索遍历顺序。" -msgid "Returns set of |tsp-result|" -msgstr "返回 |tsp-result| 的集合" +msgid "Running time: :math:`O(E + V)`" +msgstr "运行时间： :math:`O(E + V)`" -msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" -msgstr "使用 :doc:`pgr_dijkstraCostMatrix` 生成矩阵信息" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." -msgstr "**Line 4** 顶点 :math:`\\{2, 4, 13, 14\\}` 不包括在内，因为它们未连接。" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgid "`Matrix SQL`_ as described below" -msgstr "`Matrix SQL`_ 如下所述" +msgid "**options:** ``[max_depth, directed]``" +msgstr "**options:** ``[max_depth, directed]``" -msgid "``ANY-INTEGER``" -msgstr "``ANY-INTEGER``" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgstr "从根顶点 :math:`6` 开始，该顶点位于一个 **有向** 图中，其边按 ``id`` 升序排列" -msgid "``ANY-NUMERICAL``" -msgstr "``ANY-NUMERICAL``" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgstr "从根顶点开始 :math:`{12, 6\\}` 在一个 **无向** 图上，**depth** :math:`<=2` ，边按 ``id`` 升序排列" -msgid "Cost for going from start_vid to end_vid" -msgstr "从 start_vid 到 end_vid 的成本" +msgid "DFS optional parameters" +msgstr "DFS 可选参数" -msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" -msgstr "返回集合 ``(seq, node, cost, agg_cost)``" +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." +msgstr "与 `单个顶点`_ 相同，边按 ``id`` 升序排列。" -msgid "Row sequence." -msgstr "行顺序。" +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgstr "与 `单个顶点`_ 相同，边按 ``id`` 降序排列。" -msgid "**node**" -msgstr "**node**" +msgid "The resulting traversal is different." +msgstr "由此产生的遍历是不同的。" -msgid "Identifier of the node/coordinate/point." -msgstr "节点/坐标/点的标识符。" +msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." +msgstr "左图显示的是按 ID 升序排列的结果，右图显示的是按边缘标识符降序排列的结果。" -msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." -msgstr "从路径序列中的当前 ``node`` 遍历到下一个 ``node`` 的成本。" +msgid "|ascending| |descending|" +msgstr "|ascending| |descending|" -msgid "``0`` for the last row in the tour sequence." -msgstr "``0`` 表示游览序列中的最后一行。" +msgid "ascending" +msgstr "升序" -msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." -msgstr "从 ``seq = 1`` 的 ``node`` 到当前节点的总成本。" +msgid "descending" +msgstr "降序" -msgid "``0`` for the first row in the tour sequence." -msgstr "``0`` 表示游览序列中的第一行。" +msgid "`Wikipedia: Breadth First Search algorithm `__" +msgstr "`维基百科：广度优先搜索算法 `__" -msgid "Start from vertex :math:`1`" -msgstr "从顶点 :math:`1` 开始" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "**Line 6** ``start_vid => 1``" -msgstr "**Line 6** ``start_vid => 1``" +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +msgstr "``pgr_bridges`` - 返回无向图的桥。" -msgid "Using points of interest to generate an asymmetric matrix." -msgstr "使用兴趣点（POI）生成非对称矩阵的步骤如下。" +msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." +msgstr "桥是指一个无向图中的边，如果删除它会增加该图的连通分量数量。此实现仅适用于无向图。" -msgid "To generate an asymmetric matrix:" -msgstr "生成非对称矩阵：" +msgid "``edge`` ascending" +msgstr "``edge`` 升序" -msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" -msgstr "**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的 ``side`` 信息而被忽略" +msgid "Running time: :math:`O(E * (V + E))`" +msgstr "运行时间： :math:`O(E * (V + E))`" -msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" -msgstr "**Line 6** 行 生成非对称矩阵， ``directed => true``" +msgid "pgr_bridges(`Edges SQL`_)" +msgstr "pgr_bridges(`Edges SQL`_)" -msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" -msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` 将被视为 ``agg_cost``" +msgid "Returns set of |result-edge|" +msgstr "返回集合 |result-edge|" -msgid "The solution that can be larger than *twice as long as the optimal tour* because:" -msgstr "该解决方案的长度可能是*最佳行程的两倍以上*，因为：" +msgid "The bridges of the graph" +msgstr "图的桥" -msgid "Triangle inequality might not be satisfied." -msgstr "三角不等式可能不满足。" +msgid "Identifier of the edge that is a bridge." +msgstr "作为桥的边的标识符。" -msgid "``start_id != 0 AND end_id != 0``" -msgstr "``start_id != 0 AND end_id != 0``" +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgid "Connected incomplete data" -msgstr "连接不完整数据" +msgid "`Boost: Connected components `__" +msgstr "`Boost: 已连接的组件 `__" -msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." -msgstr "使用选定的边 :math:`\\{2, 4, 5, 8, 9, 15\\}`，矩阵不完整。" +msgid "``pgr_chinesePostman`` - Experimental" +msgstr "``pgr_chinesePostman`` - 实验性" -msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." -msgstr "对于 :math:`17 \\rightarrow 10` 的成本值在矩阵中不存在，但使用的值是从 :math:`10 \\rightarrow 17` 中获取的。" +msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostman`` — 计算包含有向图中的每条边并从同一顶点开始和结束的最短回路路径。" -msgid "``pgr_TSPeuclidean``" -msgstr "``pgr_TSPeuclidean``" +msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgstr "在一个不连通的图上返回 ``EMPTY SET``" -msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." -msgstr "``pgr_TSPeuclidean`` - 使用 *metric* 算法进行近似计算。" +msgid "pgr_chinesePostman(`Edges SQL`_)" +msgstr "pgr_chinesePostman(`Edges SQL`_)" -msgid "Using `Boost: metric TSP approx `__" -msgstr "使用 `Boost: metric TSP approx `__" +msgid "Returns set of |result-1-1-no-seq|" +msgstr "返回 |result-1-1-no-seq| 的集合" -msgid "Name change from pgr_eucledianTSP" -msgstr "pgr_eucledianTSP 的名称更改" +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgstr "返回集合 ``(seq, node, edge, cost, agg_cost)``" -msgid "New official function." -msgstr "新官方函数说明。" +msgid "Sequential value starting from ``1``" +msgstr "从 ``1`` 开始的顺序值" -msgid "Results change depending on input order of the `Coordinates SQL`_" -msgstr "" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 ``-1`` 表示路径的最后一个节点。" -msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." -msgstr "任何重复的标识符都会被忽略，保留的坐标是任意选择的。" +msgid "Aggregate cost from ``start_v`` to ``node``." +msgstr "从 ``start_v`` 到 ``node`` 的总成本。" -msgid "The coordinates are quite similar for the same identifier, for example ::" -msgstr "对于相同的标识符，坐标非常相似，例如 ::" +msgid "``pgr_chinesePostmanCost`` - Experimental" +msgstr "``pgr_chinesePostmanCost`` - 实验性" -msgid "The coordinates are quite different for the same identifier, for example ::" -msgstr "对于相同的标识符，坐标有很大不同，例如::" +msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostmanCost`` — 计算一个包含有向图中的每条边、以同一顶点为起点和终点的最短成本的回路路径。" -msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgid "Return value when the graph if disconnected" +msgstr "当图是不连通的时候返回的数值" -msgid "With default values" -msgstr "有默认值" +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgstr "pgr_chinesePostmanCost(`Edges SQL`_)" -msgid "`Coordinates SQL`_" -msgstr "`Coordinates SQL`_" +msgid "RETURNS ``FLOAT``" +msgstr "RETURNS ``FLOAT``" -msgid "`Coordinates SQL`_ as described below" -msgstr "`Coordinates SQL`_ 如下所述" +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" -msgid "Coordinates SQL" -msgstr "坐标SQL" +msgid "Minimum costs of a circuit path." +msgstr "一个回路路径的最小成本。" -msgid "``x``" -msgstr "``x``" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" -msgid "X value of the coordinate." -msgstr "坐标的X值。" +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgstr "``pgr_connectedComponents`` — 使用基于深度优先搜索（DFS）的方法计算无向图的连通分量。" -msgid "``y``" -msgstr "``y``" +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgstr "无向图的连通部分是指相互之间均可到达的顶点集合。" -msgid "Y value of the coordinate." -msgstr "坐标的Y值。" +msgid "Components are described by vertices" +msgstr "连通分量由顶点描述" -msgid "Test 29 cities of Western Sahara" -msgstr "测试西撒哈拉29个城市" +msgid "``component`` ascending" +msgstr "``component`` 升序" -msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" -msgstr "此示例展示了如何使用Waterloo大学的 `示例数据 `__ ，使用29 个城市的数据集 `Western Sahara dataset `__ 进行性能测试" +msgid "pgr_connectedComponents(`Edges SQL`_)" +msgstr "pgr_connectedComponents(`Edges SQL`_)" -msgid "Creating a table for the data and storing the data" -msgstr "创建数据表并存储数据" +msgid "Returns set of |result-component-V|" +msgstr "返回集合 |result-component-V|" -msgid "Adding a geometry (for visual purposes)" -msgstr "添加几何图形（用于视觉目的）" +msgid "The connected components of the graph" +msgstr "图的连通分量" -msgid "Total tour cost" -msgstr "旅游总费用" +msgid "Has the value of the minimum node identifier in the component." +msgstr "具有组件中最小节点标识符的值。" -msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" -msgstr "获取旅行的总成本，将该值与数据集上给出的最佳旅行长度 27603 进行比较" +msgid "Identifier of the vertex that belongs to the ``component``." +msgstr "属于该 ``组件`` 的顶点的标识符。" -msgid "Getting a geometry of the tour" -msgstr "获取游览的几何形状" +msgid "Connecting disconnected components" +msgstr "连接不连通的组件" -msgid "Visual results" -msgstr "视觉效果" +msgid "wikipedia: `Connected component `__" +msgstr "维基百科: `连通分量 `__" -msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." -msgstr "从视觉上比较，第一个图展示了 `最优解 `__ ，而第二个图展示了使用 ``pgr_TSPeuclidean`` 所得到的解。" +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" -msgid "``pgr_aStar`` — Shortest path using the A* algorithm." -msgstr "``pgr_aStar`` — 使用 A* 算法的最短路径。" +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" -msgid "Standardizing output columns to |short-generic-result|" -msgstr "将输出列标准化为 |short-generic-result|" +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_aStar(One to One) 增加了 `start_vid`` 和 ``end_vid`` 列。" +msgid "Version 3.8.0" +msgstr "Version 3.8.0" -msgid "pgr_aStar(One to Many) added ``end_vid`` column." -msgstr "pgr_aStar(One to Many) 添加了 ``end_vid`` 列。" +msgid "New signature:" +msgstr "新签名：" -msgid "pgr_aStar(Many to One) added ``start_vid`` column." -msgstr "pgr_aStar(Many to One) 添加了 ``start_vid`` 列。" +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgstr "之前必需的参数 **Contraction order** 现在已变为可选参数，并更名为 ``methods`` 。" -msgid "New proposed signature:" -msgstr "新提议的签名：" +msgid "New name and order of optional parameters." +msgstr "可选参数的新名称和顺序。" -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(组合)" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "已弃用签名 pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "Version 2.4.0" -msgstr "版本2.4.0" +msgid "Name change from ``pgr_contractGraph``" +msgstr "``pgr_contractGraph`` 的名称更改" -msgid "pgr_aStar(One to Many)" -msgstr "pgr_aStar(One to Many)" +msgid "Bug fixes" +msgstr "Bug修复" -msgid "pgr_aStar(Many to One)" -msgstr "pgr_aStar(Many to One)" +msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." +msgstr "收缩通过移除部分顶点和边来减小图的大小，例如，可以添加代表原始边序列的边，从而减少图算法所用的总时间和空间。" -msgid "pgr_aStar(Many to Many)" -msgstr "pgr_aStar(Many to Many)" +msgid "Does not return the full contracted graph." +msgstr "不返回完整的收缩图。" -msgid "Signature change on pgr_aStar(One to One)" -msgstr "pgr_aStar(One to One) 函数签名变更" +msgid "Only changes on the graph are returned." +msgstr "仅返回图中的变更部分。" -msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" -msgstr "结果相当于 `pgr_aStar(` `One to One`_ `)` 结果的并集：" +msgid "The returned values include:" +msgstr "返回值包括：" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "The new edges generated by linear contraction." +msgstr "线性收缩生成的新边线集。" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "The modified vertices generated by dead end contraction." +msgstr "断头节点收缩生成的修改后顶点集。" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "The returned values are ordered as follows:" +msgstr "返回值的排序如下：" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "column ``id`` ascending when its a modified vertex." +msgstr "列 ``id`` 升序排列。" -msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "column ``id`` with negative numbers descending when its a new edge." +msgstr "列 ``id`` 中的负数，当它是一条新边时，负数依次递减。" -msgid "**options:** ``[directed, heuristic, factor, epsilon]``" -msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" +msgid "Currently there are two types of contraction methods included in this function:" +msgstr "目前，该功能包含两种收缩方法：" -msgid "Returns set of |short-generic-result|" -msgstr "返回集合 |short-generic-result|" +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgstr "死角收缩。参考 :doc:`pgr_contractionDeadEnd`。" -msgid "Optional parameters are `named parameters` and have a default value." -msgstr "可选参数是`命名参数` 并具有默认值。" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgstr "线性收缩。参考 :doc:`pgr_contractionLinear`。" -msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" -msgstr "在具有heuristic :math:`2` 的 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`12`" +msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgstr "pgr_contraction(`Edges SQL`_, [**options**])" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" -msgstr "在具有heuristic :math:`3` 和factor :math:`3.5` 的 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`\\{10, 12\\}`" +msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgstr "**options:** ``[directed, methods, cycles, forbidden]``" -msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" -msgstr "在具有heuristic :math:`4` 的 **无向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :math:`10`" +msgid "Returns set of |result-contract|" +msgstr "Returns set of |result-contract|" -msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" -msgstr "在具有factor :math:`0.5` 的 **有向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :math:`\\{10, 12\\}`" +msgid "Dead end and linear contraction in that order on an undirected graph." +msgstr "在无向图上依次执行断头节点收缩与线性收缩。" -msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." -msgstr "在 **有向** 图上使用组合表，且使用factor :math:`0.5`。" +msgid "Contraction optional parameters" +msgstr "可选收缩参数" -msgid "Example 1" -msgstr "示例1" +msgid "``methods``" +msgstr "``methods``" -msgid "Demonstration of repeated values are ignored, and result is sorted." -msgstr "演示中重复的值被忽略，且结果被排序。" +msgid "``INTEGER[]``" +msgstr "``INTEGER[]``" -msgid "Example 2" -msgstr "示例2" +msgid "``ARRAY[1,2]``" +msgstr "``ARRAY[1,2]``" -msgid "Making **start vids** the same as **end vids**." -msgstr "使 **start vids** 与 **end vids** 相同。" +msgid "Ordered contraction operations." +msgstr "有序收缩操作。" -msgid "Example 3" -msgstr "示例3" +msgid "1 = Dead end contraction" +msgstr "1 = 死端收缩" -msgid "Manually assigned vertex combinations." -msgstr "手动指定的顶点组合。" +msgid "2 = Linear contraction" +msgstr "2 = 线性收缩" -msgid "``pgr_aStarCost``" -msgstr "``pgr_aStarCost``" +msgid "``cycles``" +msgstr "``cycles``" -msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr "``pgr_aStarCost`` - 使用 A* 算法计算最短路径的总成本。" +msgid ":math:`1`" +msgstr ":math:`1`" -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(组合)" +msgid "Number of times the contraction methods will be performed." +msgstr "收缩方法的执行次数。" -msgid "New proposed function." -msgstr "新提议的函数。" +msgid "``forbidden``" +msgstr "``forbidden``" -#, fuzzy -msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." -msgstr "``pgr_aStarCost`` 函数通过 A* 算法汇总最短路径的成本。" +msgid "``BIGINT[]``" +msgstr "``BIGINT[]``" -msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" -msgstr "假设返回的值存储在表中，因此唯一索引将是一对：`(start_vid, end_vid)`" +msgid "``ARRAY[]::BIGINT[]``" +msgstr "``ARRAY[]::BIGINT[]``" -msgid "For undirected graphs, the results are symmetric." -msgstr "对于无向图，结果是对称的。" +msgid "Identifiers of vertices forbidden for contraction." +msgstr "禁止收缩的顶点标识符。" -msgid "The returned values are ordered in ascending order:" -msgstr "返回值按升序排列：" +msgid "The function returns a single row. The columns of the row are:" +msgstr "该函数返回一行数据。该行的列包括：" -msgid "`start_vid` ascending" -msgstr "`start_vid` 升序" +msgid "``type``" +msgstr "``type``" -msgid "`end_vid` ascending" -msgstr "`end_vid` 升序" +msgid "Type of the row." +msgstr "行的类型。" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "``v`` when the row is a vertex." +msgstr "当该行表示一个顶点时，列为 ``v`` 。" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Column ``id`` has a positive value." +msgstr "列 ``id`` 为正值。" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "``e`` when the row is an edge." +msgstr "当行是边时，则为 ``e`` 。" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Column ``id`` has a negative value." +msgstr "列 ``id`` 的值为负数。" -msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "All numbers on this column are ``DISTINCT``" +msgstr "此列中的所有数字都是 ``DISTINCT``" -msgid "Returns set of |matrix-result|" -msgstr "返回 |matrix-result| 的集合" +msgid "When ``type`` = **'v'**." +msgstr "当 ``type`` = **'v'** 时。" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgid "Identifier of the modified vertex." +msgstr "修改顶点的标识符。" -msgid "``pgr_aStarCostMatrix``" -msgstr "``pgr_aStarCostMatrix``" +msgid "When ``type`` = **'e'**." +msgstr "当 ``type`` = **'e'** 时。" -msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." -msgstr "``pgr_aStarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" +msgid "Decreasing sequence starting from **-1**." +msgstr "从 **-1** 开始递减序列。" -msgid "Using internally the :doc:`pgr_aStar` algorithm" -msgstr "内部通过调用 :doc:`pgr_aStar` 算法进行处理" +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgstr "表示未包含在原始边集中的伪`id` 。" -msgid "Returns a cost matrix." -msgstr "返回成本矩阵。" +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" -msgid "No ordering is performed" -msgstr "不进行排序" +msgid "Array of contracted vertex identifiers." +msgstr "收缩顶点标识符数组。" -msgid "let `v` and `u` are nodes on the graph:" -msgstr "设`v` 和 `u` 是图上的节点：" +msgid "When ``type`` = **'v'**: :math:`-1`" +msgstr "当 ``type`` = **'v'**: :math:`-1` 时" -msgid "when there is no path from `v` to `u`:" -msgstr "当没有从 `v` 到 `u` 的路径时：" +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的source顶点标识符。" -msgid "cost from `v` to `u` is :math:`\\inf`" -msgstr "从 `v` 到 `u` 的成本是 :math:`\\inf`" +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的target 顶点标识符。" -msgid "when :math:`v = u` then" -msgstr "当 :math:`v = u` 时" +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的权重。" -msgid "cost from `v` to `u` is :math:`0`" -msgstr "从 `v` 到 `u` 的成本是 :math:`0`" +msgid "Only dead end contraction" +msgstr "仅死端收缩" -msgid "When the graph is **undirected** the cost matrix is symmetric" -msgstr "当图 **无向** 时，成本矩阵是对称的" +msgid "Only linear contraction" +msgstr "仅线性收缩" -msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "The cycle" +msgstr "循环" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" -msgstr "在 **无向** 图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` 创建对称的成本矩阵" +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgstr "对图进行收缩可通过多次操作实现，操作顺序会影响最终收缩图的结果——每执行一次操作后，可被后续操作收缩的顶点集合将发生变化。" -msgid "Use with :doc:`pgr_TSP`" -msgstr "使用 :doc:`pgr_TSP`" +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgstr "这种实现方式在 ``methods`` 中循环 ``cycles`` 次。" -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "Contracting sample data" +msgstr "收缩示例数据" -msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." -msgstr "``pgr_articulationPoints`` - 返回无向图的连接点。" +msgid "In this section, building and using a contracted graph will be shown by example." +msgstr "在本节中，将通过示例展示构建和使用收缩图。" -msgid "Result columns change: ``seq`` is removed" -msgstr "结果列更改：删除了 ``seq``" +msgid "The :doc:`sampledata` for an undirected graph is used" +msgstr "使用无向图的 :doc:`sampledata`" -msgid "Version 2.5.0" -msgstr "版本2.5.0" +msgid "a dead end operation first followed by a linear operation." +msgstr "首先是死端操作，然后是线性操作。" -msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph." -msgstr "那些属于多于一个双连通分量的顶点被称为关节点，或者等效地称为割点。关节点是指那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。" +msgid "Construction of the graph in the database" +msgstr "数据库中图的构建" -msgid "Works for **undirected** graphs." -msgstr "适用于 **无向** 图。" +msgid "The original graph:" +msgstr "原始图：" -msgid "``node`` ascending" -msgstr "``node`` 升序" +msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." +msgstr "结果数据并非表示收缩后的图，而是反映应用收缩方法后需对原图执行的变更操作。" -msgid "Running time: :math:`O(V + E)`" -msgstr "运行时间： :math:`O(V + E)`" +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgstr "例如，观察到顶点 :math:`6` 没有出现在结果中，因为它不受收缩算法的影响。" -msgid "pgr_articulationPoints(`Edges SQL`_)" -msgstr "pgr_articulationPoints(`Edges SQL`_)" +msgid "After doing the dead end contraction operation:" +msgstr "进行死端收缩操作后：" -msgid "Returns set of |result-node|" -msgstr "返回集合 |result-node|" +msgid "After doing the linear contraction operation to the graph above:" +msgstr "对上图进行线性收缩运算后：" -msgid "The articulation points of the graph" -msgstr "图表的连接点" +msgid "The process to create the contraction graph on the database:" +msgstr "在数据库上创建收缩图的过程：" -msgid "Nodes in red are the articulation points." -msgstr "红色节点是关节点。" +msgid "Add additional columns" +msgstr "添加附加列" -msgid "Identifier of the vertex." -msgstr "顶点的标识符。" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" +msgstr "在边表和顶点表中添加额外列。在本文档中将使用以下内容：" -msgid "`Boost: Biconnected components & articulation points `__" -msgstr "`Boost: 双连通分量与割点 `__" +msgid "Column." +msgstr "列。" -msgid "wikipedia: `Biconnected component `__" -msgstr "维基百科: `双连通分量 `__" +msgid "The vertices set belonging to the vertex/edge" +msgstr "属于顶点/边的顶点集" -#, fuzzy -msgid "``pgr_bandwidth`` - Experimental" -msgstr "``pgr_bipartite`` - 实验性" +msgid "``is_contracted``" +msgstr "``is_contracted``" -msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" -msgstr "" +msgid "On the vertex table" +msgstr "在顶点表上" -msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." -msgstr "" +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" -msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" -msgstr "" +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgstr "当 ``false`` 时，顶点不收缩，它是收缩图的一部分。" -msgid "The bandwidth is the maximum of all these distances" -msgstr "" +msgid "``is_new``" +msgstr "``is_new``" -#, fuzzy -msgid "The implementation is for undirected graphs" -msgstr "该实现适用于 **无向** 图。" +msgid "On the edge table" +msgstr "在边表上" -msgid "Run time is 0.160789 seconds" -msgstr "" +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgstr "当 ``true`` 时，边缘由收缩算法生成。 它是收缩图的一部分。" -#, fuzzy -msgid "pgr_bandwidth(`Edges SQL`_)" -msgstr "pgr_bipartite(`Edges SQL`_)" +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgstr "当 ``false`` 时，边是原始边，可能是也可能不是收缩图的一部分。" -#, fuzzy -msgid "Returns ``BIGINT``" -msgstr "``BIGINT``" +msgid "Store contraction information" +msgstr "存储收缩信息" + +msgid "Store the contraction results in a table." +msgstr "将收缩结果存储至数据表。" -#, fuzzy -msgid "For an undirected graph with edges." -msgstr "对于一个undirected graph(无向图)，其边为 :math:'{2,4,5,8}'" +msgid "Update the edges and vertices tables" +msgstr "更新边线与顶点表" -#, fuzzy -msgid "Returns a bigint ``(pgr_bandwidth)``" -msgstr "返回一个布尔值 ``(pgr_isplanar)``" +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgstr "使用 ``is_contracted`` 列来指示收缩的顶点。" -msgid "``pgr_bandwidth``" -msgstr "``pgr_bandwidth``" +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgstr "将属于顶点的结果信息填充至 ``contracted_vertices`` 表中。" -#, fuzzy -msgid "gives the bandwidth of the graph." -msgstr "边不是图的一部分：" +msgid "Insert the new edges generated by pgr_contraction." +msgstr "插入由 pgr_contraction 生成的新边。" -#, fuzzy -msgid "Undirected graph with edges before optimization." -msgstr "在有向图中，两条边都有方向性" +msgid "The contracted graph" +msgstr "收缩图" -#, fuzzy -msgid "Undirected graph with edges after optimization." -msgstr "在有向图中，两条边都有方向性" +msgid "Vertices that belong to the contracted graph." +msgstr "属于收缩图的顶点。" -#, fuzzy -msgid "`Boost: bandwidth `_" -msgstr "`Boost: 是否为二分图 `__" +msgid "Edges that belong to the contracted graph." +msgstr "属于收缩图的边。" -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +msgid "Visually:" +msgstr "视觉效果：" -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstar`` — 使用双向 A* 算法的最短路径。" +msgid "Using the contracted graph" +msgstr "使用收缩图" -msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_bdAstar(One to One) 增加了 ``start_vid`` 和 ``end_vid`` 列。" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgstr "根据最终应用的需求，图需要进行预处理。在本示例中，最终应用是使用收缩图通过 ``pgr_dijkstraCost`` 计算原始图中两个顶点之间的成本" -msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." -msgstr "pgr_bdAstar(One to Many) 添加了 ``end_vid`` 列。" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgstr "计算收缩图中给定源和目标之间的最短路径时，存在三种情况：" -msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." -msgstr "pgr_bdAstar(Many to One) 添加了 ``start_vid`` 列。" +msgid "Case 1: Both source and target belong to the contracted graph." +msgstr "情况1：源和目标都属于收缩图。" -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(组合)" +msgid "Case 2: Source and/or target belong to an edge subgraph." +msgstr "情况 2：源和/或目标属于边缘子图。" -msgid "pgr_bdAstar(One to Many)" -msgstr "pgr_bdAstar(One to Many)" +msgid "Case 3: Source and/or target belong to a vertex." +msgstr "情况 3：源和/或目标属于一个顶点。" -msgid "pgr_bdAstar(Many to One)" -msgstr "pgr_bdAstar(Many to One)" +msgid "The final application should consider all of those cases." +msgstr "最终应用应考虑所有这些情况。" -msgid "pgr_bdAstar(Many to Many)" -msgstr "pgr_bdAstar(Many to Many)" +msgid "Create a view (or table) of the contracted graph:" +msgstr "创建收缩图的视图（或表）：" -msgid "Signature change on pgr_bdAstar(One to One)" -msgstr "pgr_bdAstar(One to One) 函数签名变更" +msgid "Create the function that will use the contracted graph." +msgstr "创建使用收缩图的函数。" -#, fuzzy -msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" -msgstr "结果等效于以下情形中 pgr_bdAStar(One to One) 结果的并集：" +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgstr "情况 2：源点和/或目标点位于含收缩顶点的边线上。" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgstr "情况 3：源点和/或目标点属于已被收缩的顶点。" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "``pgr_contractionDeadEnd`` - Proposed" +msgstr "``pgr_contractionDeadEnd`` - 提议中" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionDeadEnd`` — 执行图收缩操作，并返回收缩后的顶点集与边线集。" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "A node is considered a dead end node when:" +msgstr "在下列情况下，节点被视为断头节点：" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "On undirected graphs:" +msgstr "在无向图上：" -msgid "``pgr_bdAstarCost``" -msgstr "``pgr_bdAstarCost``" +msgid "The number of adjacent vertices is 1." +msgstr "相邻顶点的个数为1。" -msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstarCost`` - 使用双向 A* 算法计算的最短路径的总成本。" +msgid "On directed graphs:" +msgstr "在有向图上：" -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(组合)" +msgid "When there is only one adjacent vertex or" +msgstr "当只有一个相邻顶点或" -#, fuzzy -msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstarCost`` 函数通过双向 A* 算法汇总最短路径的成本。" +msgid "When all edges are incoming regardless of the number of adjacent vertices." +msgstr "无论相邻顶点的数量多少，所有边都是进入的。" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "**options:** ``[directed, forbidden]``" +msgstr "**options:** ``[directed, forbidden]``" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "Dead end contraction on an undirected graph." +msgstr "无向图的断头节点收缩。" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "The green nodes are dead end nodes." +msgstr "绿色节点为断头节点。" -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgstr "节点 :math:`3` 是节点 :math:`1` 收缩后的死结节点。" -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" -#, fuzzy -msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." -msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" +msgid "**Empty**" +msgstr "**Empty**" -#, fuzzy -msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." -msgstr "内部使用 :doc:`pgr_bdAstar` 算法" +msgid "Value = ``e`` indicating the row is an edge." +msgstr "值 = ``e`` 表示该行是一条边。" -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "A pseudo `id` of the edge." +msgstr "边线的伪 `id`。" -msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." -msgstr "``pgr_bdDijkstra`` — 返回使用双向 Dijkstra 算法计算的最短路径。" +msgid "Identifier of the source vertex of the current edge." +msgstr "当前边的源顶点的标识符。" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(组合)" +msgid "Identifier of the target vertex of the current edge." +msgstr "当前边的目标顶点的标识符。" -msgid "pgr_bdDijkstra(One to Many)" -msgstr "pgr_bdDijkstra(One to Many)" +msgid "Weight of the current edge." +msgstr "当前边线的权重值。" -msgid "pgr_bdDijkstra(Many to One)" -msgstr "pgr_bdDijkstra(Many to One)" +msgid "Dead end vertex on undirected graph" +msgstr "无向图上的死端顶点" -msgid "pgr_bdDijkstra(Many to Many)" -msgstr "pgr_bdDijkstra(Many to Many)" +msgid "They have only one adjacent node." +msgstr "它们只有一个相邻节点。" -#, fuzzy -msgid "Signature change on pgr_bdDijkstra(One to One)" -msgstr "函数的签名变更 pgr_bdDijsktra(One to One)" +msgid "Dead end vertex on directed graph" +msgstr "有向图上的死端顶点" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The green nodes are dead end nodes" +msgstr "绿色节点为断头节点" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgstr "蓝色节点具有无限数量的传入和/或传出边缘。" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Node" +msgstr "节点" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Adjacent nodes" +msgstr "相邻节点" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Dead end" +msgstr "死端" -msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" -msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`10`" +msgid "Reason" +msgstr "Reason" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" -msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" +msgid ":math:`6`" +msgstr ":math:`6`" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" -msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" +msgid ":math:`\\{1\\}`" +msgstr ":math:`\\{1\\}`" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" -msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" +msgid "Yes" +msgstr "是" -msgid "Using a combinations table on an **undirected** graph" -msgstr "在 **无向** 图上使用组合表" +msgid "Has only one adjacent node." +msgstr "只有一个相邻节点。" -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" -msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid ":math:`7`" +msgstr ":math:`7`" -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +msgid ":math:`\\{2\\}`" +msgstr ":math:`\\{2\\}`" -msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." -msgstr "``pgr_bdDijkstraCost`` — 返回使用双向 Dijkstra 算法计算最短路径的成本。" +msgid ":math:`8`" +msgstr ":math:`8`" -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(组合)" +msgid ":math:`\\{2, 3\\}`" +msgstr ":math:`\\{2, 3\\}`" -#, fuzzy -msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." -msgstr "``pgr_bdDijkstraCost`` 函数通过双向 Dijkstra 算法汇总最短路径的成本值。" +msgid "Has more than one adjacent node and all edges are incoming." +msgstr "有一个以上的相邻节点，且所有边都是传入的。" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid ":math:`\\{4\\}`" +msgstr ":math:`\\{4\\}`" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid ":math:`10`" +msgstr ":math:`10`" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgid ":math:`\\{4, 5\\}`" +msgstr ":math:`\\{4, 5\\}`" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "No" +msgstr "No" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgid "Has more than one adjacent node and all edges are outgoing." +msgstr "有一个以上的相邻节点，且所有边都是向外的。" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid ":math:`1,2,3,4,5`" +msgstr ":math:`1,2,3,4,5`" -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "Many adjacent nodes." +msgstr "许多相邻节点。" -msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." -msgstr "``pgr_bdDijkstraCostMatrix`` - 使用 :doc:`pgr_bdDijkstra` 计算成本矩阵。" +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." +msgstr "有一个以上的相邻节点，有些边是入边，有些是出边。" -msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." -msgstr "使用双向Dijkstra算法，计算并返回成本矩阵。" +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgstr "从上面可以看出，节点 :math:`\\{6, 7, 9\\}` 是断头节点，因为其邻接顶点的数量为 1。" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." +msgstr "当有多个相邻顶点时，所有的边都必须是所有进入的边，否则就不是死胡同。" -msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" -msgstr "在一个 **无向** 图上的顶点集合 :math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵" +msgid "Step by step dead end contraction" +msgstr "逐步断头节点收缩" -msgid "Use with :doc:`pgr_TSP`." -msgstr "与 :doc:`pgr_TSP` 一起使用。" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgstr "断头节点收缩将持续执行，直至图中不再存在断头节点。例如下图中 :math:`3` 为断头节点时的处理流程：" -#, fuzzy -msgid "``pgr_bellmanFord`` - Experimental" -msgstr "``pgr_bellmanFord - 实验性``" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgstr "在收缩 :math:`3` 后，节点 :math:`2` 变成了断头节点，并被继续收缩：" -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." -msgstr "``pgr_bellmanFord`` — 使用 Bellman-Ford 算法计算的最短路径。" +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgstr "收缩 :math:`2` 后，停止。节点 :math:`1` 包含已收缩节点的信息。" -msgid "pgr_bellmanFord(Combinations)" -msgstr "pgr_bellmanFord(组合)" +msgid "Creating the contracted graph" +msgstr "创建收缩图" -msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." -msgstr "Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点 (``start_vid``) 到终点顶点 (``end_vid``) 的最短路径，其中一些边的权重可以为负数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" +msgid "Steps for the creation of the contracted graph" +msgstr "创建收缩图的步骤" -msgid "Process is valid for edges with both positive and negative edge weights." -msgstr "该过程对于具有正边权重和负边权重的边都有效。" +msgid "Add additional columns." +msgstr "添加额外的列。" -msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." -msgstr "当起始顶点和结束顶点相同时，不存在路径。聚合成本（agg_cost）将为 :math:`0`。" +msgid "Save results into a table." +msgstr "将结果保存到表格中。" -msgid "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." -msgstr "当起始顶点和结束顶点不同，并且它们之间存在路径且不存在*负循环*时。 agg_cost 将是某个有限值，表示它们之间的最短距离。" +msgid "The contracted vertices are not part of the contracted graph." +msgstr "收缩后的顶点不包含在收缩图中。" -msgid "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." -msgstr "当起始顶点和结束顶点不同，并且它们之间存在路径，但包含*负循环*时。 在这种情况下，这些顶点的 agg_cost 继续减少，因此无法为它们定义 agg_cost 。" +msgid "Using when departure and destination are in the contracted graph" +msgstr "当出发地和目的地位于收缩图中时使用" -msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." -msgstr "当起始顶点和结束顶点不同且不存在路径时，聚合成本（agg_cost）为 :math:`\\infty`。" +msgid "Using when departure/destination is not in the contracted graph" +msgstr "当出发地/目的地不在收缩图中时使用" -msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." -msgstr "出于优化目的，`start_vids`或 `end_vids` 中的任何重复值都将被忽略。" +msgid "Using when departure and destination are not in the contracted graph" +msgstr "当出发地和目的地均不在收缩图中时使用" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" -msgstr "运行时间： :math:`O(| start\\_vids | * ( V * E))`" +msgid "``pgr_contractionHierarchies`` - Experimental" +msgstr "``pgr_contractionHierarchies`` - 实验性" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgstr "``pgr_contractionHierarchies`` — 根据收缩层级方法执行图收缩，并返回收缩后的顶点和生成的快捷边。" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgstr "收缩层次法是从顶点的初始顺序出发建立层次顺序的，在最短路径算法的标签固定处理过程中优先考虑某些顶点。此外，收缩层次算法还能在图中添加捷径边，帮助最短路径算法遵循所创建的层次图结构。" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgstr "层次结构的原理是将属于长距离网络（例如公路网络中的高速公路）的顶点置于高优先级，而将属于短距离网络（例如公路网络中的主干道或次干路）的节点置于低优先级。" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgstr "收缩层次结构算法的假设是，已经存在一个有价值的顶点顺序，用于初始化收缩过程。由于大多数情况下没有有价值的初始节点排序，因此我们使用顶点 ID 给出的顺序。然后，在这个首序的基础上进行收缩处理，得到最终的层次结构。" -msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgstr "其基本原理是将顶点按其收缩吸引力的估计值排序，保留在优先队列中。实施案例中使用的度量称为 *边差* ，相当于顶点收缩产生的捷径数量与收缩前图中附带边的数量之差 (``#shortcuts - #incident edges``)." -#, fuzzy -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" -msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgstr "最后，在使用类似 Dijkstra 的双向算法时，目的是减少图中已探索的部分。顶点顺序用于为定向搜索提供信息。搜索过程不会失去最优性。" -#, fuzzy -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" -msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgstr "为收缩寻找最佳顶点排序是一个难题。然而，根据 Geisberger 等人的研究 [2]，非常简单的局部启发式方法就能很好地解决这个问题。这种方法的原理是先验地估算 *边差* 的值，只有当新的度量值使位于队列顶端的节点保持在队列顶端时，才对其进行收缩。否则，它就会被重新插入队列，位于与新度量值相对应的正确位置。" -#, fuzzy -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" -msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" +msgid "The process is done on graphs having only edges with positive costs." +msgstr "这个过程是在只有边的成本为正值的图形上完成的。" -#, fuzzy -msgid "Using a combinations table on an undirected graph" -msgstr "在无向图上使用组合表。" +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgstr "需要注意的是，此函数不会删除任何顶点。最终图中保留了原有的所有顶点，但新增了一些对应于快捷边的边。为构建这些快捷边而收缩的顶点也会被保留，并按层级顺序排列。" -msgid "`Boost: Bellman Ford `__" -msgstr "`Boost: Belman Ford `__" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgstr "至于其他收缩方法，它不会返回完整的收缩图，只会返回变化。它们有两种类型：" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "added shortcut edges, with negative identifiers;" +msgstr "增加了带有负标识符的快捷边;" -msgid "``pgr_betweennessCentrality`` - Experimental" -msgstr "``pgr_betweennessCentrality`` - 实验性" +msgid "contracted nodes with an order." +msgstr "带有顺序的收缩节点。" -msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" -msgstr "``pgr_betweennessCentrality`` - 使用布兰德斯算法计算相对中心度" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" +msgstr "``pgr_contractionHierarchies`` 函数具有以下签名：" -msgid "Version 3.7.0" -msgstr "版本 3.7.0" +msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" -msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." -msgstr "Brandes 算法利用稀疏图来评估所有顶点的中心度得分。" +msgid "Returns set of |result-contraction-hierarchies|" +msgstr "返回集合 |result-contract|" -msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." -msgstr "Betweenness centrality（介数中心性）衡量的是一个顶点在所有其他顶点对之间的最短路径中的重要性。具有较高介数中心性得分的顶点，通常能够对网络产生显著的影响，因为它们控制了通过它们的最短路径。" +msgid "Contraction hierarchies optional parameters" +msgstr "收缩层级的可选参数" -msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." -msgstr "这些顶点的移除会影响网络，因为大多数顶点之间的最短路径都经过它们，从而破坏了网络的连接性。" +msgid "True if the graph is directed, False otherwise." +msgstr "如果图是有向的，则为 True，否则为 False。" -msgid "This implementation work for both directed and undirected graphs." -msgstr "该实现适用于directed 和undirected。" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" +msgstr "该函数返回多行（每个顶点一行，每创建一条快捷边一行）。行的列数为：" -msgid "Running time: :math:`\\Theta(VE)`" -msgstr "运行时间: :math:`Theta(VE)`" +msgid "Type of the ``id``." +msgstr "``id`` 的类型。" -msgid "Running space: :math:`\\Theta(VE)`" -msgstr "运行空间: :math:`\\Theta(VE)`" +msgid "Column ``id`` has a positive value" +msgstr "列 ``id`` 为正值" -msgid "Throws when there are no edges in the graph" -msgstr "当图形中没有边时抛出" +msgid "Column ``id`` has a negative value" +msgstr "列 ``id`` 的值为负数" -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgstr "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgid "``metric``" +msgstr "``metric``" -msgid "Returns set of ``(vid, centrality)``" -msgstr "返回 ``(vid, centrality)`` 的集合" +msgid "``vertex_order``" +msgstr "``vertex_order``" -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "对于带边的directed graph:math:`\\{1, 2, 3, 4\\}`." +msgid "On an undirected graph" +msgstr "在无向图上" -msgid "Explanation" -msgstr "说明" +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." +msgstr "下面的查询显示了在无向图上进行收缩操作所涉及的原始数据。" -msgid "The betweenness centrality are between parenthesis." -msgstr "介数中心性值位于括号内。" +msgid "building contraction hierarchies on the whole graph" +msgstr "在整个图形上建立收缩层次结构" -msgid "The leaf vertices have betweenness centrality :math:`0`." -msgstr "叶子节点的介数中心性为 :math:`0`。" +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgstr "结果并不代表收缩后的图形。它们代表的是应用收缩算法后对图所做的改变，并根据 *边差* 度量对顶点进行排序，从而给出算法建立的顶点顺序。因此，结果中包含了所有顶点（当然禁止的顶点除外）。结果中只显示算法建立的捷径。" -msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." -msgstr "顶点 :math:`6` 的间隔中心度高于顶点 :math:`10` 的间隔中心度。" +msgid "After computing the contraction hierarchies, an order is now given to the vertices," +msgstr "计算完收缩层次后，现在要给顶点排序，" -msgid "Removing vertex :math:`6` will create three graph components." -msgstr "移除顶点 :math:`6` 将创建三个图形组件。" +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgstr "是为了与一种特定的 Dijkstra 算法（在未来版本中实现）配合使用，从而加快搜索速度。" -msgid "Removing vertex :math:`10` will create two graph components." -msgstr "移除节点 :math:`10` 将会产生两个图形组件。" +msgid "We obtain the contracted graph above:" +msgstr "我们得到了上面的收缩图：" -msgid "``vid``" -msgstr "``vid``" +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." +msgstr "我们可以毫不意外地看到，属于捷径的顶点在结果顶点顺序中往往具有较高的优先级。" -msgid "``centrality``" -msgstr "``centrality``" +msgid "On an undirected graph with forbidden vertices" +msgstr "在有禁止顶点的无向图上" -msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" -msgstr "该节点的相对介数中心性得分（范围为 [0,1]）" +msgid "building contraction with a set of forbidden vertices" +msgstr "带有一组禁止顶点的建筑收缩" -msgid "`Boost: betweenness centrality `_" -msgstr "`Boost: 介数中心性 `_" +msgid "Contraction process steps details" +msgstr "收缩过程步骤详情" -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +msgid "Shortcut building process" +msgstr "快捷构建过程" -msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." -msgstr "``pgr_biconnectedComponents`` — 无向图的双连通分量。" +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgstr "顶点 ``v`` 通过添加快捷边来进行收缩，替换形式为 ``(u, v, w)`` 的原路径为一条边 ``(u, w)`` 。仅当 ``(u, v, w)`` 是 ``u`` 和 ``w`` 之间唯一的最短路径时，才需要快捷边 ``(u, w)`` 。" -msgid "Result columns change:" -msgstr "结果列发生变化：" +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgstr "当为给定顶点 ``v`` 添加完所有快捷边后， ``v`` 的相关边会被移除，接着对剩余图中的另一个顶点进行收缩。" -msgid "``n_seq`` is removed" -msgstr "``n_seq`` 被删除" +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgstr "这个过程对图形是破坏性的，我们会制作一个副本，以便再次对其进行整体操作。收缩过程会将所有发现的捷径添加到边集 ``E`` 中，并为每个收缩顶点赋予一个度量值。这个度量值就是所谓的 *收缩层次* 。" -msgid "``seq`` changed type to ``BIGINT``" -msgstr "``seq`` 将类型更改为 ``BIGINT``" +msgid "Initialize the queue with a first vertices order" +msgstr "用初始顶点顺序初始化队列" -msgid "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." -msgstr "无向图的双连通分量是顶点的最大子集，因此从特定分量中删除顶点不会断开该分量。 与连接组件不同，顶点可以属于多个双连接组件。 顶点可以存在于多个双连通分量中，但每条边只能包含在单个双连通分量中。" +msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" +msgstr "对于图中的每个顶点 ``v`` ，都会建立一个 ``v`` 的收缩：" -msgid "Components are described by edges." -msgstr "组件由边描述。" +msgid ":math:`v`" +msgstr ":math:`v`" -msgid "``component`` ascending." -msgstr "``component`` 升序。" +msgid ":math:`\\{p, r, u\\}`" +msgstr ":math:`\\{p, r, u\\}`" -msgid "``edge`` ascending." -msgstr "``edge`` 升序。" +msgid ":math:`p`" +msgstr ":math:`p`" + +msgid ":math:`\\{u, v\\}`" +msgstr ":math:`\\{u, v\\}`" -msgid "pgr_biconnectedComponents(`Edges SQL`_)" -msgstr "pgr_biconnectedComponents(`Edges SQL`_)" +msgid ":math:`u`" +msgstr ":math:`u`" -msgid "Returns set of |result-component-E|" -msgstr "返回集合 |result-component-E|" +msgid ":math:`\\{p, v, w\\}`" +msgstr ":math:`\\{p, v, w\\}`" -msgid "The biconnected components of the graph" -msgstr "图的双连通分量" +msgid ":math:`r`" +msgstr ":math:`r`" -msgid "``component``" -msgstr "``component``" +msgid ":math:`\\{v, w\\}`" +msgstr ":math:`\\{v, w\\}`" -msgid "Component identifier." -msgstr "分量标识符。" +msgid ":math:`w`" +msgstr ":math:`w`" -msgid "Has the value of the minimum edge identifier in the component." -msgstr "具有组件中最小边标识符的值。" +msgid ":math:`\\{r, u\\}`" +msgstr ":math:`\\{r, u\\}`" -msgid "Identifier of the edge that belongs to the ``component``." -msgstr "属于该 ``component`` 的边的标识符。" +msgid "Adjacent edges are removed." +msgstr "相邻边被移除。" -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgstr "``pgr_binaryBreadthFirstSearch`` - 实验性" +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgstr "只有当通过 ``v`` 的路径是 ``v`` 的前驱和后继之间唯一的最短路径时，才会从 ``v`` 的前驱到后继构建快捷边。这里的 *边差* 度量值为-2。" -msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." -msgstr "``pgr_binaryBreadthFirstSearch`` — 返回二进制图中的最短路径。" +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgstr "然后收缩下面的顶点。这个过程一直持续到图中的每个节点都被收缩为止。最后，图中就不再有边了，这个过程也就结束了。" -msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." -msgstr "任何边权属于集合 {0,X} 的图（其中“X”是任何非负整数）都被称为“二元图”。" +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgstr "第一次收缩将给出一个顶点顺序，根据度量（边差值）按升序排列。这样就得到了一个总的顶点顺序。如果 ``u < v`` ，那么 ``u`` 就比 ``v`` 重要。算法会按此顺序将顶点保存到队列中。" -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "pgr_binaryBreadthFirstSearch(组合)" +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." +msgstr "现在，我们将按照这个顺序再次收缩顶点，从而构建一个层次结构。" -#, fuzzy -msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." -msgstr "众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。" +msgid "Build the final vertex order" +msgstr "构建最终顶点顺序" -msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." -msgstr "然而，如果权重受到更多限制，我们可以使用一种更快的算法。这个算法被称为'二进制广度优先搜索'，也称为'0-1 BFS'，它是标准广度优先搜索问题的一种变体，用于解决单源最短路径（SSSP）问题，当每条边的权重属于集合{0，X}，其中'X'是任意非负实数时，其时间复杂度为 :math:`O(|E|)`。" +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgstr "一旦建立了第一顺序，算法就会利用它再次浏览图形。对于队列中的每个顶点，算法都会模拟收缩并计算其边差。如果计算出的值大于下一个要收缩的顶点的值，算法就会把它放回队列（启发式方法）。否则，该顶点将永久收缩。" -msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" -msgstr "过程仅在“二元图”上完成。 （“二元图”：边权重属于集合 {0,X} 的任何图，其中“X”是任何非负实整数。）" +msgid "Add shortcuts to the initial graph" +msgstr "向初始图形添加快捷边" -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" -msgstr "运行时间： :math:`O(| start\\_vids | * |E|)`" +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgstr "最后，算法会使用初始图形（删除边之前）并添加快捷边。这样就得到了收缩后的图形，可以使用专门的 Dijkstra 算法，该算法会考虑层次结构中节点的顺序。" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Use the contraction" +msgstr "使用缩略语" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Build the contraction" +msgstr "构建收缩" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "Add shortcuts and hierarchy in the existing tables" +msgstr "在现有表中添加快捷边和层级" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" +msgstr "在 `vertices` 和 `edges` 表中添加新列来存储结果：" -msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Update and insert the results in the two tables." +msgstr "更新并插入结果到两个表中。" -msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" -msgstr "**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同 (即为 :math:`1`)" +msgid "Use a Dijkstra shortest path algorithm on it" +msgstr "对其使用 Dijkstra 最短路径算法" -msgid "`Boost: Breadth First Search `__" -msgstr "`Boost: 广度优先搜索 `__" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgstr "然后，你可以使用任何类似Dijkstra的算法，等待适应的算法，它将考虑构建的顶点层级。例如：" -msgid "https://cp-algorithms.com/graph/01_bfs.html" -msgstr "https://cp-algorithms.com/graph/01_bfs.html" +msgid "``pgr_contractionLinear`` - Proposed" +msgstr "``pgr_contractionLinear`` - 提议中" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionLinear`` — 执行图收缩并返回收缩后的顶点和边线。" -msgid "``pgr_bipartite`` - Experimental" -msgstr "``pgr_bipartite`` - 实验性" +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionLinear(`Edges SQL`_, [**options**])" -msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." -msgstr "``pgr_bipartite`` - 不相邻的顶点集合，同一集合中没有两个顶点相邻。" +msgid "Linear contraction on an undirected graph." +msgstr "无向图上的线性收缩。" -msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." -msgstr "二方图是指有两组顶点的图，这两组顶点相互连接，但内部没有连接。如果可以使用两种颜色对图形着色，从而使一个集合中的顶点着色为相同的颜色，那么就可能是一个二方图。" +msgid "The green nodes are linear nodes and will not be part of the contracted graph." +msgstr "绿色节点为线性节点，不属于收缩图的一部分。" -msgid "The algorithm works in undirected graph only." -msgstr "该算法只适用于无向图。" +msgid "All edges adjacent will not be part of the contracted graph." +msgstr "所有相邻边线均不纳入收缩图。" -msgid "The returned values are not ordered." -msgstr "返回值没有排序。" +msgid "The red lines will be new edges of the contracted graph." +msgstr "红线将成为收缩图的新边线。" -msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." -msgstr "该算法检查图是否是二分图。 如果它是二分的，那么它返回节点以及代表两个不同集合的两种颜色 `0` 和`1`。" +msgid "**contraction Order**" +msgstr "**contraction Order**" -msgid "If graph is not bipartite then algorithm returns empty set." -msgstr "如果图不是两部分的，那么算法会返回空集。" +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgstr "对 ``contraction_order`` 执行收缩操作的次数。" -msgid "pgr_bipartite(`Edges SQL`_)" -msgstr "pgr_bipartite(`Edges SQL`_)" +msgid "A node connects two (or more) `linear` edges when" +msgstr "节点连接两条（或多条）\"线性 \"边，当" -msgid "When the graph is bipartite" -msgstr "当图形为两方时" +msgid "The number of adjacent vertices is 2." +msgstr "相邻顶点的数量为2。" -msgid "Additional Example" -msgstr "附加示例" +msgid "In case of a directed graph, a node is considered a `linear` node when" +msgstr "在有向图的情况下，当满足以下条件时，节点被视为`线性`节点" -msgid "The odd length cyclic graph can not be bipartite." -msgstr "奇长循环图不可能是两部分的。" +msgid "Linearity is symmetrical." +msgstr "线性是对称的。" -msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." -msgstr "边 :math:`5 \\rightarrow 1` 将使顶点为 :math:`\\{1, 3, 7, 6, 5\\}` 的子图成为奇数长度的循环图，因为循环有 5 个顶点。" +msgid "Linearity is not symmetrical" +msgstr "线性不对称" -msgid "Edges in blue represent odd length cycle subgraph." -msgstr "蓝色边代表奇数长度循环子图。" +msgid "Graph where linearity is not symmetrical." +msgstr "线性不对称的图形。" -msgid "`Boost: is_bipartite `__" -msgstr "`Boost: 是否为二分图 `__" +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." +msgstr "当图形作为有向图处理时，线性并不对称，因此图形无法收缩。" -msgid "`Wikipedia: bipartite graph `__" -msgstr "`维基百科：二分图 `__" +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." +msgstr "当把同一图形作为无向图处理时，线性是对称的，因此图形可以收缩。" -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +msgid "The three edges can be replaced by one undirected edge" +msgstr "三条边可以用一条无向边代替" -msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." -msgstr "`pgr_boykovKolmogorov`` - 使用 Boykov Kolmogorov 算法计算图边的流量，使从源到目标的流量最大。" +msgid "Edge :math:`1 - 3`." +msgstr "边线 :math:`1 - 3`。" -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov (组合)" +msgid "With cost: :math:`4`." +msgstr "成本： :math:`4`." -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" -msgstr "从 ``pgr_maxFlowBoykovKolmogorov`` 更名而来" +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgstr "边上的收缩顶点: :math:`\\{2\\}`." -msgid "Function promoted to proposed." -msgstr "函数已升级为提议。" +msgid "Linearity is symmetrical" +msgstr "线性是对称的" -msgid "Running time: Polynomial" -msgstr "运行时间：多项式时间" +msgid "Graph where linearity is symmetrical." +msgstr "线性对称的图形。" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgid "The four edges can be replaced by two directed edges." +msgstr "四条边可以用两条有向边代替。" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Edge :math:`3 - 1`." +msgstr "边线 :math:`3 - 1`." -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgid "With cost: :math:`6`." +msgstr "成本： :math:`6`." -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgid "The four edges can be replaced by one undirected edge." +msgstr "四条边线可替换为一条无向边。" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgid "Step by step linear contraction" +msgstr "逐步线性收缩" -msgid "Returns set of |result-flow|" -msgstr "返回集合 |result-flow|" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgstr "线性收缩将在没有更多线性边时停止。例如，在下图中存在线性边" -msgid "From vertex :math:`11` to vertex :math:`12`" -msgstr "从顶点 :math:`11` 到顶点 :math:`12`" +msgid "Contracting vertex :math:`3`," +msgstr "收缩顶点 :math:`3`," -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "从顶点 :math:`11` 到顶点 :math:`\\{5, 10, 12\\}`" +msgid "The vertex :math:`3` is removed from the graph" +msgstr "顶点 :math:`3` 已从图中移除" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" -msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`12`" +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "边线 :math:`2 \\rightarrow 3` 和 :math:`w \\rightarrow z` 已从图中移除。" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`\\{5, 10, 12\\}`" +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgstr "插入一条新边 :math:`2 \\rightarrow 4` ，用红色表示。" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." -msgstr "使用组合表，相当于计算从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`{\\10, 15, 14\\}` 的结果。" +msgid "Contracting vertex :math:`2`:" +msgstr "收缩顶点 :math:`2`：" -msgid "`Boost: Boykov Kolmogorov max flow `__" -msgstr "`Boost: Boykov-Kolmogorov 最大流算法 `__" +msgid "The vertex :math:`2` is removed from the graph" +msgstr "顶点 :math:`2` 已从图形中移除" -msgid "``pgr_breadthFirstSearch`` - Experimental" -msgstr "``pgr_breadthFirstSearch`` - 实验性" +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgstr "从图中删除边 :math:`1 \\rightarrow 2` 和 :math:`2 \\rightarrow 3` 。" -msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." -msgstr "``pgr_breadthFirstSearch`` — 使用广度优先搜索算法返回遍历顺序。" +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgstr "插入一条新边 :math:`1\\rightarrow 3` ，用红色表示。" -#, fuzzy -msgid "Version 4.0.0:" -msgstr "Version 4.0.0" +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." +msgstr "边线 :math:`1 \\rightarrow 3` 包含成本值及被收缩节点信息。" -msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." -msgstr "提供从根顶点到特定深度的广度优先搜索遍历顺序。" +msgid "Create the contracted graph." +msgstr "创建收缩图。" -msgid "The implementation will work on any type of graph." -msgstr "该实现适用于任何类型的图。" +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "pgr_cuthillMckeeOrdering`` - 实验性" -msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." -msgstr "提供从源节点到目标深度级别的广度优先搜索遍历顺序。" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" -msgid "Running time: :math:`O(E + V)`" -msgstr "运行时间： :math:`O(E + V)`" +msgid "Version 3.4.0" +msgstr "版本 3.4.0" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgstr "在数值线性代数中，Cuthill-McKee 算法（CM）以 Elizabeth Cuthill 和 James McKee 的名字命名，是一种将具有对称稀疏性模式的稀疏矩阵置换为带宽较小的带状矩阵形式的算法。" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgstr "顶点的搜索顺序基本上是广度优先，只不过在每一步中，相邻的顶点会按照度数递增的顺序排列在队列中。" -msgid "**options:** ``[max_depth, directed]``" -msgstr "**options:** ``[max_depth, directed]``" +msgid "The implementation is for **undirected** graphs." +msgstr "该实现适用于 **无向** 图。" -msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" -msgstr "从根顶点 :math:`6` 开始，该顶点位于一个 **有向** 图中，其边按 ``id`` 升序排列" +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "带宽最小化问题被认为是NP完全问题。" -msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" -msgstr "从根顶点开始 :math:`{12, 6\\}` 在一个 **无向** 图上，**depth** :math:`<=2` ，边按 ``id`` 升序排列" +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "运行时间复杂度为： :math:`O(m log(m)|V|)`" -msgid "DFS optional parameters" -msgstr "DFS 可选参数" +msgid "where :math:`|V|` is the number of vertices," +msgstr "其中 :math:`|V|` 是顶点数，" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." -msgstr "与 `单个顶点`_ 相同，边按 ``id`` 升序排列。" +msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgstr ":math:`m` 是图中顶点的最大度数。" -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." -msgstr "与 `单个顶点`_ 相同，边按 ``id`` 降序排列。" +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "pgr_cuthillMckeeOrdering(`Edges SQL`_)" -msgid "The resulting traversal is different." -msgstr "由此产生的遍历是不同的。" +msgid "Returns set of |result_node_order|" +msgstr "返回集合 |result_node_order|" -msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." -msgstr "左图显示的是按 ID 升序排列的结果，右图显示的是按边缘标识符降序排列的结果。" +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "pgRouting :doc:`sampledata` 的图形排序" -msgid "|ascending| |descending|" -msgstr "|ascending| |descending|" +msgid "Returns set of ``(seq, node)``" +msgstr "返回 ``(seq, node)`` 的集合" -msgid "ascending" -msgstr "升序" +msgid "Sequence of the order starting from 1." +msgstr "从1开始的顺序序列。" -msgid "descending" -msgstr "降序" +msgid "New ordering in reverse order." +msgstr "新的逆序排列。" -msgid "`Wikipedia: Breadth First Search algorithm `__" -msgstr "`维基百科：广度优先搜索算法 `__" +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Cuthill-McKee 排序 `__" -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Cuthill-McKee 排序 `__" -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." -msgstr "``pgr_bridges`` - 返回无向图的桥。" +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``pgr_dagShortestPath`` - 实验性" -msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." -msgstr "桥是指一个无向图中的边，如果删除它会增加该图的连通分量数量。此实现仅适用于无向图。" +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgstr "``pgr_dagShortestPath`` — 返回加权有向无环图（DAG）中的最短路径。特别是使用 Boost.Graph 实现的 DAG 最短路径算法。" -msgid "``edge`` ascending" -msgstr "``edge`` 升序" +msgid "pgr_dagShortestPath(Combinations)" +msgstr "pgr_dagShortestPath(组合)" -msgid "Running time: :math:`O(E * (V + E))`" -msgstr "运行时间： :math:`O(E * (V + E))`" +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgstr "有向无环图（DAG）的最短路径是一种图搜索算法，用于解决加权有向无环图的最短路径问题，找到从起始顶点 (``start_vid``) 到结束顶点 (``end_vid``) 的最短路径。" -msgid "pgr_bridges(`Edges SQL`_)" -msgstr "pgr_bridges(`Edges SQL`_)" +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgstr "这个实现只能用于 **有向** 图，且没有循环，即有向无环图。" -msgid "Returns set of |result-edge|" -msgstr "返回集合 |result-edge|" +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgstr "该算法依靠对 DAG 进行拓扑排序来对顶点进行线性排序，因此比 Dijkstra 或 Bellman-Ford 算法更有效率。" -msgid "The bridges of the graph" -msgstr "图的桥" +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgstr "该过程仅对加权有向无环图有效。 否则它会抛出警告。" -msgid "Identifier of the edge that is a bridge." -msgstr "作为桥的边的标识符。" +msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgstr "`agg_cost`中未包括的值`(v, v)` 的成本为`0`" -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgstr "`agg_cost`中未包括的值 `(u, v)`是数学符号中的 :math:`\\infty`" -msgid "`Boost: Connected components `__" -msgstr "`Boost: 已连接的组件 `__" +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "运行时间： :math:`O(| start\\_vids | * (V + E))`" -msgid "``pgr_chinesePostman`` - Experimental" -msgstr "``pgr_chinesePostman`` - 实验性" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." -msgstr "``pgr_chinesePostman`` — 计算包含有向图中的每条边并从同一顶点开始和结束的最短回路路径。" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgid "Returns ``EMPTY SET`` on a disconnected graph" -msgstr "在一个不连通的图上返回 ``EMPTY SET``" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_chinesePostman(`Edges SQL`_)" -msgstr "pgr_chinesePostman(`Edges SQL`_)" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgid "Returns set of |result-1-1-no-seq|" -msgstr "返回 |result-1-1-no-seq| 的集合" +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" -msgstr "返回集合 ``(seq, node, edge, cost, agg_cost)``" +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgstr "在 **有向** 图上，从顶点 :math:`5` 到顶点 :math:`11`" -msgid "Sequential value starting from ``1``" -msgstr "从 ``1`` 开始的顺序值" +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "从顶点 :math:`5` 到顶点 :math:`\\{7, 11\\}`" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." -msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 ``-1`` 表示路径的最后一个节点。" +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgstr "从顶点 :math:`\\{5, 10\\}` 到顶点 :math:`11`" -msgid "Aggregate cost from ``start_v`` to ``node``." -msgstr "从 ``start_v`` 到 ``node`` 的总成本。" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "在 **无向** 图上，从顶点 :math:`\\{5, 15\\} ` 到顶点 :math:`\\{11, 17\\}`" -msgid "``pgr_chinesePostmanCost`` - Experimental" -msgstr "``pgr_chinesePostmanCost`` - 实验性" +msgid "Return columns" +msgstr "返回列" -msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." -msgstr "``pgr_chinesePostmanCost`` — 计算一个包含有向图中的每条边、以同一顶点为起点和终点的最短成本的回路路径。" +msgid "Making **start_vids** the same as **end_vids**" +msgstr "使 **start_vids** 与 **end_vids** 相同" -msgid "Return value when the graph if disconnected" -msgstr "当图是不连通的时候返回的数值" +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: DAG最短路径DAG 最短路径 `__" -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" -msgstr "pgr_chinesePostmanCost(`Edges SQL`_)" +msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgstr "https://en.wikipedia.org/wiki/Topological_sorting" -msgid "RETURNS ``FLOAT``" -msgstr "RETURNS ``FLOAT``" +msgid "``pgr_degree``" +msgstr "``pgr_degree``" -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" -msgid "Minimum costs of a circuit path." -msgstr "一个回路路径的最小成本。" +msgid "Error messages adjustment." +msgstr "错误信息调整。" -msgid "``pgr_connectedComponents``" -msgstr "``pgr_connectedComponents``" +msgid "New signature with only Edges SQL." +msgstr "只有 Edges SQL 的新签名。" -msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." -msgstr "``pgr_connectedComponents`` — 使用基于深度优先搜索（DFS）的方法计算无向图的连通分量。" +msgid "Calculates the degree of the vertices of an undirected graph" +msgstr "计算无向图顶点的度数" -msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." -msgstr "无向图的连通部分是指相互之间均可到达的顶点集合。" +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgstr "图中顶点的度（或称为顶点的连接度）是指与该顶点相关联的边数。" -msgid "Components are described by vertices" -msgstr "连通分量由顶点描述" +msgid "A loop contributes 2 to a vertex's degree." +msgstr "一个循环对一个顶点的度数贡献为 2。" -msgid "``component`` ascending" -msgstr "``component`` 升序" +msgid "A vertex with degree 0 is called an isolated vertex." +msgstr "度数为 0 的顶点称为孤立顶点。" -msgid "pgr_connectedComponents(`Edges SQL`_)" -msgstr "pgr_connectedComponents(`Edges SQL`_)" +msgid "Isolated vertex is not part of the result" +msgstr "孤立顶点不包含在结果中" -msgid "Returns set of |result-component-V|" -msgstr "返回集合 |result-component-V|" +msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgstr "未参与子图的顶点被视为孤立顶点。" -msgid "The connected components of the graph" -msgstr "图的连通分量" +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgstr "可以执行 ``dryrun`` ，用于获取答案的代码将显示在 PostgreSQL 的 ``NOTICE`` 。" -msgid "Has the value of the minimum node identifier in the component." -msgstr "具有组件中最小节点标识符的值。" +msgid "The code can be used as base code for the particular application requirements." +msgstr "该代码可用作满足特定应用要求的基础代码。" -msgid "Identifier of the vertex that belongs to the ``component``." -msgstr "属于该 ``组件`` 的顶点的标识符。" +msgid "No ordering is performed." +msgstr "不执行排序操作。" -msgid "Connecting disconnected components" -msgstr "连接不连通的组件" +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgstr "pgr_degree(`Edges SQL`_ , [``dryrun``])" -msgid "wikipedia: `Connected component `__" -msgstr "维基百科: `连通分量 `__" +msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgstr "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" +msgid "RETURNS SETOF |result-degree|" +msgstr "RETURNS SETOF |result-degree|" -msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" +msgid "Edges" +msgstr "边" -msgid "Version 3.8.0" -msgstr "Version 3.8.0" +msgid "example" +msgstr "示例" -msgid "New signature:" -msgstr "新签名：" +msgid "Get the degree of the vertices defined on the edges table" +msgstr "获取边线表定义的顶点度数" -msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." -msgstr "之前必需的参数 **Contraction order** 现在已变为可选参数，并更名为 ``methods`` 。" +msgid "Edges and Vertices" +msgstr "边和顶点" -msgid "New name and order of optional parameters." -msgstr "可选参数的新名称和顺序。" +msgid "Extracting the vertex information" +msgstr "提取顶点信息" -msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "已弃用签名 pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgstr "``pgr_degree`` 可以使用 :doc:`pgr_extractVertices` 嵌入调用。" -msgid "Name change from ``pgr_contractGraph``" -msgstr "``pgr_contractGraph`` 的名称更改" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgstr "对于适当规模的网络，最好事先准备好顶点表，并在调用 ``pgr_degree`` 时使用。 (请参阅 `Using a vertex table`_)" -msgid "Bug fixes" -msgstr "Bug修复" +msgid "Calculate the degree of the nodes:" +msgstr "计算节点的度数：" -msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." -msgstr "收缩通过移除部分顶点和边来减小图的大小，例如，可以添加代表原始边序列的边，从而减少图算法所用的总时间和空间。" +msgid "`Vertex SQL`_" +msgstr "`Vertex SQL`_" -msgid "Does not return the full contracted graph." -msgstr "不返回完整的收缩图。" +msgid "`Vertex SQL`_ as described below" +msgstr "`Vertex SQL`_ 如下所述" -msgid "Only changes on the graph are returned." -msgstr "仅返回图中的变更部分。" +msgid "``dryrun``" +msgstr "``dryrun``" -msgid "The returned values include:" -msgstr "返回值包括：" +msgid "When true do not process and get in a NOTICE the resulting query." +msgstr "当为真时，不要处理查询，而是获取一个通知（NOTICE）来显示查询的结果。" -msgid "The new edges generated by linear contraction." -msgstr "线性收缩生成的新边线集。" +msgid "For the `Edges and Vertices`_ signature:" +msgstr "关于 `Edges and Vertices`_ 签名：" -msgid "The modified vertices generated by dead end contraction." -msgstr "断头节点收缩生成的修改后顶点集。" +msgid "For the `Edges`_ signature:" +msgstr "关于 `Edges`_ 签名：" -msgid "The returned values are ordered as follows:" -msgstr "返回值的排序如下：" +msgid "Vertex SQL" +msgstr "Vertex SQL" -msgid "column ``id`` ascending when its a modified vertex." -msgstr "列 ``id`` 升序排列。" +msgid "``in_edges``" +msgstr "``in_edges``" -msgid "column ``id`` with negative numbers descending when its a new edge." -msgstr "列 ``id`` 中的负数，当它是一条新边时，负数依次递减。" +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgstr "以顶点 ``id`` 作为 *第一个端点* 的边的标识符数组。" -msgid "Currently there are two types of contraction methods included in this function:" -msgstr "目前，该功能包含两种收缩方法：" +msgid "When missing, ``out_edges`` must exist." +msgstr "当缺失时， ``out_edges`` 必须存在。" -msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." -msgstr "死角收缩。参考 :doc:`pgr_contractionDeadEnd`。" +msgid "``out_edges``" +msgstr "``out_edges``" -msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." -msgstr "线性收缩。参考 :doc:`pgr_contractionLinear`。" +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgstr "以顶点 ``id`` 作为 *第二个端点* 的边的标识符数组。" -msgid "pgr_contraction(`Edges SQL`_, [**options**])" -msgstr "pgr_contraction(`Edges SQL`_, [**options**])" +msgid "When missing, ``in_edges`` must exist." +msgstr "缺失时， ``in_edges`` 必须存在。" -msgid "**options:** ``[directed, methods, cycles, forbidden]``" -msgstr "**options:** ``[directed, methods, cycles, forbidden]``" +msgid "Vertex identifier" +msgstr "顶点标识符" -msgid "Returns set of |result-contract|" -msgstr "Returns set of |result-contract|" +msgid "``degree``" +msgstr "``degree``" -msgid "Dead end and linear contraction in that order on an undirected graph." -msgstr "在无向图上依次执行断头节点收缩与线性收缩。" +msgid "Number of edges that are incident to the vertex ``id``" +msgstr "与顶点 ``id`` 关联的边数" -msgid "Contraction optional parameters" -msgstr "可选收缩参数" +msgid "Degree of a loop" +msgstr "循环度" -msgid "``methods``" -msgstr "``methods``" +msgid "Using the `Edges`_ signature." +msgstr "使用 `Edges`_ 签名。" -msgid "``INTEGER[]``" -msgstr "``INTEGER[]``" +msgid "Using the `Edges and Vertices`_ signature." +msgstr "使用 `Edges and Vertices`_ 签名。" -msgid "``ARRAY[1,2]``" -msgstr "``ARRAY[1,2]``" +msgid "Degree of a sub graph" +msgstr "子图的度数" -msgid "Ordered contraction operations." -msgstr "有序收缩操作。" +msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgstr "下面是 :doc:`sampledata` 的子图：" -msgid "1 = Dead end contraction" -msgstr "1 = 死端收缩" +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" -msgid "2 = Linear contraction" -msgstr "2 = 线性收缩" +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgstr ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" -msgid "``cycles``" -msgstr "``cycles``" +msgid "The vertices not participating on the edge are considered isolated" +msgstr "未参与边的顶点被视为孤立顶点" -msgid ":math:`1`" -msgstr ":math:`1`" +msgid "their degree is 0 in the subgraph and" +msgstr "在子图中的阶数为 0，并且" -msgid "Number of times the contraction methods will be performed." -msgstr "收缩方法的执行次数。" +msgid "their degree is not shown in the output." +msgstr "它们的度数不会在输出结果中显示。" -msgid "``forbidden``" -msgstr "``forbidden``" +msgid "Using a vertex table" +msgstr "使用顶点表" -msgid "``BIGINT[]``" -msgstr "``BIGINT[]``" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgstr "对于较大规模的网络，建议预先准备顶点表并在调用 ``pgr_degree`` 时使用。" -msgid "``ARRAY[]::BIGINT[]``" -msgstr "``ARRAY[]::BIGINT[]``" +msgid "Extract the vertex information and save into a table:" +msgstr "提取顶点信息并保存到表格中：" -msgid "Identifiers of vertices forbidden for contraction." -msgstr "禁止收缩的顶点标识符。" +msgid "Dry run execution" +msgstr "模拟执行" -msgid "The function returns a single row. The columns of the row are:" -msgstr "该函数返回一行数据。该行的列包括：" +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgstr "要获取用于生成顶点信息的查询，请使用 ``dryrun => true`` 。" -msgid "``type``" -msgstr "``type``" +msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgstr "结果可作为基础代码，根据后台开发需要进行改进。" -msgid "Type of the row." -msgstr "行的类型。" +msgid "Finding dead ends" +msgstr "查找断头节点" -msgid "``v`` when the row is a vertex." -msgstr "当该行表示一个顶点时，列为 ``v`` 。" +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgstr "如果已经使用 ``pgr_extractVertices`` 构建了顶点表，并且想要获取整个图的度数，而不是子集的度数，则可以跳过使用 ``pgr_degree`` ，直接操作 ``in_edges`` 和 ``out_edges`` 列。" -msgid "Column ``id`` has a positive value." -msgstr "列 ``id`` 为正值。" +msgid "The degree of a dead end is 1." +msgstr "断头节点的度数为 1。" -msgid "``e`` when the row is an edge." -msgstr "当行是边时，则为 ``e`` 。" +msgid "Finding linear vertices" +msgstr "查找线性顶点" -msgid "Column ``id`` has a negative value." -msgstr "列 ``id`` 的值为负数。" +msgid "The degree of a linear vertex is 2." +msgstr "线性顶点的阶数为 2。" -msgid "All numbers on this column are ``DISTINCT``" -msgstr "此列中的所有数字都是 ``DISTINCT``" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "若已使用 ``pgr_extractVertices`` 构建顶点表" -msgid "When ``type`` = **'v'**." -msgstr "当 ``type`` = **'v'** 时。" +msgid ":doc:`pgr_extractVertices`" +msgstr ":doc:`pgr_extractVertices`" -msgid "Identifier of the modified vertex." -msgstr "修改顶点的标识符。" +msgid "``pgr_depthFirstSearch`` - Proposed" +msgstr "``pgr_depthFirstSearch`` - 提议中" -msgid "When ``type`` = **'e'**." -msgstr "当 ``type`` = **'e'** 时。" +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "``pgr_depthFirstSearch`` — 返回图的深度优先搜索遍历。 该图可以是有向图或无向图。" -msgid "Decreasing sequence starting from **-1**." -msgstr "从 **-1** 开始递减序列。" +msgid "Version 3.3.0" +msgstr "版本 3.3.0" -msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." -msgstr "表示未包含在原始边集中的伪`id` 。" +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "深度优先搜索算法是一种遍历算法，从根顶点开始，尽可能深入探索，一旦到达一个没有相邻顶点或所有相邻顶点都已访问的顶点，就会回溯。遍历会一直持续，直到从根顶点可达的所有顶点都被访问。" -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "该实现适用于 **有向** 图和 **无向** 图。" -msgid "Array of contracted vertex identifiers." -msgstr "收缩顶点标识符数组。" +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgstr "提供从根顶点或一组根顶点开始的深度优先搜索遍历顺序。" -msgid "When ``type`` = **'v'**: :math:`-1`" -msgstr "当 ``type`` = **'v'**: :math:`-1` 时" +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgstr "可选的非负最大深度参数，用于限制结果的深度到特定的深度。" -msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." -msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的source顶点标识符。" +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgstr "为了优化的目的，`Root vids` 中的任何重复值都会被忽略。" -msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." -msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的target 顶点标识符。" +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "它不会生成从根顶点到目标顶点的最短路径。" -msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." -msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的权重。" +msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgstr "不保证遍历的总成本最小。" -msgid "Only dead end contraction" -msgstr "仅死端收缩" +msgid "The returned values are ordered in ascending order of `start_vid`." +msgstr "返回值按 `start_vid` 升序排列。" -msgid "Only linear contraction" -msgstr "仅线性收缩" +msgid "Depth First Search Running time: :math:`O(E + V)`" +msgstr "深度优先搜索运行时间： :math:`O(E + V)`" -msgid "The cycle" -msgstr "循环" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." -msgstr "对图进行收缩可通过多次操作实现，操作顺序会影响最终收缩图的结果——每执行一次操作后，可被后续操作收缩的顶点集合将发生变化。" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgid "This implementation cycles ``cycles`` times through the ``methods`` ." -msgstr "这种实现方式在 ``methods`` 中循环 ``cycles`` 次。" +msgid "**options:** ``[directed, max_depth]``" +msgstr "**options:** ``[directed, max_depth]``" -msgid "Contracting sample data" -msgstr "收缩示例数据" +msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgstr "与 `单个顶点`_ 相同，但边按 ``id`` 降序排列。" -msgid "In this section, building and using a contracted graph will be shown by example." -msgstr "在本节中，将通过示例展示构建和使用收缩图。" +msgid "`Boost: Depth First Search `__" +msgstr "`Boost: 深度优先搜索 `__" -msgid "The :doc:`sampledata` for an undirected graph is used" -msgstr "使用无向图的 :doc:`sampledata`" +msgid "`Boost: Undirected DFS `__" +msgstr "`Boost: 非定向 DFS `__" -msgid "a dead end operation first followed by a linear operation." -msgstr "首先是死端操作，然后是线性操作。" +msgid "`Wikipedia: Depth First Search algorithm `__" +msgstr "`维基百科：深度优先搜索算法 `__" -msgid "Construction of the graph in the database" -msgstr "数据库中图的构建" +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgstr "``pgr_dijkstra`` - 使用 Dijkstra 算法计算的最短路径。" -msgid "The original graph:" -msgstr "原始图：" +msgid "Version 3.5.0" +msgstr "版本 3.5.0" -msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." -msgstr "结果数据并非表示收缩后的图，而是反映应用收缩方法后需对原图执行的变更操作。" +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_dijkstra(One to One) 增加了 ``start_vid`` 和 ``end_vid`` 列。" -msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." -msgstr "例如，观察到顶点 :math:`6` 没有出现在结果中，因为它不受收缩算法的影响。" +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgstr "pgr_dijkstra(One to Many) 添加了 ``end_vid`` 列。" -msgid "After doing the dead end contraction operation:" -msgstr "进行死端收缩操作后：" +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgstr "pgr_dijkstra(Many to One) 添加了 ``start_vid`` 列。" -msgid "After doing the linear contraction operation to the graph above:" -msgstr "对上图进行线性收缩运算后：" +msgid "Version 3.1.0" +msgstr "版本 3.1.0" -msgid "The process to create the contraction graph on the database:" -msgstr "在数据库上创建收缩图的过程：" +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(Combinations)" -msgid "Add additional columns" -msgstr "添加附加列" +msgid "Version 2.2.0" +msgstr "版本 2.2.0" -msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" -msgstr "在边表和顶点表中添加额外列。在本文档中将使用以下内容：" +msgid "pgr_dijkstra(One to Many)" +msgstr "pgr_dijkstra(One to Many)" -msgid "Column." -msgstr "列。" +msgid "pgr_dijkstra(Many to One)" +msgstr "pgr_dijkstra(Many to One)" -msgid "The vertices set belonging to the vertex/edge" -msgstr "属于顶点/边的顶点集" +msgid "pgr_dijkstra(Many to Many)" +msgstr "pgr_dijkstra(Many to Many)" -msgid "``is_contracted``" -msgstr "``is_contracted``" +msgid "Signature change on pgr_dijkstra(One to One)" +msgstr "pgr_dijkstra(One to One) 函数签名变更" -msgid "On the vertex table" -msgstr "在顶点表上" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." -msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." -msgstr "当 ``false`` 时，顶点不收缩，它是收缩图的一部分。" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "``is_new``" -msgstr "``is_new``" +msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "On the edge table" -msgstr "在边表上" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgstr "在 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" -msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." -msgstr "当 ``true`` 时，边缘由收缩算法生成。 它是收缩图的一部分。" +msgid "The examples of this section are based on the :doc:`sampledata` network." +msgstr "本节的示例基于 :doc:`sampledata` 网络。" -msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." -msgstr "当 ``false`` 时，边是原始边，可能是也可能不是收缩图的一部分。" +msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" +msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **有向** 图" -msgid "Store contraction information" -msgstr "存储收缩信息" +msgid "Directed graph with cost and reverse cost columns" +msgstr "带成本列和反向成本列的有向图" -msgid "Store the contraction results in a table." -msgstr "将收缩结果存储至数据表。" +msgid "1) Path from :math:`6` to :math:`10`" +msgstr "1) 从 :math:`6` 到 :math:`10` 的路径" -msgid "Update the edges and vertices tables" -msgstr "更新边线与顶点表" +msgid "2) Path from :math:`6` to :math:`7`" +msgstr "2) 从 :math:`6` 到 :math:`7` 的路径" -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "使用 ``is_contracted`` 列来指示收缩的顶点。" +msgid "3) Path from :math:`12` to :math:`10`" +msgstr "3) 从 :math:`12` 到 :math:`10` 的路径" -msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." -msgstr "将属于顶点的结果信息填充至 ``contracted_vertices`` 表中。" +msgid "4) Path from :math:`12` to :math:`7`" +msgstr "4) 从 :math:`12` 到 :math:`7` 的路径" -msgid "Insert the new edges generated by pgr_contraction." -msgstr "插入由 pgr_contraction 生成的新边。" +msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" +msgstr "5) 使用 `One to Many`_ 来获取示例1和示例2的解决方案" -msgid "The contracted graph" -msgstr "收缩图" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgstr "路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" -msgid "Vertices that belong to the contracted graph." -msgstr "属于收缩图的顶点。" +msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" +msgstr "6) 使用 `Many to One`_ 来获取示例2和示例4的解决方案" -msgid "Edges that belong to the contracted graph." -msgstr "属于收缩图的边。" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgstr "路径 :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" -msgid "Visually:" -msgstr "视觉效果：" +msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" +msgstr "7) 使用 `Many to Many`_ 来获取示例1到4的解决方案" -msgid "Using the contracted graph" -msgstr "使用收缩图" +msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgstr "路径 :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" -msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" -msgstr "根据最终应用的需求，图需要进行预处理。在本示例中，最终应用是使用收缩图通过 ``pgr_dijkstraCost`` 计算原始图中两个顶点之间的成本" +msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" +msgstr "8) 使用 `组合`_ 来获取示例1到3的解决方案" -msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" -msgstr "计算收缩图中给定源和目标之间的最短路径时，存在三种情况：" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgstr "路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgid "Case 1: Both source and target belong to the contracted graph." -msgstr "情况1：源和目标都属于收缩图。" +msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" +msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **无向** 图" -msgid "Case 2: Source and/or target belong to an edge subgraph." -msgstr "情况 2：源和/或目标属于边缘子图。" +msgid "Undirected graph with cost and reverse cost columns" +msgstr "带成本列和反向成本列的无向图" -msgid "Case 3: Source and/or target belong to a vertex." -msgstr "情况 3：源和/或目标属于一个顶点。" +msgid "9) Path from :math:`6` to :math:`10`" +msgstr "9)从 :math:`6` 到 :math:`10` 的路径" -msgid "The final application should consider all of those cases." -msgstr "最终应用应考虑所有这些情况。" +msgid "10) Path from :math:`6` to :math:`7`" +msgstr "10) 从 :math:`6` 到 :math:`7` 的路径" -msgid "Create a view (or table) of the contracted graph:" -msgstr "创建收缩图的视图（或表）：" +msgid "11) Path from :math:`12` to :math:`10`" +msgstr "11)从 :math:`12` 到 :math:`10` 的路径" -msgid "Create the function that will use the contracted graph." -msgstr "创建使用收缩图的函数。" +msgid "12) Path from :math:`12` to :math:`7`" +msgstr "12)从 :math:`12` 到 :math:`7` 的路径" -msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." -msgstr "情况 2：源点和/或目标点位于含收缩顶点的边线上。" +msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" +msgstr "13) 使用 `One to Many`_ 来获取示例9和10的解决方案" -msgid "Case 3: Source and/or target belong to a vertex that has been contracted." -msgstr "情况 3：源点和/或目标点属于已被收缩的顶点。" +msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" +msgstr "14) 使用 `Many to One`_ 来获取示例10和12的解决方案" -msgid "``pgr_contractionDeadEnd`` - Proposed" -msgstr "``pgr_contractionDeadEnd`` - 提议中" +msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" +msgstr "15) 使用 `Many to Many`_ 来获取示例9到12的解决方案" -msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contractionDeadEnd`` — 执行图收缩操作，并返回收缩后的顶点集与边线集。" +msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" +msgstr "16) 使用 `组合`_ 来获取示例9到11的解决方案" -msgid "A node is considered a dead end node when:" -msgstr "在下列情况下，节点被视为断头节点：" +msgid "For **directed** graphs only with ``cost`` column" +msgstr "仅适用于 **有向** 图，且仅包含 ``cost`` 列" -msgid "On undirected graphs:" -msgstr "在无向图上：" +msgid "Directed graph only with cost column" +msgstr "仅有成本列的有向图" -msgid "The number of adjacent vertices is 1." -msgstr "相邻顶点的个数为1。" +msgid "17) Path from :math:`6` to :math:`10`" +msgstr "17)从 :math:`6` 到 :math:`10` 的路径" -msgid "On directed graphs:" -msgstr "在有向图上：" +msgid "18) Path from :math:`6` to :math:`7`" +msgstr "18) 从 :math:`6` 到 :math:`7` 的路径" -msgid "When there is only one adjacent vertex or" -msgstr "当只有一个相邻顶点或" +msgid "19) Path from :math:`12` to :math:`10`" +msgstr "19)从 :math:`12` 到 :math:`10` 的路径" -msgid "When all edges are incoming regardless of the number of adjacent vertices." -msgstr "无论相邻顶点的数量多少，所有边都是进入的。" +msgid "20) Path from :math:`12` to :math:`7`" +msgstr "20) 从 :math:`12` 到 :math:`7` 的路径" -msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" +msgstr "21) 使用 `One to Many`_ 来获取示例17和18的解决方案" -msgid "**options:** ``[directed, forbidden]``" -msgstr "**options:** ``[directed, forbidden]``" +msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" +msgstr "22) 使用 `Many to One`_ 来获取示例18和20的解决方案" -msgid "Dead end contraction on an undirected graph." -msgstr "无向图的断头节点收缩。" +msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" +msgstr "23) 使用 `Many to Many`_ 来获取示例17到20的解决方案" -msgid "The green nodes are dead end nodes." -msgstr "绿色节点为断头节点。" +msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" +msgstr "24) 使用 `组合`_ 来获取示例17到19的解决方案" -msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." -msgstr "节点 :math:`3` 是节点 :math:`1` 收缩后的死结节点。" +msgid "For **undirected** graphs only with ``cost`` column" +msgstr "仅适用于带有 ``cost`` 列的 **无向** 图" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" +msgid "Undirected graph only with cost column" +msgstr "仅有成本列的无向图" -msgid "**Empty**" -msgstr "**Empty**" +msgid "25) Path from :math:`6` to :math:`10`" +msgstr "25) 从 :math:`6` 到 :math:`10` 的路径" -msgid "Value = ``e`` indicating the row is an edge." -msgstr "值 = ``e`` 表示该行是一条边。" +msgid "26) Path from :math:`6` to :math:`7`" +msgstr "26) 从 :math:`6` 到 :math:`7` 的路径" -msgid "A pseudo `id` of the edge." -msgstr "边线的伪 `id`。" +msgid "27) Path from :math:`12` to :math:`10`" +msgstr "27)从 :math:`12` 到 :math:`10` 的路径" -msgid "Identifier of the source vertex of the current edge." -msgstr "当前边的源顶点的标识符。" +msgid "28) Path from :math:`12` to :math:`7`" +msgstr "28) 从 :math:`12` 到 :math:`7` 的路径" -msgid "Identifier of the target vertex of the current edge." -msgstr "当前边的目标顶点的标识符。" +msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" +msgstr "29) 使用 `One to Many`_ 来获取示例25和26的解决方案" -msgid "Weight of the current edge." -msgstr "当前边线的权重值。" +msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" +msgstr "30) 使用 `Many to One`_ 来获取示例26和28的解决方案" -msgid "Dead end vertex on undirected graph" -msgstr "无向图上的死端顶点" +msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" +msgstr "31) 使用 `Many to Many`_ 来获取示例25到28的解决方案" -msgid "They have only one adjacent node." -msgstr "它们只有一个相邻节点。" +msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" +msgstr "32) 使用 `组合`_ 来获取示例25到27的解决方案" -msgid "Dead end vertex on directed graph" -msgstr "有向图上的死端顶点" +msgid "Equvalences between signatures" +msgstr "签名之间的等价性" -msgid "The green nodes are dead end nodes" -msgstr "绿色节点为断头节点" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgstr "下面的示例可以找到 :math:`\\{6}\\rightarrow\\{10\\}` 的路径" -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." -msgstr "蓝色节点具有无限数量的传入和/或传出边缘。" +msgid "33) Using `One to One`_" +msgstr "33) 使用 `One to One`_" -msgid "Node" -msgstr "节点" +msgid "34) Using `One to Many`_" +msgstr "34)使用 `One to Many`_" -msgid "Adjacent nodes" -msgstr "相邻节点" +msgid "35) Using `Many to One`_" +msgstr "35) 使用 `Many to One`_" -msgid "Dead end" -msgstr "死端" +msgid "36) Using `Many to Many`_" +msgstr "36) 使用 `Many to Many`_" -msgid "Reason" -msgstr "Reason" +msgid "37) Using `Combinations`_" +msgstr "37) 使用 `组合`_" -msgid ":math:`6`" -msgstr ":math:`6`" +msgid "`Boost: Dijkstra shortest paths `__" +msgstr "`Boost: Dijkstra最短路径Dijkstra 最短路径 `__" -msgid ":math:`\\{1\\}`" -msgstr ":math:`\\{1\\}`" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgid "Yes" -msgstr "是" +msgid "``pgr_dijkstraCost``" +msgstr "``pgr_dijkstraCost``" -msgid "Has only one adjacent node." -msgstr "只有一个相邻节点。" +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgstr "`pgr_dijkstraCost`` - 使用 Dijkstra 算法计算最短路径的总成本。" -msgid ":math:`7`" -msgstr ":math:`7`" +msgid "pgr_dijkstraCost(Combinations)" +msgstr "pgr_dijkstraCost(Combinations)" -msgid ":math:`\\{2\\}`" -msgstr ":math:`\\{2\\}`" +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr "``pgr_dijkstraCost`` 使用 Dijkstra 算法计算出的最短路径的代价。" -msgid ":math:`8`" -msgstr ":math:`8`" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid ":math:`\\{2, 3\\}`" -msgstr ":math:`\\{2, 3\\}`" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "Has more than one adjacent node and all edges are incoming." -msgstr "有一个以上的相邻节点，且所有边都是传入的。" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid ":math:`\\{4\\}`" -msgstr ":math:`\\{4\\}`" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid ":math:`10`" -msgstr ":math:`10`" +msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid ":math:`\\{4, 5\\}`" -msgstr ":math:`\\{4, 5\\}`" +msgid "``pgr_dijkstraCostMatrix``" +msgstr "``pgr_dijkstraCostMatrix``" -msgid "No" -msgstr "No" +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgstr "``pgr_dijkstraCostMatrix`` - 使用 :doc:`pgr_dijkstra` 计算成本矩阵。" -msgid "Has more than one adjacent node and all edges are outgoing." -msgstr "有一个以上的相邻节点，且所有边都是向外的。" +msgid "Using Dijkstra algorithm, calculate and return a cost matrix." +msgstr "使用 Dijkstra 算法，计算并返回成本矩阵。" -msgid ":math:`1,2,3,4,5`" -msgstr ":math:`1,2,3,4,5`" +msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgid "Many adjacent nodes." -msgstr "许多相邻节点。" +msgid "``pgr_dijkstraNear``" +msgstr "``pgr_dijkstraNear``" -msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." -msgstr "有一个以上的相邻节点，有些边是入边，有些是出边。" +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNear`` - 使用 Dijkstra 算法，找到通往最近顶点的路径。" -msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." -msgstr "从上面可以看出，节点 :math:`\\{6, 7, 9\\}` 是断头节点，因为其邻接顶点的数量为 1。" +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgstr "给定一个图、一个起始顶点和一组终止顶点，该函数会找出从起始顶点到最近的终止顶点的最短路径。" -msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." -msgstr "当有多个相邻顶点时，所有的边都必须是所有进入的边，否则就不是死胡同。" +msgid "Uses Dijkstra algorithm." +msgstr "使用 Dijkstra 算法。" -msgid "Step by step dead end contraction" -msgstr "逐步断头节点收缩" +msgid "Works for **directed** and **undirected** graphs." +msgstr "适用于 **有向** 和 **无向** 图。" -msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" -msgstr "断头节点收缩将持续执行，直至图中不再存在断头节点。例如下图中 :math:`3` 为断头节点时的处理流程：" +msgid "When there are more than one path to the same vertex with same cost:" +msgstr "当有多条路径通向同一顶点且成本相同时：" -msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" -msgstr "在收缩 :math:`3` 后，节点 :math:`2` 变成了断头节点，并被继续收缩：" +msgid "The algorithm will return just one path" +msgstr "算法将只返回一条路径" -msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." -msgstr "收缩 :math:`2` 后，停止。节点 :math:`1` 包含已收缩节点的信息。" +msgid "Optionally allows to find more than one path." +msgstr "可选择查找多条路径。" -msgid "Creating the contracted graph" -msgstr "创建收缩图" +msgid "When more than one path is to be returned:" +msgstr "当需要返回多条路径时：" -msgid "Steps for the creation of the contracted graph" -msgstr "创建收缩图的步骤" +msgid "Results are sorted in increasing order of:" +msgstr "结果按以下顺序递增排序：" -msgid "Add additional columns." -msgstr "添加额外的列。" +msgid "aggregate cost" +msgstr "总成本" -msgid "Save results into a table." -msgstr "将结果保存到表格中。" +msgid "Within the same value of aggregate costs:" +msgstr "在总成本相同值范围内：" -msgid "The contracted vertices are not part of the contracted graph." -msgstr "收缩后的顶点不包含在收缩图中。" +msgid "results are sorted by (source, target)" +msgstr "结果按 (source, target)排序" -msgid "Using when departure and destination are in the contracted graph" -msgstr "当出发地和目的地位于收缩图中时使用" +msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" +msgstr "运行时间：Dijkstra 运行时间： :math:`drt = O((|E| + |V|)log|V|)`" -msgid "Using when departure/destination is not in the contracted graph" -msgstr "当出发地/目的地不在收缩图中时使用" +msgid "One to Many; :math:`drt`" +msgstr "一对多； :math:`drt`" -msgid "Using when departure and destination are not in the contracted graph" -msgstr "当出发地和目的地均不在收缩图中时使用" +msgid "Many to One: :math:`drt`" +msgstr "Many to One: :math:`drt`" -msgid "``pgr_contractionHierarchies`` - Experimental" -msgstr "``pgr_contractionHierarchies`` - 实验性" +msgid "Many to Many: :math:`drt * |Starting vids|`" +msgstr "Many to Many: :math:`drt * |Starting vids|`" -msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." -msgstr "``pgr_contractionHierarchies`` — 根据收缩层级方法执行图收缩，并返回收缩后的顶点和生成的快捷边。" +msgid "Combinations: :math:`drt * |Starting vids|`" +msgstr "组合： :math:`drt * |Starting vids|`" -msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." -msgstr "收缩层次法是从顶点的初始顺序出发建立层次顺序的，在最短路径算法的标签固定处理过程中优先考虑某些顶点。此外，收缩层次算法还能在图中添加捷径边，帮助最短路径算法遵循所创建的层次图结构。" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." -msgstr "层次结构的原理是将属于长距离网络（例如公路网络中的高速公路）的顶点置于高优先级，而将属于短距离网络（例如公路网络中的主干道或次干路）的节点置于低优先级。" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." -msgstr "收缩层次结构算法的假设是，已经存在一个有价值的顶点顺序，用于初始化收缩过程。由于大多数情况下没有有价值的初始节点排序，因此我们使用顶点 ID 给出的顺序。然后，在这个首序的基础上进行收缩处理，得到最终的层次结构。" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." -msgstr "其基本原理是将顶点按其收缩吸引力的估计值排序，保留在优先队列中。实施案例中使用的度量称为 *边差* ，相当于顶点收缩产生的捷径数量与收缩前图中附带边的数量之差 (``#shortcuts - #incident edges``)." +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." -msgstr "最后，在使用类似 Dijkstra 的双向算法时，目的是减少图中已探索的部分。顶点顺序用于为定向搜索提供信息。搜索过程不会失去最优性。" +msgid "**options A:** ``[directed, cap]``" +msgstr "**options A:** ``[directed, cap]``" -msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." -msgstr "为收缩寻找最佳顶点排序是一个难题。然而，根据 Geisberger 等人的研究 [2]，非常简单的局部启发式方法就能很好地解决这个问题。这种方法的原理是先验地估算 *边差* 的值，只有当新的度量值使位于队列顶端的节点保持在队列顶端时，才对其进行收缩。否则，它就会被重新插入队列，位于与新度量值相对应的正确位置。" +msgid "**options B:** ``[directed, cap, global]``" +msgstr "**options B:** ``[directed, cap, global]``" -msgid "The process is done on graphs having only edges with positive costs." -msgstr "这个过程是在只有边的成本为正值的图形上完成的。" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." -msgstr "需要注意的是，此函数不会删除任何顶点。最终图中保留了原有的所有顶点，但新增了一些对应于快捷边的边。为构建这些快捷边而收缩的顶点也会被保留，并按层级顺序排列。" +msgid "**options:** ``[directed, cap]``" +msgstr "**options:** ``[directed, cap]``" -msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" -msgstr "至于其他收缩方法，它不会返回完整的收缩图，只会返回变化。它们有两种类型：" +msgid "Departing on car from vertex :math:`6` find the nearest subway station." +msgstr "从顶点 :math:`6` 乘车出发，找到最近的地铁站。" -msgid "added shortcut edges, with negative identifiers;" -msgstr "增加了带有负标识符的快捷边;" +msgid "Using a **directed** graph for car routing." +msgstr "使用 **有向** 图进行汽车路线规划。" -msgid "contracted nodes with an order." -msgstr "带有顺序的收缩节点。" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgstr "地铁站位于以下顶点上 :math:`\\{1, 10, 11\\}`" -msgid "The ``pgr_contractionHierarchies`` function has the following signature:" -msgstr "``pgr_contractionHierarchies`` 函数具有以下签名：" +msgid "The defaults used:" +msgstr "使用的默认值：" -msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" +msgid "`directed => true`" +msgstr "`directed => true`" -msgid "Returns set of |result-contraction-hierarchies|" -msgstr "返回集合 |result-contract|" +msgid "`cap => 1`" +msgstr "`cap => 1`" -msgid "Contraction hierarchies optional parameters" -msgstr "收缩层级的可选参数" +msgid "The result shows that station at vertex :math:`11` is the nearest." +msgstr "结果显示，位于顶点 :math:`11` 的站最近。" -msgid "True if the graph is directed, False otherwise." -msgstr "如果图是有向的，则为 True，否则为 False。" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" -msgstr "该函数返回多行（每个顶点一行，每创建一条快捷边一行）。行的列数为：" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" +msgstr "从地铁站开车出发，找到距离顶点 :math:`2` 最近的 **两个** 车站" -msgid "Type of the ``id``." -msgstr "``id`` 的类型。" +msgid "On line `4`: using the positional parameter: `directed` set to ``true``" +msgstr "第 `4` 行：使用位置参数： `directed` 设置为 ``true``" -msgid "Column ``id`` has a positive value" -msgstr "列 ``id`` 为正值" +msgid "In line `5`: using named parameter `cap => 2`" +msgstr "第 `5` 行：使用命名参数 `cap => 2`" -msgid "Column ``id`` has a negative value" -msgstr "列 ``id`` 的值为负数" +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgstr "结果显示，位于顶点 :math:`10` 的站点最近，其次是 :math:`11`。" -msgid "``metric``" -msgstr "``metric``" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "``vertex_order``" -msgstr "``vertex_order``" +msgid "**options:** ``[directed, cap, global]``" +msgstr "**options:** ``[directed, cap, global]``" -msgid "On an undirected graph" -msgstr "在无向图上" +msgid "Find the best pedestrian connection between two lines of buses" +msgstr "在两条公交线路之间寻找最佳的行人通道" -msgid "The following query shows the original data involved in the contraction operation on an undirected graph." -msgstr "下面的查询显示了在无向图上进行收缩操作所涉及的原始数据。" +msgid "Using an **undirected** graph for pedestrian routing" +msgstr "采用**非定向**图进行行人路径规划" -msgid "building contraction hierarchies on the whole graph" -msgstr "在整个图形上建立收缩层次结构" +msgid "The first subway line stations are at :math:`\\{15, 16\\}`" +msgstr "第一条地铁线的站点位于 :math:`\\{15, 16\\}`" -msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." -msgstr "结果并不代表收缩后的图形。它们代表的是应用收缩算法后对图所做的改变，并根据 *边差* 度量对顶点进行排序，从而给出算法建立的顶点顺序。因此，结果中包含了所有顶点（当然禁止的顶点除外）。结果中只显示算法建立的捷径。" +msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgstr "地铁二号线的站点是 :math:`\\{1, 10, 11\\}`" -msgid "After computing the contraction hierarchies, an order is now given to the vertices," -msgstr "计算完收缩层次后，现在要给顶点排序，" +msgid "On line `4`: using the named parameter: `directed => false`" +msgstr "第 `4` 行：使用命名参数：`directed => false`" -msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." -msgstr "是为了与一种特定的 Dijkstra 算法（在未来版本中实现）配合使用，从而加快搜索速度。" +msgid "`global => true`" +msgstr "`global => true`" -msgid "We obtain the contracted graph above:" -msgstr "我们得到了上面的收缩图：" +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgstr "对于行人来说，上下车的最佳连接点是第一条地铁线的顶点 :math:`15` 和第二条地铁线的顶点 :math:`10`。" -msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." -msgstr "我们可以毫不意外地看到，属于捷径的顶点在结果顶点顺序中往往具有较高的优先级。" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgstr "只返回 `一条` 路由，因为 `global` 为 ``true`` 且 `cap` 为 ``1``" -msgid "On an undirected graph with forbidden vertices" -msgstr "在有禁止顶点的无向图上" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "building contraction with a set of forbidden vertices" -msgstr "带有一组禁止顶点的建筑收缩" +msgid "Find the best car connection between all the stations of two subway lines" +msgstr "查找两条地铁线所有站点之间的最佳汽车连接线路" -msgid "Contraction process steps details" -msgstr "收缩过程步骤详情" +msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" +msgstr "第一条地铁线的站点是 :math:`\\{1, 10, 11\\}`" -msgid "Shortcut building process" -msgstr "快捷构建过程" +msgid "The second subway line stations are at :math:`\\{15, 16\\}`" +msgstr "地铁二号线站点位于 :math:`\\{15, 16\\}`" -msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." -msgstr "顶点 ``v`` 通过添加快捷边来进行收缩，替换形式为 ``(u, v, w)`` 的原路径为一条边 ``(u, w)`` 。仅当 ``(u, v, w)`` 是 ``u`` 和 ``w`` 之间唯一的最短路径时，才需要快捷边 ``(u, w)`` 。" +msgid "The combinations contents:" +msgstr "组合内容：" -msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." -msgstr "当为给定顶点 ``v`` 添加完所有快捷边后， ``v`` 的相关边会被移除，接着对剩余图中的另一个顶点进行收缩。" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgstr "行 `3~4` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第二条地铁线上的顶点" -msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." -msgstr "这个过程对图形是破坏性的，我们会制作一个副本，以便再次对其进行整体操作。收缩过程会将所有发现的捷径添加到边集 ``E`` 中，并为每个收缩顶点赋予一个度量值。这个度量值就是所谓的 *收缩层次* 。" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgstr "行 `6~7` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第一条地铁线上的顶点" -msgid "Initialize the queue with a first vertices order" -msgstr "用初始顶点顺序初始化队列" +msgid "On line `8`: using the named parameter is `global => false`" +msgstr "第 `8` 行：使用名为 `global => false` 的参数" -msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:" -msgstr "对于图中的每个顶点 ``v`` ，都会建立一个 ``v`` 的收缩：" +msgid "From the results:" +msgstr "从结果来看：" -msgid ":math:`v`" -msgstr ":math:`v`" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgstr "将第一条地铁线 :math:`{1, 10, 11\\}` 连接到第二条地铁线 :math:`{15, 16\\}`：" -msgid ":math:`\\{p, r, u\\}`" -msgstr ":math:`\\{p, r, u\\}`" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgstr "从第一条线路的所有站点出发的最佳连接是： :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgid ":math:`p`" -msgstr ":math:`p`" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` （行：`11` 和`12`）" -msgid ":math:`\\{u, v\\}`" -msgstr ":math:`\\{u, v\\}`" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgstr "将第二条地铁线 :math:`{15, 16\\}` 连接到第一条地铁线 :math:`{1, 10, 11\\}`：" -msgid ":math:`u`" -msgstr ":math:`u`" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgstr "从二号线所有站点出发的最佳连接是： :math:`{(15 ／rightarrow 10) (16 ／rightarrow 11)}`" -msgid ":math:`\\{p, v, w\\}`" -msgstr ":math:`\\{p, v, w\\}`" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgstr "由于成本相同，两者同样好。(行：`13` 和 `14` ，行：`15` 和 `16`)" -msgid ":math:`r`" -msgstr ":math:`r`" +msgid "Dijkstra optional parameters" +msgstr "Dijkstra 可选参数" -msgid ":math:`\\{v, w\\}`" -msgstr ":math:`\\{v, w\\}`" +msgid "Near optional parameters" +msgstr "接近可选参数" -msgid ":math:`w`" -msgstr ":math:`w`" +msgid "``cap``" +msgstr "``cap``" -msgid ":math:`\\{r, u\\}`" -msgstr ":math:`\\{r, u\\}`" +msgid "Find at most ``cap`` number of nearest shortest paths" +msgstr "查找最多 ``cap`` 条最近的最短路径" -msgid "Adjacent edges are removed." -msgstr "相邻边被移除。" +msgid "``global``" +msgstr "``global``" -msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." -msgstr "只有当通过 ``v`` 的路径是 ``v`` 的前驱和后继之间唯一的最短路径时，才会从 ``v`` 的前驱到后继构建快捷边。这里的 *边差* 度量值为-2。" +msgid "When ``true``: only ``cap`` limit results will be returned" +msgstr "``true`` 时：仅返回 ``cap`` 结果" -msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." -msgstr "然后收缩下面的顶点。这个过程一直持续到图中的每个节点都被收缩为止。最后，图中就不再有边了，这个过程也就结束了。" +msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" +msgstr "当 ``false`` 时：将返回每个 ``Start vid`` 的 ``cap`` 限值" -msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." -msgstr "第一次收缩将给出一个顶点顺序，根据度量（边差值）按升序排列。这样就得到了一个总的顶点顺序。如果 ``u < v`` ，那么 ``u`` 就比 ``v`` 重要。算法会按此顺序将顶点保存到队列中。" +msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgstr "维基百科：https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgid "A hierarchy will now be constructed by contracting again the vertices in this order." -msgstr "现在，我们将按照这个顺序再次收缩顶点，从而构建一个层次结构。" +msgid "``pgr_dijkstraNearCost``" +msgstr "``pgr_dijkstraNearCost``" -msgid "Build the final vertex order" -msgstr "构建最终顶点顺序" +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +msgstr "`pgr_dijkstraNearCost`` - 使用 dijkstra 算法，找到通往最近顶点的路径。" -msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." -msgstr "一旦建立了第一顺序，算法就会利用它再次浏览图形。对于队列中的每个顶点，算法都会模拟收缩并计算其边差。如果计算出的值大于下一个要收缩的顶点的值，算法就会把它放回队列（启发式方法）。否则，该顶点将永久收缩。" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "Add shortcuts to the initial graph" -msgstr "向初始图形添加快捷边" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." -msgstr "最后，算法会使用初始图形（删除边之前）并添加快捷边。这样就得到了收缩后的图形，可以使用专门的 Dijkstra 算法，该算法会考虑层次结构中节点的顺序。" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgid "Use the contraction" -msgstr "使用缩略语" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgid "Build the contraction" -msgstr "构建收缩" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Add shortcuts and hierarchy in the existing tables" -msgstr "在现有表中添加快捷边和层级" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "Add new columns in the `vertices` and `edges` tables to store the results:" -msgstr "在 `vertices` 和 `edges` 表中添加新列来存储结果：" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" +msgstr "从地铁站开车出发找到距离顶点 :math:`6` 最近的 **两个** 车站" -msgid "Update and insert the results in the two tables." -msgstr "更新并插入结果到两个表中。" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "Use a Dijkstra shortest path algorithm on it" -msgstr "对其使用 Dijkstra 最短路径算法" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" -msgstr "然后，你可以使用任何类似Dijkstra的算法，等待适应的算法，它将考虑构建的顶点层级。例如：" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` (lines: `1`)" -msgid "``pgr_contractionLinear`` - Proposed" -msgstr "``pgr_contractionLinear`` - 提议中" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgstr "由于成本相同，两者同样好。(行：`12` and `13`)" -msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." -msgstr "``pgr_contractionLinear`` — 执行图收缩并返回收缩后的顶点和边线。" +msgid "``pgr_dijkstraVia``" +msgstr "``pgr_dijkstraVia``" -msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" -msgstr "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." +msgstr "``pgr_dijkstraVia`` - 经过顶点列表的路径。" -msgid "Linear contraction on an undirected graph." -msgstr "无向图上的线性收缩。" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "给定一个顶点列表和一个图，该函数等价于为所有 :math:`i < size\\_of(via\\;vertices)`的 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间找到最短路径。" -msgid "The green nodes are linear nodes and will not be part of the contracted graph." -msgstr "绿色节点为线性节点，不属于收缩图的一部分。" +msgid "Route" +msgstr "路线" -msgid "All edges adjacent will not be part of the contracted graph." -msgstr "所有相邻边线均不纳入收缩图。" +msgid "is a sequence of paths." +msgstr "是一个路径序列。" -msgid "The red lines will be new edges of the contracted graph." -msgstr "红线将成为收缩图的新边线。" +msgid "Path" +msgstr "路径" -msgid "**contraction Order**" -msgstr "**contraction Order**" +msgid "is a section of the route." +msgstr "是路线的一段。" -msgid "Number of times the contraction operations on ``contraction_order`` will be performed." -msgstr "对 ``contraction_order`` 执行收缩操作的次数。" +msgid "One Via" +msgstr "一次通过" -msgid "A node connects two (or more) `linear` edges when" -msgstr "节点连接两条（或多条）\"线性 \"边，当" +msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgstr "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" -msgid "The number of adjacent vertices is 2." -msgstr "相邻顶点的数量为2。" +msgid "**options:** ``[directed, strict, U_turn_on_edge]``" +msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" -msgid "In case of a directed graph, a node is considered a `linear` node when" -msgstr "在有向图的情况下，当满足以下条件时，节点被视为`线性`节点" +msgid "Returns set of |via-result|" +msgstr "返回 |via-result| 的集合" -msgid "Linearity is symmetrical." -msgstr "线性是对称的。" +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgstr "在一个directed graph中，找到按顺序访问顶点 :math:`\\ {5, 1, 8\\}` 的路径。" -msgid "Linearity is not symmetrical" -msgstr "线性不对称" +msgid "Via optional parameters" +msgstr "Via可选参数" -msgid "Graph where linearity is not symmetrical." -msgstr "线性不对称的图形。" +msgid "When ``true`` departing from a visited vertex will not try to avoid" +msgstr "为 ``true`` 时，从访问过的顶点出发时不会试图避开" -msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." -msgstr "当图形作为有向图处理时，线性并不对称，因此图形无法收缩。" +msgid "Identifier of a path. Has value **1** for the first path." +msgstr "路径的标识符。 第一条路径的值为 **1**。" -msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." -msgstr "当把同一图形作为无向图处理时，线性是对称的，因此图形可以收缩。" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。" -msgid "The three edges can be replaced by one undirected edge" -msgstr "三条边可以用一条无向边代替" +msgid "-1 for the last node of the path." +msgstr "-1，表示路径的最后一个节点。" -msgid "Edge :math:`1 - 3`." -msgstr "边线 :math:`1 - 3`。" +msgid "-2 for the last node of the route." +msgstr "路由的最后一个节点为 -2。" -msgid "With cost: :math:`4`." -msgstr "成本： :math:`4`." +msgid "``route_agg_cost``" +msgstr "``route_agg_cost``" -msgid "Contracted vertices in the edge: :math:`\\{2\\}`." -msgstr "边上的收缩顶点: :math:`\\{2\\}`." +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgstr "从 ``seq = 1`` 的 ``start_vid`` 到当前 ``seq`` 的 ``end_vid`` 的总费用。" -msgid "Linearity is symmetrical" -msgstr "线性是对称的" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgstr "所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}` 的路径。" -msgid "Graph where linearity is symmetrical." -msgstr "线性对称的图形。" +msgid "The main query" +msgstr "主查询" -msgid "The four edges can be replaced by two directed edges." -msgstr "四条边可以用两条有向边代替。" +msgid "Aggregate cost of the third path." +msgstr "第三条路径的总成本。" -msgid "Edge :math:`3 - 1`." -msgstr "边线 :math:`3 - 1`." +msgid "Route's aggregate cost of the route at the end of the third path." +msgstr "第三条路径末端的路径总成本。" -msgid "With cost: :math:`6`." -msgstr "成本： :math:`6`." +msgid "Nodes visited in the route." +msgstr "路由中访问的节点。" -msgid "The four edges can be replaced by one undirected edge." -msgstr "四条边线可替换为一条无向边。" +msgid "The aggregate costs of the route when the visited vertices are reached." +msgstr "到达所访问顶点时的路线总成本。" -msgid "Step by step linear contraction" -msgstr "逐步线性收缩" +msgid "Status of \"passes in front\" or \"visits\" of the nodes." +msgstr "节点的 \"前方通过 \"或 \"访问 \"状态。" -msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" -msgstr "线性收缩将在没有更多线性边时停止。例如，在下图中存在线性边" +msgid ":doc:`via-category`." +msgstr ":doc:`via-category`。" -msgid "Contracting vertex :math:`3`," -msgstr "收缩顶点 :math:`3`," +msgid ":doc:`dijkstra-family`." +msgstr ":doc:`dijkstra-family`。" -msgid "The vertex :math:`3` is removed from the graph" -msgstr "顶点 :math:`3` 已从图中移除" +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" -msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." -msgstr "边线 :math:`2 \\rightarrow 3` 和 :math:`w \\rightarrow z` 已从图中移除。" +msgid "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance(Single vertex)" -msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." -msgstr "插入一条新边 :math:`2 \\rightarrow 4` ，用红色表示。" +msgid "Added ``depth`` and ``start_vid`` result columns." +msgstr "添加了 ``depth`` 和 ``start_vid`` 结果列。" -msgid "Contracting vertex :math:`2`:" -msgstr "收缩顶点 :math:`2`：" +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance(Multiple vertices)" -msgid "The vertex :math:`2` is removed from the graph" -msgstr "顶点 :math:`2` 已从图形中移除" +msgid "Result column name change: ``from_v`` to ``start_vid``." +msgstr "结果列名称更改： ``from_v`` 改为 ``start_vid`` 。" -msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." -msgstr "从图中删除边 :math:`1 \\rightarrow 2` 和 :math:`2 \\rightarrow 3` 。" +msgid "Added ``depth`` and ``pred`` result columns." +msgstr "添加了 ``depth`` 和``pred`` 结果列。" -msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." -msgstr "插入一条新边 :math:`1\\rightarrow 3` ，用红色表示。" +msgid "Signature change:" +msgstr "签名变更：" -msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." -msgstr "边线 :math:`1 \\rightarrow 3` 包含成本值及被收缩节点信息。" +msgid "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance(单个顶点)" -msgid "Create the contracted graph." -msgstr "创建收缩图。" +msgid "New official signature:" +msgstr "新签名：" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "pgr_cuthillMckeeOrdering`` - 实验性" +msgid "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance(多个顶点)" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" -msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgstr "使用 Dijkstra 算法，提取成本小于或等于 ``distance`` 值的所有节点。提取的边将符合相应的生成树。" -msgid "Version 3.4.0" -msgstr "版本 3.4.0" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." -msgstr "在数值线性代数中，Cuthill-McKee 算法（CM）以 Elizabeth Cuthill 和 James McKee 的名字命名，是一种将具有对称稀疏性模式的稀疏矩阵置换为带宽较小的带状矩阵形式的算法。" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" -msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." -msgstr "顶点的搜索顺序基本上是广度优先，只不过在每一步中，相邻的顶点会按照度数递增的顺序排列在队列中。" +msgid "**options:** [directed, equicost]" +msgstr "**options:** [directed, equicost]" -msgid "The implementation is for **undirected** graphs." -msgstr "该实现适用于 **无向** 图。" +msgid "Single Vertex" +msgstr "单个顶点" -msgid "The bandwidth minimization problems are considered NP-complete problems." -msgstr "带宽最小化问题被认为是NP完全问题。" +msgid "From vertex :math:`11` for a distance of :math:`3.0`" +msgstr "从顶点 :math:`11` 到 :math:`3.0` 的距离" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" -msgstr "运行时间复杂度为： :math:`O(m log(m)|V|)`" +msgid "Multiple Vertices" +msgstr "多个顶点" -msgid "where :math:`|V|` is the number of vertices," -msgstr "其中 :math:`|V|` 是顶点数，" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgstr "从顶点 :math:`{11, 16\\}` 出发，距离为 :math:`3.0` 且有向图上的成本相等" -msgid ":math:`m` is the maximum degree of the vertices in the graph." -msgstr ":math:`m` 是图中顶点的最大度数。" +msgid "Driving distance optional parameters" +msgstr "行驶距离可选参数" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" -msgstr "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgid "``equicost``" +msgstr "``equicost``" -msgid "Returns set of |result_node_order|" -msgstr "返回集合 |result_node_order|" +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgstr "``true`` 时，节点只会出现在最近的 ``start_vid`` 列表中。绑定制动是任意的。" -msgid "Graph ordering of pgRouting :doc:`sampledata`" -msgstr "pgRouting :doc:`sampledata` 的图形排序" +msgid "When ``false`` which resembles several calls using the single vertex signature." +msgstr "``false`` 时，类似于使用单个顶点签名的多次调用。" -msgid "Returns set of ``(seq, node)``" -msgstr "返回 ``(seq, node)`` 的集合" +msgid "end-before" +msgstr "" -msgid "Sequence of the order starting from 1." -msgstr "从1开始的顺序序列。" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgstr "在无向图上，从顶点 :math:`{11, 16\\}` 开始的距离为 :math:`3.0`" -msgid "New ordering in reverse order." -msgstr "新的逆序排列。" +msgid "``pgr_edgeColoring`` - Experimental" +msgstr "``pgr_edgeColoring`` - 实验性" -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "`Boost: Cuthill-McKee 排序 `__" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgstr "``pgr_edgeColoring`` - 返回无向图和无环图的边着色" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "`Wikipedia: Cuthill-McKee 排序 `__" +#, fuzzy +msgid "Output columns standardized to |result_edge_color|" +msgstr "输出列是 |ksp-result|" -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr "``pgr_dagShortestPath`` - 实验性" +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgstr "边着色是一种用于为图形中顶点的边着色的算法。它为图中的边分配颜色，使相邻的两条边没有相同的颜色。" -msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." -msgstr "``pgr_dagShortestPath`` — 返回加权有向无环图（DAG）中的最短路径。特别是使用 Boost.Graph 实现的 DAG 最短路径算法。" +msgid "The implementation is for **undirected** and **loop-free** graphs" +msgstr "针对 **无向** 和 **无环** 图实施" -msgid "pgr_dagShortestPath(Combinations)" -msgstr "pgr_dagShortestPath(组合)" +msgid "loop free" +msgstr "无环" -msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." -msgstr "有向无环图（DAG）的最短路径是一种图搜索算法，用于解决加权有向无环图的最短路径问题，找到从起始顶点 (``start_vid``) 到结束顶点 (``end_vid``) 的最短路径。" +msgid "no self-loops and no parallel edges." +msgstr "无自循环，无平行边。" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." -msgstr "这个实现只能用于 **有向** 图，且没有循环，即有向无环图。" +msgid "Provides the color to be assigned to all the edges present in the graph." +msgstr "指定要分配给图中所有边的颜色。" -msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." -msgstr "该算法依靠对 DAG 进行拓扑排序来对顶点进行线性排序，因此比 Dijkstra 或 Bellman-Ford 算法更有效率。" +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +msgstr "最多使用 :math:`\\Delta + 1` 种颜色，其中 :math:`\\Delta` 是图的度数。" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." -msgstr "该过程仅对加权有向无环图有效。 否则它会抛出警告。" +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgstr "这对于某些图是最优的，根据Vizing定理，对于所有其他图，它使用的颜色最多比最优解多一种。" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" -msgstr "`agg_cost`中未包括的值`(v, v)` 的成本为`0`" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgstr "色数（chromatic number） :math:`x'(G)`（用于图的适当边着色所需的最小颜色数）等于图的度 :math:`\\Delta + 1`（ :math:`x'(G) = \\Delta`）" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" -msgstr "`agg_cost`中未包括的值 `(u, v)`是数学符号中的 :math:`\\infty`" +msgid "The algorithm tries to assign the least possible color to every edge." +msgstr "该算法尝试为每条边分配尽可能少的颜色。" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" -msgstr "运行时间： :math:`O(| start\\_vids | * (V + E))`" +msgid "Does not always produce optimal coloring." +msgstr "并不总是产生最佳的着色。" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgid "The returned rows are ordered in ascending order of the edge identifier." +msgstr "返回的行按边标识符升序排列。" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" +msgstr "高效图形着色是一个 NP-Hard问题，因此：" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" +msgstr "在此实现中，运行时间为： :math:`O(|E|*|V||)`" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgid "where :math:`|E|` is the number of edges in the graph," +msgstr "其中 :math:`|E|` 是图中的边数、" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgid ":math:`|V|` is the number of vertices in the graph." +msgstr ":math:`|V|` 是图中的顶点数。" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" -msgstr "在 **有向** 图上，从顶点 :math:`5` 到顶点 :math:`11`" +msgid "pgr_edgeColoring(`Edges SQL`_)" +msgstr "pgr_edgeColoring(`Edges SQL`_)" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" -msgstr "从顶点 :math:`5` 到顶点 :math:`\\{7, 11\\}`" +msgid "Graph coloring of pgRouting :doc:`sampledata`" +msgstr "pgRouting :doc:`sampledata` 的图形着色" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" -msgstr "从顶点 :math:`\\{5, 10\\}` 到顶点 :math:`11`" +msgid "`Boost: Edge Coloring `__" +msgstr "`Boost: 边着色 `__" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" -msgstr "在 **无向** 图上，从顶点 :math:`\\{5, 15\\} ` 到顶点 :math:`\\{11, 17\\}`" +msgid "`Wikipedia: Graph coloring `__" +msgstr "`维基百科：图着色 `__" -msgid "Return columns" -msgstr "返回列" +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgstr "``pgr_edgeDisjointPaths`` - 计算两组顶点之间的边不相交路径。" -msgid "Making **start_vids** the same as **end_vids**" -msgstr "使 **start_vids** 与 **end_vids** 相同" +#, fuzzy +msgid "Output columns standardized to |generic-result|" +msgstr "输出列是 |old-generic-result|" -msgid "`Boost: DAG shortest paths `__" -msgstr "`Boost: DAG最短路径DAG 最短路径 `__" +msgid "pgr_edgeDisjointPaths(Combinations)" +msgstr "pgr_edgeDisjointPaths(组合)" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" -msgstr "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgstr "计算两组顶点之间的边不相交路径。 利用底层最大流量算法来计算路径。" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +msgid "The main characterics are:" +msgstr "主要特点是：" -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." -msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" +msgid "Calculates the edge disjoint paths between any two groups of vertices." +msgstr "计算任意两组顶点之间的边相交路径。" -msgid "Error messages adjustment." -msgstr "错误信息调整。" +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgstr "当源和目标相同或无法到达时，返回 EMPTY SET。" -msgid "New signature with only Edges SQL." -msgstr "只有 Edges SQL 的新签名。" +msgid "The graph can be directed or undirected." +msgstr "图可以是有向或无向的。" -msgid "Calculates the degree of the vertices of an undirected graph" -msgstr "计算无向图顶点的度数" +msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." +msgstr "使用 :doc:`pgr_boykovKolmogorov` 计算路径。" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." -msgstr "图中顶点的度（或称为顶点的连接度）是指与该顶点相关联的边数。" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "A loop contributes 2 to a vertex's degree." -msgstr "一个循环对一个顶点的度数贡献为 2。" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "A vertex with degree 0 is called an isolated vertex." -msgstr "度数为 0 的顶点称为孤立顶点。" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "Isolated vertex is not part of the result" -msgstr "孤立顶点不包含在结果中" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "Vertex not participating on the subgraph is considered and isolated vertex." -msgstr "未参与子图的顶点被视为孤立顶点。" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." -msgstr "可以执行 ``dryrun`` ，用于获取答案的代码将显示在 PostgreSQL 的 ``NOTICE`` 。" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgstr "使用组合表，相当于计算无向图上从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`\\{10, 15, 14\\}` 的结果。" -msgid "The code can be used as base code for the particular application requirements." -msgstr "该代码可用作满足特定应用要求的基础代码。" +msgid "Manually assigned vertex combinations on an undirected graph." +msgstr "在无向图上手动分配顶点组合。" -msgid "No ordering is performed." -msgstr "不执行排序操作。" +msgid "``pgr_edmondsKarp``" +msgstr "``pgr_edmondsKarp``" -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" -msgstr "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgstr "``pgr_edmondsKarp`` — 使用 Edmonds Karp 算法计算图边上的流量，以最大化从源到目标的流量。" -msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" -msgstr "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(组合)" -msgid "RETURNS SETOF |result-degree|" -msgstr "RETURNS SETOF |result-degree|" +msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" +msgstr "从 ``pgr_maxFlowEdmondsKarp`` 更名而来" -msgid "Edges" -msgstr "边" +msgid "Running time: :math:`O( V * E ^ 2)`" +msgstr "运行时间： :math:`O( V * E ^ 2)`" -msgid "example" -msgstr "示例" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" -msgid "Get the degree of the vertices defined on the edges table" -msgstr "获取边线表定义的顶点度数" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" -msgid "Edges and Vertices" -msgstr "边和顶点" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" -msgid "Extracting the vertex information" -msgstr "提取顶点信息" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." -msgstr "``pgr_degree`` 可以使用 :doc:`pgr_extractVertices` 嵌入调用。" +msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" -msgstr "对于适当规模的网络，最好事先准备好顶点表，并在调用 ``pgr_degree`` 时使用。 (请参阅 `Using a vertex table`_)" +msgid "`Boost: Edmonds Karp max flow `__" +msgstr "`Boost: Edmonds Karp max flow `__" -msgid "Calculate the degree of the nodes:" -msgstr "计算节点的度数：" +msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgid "`Vertex SQL`_" -msgstr "`Vertex SQL`_" +msgid "``pgr_edwardMoore`` - Experimental" +msgstr "``pgr_edwardMoore`` - 实验性" -msgid "`Vertex SQL`_ as described below" -msgstr "`Vertex SQL`_ 如下所述" +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgstr "`pgr_edwardMoore`` - 使用 Edward-Moore 算法返回最短路径。" -msgid "``dryrun``" -msgstr "``dryrun``" +msgid "pgr_edwardMoore(Combinations)" +msgstr "pgr_edwardMoore(组合)" -msgid "When true do not process and get in a NOTICE the resulting query." -msgstr "当为真时，不要处理查询，而是获取一个通知（NOTICE）来显示查询的结果。" +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgstr "Edward Moore算法是Bellman-Ford算法的改进。 它可以计算加权有向图中从单个源顶点到所有其他顶点的最短路径。 Edward Moore算法和Bellman-Ford算法之间的主要区别在于运行时间。" -msgid "For the `Edges and Vertices`_ signature:" -msgstr "关于 `Edges and Vertices`_ 签名：" +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgstr "该算法的最坏运行时间为 :math:`O(| V | * | E |)` ，类似于Bellman-Ford算法的时间复杂度。然而，实验表明，对于随机图，该算法的平均运行时间复杂度为 :math:`O( | E | )`。这在计算速度上明显更快。" -msgid "For the `Edges`_ signature:" -msgstr "关于 `Edges`_ 签名：" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgstr "因此，该算法在最好的情况下，明显快于 Bellman-Ford 算法，在最差的情况下，与 Bellman-Ford 算法一样好" -msgid "Vertex SQL" -msgstr "Vertex SQL" +msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" +msgstr "未包含值 `(v, v)` 的 `agg_cost` 为 :math:`0`" -msgid "``in_edges``" -msgstr "``in_edges``" +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgstr "出于优化目的， `start vids` 或`end vids`中的任何重复值都将被忽略。" -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." -msgstr "以顶点 ``id`` 作为 *第一个端点* 的边的标识符数组。" +msgid "Running time:" +msgstr "运行时间：" -msgid "When missing, ``out_edges`` must exist." -msgstr "当缺失时， ``out_edges`` 必须存在。" +msgid "Worst case: :math:`O(| V | * | E |)`" +msgstr "最坏的情况： :math:`O(| V | * | E |)`" -msgid "``out_edges``" -msgstr "``out_edges``" +msgid "Average case: :math:`O( | E | )`" +msgstr "平均情况： :math:`O( | E | )`" -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." -msgstr "以顶点 ``id`` 作为 *第二个端点* 的边的标识符数组。" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "When missing, ``in_edges`` must exist." -msgstr "缺失时， ``in_edges`` 必须存在。" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "Vertex identifier" -msgstr "顶点标识符" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "``degree``" -msgstr "``degree``" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "Number of edges that are incident to the vertex ``id``" -msgstr "与顶点 ``id`` 关联的边数" +msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "Degree of a loop" -msgstr "循环度" +msgid "Using a combinations table on an **undirected** graph." +msgstr "在 **无向** 图上使用组合表。" -msgid "Using the `Edges`_ signature." -msgstr "使用 `Edges`_ 签名。" +msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgid "Using the `Edges and Vertices`_ signature." -msgstr "使用 `Edges and Vertices`_ 签名。" +msgid "``pgr_extractVertices``" +msgstr "``pgr_extractVertices``" -msgid "Degree of a sub graph" -msgstr "子图的度数" +msgid "``pgr_extractVertices`` — Extracts the vertices information" +msgstr "``pgr_extractVertices`` — 提取顶点信息" -msgid "For the following is a subgraph of the :doc:`sampledata`:" -msgstr "下面是 :doc:`sampledata` 的子图：" +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgstr "这是一个用于提取图的边集的顶点信息的辅助函数。" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" -msgstr ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgstr "当给出边标识符时，它也会计算出入边" -msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" -msgstr ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgstr "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" -msgid "The vertices not participating on the edge are considered isolated" -msgstr "未参与边的顶点被视为孤立顶点" +msgid "RETURNS SETOF |result-extract|" +msgstr "RETURNS SETOF |result-extract|" -msgid "their degree is 0 in the subgraph and" -msgstr "在子图中的阶数为 0，并且" +msgid "When line geometry is known" +msgstr "当线的几何形状已知时" -msgid "their degree is not shown in the output." -msgstr "它们的度数不会在输出结果中显示。" +msgid "(Optional) identifier of the edge." +msgstr "（可选）边的标识符。" -msgid "Using a vertex table" -msgstr "使用顶点表" +msgid "``geom``" +msgstr "``geom``" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." -msgstr "对于较大规模的网络，建议预先准备顶点表并在调用 ``pgr_degree`` 时使用。" +msgid "``LINESTRING``" +msgstr "``LINESTRING``" -msgid "Extract the vertex information and save into a table:" -msgstr "提取顶点信息并保存到表格中：" +msgid "Geometry of the edge." +msgstr "边的几何形状。" -msgid "Dry run execution" -msgstr "模拟执行" +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgstr "该内部查询优先于接下来的两个内部查询，因此当 ``geom`` 列出现时，其他列将被忽略。" -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." -msgstr "要获取用于生成顶点信息的查询，请使用 ``dryrun => true`` 。" +msgid "Ignored columns:" +msgstr "忽略的列：" -msgid "The results can be used as base code to make a refinement based on the backend development needs." -msgstr "结果可作为基础代码，根据后台开发需要进行改进。" +msgid "``startpoint``" +msgstr "``startpoint``" -msgid "Finding dead ends" -msgstr "查找断头节点" +msgid "``endpoint``" +msgstr "``endpoint``" -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." -msgstr "如果已经使用 ``pgr_extractVertices`` 构建了顶点表，并且想要获取整个图的度数，而不是子集的度数，则可以跳过使用 ``pgr_degree`` ，直接操作 ``in_edges`` 和 ``out_edges`` 列。" +msgid "When vertex geometry is known" +msgstr "当顶点几何形状已知时" -msgid "The degree of a dead end is 1." -msgstr "断头节点的度数为 1。" +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgstr "要使用此内部查询，列 ``geom`` 不应成为列集的一部分。" -msgid "Finding linear vertices" -msgstr "查找线性顶点" +msgid "``POINT``" +msgstr "``POINT``" -msgid "The degree of a linear vertex is 2." -msgstr "线性顶点的阶数为 2。" +msgid "POINT geometry of the starting vertex." +msgstr "起始顶点的 POINT 几何图形。" -msgid "If there is a vertices table already built using the ``pgr_extractVertices``" -msgstr "若已使用 ``pgr_extractVertices`` 构建顶点表" +msgid "POINT geometry of the ending vertex." +msgstr "结束顶点POINT的几何图形。" -msgid ":doc:`pgr_extractVertices`" -msgstr ":doc:`pgr_extractVertices`" +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgstr "此内部查询优先于下一个内部查询，因此当出现 ``startpoint`` 和 ``endpoint`` 列时，其他列将被忽略。" -msgid "``pgr_depthFirstSearch`` - Proposed" -msgstr "``pgr_depthFirstSearch`` - 提议中" +msgid "When identifiers of vertices are known" +msgstr "当顶点的标识符已知时" -msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." -msgstr "``pgr_depthFirstSearch`` — 返回图的深度优先搜索遍历。 该图可以是有向图或无向图。" +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgstr "要使用此内部查询，列 ``geom`` 、 ``startpoint`` 和 ``endpoint`` 不应成为列集的一部分。" -msgid "Version 3.3.0" -msgstr "版本 3.3.0" +msgid "``NULL`` When the ``id`` is not part of the inner query" +msgstr "``NULL`` 当 ``id`` 不是内部查询的一部分时" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." -msgstr "深度优先搜索算法是一种遍历算法，从根顶点开始，尽可能深入探索，一旦到达一个没有相邻顶点或所有相邻顶点都已访问的顶点，就会回溯。遍历会一直持续，直到从根顶点可达的所有顶点都被访问。" +msgid "X value of the point geometry" +msgstr "点几何的X值" -msgid "The implementation works for both **directed** and **undirected** graphs." -msgstr "该实现适用于 **有向** 图和 **无向** 图。" +msgid "``NULL`` When no geometry is provided" +msgstr "``NULL`` 当没有提供几何图形时" -msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." -msgstr "提供从根顶点或一组根顶点开始的深度优先搜索遍历顺序。" +msgid "Geometry of the point" +msgstr "点几何" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." -msgstr "可选的非负最大深度参数，用于限制结果的深度到特定的深度。" +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgstr "要获取用于生成顶点信息的查询，请使用 ``dryrun := true`` 。" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." -msgstr "为了优化的目的，`Root vids` 中的任何重复值都会被忽略。" +msgid "Create a routing topology" +msgstr "创建路由拓扑" -msgid "It does not produce the shortest path from a root vertex to a target vertex." -msgstr "它不会生成从根顶点到目标顶点的最短路径。" +msgid "Make sure the database does not have the ``vertices_table``" +msgstr "确保数据库没有 ``vertices_table``" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." -msgstr "不保证遍历的总成本最小。" +msgid "Clean up the columns of the routing topology to be created" +msgstr "清理要创建的路由拓扑的列" -msgid "The returned values are ordered in ascending order of `start_vid`." -msgstr "返回值按 `start_vid` 升序排列。" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgstr "当 ``LINESTRING`` 具有 SRID 时，请使用 ``geom::geometry(POINT, )``" -msgid "Depth First Search Running time: :math:`O(E + V)`" -msgstr "深度优先搜索运行时间： :math:`O(E + V)`" +msgid "For big edge tables that are been prepared," +msgstr "对于已经准备好的大型边表，" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "Create it as ``UNLOGGED`` and" +msgstr "将其创建为 ``UNLOGGED`` 并" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" +msgstr "创建表后，执行 ``ALTER TABLE .. SET LOGGED`` 操作" -msgid "**options:** ``[directed, max_depth]``" -msgstr "**options:** ``[directed, max_depth]``" +msgid "Inspect the vertices table" +msgstr "检查顶点表" -msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." -msgstr "与 `单个顶点`_ 相同，但边按 ``id`` 降序排列。" +msgid "Create the routing topology on the edge table" +msgstr "在边表上创建路由拓扑" -msgid "`Boost: Depth First Search `__" -msgstr "`Boost: 深度优先搜索 `__" +msgid "Updating the ``source`` information" +msgstr "更新 ``source`` 信息" -msgid "`Boost: Undirected DFS `__" -msgstr "`Boost: 非定向 DFS `__" +msgid "Updating the ``target`` information" +msgstr "更新 ``target`` 信息" -msgid "`Wikipedia: Depth First Search algorithm `__" -msgstr "`维基百科：深度优先搜索算法 `__" +msgid "Inspect the routing topology" +msgstr "检查路由拓扑" -msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." -msgstr "``pgr_dijkstra`` - 使用 Dijkstra 算法计算的最短路径。" +msgid "**Generated topology**" +msgstr "**生成拓扑**" -msgid "Version 3.5.0" -msgstr "版本 3.5.0" +msgid "``pgr_findCloseEdges``" +msgstr "``pgr_findCloseEdges``" -msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "pgr_dijkstra(One to One) 增加了 ``start_vid`` 和 ``end_vid`` 列。" +msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." +msgstr "``pgr_findCloseEdges`` - 查找点几何图形的闭合边。" -msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." -msgstr "pgr_dijkstra(One to Many) 添加了 ``end_vid`` 列。" +msgid "``partial`` option is removed." +msgstr "``partial`` 选项已被移除。" -msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." -msgstr "pgr_dijkstra(Many to One) 添加了 ``start_vid`` 列。" +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgstr "``pgr_findCloseEdges`` - 一个用于查找距离点状geometry最近边的工具函数。" -msgid "Version 3.1.0" -msgstr "版本 3.1.0" +msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgstr "几何图形必须位于同一坐标系中（具有相同的 SRID）。" -msgid "pgr_dijkstra(Combinations)" -msgstr "pgr_dijkstra(Combinations)" +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgstr "可以获取计算代码，以便根据应用需要进行进一步的具体调整。" -msgid "Version 2.2.0" -msgstr "版本 2.2.0" +msgid "``EMPTY SET`` is returned on dryrun executions" +msgstr "空结果集 ``EMPTY SET`` 会在试运行中返回" -msgid "pgr_dijkstra(One to Many)" -msgstr "pgr_dijkstra(One to Many)" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgid "pgr_dijkstra(Many to One)" -msgstr "pgr_dijkstra(Many to One)" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgid "pgr_dijkstra(Many to Many)" -msgstr "pgr_dijkstra(Many to Many)" +msgid "**options:** ``[cap, dryrun]``" +msgstr "**options:** ``[cap, dryrun]``" -msgid "Signature change on pgr_dijkstra(One to One)" -msgstr "pgr_dijkstra(One to One) 函数签名变更" +msgid "Returns set of |result-find|" +msgstr "返回集合 |result-find|" -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "One point" +msgstr "一个点" -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgstr "用 :math:`pid = 5` 获取两条与兴趣点接近的边" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "``cap => 2``" +msgstr "``cap => 2``" -msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Many points" +msgstr "多点" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" -msgstr "在 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" +msgid "For each points of interests, find the closest edge." +msgstr "为每个兴趣点找出最近的边。" -msgid "The examples of this section are based on the :doc:`sampledata` network." -msgstr "本节的示例基于 :doc:`sampledata` 网络。" +msgid "**point**" +msgstr "**point**" -msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **有向** 图" +msgid "The point geometry" +msgstr "点几何" -msgid "Directed graph with cost and reverse cost columns" -msgstr "带成本列和反向成本列的有向图" +msgid "**points**" +msgstr "**points**" -msgid "1) Path from :math:`6` to :math:`10`" -msgstr "1) 从 :math:`6` 到 :math:`10` 的路径" +msgid "``POINT[]``" +msgstr "``POINT[]``" -msgid "2) Path from :math:`6` to :math:`7`" -msgstr "2) 从 :math:`6` 到 :math:`7` 的路径" +msgid "An array of point geometries" +msgstr "点几何数组" -msgid "3) Path from :math:`12` to :math:`10`" -msgstr "3) 从 :math:`12` 到 :math:`10` 的路径" +msgid "**tolerance**" +msgstr "**tolerance**" -msgid "4) Path from :math:`12` to :math:`7`" -msgstr "4) 从 :math:`12` 到 :math:`7` 的路径" +msgid "Max distance between geometries" +msgstr "几何图形之间的最大距离" -msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" -msgstr "5) 使用 `One to Many`_ 来获取示例1和示例2的解决方案" +msgid "Limit output rows" +msgstr "限制输出行数" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" -msgstr "路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" +msgid "When ``false`` calculations are performed." +msgstr "当为 ``false`` 时，执行计算。" -msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" -msgstr "6) 使用 `Many to One`_ 来获取示例2和示例4的解决方案" +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgstr "当为 ``true`` 时，不执行计算，并在 PostgreSQL 的 ``NOTICE`` 中显示执行计算的查询。" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" -msgstr "路径 :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" +msgid "``geometry``" +msgstr "``geometry``" -msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" -msgstr "7) 使用 `Many to Many`_ 来获取示例1到4的解决方案" +msgid "The ``LINESTRING`` geometry of the edge." +msgstr "边的 ``LINESTRING`` 几何。" -msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" -msgstr "路径 :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" +msgid "When :math:`cap = 1`, it is the closest edge." +msgstr "当 :math:`cap = 1` 时，它是最近的边。" -msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" -msgstr "8) 使用 `组合`_ 来获取示例1到3的解决方案" +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgstr "以 <0,1> 范围内的值，表示相对于边线第一个端点的相对位置。" -msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgstr "路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Value in ``[r, l]`` indicating if the point is:" +msgstr "``[r, l]`` 中的值指示该点是否为：" -msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **无向** 图" +msgid "At the right ``r`` of the segment." +msgstr "位于线段右侧 ``r`` 。" -msgid "Undirected graph with cost and reverse cost columns" -msgstr "带成本列和反向成本列的无向图" +msgid "When the point is on the line it is considered to be on the right." +msgstr "当点在直线上时，它被认为是在右边。" -msgid "9) Path from :math:`6` to :math:`10`" -msgstr "9)从 :math:`6` 到 :math:`10` 的路径" +msgid "At the left ``l`` of the segment." +msgstr "位于线段左侧 ``l`` 。" -msgid "10) Path from :math:`6` to :math:`7`" -msgstr "10) 从 :math:`6` 到 :math:`7` 的路径" +msgid "``distance``" +msgstr "``distance``" -msgid "11) Path from :math:`12` to :math:`10`" -msgstr "11)从 :math:`12` 到 :math:`10` 的路径" +msgid "Distance from the point to the edge." +msgstr "点到边线的距离。" -msgid "12) Path from :math:`12` to :math:`7`" -msgstr "12)从 :math:`12` 到 :math:`7` 的路径" +msgid "Original ``POINT`` geometry." +msgstr "原始的 ``POINT`` 几何形状。" -msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" -msgstr "13) 使用 `One to Many`_ 来获取示例9和10的解决方案" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgstr "连接原始 **point** 和具有标识符 ``edge_id`` 的边的最近点的 ``LINESTRING`` 几何体" -msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" -msgstr "14) 使用 `Many to One`_ 来获取示例10和12的解决方案" +msgid "One point in an edge" +msgstr "边线上的一个点" -msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" -msgstr "15) 使用 `Many to Many`_ 来获取示例9到12的解决方案" +msgid "The green node is the original point." +msgstr "绿色节点为原始点。" -msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" -msgstr "16) 使用 `组合`_ 来获取示例9到11的解决方案" +msgid "``geom`` has the value of the original point." +msgstr "``geom`` 包含原始点的坐标值。" -msgid "For **directed** graphs only with ``cost`` column" -msgstr "仅适用于 **有向** 图，且仅包含 ``cost`` 列" +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgstr "几何图形 ``edge`` 是连接原始点与边线 :math:`sp \\rightarrow ep` 的线段。" -msgid "Directed graph only with cost column" -msgstr "仅有成本列的有向图" +msgid "The point is located at the left of the edge." +msgstr "该点位于边线的左侧。" -msgid "17) Path from :math:`6` to :math:`10`" -msgstr "17)从 :math:`6` 到 :math:`10` 的路径" +msgid "One point dry run execution" +msgstr "单点模拟执行" -msgid "18) Path from :math:`6` to :math:`7`" -msgstr "18) 从 :math:`6` 到 :math:`7` 的路径" +msgid "Using the query from the previous example:" +msgstr "使用上一个示例中的查询：" -msgid "19) Path from :math:`12` to :math:`10`" -msgstr "19)从 :math:`12` 到 :math:`10` 的路径" +msgid "Returns ``EMPTY SET``." +msgstr "返回 ``EMPTY SET`` 。" -msgid "20) Path from :math:`12` to :math:`7`" -msgstr "20) 从 :math:`12` 到 :math:`7` 的路径" +msgid "``dryrun => true``" +msgstr "``dryrun => true``" -msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" -msgstr "21) 使用 `One to Many`_ 来获取示例17和18的解决方案" +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." +msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE`` 。" -msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" -msgstr "22) 使用 `Many to One`_ 来获取示例18和20的解决方案" +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." +msgstr "生成的代码可用作满足其他要求（如考虑 SRID）的起始基础代码。" -msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" -msgstr "23) 使用 `Many to Many`_ 来获取示例17到20的解决方案" +msgid "Many points in an edge" +msgstr "一条边上有许多点" -msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" -msgstr "24) 使用 `组合`_ 来获取示例17到19的解决方案" +msgid "The green nodes are the **original points**" +msgstr "绿色节点为 **原始点**" -msgid "For **undirected** graphs only with ``cost`` column" -msgstr "仅适用于带有 ``cost`` 列的 **无向** 图" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgstr "标为 **g1** 和 **g2** 的几何体 ``geom`` 是 **原始点**" -msgid "Undirected graph only with cost column" -msgstr "仅有成本列的无向图" +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgstr "标为 **edge1** 和 **edge2** 的几何图形 ``edge`` 是一条连接 ** 原始点** 和 :math:`sp \\rightarrow ep` 边上最近点的线。" -msgid "25) Path from :math:`6` to :math:`10`" -msgstr "25) 从 :math:`6` 到 :math:`10` 的路径" +msgid "Many points dry run execution" +msgstr "多点模拟执行" -msgid "26) Path from :math:`6` to :math:`7`" -msgstr "26) 从 :math:`6` 到 :math:`7` 的路径" +msgid "Do not process query" +msgstr "不处理查询" -msgid "27) Path from :math:`12` to :math:`10`" -msgstr "27)从 :math:`12` 到 :math:`10` 的路径" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE``" -msgid "28) Path from :math:`12` to :math:`7`" -msgstr "28) 从 :math:`12` 到 :math:`7` 的路径" +msgid "Find at most two routes to a given point" +msgstr "最多找到两条到达给定点的路线" -msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" -msgstr "29) 使用 `One to Many`_ 来获取示例25和26的解决方案" +msgid "Using :doc:`pgr_withPoints`" +msgstr "使用 :doc:`pgr_withPoints`" -msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" -msgstr "30) 使用 `Many to One`_ 来获取示例26和28的解决方案" +msgid "A point of interest table" +msgstr "兴趣点表" -msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" -msgstr "31) 使用 `Many to Many`_ 来获取示例25到28的解决方案" +msgid "Handling points outside the graph." +msgstr "处理图外的点。" -msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" -msgstr "32) 使用 `组合`_ 来获取示例25到27的解决方案" +msgid "Points of interest" +msgstr "兴趣点" -msgid "Equvalences between signatures" -msgstr "签名之间的等价性" +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgstr "有时应用程序会“即时执行”，从不是图中顶点的位置开始。在pgRouting中，这些位置被称为兴趣点。" -msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" -msgstr "下面的示例可以找到 :math:`\\{6}\\rightarrow\\{10\\}` 的路径" +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." +msgstr "兴趣点所需的信息包括 ``pid``, ``edge_id``, ``side``, ``fraction`` 。" -msgid "33) Using `One to One`_" -msgstr "33) 使用 `One to One`_" +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgstr "在这份文档中，将有6个固定的兴趣点，并且它们将被存储在一个表中。" -msgid "34) Using `One to Many`_" -msgstr "34)使用 `One to Many`_" +msgid "A unique identifier." +msgstr "唯一标识符。" -msgid "35) Using `Many to One`_" -msgstr "35) 使用 `Many to One`_" +msgid "Identifier of the nearest segment." +msgstr "最近边线的标识符。" -msgid "36) Using `Many to Many`_" -msgstr "36) 使用 `Many to Many`_" +msgid "Is it on the left, right or both sides of the segment ``edge_id``." +msgstr "位于边线 ``edge_id`` 的左侧、右侧还是两侧。" -msgid "37) Using `Combinations`_" -msgstr "37) 使用 `组合`_" +msgid "Where in the segment is the point located." +msgstr "该点位于边的哪个位置。" -msgid "`Boost: Dijkstra shortest paths `__" -msgstr "`Boost: Dijkstra最短路径Dijkstra 最短路径 `__" +msgid "The geometry of the points." +msgstr "点的几何形状。" -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +msgid "The distance between ``geom`` and the segment ``edge_id``." +msgstr "``geom`` 与边线 ``edge_id`` 之间的距离。" -msgid "``pgr_dijkstraCost``" -msgstr "``pgr_dijkstraCost``" +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." +msgstr "一个连接点的 ``geom`` 到边 ``edge_id`` 上最近点的线段。" -msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." -msgstr "`pgr_dijkstraCost`` - 使用 Dijkstra 算法计算最短路径的总成本。" +msgid "``newPoint``" +msgstr "``newPoint``" -msgid "pgr_dijkstraCost(Combinations)" -msgstr "pgr_dijkstraCost(Combinations)" +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgstr "边 ``edge_id`` 上距离 ``geom`` 最近的一个点。" -msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." -msgstr "``pgr_dijkstraCost`` 使用 Dijkstra 算法计算出的最短路径的代价。" +msgid "Points of interest fill up" +msgstr "兴趣点填充" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Inserting the points of interest." +msgstr "插入兴趣点。" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Filling the rest of the table." +msgstr "填充表格的其余部分。" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." +msgstr "任何其他额外的修改：在本手册中，可从两侧到达点 :math:`6`。" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "The points of interest:" +msgstr "兴趣点：" -msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "``pgr_floydWarshall``" +msgstr "``pgr_floydWarshall``" -msgid "``pgr_dijkstraCostMatrix``" -msgstr "``pgr_dijkstraCostMatrix``" +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgstr "``pgr_floydWarshall`` - 使用 Floyd-Warshall 算法返回图中每对节点的最短路径成本之和。" -msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." -msgstr "``pgr_dijkstraCostMatrix`` - 使用 :doc:`pgr_dijkstra` 计算成本矩阵。" +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgstr "Floyd-Warshall算法，也被称为 Floyd算法，是计算图中每一对节点间最短路径的路径成本总和的一种良好选择，适用于*密集图*。我们使用Boost的实现，其运行时间为： :math:`\\Theta(V^3)`，" -msgid "Using Dijkstra algorithm, calculate and return a cost matrix." -msgstr "使用 Dijkstra 算法，计算并返回成本矩阵。" +msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgstr "pgr_floydWarshall(`Edges SQL`_, [``directed``])" -msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图。" -msgid "``pgr_dijkstraNear``" -msgstr "``pgr_dijkstraNear``" +#, fuzzy +msgid "Boost `Floyd-Warshall `_" +msgstr "Boost `弗洛伊德-沃沙尔算法 `_" -msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." -msgstr "``pgr_dijkstraNear`` - 使用 Dijkstra 算法，找到通往最近顶点的路径。" +msgid "``pgr_full_version``" +msgstr "``pgr_full_version``" -msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." -msgstr "给定一个图、一个起始顶点和一组终止顶点，该函数会找出从起始顶点到最近的终止顶点的最短路径。" +msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgstr "``pgr_full_version`` — 获取pgRouting版本信息的详细信息。" -msgid "Uses Dijkstra algorithm." -msgstr "使用 Dijkstra 算法。" +msgid "Get complete details of pgRouting version information" +msgstr "获取 pgRouting 版本信息的完整详细信息" -msgid "Works for **directed** and **undirected** graphs." -msgstr "适用于 **有向** 和 **无向** 图。" +msgid "pgr_full_version()" +msgstr "pgr_full_version()" -msgid "When there are more than one path to the same vertex with same cost:" -msgstr "当有多条路径通向同一顶点且成本相同时：" +msgid "RETURNS |result-version|" +msgstr "RETURNS |result-version|" -msgid "The algorithm will return just one path" -msgstr "算法将只返回一条路径" +msgid "Information about when this documentation was built" +msgstr "有关此文档何时构建的信息" -msgid "Optionally allows to find more than one path." -msgstr "可选择查找多条路径。" +msgid "``version``" +msgstr "``version``" -msgid "When more than one path is to be returned:" -msgstr "当需要返回多条路径时：" +msgid "pgRouting version" +msgstr "pgRouting 版本" -msgid "Results are sorted in increasing order of:" -msgstr "结果按以下顺序递增排序：" +msgid "``build_type``" +msgstr "``build_type``" -msgid "aggregate cost" -msgstr "总成本" +msgid "The Build type" +msgstr "构建类型" -msgid "Within the same value of aggregate costs:" -msgstr "在总成本相同值范围内：" +msgid "``compile_date``" +msgstr "``compile_date``" -msgid "results are sorted by (source, target)" -msgstr "结果按 (source, target)排序" +msgid "Compilation date" +msgstr "编译日期" -msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" -msgstr "运行时间：Dijkstra 运行时间： :math:`drt = O((|E| + |V|)log|V|)`" +msgid "``library``" +msgstr "``library``" -msgid "One to Many; :math:`drt`" -msgstr "一对多； :math:`drt`" +msgid "Library name and version" +msgstr "库名称和版本" -msgid "Many to One: :math:`drt`" -msgstr "Many to One: :math:`drt`" +msgid "``system``" +msgstr "``system``" -msgid "Many to Many: :math:`drt * |Starting vids|`" -msgstr "Many to Many: :math:`drt * |Starting vids|`" +msgid "Operative system" +msgstr "操作系统" -msgid "Combinations: :math:`drt * |Starting vids|`" -msgstr "组合： :math:`drt * |Starting vids|`" +msgid "``postgreSQL``" +msgstr "``postgreSQL``" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "pgsql used" +msgstr "使用pgsql" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "``compiler``" +msgstr "``compiler``" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "Compiler and version" +msgstr "编译器和版本" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "``boost``" +msgstr "``boost``" -msgid "**options A:** ``[directed, cap]``" -msgstr "**options A:** ``[directed, cap]``" +msgid "Boost version" +msgstr "Boost 版本" -msgid "**options B:** ``[directed, cap, global]``" -msgstr "**options B:** ``[directed, cap, global]``" +msgid "``hash``" +msgstr "``hash``" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Git hash of pgRouting build" +msgstr "pgRouting 构建的 Git 哈希" -msgid "**options:** ``[directed, cap]``" -msgstr "**options:** ``[directed, cap]``" +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr "``pgr_hawickCircuits`` - 实验性" -msgid "Departing on car from vertex :math:`6` find the nearest subway station." -msgstr "从顶点 :math:`6` 乘车出发，找到最近的地铁站。" +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgstr "``pgr_hawickCircuits`` — 使用 Hawick 电路算法返回电路列表。" -msgid "Using a **directed** graph for car routing." -msgstr "使用 **有向** 图进行汽车路线规划。" +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgstr "Hawick Circuit 算法由 Ken Hawick 和 Health A. James 于 2008 年发表。 该算法解决了图中电路的检测和枚举问题。 它能够在具有有向弧、多弧和自弧的图中进行电路枚举，并具有内存高效和高性能的实现。 它是寻找有向图所有基本电路的约翰逊算法的扩展。" -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" -msgstr "地铁站位于以下顶点上 :math:`\\{1, 10, 11\\}`" +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgstr "Boost Graph Library 中定义了 2 个变体。 在这里，我们只实现了第二个，因为它服务于最合适和最实用的用例。 在这个变体中，我们在过滤掉由平行边缘引起的电路后得到电路。 当您想要计算数量时，并行边缘电路有更多用例。 也许将来我们也会实现这种变化。" -msgid "The defaults used:" -msgstr "使用的默认值：" +msgid "The algorithm implementation works only for directed graph" +msgstr "该算法实现仅适用于有向图" -msgid "`directed => true`" -msgstr "`directed => true`" +msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgstr "这是对于电路枚举的一种格式，基于Johnson的算法。" -msgid "`cap => 1`" -msgstr "`cap => 1`" +msgid "The algorithm outputs the distinct circuits present in the graph." +msgstr "该算法输出图中存在的不同电路。" -msgid "The result shows that station at vertex :math:`11` is the nearest." -msgstr "结果显示，位于顶点 :math:`11` 的站最近。" +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgstr "时间复杂度： :math:`O((V + E) (c + 1))`" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid ":math:`|c|` is the number of circuits in the graph." +msgstr ":math:`|c|` 是图中电路的数目。" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" -msgstr "从地铁站开车出发，找到距离顶点 :math:`2` 最近的 **两个** 车站" +msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgstr "pgr_hawickCircuits(`Edges SQL`_)" -msgid "On line `4`: using the positional parameter: `directed` set to ``true``" -msgstr "第 `4` 行：使用位置参数： `directed` 设置为 ``true``" +msgid "Circuits present in the pgRouting :doc:`sampledata`" +msgstr "pgRouting :doc:`sampledata` 中存在的电路" -msgid "In line `5`: using named parameter `cap => 2`" -msgstr "第 `5` 行：使用命名参数 `cap => 2`" +msgid "Id of the circuit starting from ``1``" +msgstr "电路id从 ``1`` 开始" -msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." -msgstr "结果显示，位于顶点 :math:`10` 的站点最近，其次是 :math:`11`。" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgstr "在路径中的相对位置。数值 ``0`` 表示路径的起点" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Identifier of the starting vertex of the circuit." +msgstr "电路起始顶点的标识符。" -msgid "**options:** ``[directed, cap, global]``" -msgstr "**options:** ``[directed, cap, global]``" +msgid "Identifier of the ending vertex of the circuit." +msgstr "电路结束顶点的标识符。" -msgid "Find the best pedestrian connection between two lines of buses" -msgstr "在两条公交线路之间寻找最佳的行人通道" +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "从 vid 到下一个 vid 的路径中节点的标识符。" -msgid "Using an **undirected** graph for pedestrian routing" -msgstr "采用**非定向**图进行行人路径规划" +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost：Hawick 电路算法 `__" -msgid "The first subway line stations are at :math:`\\{15, 16\\}`" -msgstr "第一条地铁线的站点位于 :math:`\\{15, 16\\}`" +msgid "``pgr_isPlanar`` - Experimental" +msgstr "``pgr_isPlanar`` - 实验性" -msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "地铁二号线的站点是 :math:`\\{1, 10, 11\\}`" +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgstr "``pgr_isPlanar`` — 根据图的平面性返回布尔值。" -msgid "On line `4`: using the named parameter: `directed => false`" -msgstr "第 `4` 行：使用命名参数：`directed => false`" +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgstr "如果一个图可以在二维空间中绘制，使得它的任意两条边都不相交，那么这个图就是平面图。这种平面图的绘制称为平面绘图。每个平面图也可以表示为一个直线绘图，即在平面绘图中，每条边都由一条线段表示。当一个图包含 :math:`K_5` 或 :math:`K_{3, 3}` 作为子图时，这个图就不是平面图。" -msgid "`global => true`" -msgstr "`global => true`" +msgid "This implementation use the Boyer-Myrvold Planarity Testing." +msgstr "此实施使用 Boyer-Myrvold 平面度测试。" -msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." -msgstr "对于行人来说，上下车的最佳连接点是第一条地铁线的顶点 :math:`15` 和第二条地铁线的顶点 :math:`10`。" +msgid "It will return a boolean value depending upon the planarity of the graph." +msgstr "它将根据图形的平面性返回一个布尔值。" -msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" -msgstr "只返回 `一条` 路由，因为 `global` 为 ``true`` 且 `cap` 为 ``1``" +msgid "Applicable only for **undirected** graphs." +msgstr "仅适用于 **无向** 图。" -msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "The algorithm does not considers traversal costs in the calculations." +msgstr "该算法在计算中不考虑遍历成本。" -msgid "Find the best car connection between all the stations of two subway lines" -msgstr "查找两条地铁线所有站点之间的最佳汽车连接线路" +msgid "Running time: :math:`O(|V|)`" +msgstr "运行时间： :math:`O(|V|)`" -msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "第一条地铁线的站点是 :math:`\\{1, 10, 11\\}`" +msgid "pgr_isPlanar(`Edges SQL`)" +msgstr "pgr_isPlanar(`Edges SQL`)" -msgid "The second subway line stations are at :math:`\\{15, 16\\}`" -msgstr "地铁二号线站点位于 :math:`\\{15, 16\\}`" +msgid "RETURNS ``BOOLEAN``" +msgstr "返回 ``BOOLEAN``" -msgid "The combinations contents:" -msgstr "组合内容：" +msgid "Returns a boolean ``(pgr_isplanar)``" +msgstr "返回一个布尔值 ``(pgr_isplanar)``" -msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" -msgstr "行 `3~4` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第二条地铁线上的顶点" +msgid "``pgr_isplanar``" +msgstr "``pgr_isplanar``" -msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" -msgstr "行 `6~7` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第一条地铁线上的顶点" +msgid "`true` when the graph is planar." +msgstr "当图形是平面时为 `true`。" -msgid "On line `8`: using the named parameter is `global => false`" -msgstr "第 `8` 行：使用名为 `global => false` 的参数" +msgid "`false` when the graph is not planar." +msgstr "当图形不是平面时为 `false`。" -msgid "From the results:" -msgstr "从结果来看：" +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgstr "以下边将构成具有顶点 {10, 15, 11, 16, 13} 的子图，这个子图是一个 :math:`K_1` 图。" -msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" -msgstr "将第一条地铁线 :math:`{1, 10, 11\\}` 连接到第二条地铁线 :math:`{15, 16\\}`：" +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgstr "新图不是平面图，因为它具有一个 :math:`K_5` 子图。蓝色的边代表 :math:`K_5` 子图。" -msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgstr "从第一条线路的所有站点出发的最佳连接是： :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "`Boost: Boyer Myrvold `__" +msgstr "`Boost: Boyer-Myrvold 算法 `__" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" -msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` （行：`11` 和`12`）" +msgid "``pgr_johnson``" +msgstr "``pgr_johnson``" -msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" -msgstr "将第二条地铁线 :math:`{15, 16\\}` 连接到第一条地铁线 :math:`{1, 10, 11\\}`：" +#, fuzzy +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgstr "``pgr_johnson`` - 使用 Jhonson 算法返回图中每对节点的最短路径成本之和。" -msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgstr "从二号线所有站点出发的最佳连接是： :math:`{(15 ／rightarrow 10) (16 ／rightarrow 11)}`" +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgstr "Johnson 算法是计算图中每对节点的最短路径总成本的一个良好选择，特别适用于*稀疏图*。它使用 Boost 实现，运行时间为 :math:`O(V E \\log V)` ，" -msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" -msgstr "由于成本相同，两者同样好。(行：`13` 和 `14` ，行：`15` 和 `16`)" +msgid "pgr johnson(`Edges SQL`_, [``directed``])" +msgstr "pgr johnson(`Edges SQL`_, [``directed``])" -msgid "Dijkstra optional parameters" -msgstr "Dijkstra 可选参数" +msgid "Boost `Johnson `_" +msgstr "Boost `Johnson 算法 `_" -msgid "Near optional parameters" -msgstr "接近可选参数" +#, fuzzy +msgid "``pgr_kingOrdering`` - Experimental" +msgstr "``pgr_edgeColoring`` - 实验性" -msgid "``cap``" -msgstr "``cap``" +#, fuzzy +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" -msgid "Find at most ``cap`` number of nearest shortest paths" -msgstr "查找最多 ``cap`` 条最近的最短路径" +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." +msgstr "" -msgid "``global``" -msgstr "``global``" +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." +msgstr "" -msgid "When ``true``: only ``cap`` limit results will be returned" -msgstr "``true`` 时：仅返回 ``cap`` 结果" +#, fuzzy +msgid "The implementation targets undirected graphs." +msgstr "该实现适用于 **无向** 图。" -msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" -msgstr "当 ``false`` 时：将返回每个 ``Start vid`` 的 ``cap`` 限值" +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." +msgstr "" -msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" -msgstr "维基百科：https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" +#, fuzzy +msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" +msgstr "运行时间复杂度为： :math:`O(m log(m)|V|)`" -msgid "``pgr_dijkstraNearCost``" -msgstr "``pgr_dijkstraNearCost``" +#, fuzzy +msgid "where :math:`|E|` is the number of edges," +msgstr "其中 :math:`|V|` 是顶点数，" -msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." -msgstr "`pgr_dijkstraNearCost`` - 使用 dijkstra 算法，找到通往最近顶点的路径。" +#, fuzzy +msgid ":math:`m` is the maximum degree among all vertices." +msgstr ":math:`m` 是图中顶点的最大度数。" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +#, fuzzy +msgid "pgr_kingOrdering(`Edges SQL`_)" +msgstr "pgr_edgeColoring(`Edges SQL`_)" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +#, fuzzy +msgid "`Boost: King Ordering `__" +msgstr "`Boost: 边着色 `__" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "``pgr_kruskal``" +msgstr "``pgr_kruskal``" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgstr "``pgr_kruskal`` — 使用 Kruskal 算法的图的最小生成树。" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgstr "该算法使用 Kruskal 算法在可能断开的图中找到最小生成森林。" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "EMPTY SET is returned when there are no edges in the graph." +msgstr "当图中没有边时，返回 EMPTY SET。" -msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" -msgstr "从地铁站开车出发找到距离顶点 :math:`6` 最近的 **两个** 车站" +msgid "pgr_kruskal(`Edges SQL`_)" +msgstr "pgr_kruskal(`Edges SQL`_)" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "Returns set of |result-mst|" +msgstr "返回 |result-mst| 的集合" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "Minimum spanning forest" +msgstr "最小生成森林" -msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" -msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` (lines: `1`)" +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgstr "``pgr_kruskalBFS`` — Kruskal 的最小生成树算法，具有广度优先搜索排序。" -msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" -msgstr "由于成本相同，两者同样好。(行：`12` and `13`)" +msgid "Added ``pred`` result columns." +msgstr "添加了 ``pred`` 结果列。" -msgid "``pgr_dijkstraVia``" -msgstr "``pgr_dijkstraVia``" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "访问并提取使用 Kruskal 算法创建的最小生成树的呼吸优先搜索排序中的节点信息。" -msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." -msgstr "``pgr_dijkstraVia`` - 经过顶点列表的路径。" +msgid "Returned tree nodes from a root vertex are on Breath First Search order" +msgstr "从根顶点返回的树节点遵循广度优先搜索顺序" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." -msgstr "给定一个顶点列表和一个图，该函数等价于为所有 :math:`i < size\\_of(via\\;vertices)`的 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间找到最短路径。" +msgid "Breath First Search Running time: :math:`O(E + V)`" +msgstr "广度优先搜索运行时间： :math:`O(E + V)`" -msgid "Route" -msgstr "路线" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgid "is a sequence of paths." -msgstr "是一个路径序列。" +msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgid "Path" -msgstr "路径" +msgid "The Minimum Spanning Tree having as root vertex :math:`6`" +msgstr "以根顶点为 :math:`6` 的最小生成树" -msgid "is a section of the route." -msgstr "是路线的一段。" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgstr "以顶点 :math:`\\{9, 6\\}` 为起点， :math:`depth \\leq 3` 的最小生成树" -msgid "One Via" -msgstr "一次通过" +msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." +msgstr "``pgr_kruskalDD`` — 使用 Kruskal 算法的汇流节点。" -msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" -msgstr "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgstr "使用 Kruskal 算法，在计算的最小生成树中提取总成本小于或等于距 **根** 顶点（或多个顶点） **距离** 的节点。" -msgid "**options:** ``[directed, strict, U_turn_on_edge]``" -msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" +msgid "Returned tree nodes from a root vertex are on Depth First Search order." +msgstr "从根顶点返回的树节点遵循深度优先搜索顺序。" -msgid "Returns set of |via-result|" -msgstr "返回 |via-result| 的集合" +msgid "Depth First Search running time: :math:`O(E + V)`" +msgstr "深度优先搜索运行时间： :math:`O(E + V)`" -msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." -msgstr "在一个directed graph中，找到按顺序访问顶点 :math:`\\ {5, 1, 8\\}` 的路径。" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" +msgstr "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" -msgid "Via optional parameters" -msgstr "Via可选参数" +msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" +msgstr "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" -msgid "When ``true`` departing from a visited vertex will not try to avoid" -msgstr "为 ``true`` 时，从访问过的顶点出发时不会试图避开" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgstr "以顶点 :math:`6` 为起点的，总成本小于或等于 :math:`distance \\leq 3.5` 的最小生成树" -msgid "Identifier of a path. Has value **1** for the first path." -msgstr "路径的标识符。 第一条路径的值为 **1**。" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgstr "以顶点 :math:`\\{9, 6\\}` 为起点， :math:`distance \\leq 3.5` 的最小生成树" -msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." -msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。" +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_kruskalDFS`` — 具有深度优先搜索排序的最小生成树 Kruskal 算法。" -msgid "-1 for the last node of the path." -msgstr "-1，表示路径的最后一个节点。" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "访问并提取使用 Kruskal 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" -msgid "-2 for the last node of the route." -msgstr "路由的最后一个节点为 -2。" +msgid "Returned tree nodes from a root vertex are on Depth First Search order" +msgstr "从根顶点返回的树节点按深度优先搜索顺序" -msgid "``route_agg_cost``" -msgstr "``route_agg_cost``" +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." -msgstr "从 ``seq = 1`` 的 ``start_vid`` 到当前 ``seq`` 的 ``end_vid`` 的总费用。" +msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." -msgstr "所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}` 的路径。" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "``pgr_lengauerTarjanDominatorTree`` - 实验性" -msgid "The main query" -msgstr "主查询" +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgstr "``pgr_lengauerTarjanDominatorTree`` — 返回所有顶点的直接支配者。" -msgid "Aggregate cost of the third path." -msgstr "第三条路径的总成本。" +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgstr "该算法计算每个顶点的*immediate dominator*，称为**idom**，一旦计算出每个顶点的**idom**，就可以将每个顶点的**idom**作为其父节点，从而构建支配者树。" -msgid "Route's aggregate cost of the route at the end of the third path." -msgstr "第三条路径末端的路径总成本。" +msgid "The algorithm works in directed graph only." +msgstr "该算法仅适用于有向图。" -msgid "Nodes visited in the route." -msgstr "路由中访问的节点。" +msgid "The algorithm returns *idom* of each vertex." +msgstr "该算法返回每个顶点的* idom*。" -msgid "The aggregate costs of the route when the visited vertices are reached." -msgstr "到达所访问顶点时的路线总成本。" +msgid "If the *root vertex* not present in the graph then it returns empty set." +msgstr "如果图中不存在*根顶点*，则返回空集。" -msgid "Status of \"passes in front\" or \"visits\" of the nodes." -msgstr "节点的 \"前方通过 \"或 \"访问 \"状态。" +msgid "Running time: :math:`O((V+E)log(V+E))`" +msgstr "运行时间： :math:`O((V+E)log(V+E))`" -msgid ":doc:`via-category`." -msgstr ":doc:`via-category`。" +msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" +msgstr "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" -msgid ":doc:`dijkstra-family`." -msgstr ":doc:`dijkstra-family`。" +msgid "Returns set of |result-idom|" +msgstr "返回 |result-idom| 的集合" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." -msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" +msgid "The dominator tree with root vertex :math:`5`" +msgstr "具有根顶点 :math:`5` 的支配树" -msgid "pgr_drivingDistance(Single vertex)" -msgstr "pgr_drivingDistance(Single vertex)" +msgid "SQL query as described above." +msgstr "SQL 查询如上所述。" -msgid "Added ``depth`` and ``start_vid`` result columns." -msgstr "添加了 ``depth`` 和 ``start_vid`` 结果列。" +msgid "**root vertex**" +msgstr "**root vertex**" -msgid "pgr_drivingDistance(Multiple vertices)" -msgstr "pgr_drivingDistance(Multiple vertices)" +msgid "Returns set of ``(seq, vertex_id, idom)``" +msgstr "返回集合 ``(seq, vertex_id, idom)``" -msgid "Result column name change: ``from_v`` to ``start_vid``." -msgstr "结果列名称更改： ``from_v`` 改为 ``start_vid`` 。" +msgid "``vertex_id``" +msgstr "``vertex_id``" -msgid "Added ``depth`` and ``pred`` result columns." -msgstr "添加了 ``depth`` 和``pred`` 结果列。" +msgid "Identifier of vertex ." +msgstr "顶点的标识符。" -msgid "Signature change:" -msgstr "签名变更：" +msgid "``idom``" +msgstr "``idom``" -msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance(单个顶点)" +msgid "Immediate dominator of vertex." +msgstr "顶点的直接支配者。" -msgid "New official signature:" -msgstr "新签名：" +msgid "Dominator tree of another component." +msgstr "另一个组件的支配树。" -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance(多个顶点)" +msgid "`Boost: Lengauer-Tarjan dominator `__" +msgstr "`Boost: Lengauer-Tarjan 支配者算法 `__" -msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." -msgstr "使用 Dijkstra 算法，提取成本小于或等于 ``distance`` 值的所有节点。提取的边将符合相应的生成树。" +msgid "`Wikipedia: dominator tree `__" +msgstr "`维基百科:支配树 `__" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "``pgr_lineGraph`` - Proposed" +msgstr "``pgr_lineGraph`` - 提议中" -msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" -msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgstr "``pgr_lineGraph`` — 将给定图转换为其相应的基于边的图。" -msgid "**options:** [directed, equicost]" -msgstr "**options:** [directed, equicost]" +msgid "Works for directed and undirected graphs." +msgstr "适用于有向和无向图。" -msgid "Single Vertex" -msgstr "单个顶点" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgstr "给定一个图 :math:`G`，其线图 :math:`L(G)` 是一个图，满足以下条件：" -msgid "From vertex :math:`11` for a distance of :math:`3.0`" -msgstr "从顶点 :math:`11` 到 :math:`3.0` 的距离" +msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." +msgstr ":math:`L(G)` 的每个顶点代表 :math:`G` 的一条边。" -msgid "Multiple Vertices" -msgstr "多个顶点" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgstr ":math:`L(G)` 的两个顶点相邻，当且仅当它们对应的边在 :math:`G` 中共享一个共同端点时" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" -msgstr "从顶点 :math:`{11, 16\\}` 出发，距离为 :math:`3.0` 且有向图上的成本相等" +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgstr "结果中的 ``cost`` 和 ``reverse_cost`` 列表示边的存在性。" -msgid "Driving distance optional parameters" -msgstr "行驶距离可选参数" +msgid "When the graph is directed the result is directed." +msgstr "当图形是有向的，结果也是有向的。" -msgid "``equicost``" -msgstr "``equicost``" +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." +msgstr "要获取完整的线图，请在双向边上使用唯一标识符 (See `Additional Examples`_)." -msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." -msgstr "``true`` 时，节点只会出现在最近的 ``start_vid`` 列表中。绑定制动是任意的。" +msgid "When the graph is undirected the result is undirected." +msgstr "当图无向时，成本矩阵是对称的。" -msgid "When ``false`` which resembles several calls using the single vertex signature." -msgstr "``false`` 时，类似于使用单个顶点签名的多次调用。" +msgid "The ``reverse_cost`` is always :math:`-1`." +msgstr "``reverse_cost`` 始终为 :math:`-1` 。" -msgid "end-before" -msgstr "" +msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" +msgstr "pgr_lineGraph(`Edges SQL`_, [``directed``])" -msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" -msgstr "在无向图上，从顶点 :math:`{11, 16\\}` 开始的距离为 :math:`3.0`" +msgid "Returns set of |result-lineg|" +msgstr "返回结果 |result-lineg|" -msgid "``pgr_edgeColoring`` - Experimental" -msgstr "``pgr_edgeColoring`` - 实验性" +msgid "For an undirected graph with edges :math:'{2,4,5,8}'" +msgstr "对于一个undirected graph(无向图)，其边为 :math:'{2,4,5,8}'" -msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" -msgstr "``pgr_edgeColoring`` - 返回无向图和无环图的边着色" +msgid "Gives a local identifier for the edge" +msgstr "给出边的本地标识符" -msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." -msgstr "边着色是一种用于为图形中顶点的边着色的算法。它为图中的边分配颜色，使相邻的两条边没有相同的颜色。" +msgid "When `negative`: the source is the reverse edge in the original graph." +msgstr "为负时：源是原始图中的反向边。" -msgid "The implementation is for **undirected** and **loop-free** graphs" -msgstr "针对 **无向** 和 **无环** 图实施" +msgid "When `negative`: the target is the reverse edge in the original graph." +msgstr "为负时：目标是原始图中的反向边。" -msgid "loop free" -msgstr "无环" +msgid "Weight of the edge (``source``, ``target``)." +msgstr "边 (``source``, ``target``) 的权重。" -msgid "no self-loops and no parallel edges." -msgstr "无自循环，无平行边。" +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." +msgstr "当为负时：边(``source``, ``target``)不存在，因此它不是图的一部分。" -msgid "Provides the color to be assigned to all the edges present in the graph." -msgstr "指定要分配给图中所有边的颜色。" +msgid "Weight of the edge (``target``, ``source``)." +msgstr "边 (``target``, ``source``)的权重。" -msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." -msgstr "最多使用 :math:`\\Delta + 1` 种颜色，其中 :math:`\\Delta` 是图的度数。" +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgstr "当为负时：边(``target``, ``source``)不存在，因此它不是图的一部分。" -msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." -msgstr "这对于某些图是最优的，根据Vizing定理，对于所有其他图，它使用的颜色最多比最优解多一种。" +msgid "Given the following directed graph" +msgstr "给定以下有向图" -msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" -msgstr "色数（chromatic number） :math:`x'(G)`（用于图的适当边着色所需的最小颜色数）等于图的度 :math:`\\Delta + 1`（ :math:`x'(G) = \\Delta`）" +msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" -msgid "The algorithm tries to assign the least possible color to every edge." -msgstr "该算法尝试为每条边分配尽可能少的颜色。" +msgid "Representation as directed with shared edge identifiers" +msgstr "用共享边标识符定向表示" -msgid "Does not always produce optimal coloring." -msgstr "并不总是产生最佳的着色。" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" +msgstr "为了简化数据库中边表的设计，边的标识符采用3位数字表示：" -msgid "The returned rows are ordered in ascending order of the edge identifier." -msgstr "返回的行按边标识符升序排列。" +msgid "hundreds" +msgstr "百位" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" -msgstr "高效图形着色是一个 NP-Hard问题，因此：" +msgid "the source vertex" +msgstr "源点" -msgid "In this implelentation the running time: :math:`O(|E|*|V|)`" -msgstr "在此实现中，运行时间为： :math:`O(|E|*|V||)`" +msgid "tens" +msgstr "十位" -msgid "where :math:`|E|` is the number of edges in the graph," -msgstr "其中 :math:`|E|` 是图中的边数、" +msgid "always 0, acts as a separator" +msgstr "始终为 0，用作分隔符" -msgid ":math:`|V|` is the number of vertices in the graph." -msgstr ":math:`|V|` 是图中的顶点数。" +msgid "units" +msgstr "个位" -msgid "pgr_edgeColoring(`Edges SQL`_)" -msgstr "pgr_edgeColoring(`Edges SQL`_)" +msgid "the target vertex" +msgstr "目标顶点" -msgid "Graph coloring of pgRouting :doc:`sampledata`" -msgstr "pgRouting :doc:`sampledata` 的图形着色" +msgid "In this image," +msgstr "在这张图片中，" -msgid "`Boost: Edge Coloring `__" -msgstr "`Boost: 边着色 `__" +msgid "Single or double head arrows represent one edge (row) on the edges table." +msgstr "单向或双向箭头表示边表中的一条边（行）。" -msgid "`Wikipedia: Graph coloring `__" -msgstr "`维基百科：图着色 `__" +msgid "The numbers in the yellow shadow are the edge identifiers." +msgstr "黄色阴影中的数字是边缘标识符。" -msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." -msgstr "``pgr_edgeDisjointPaths`` - 计算两组顶点之间的边不相交路径。" +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgstr "当使用 ``reverse_cost`` 列时，两个边对会共享相同的标识符。" -msgid "pgr_edgeDisjointPaths(Combinations)" -msgstr "pgr_edgeDisjointPaths(组合)" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgstr "边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` 用一条边行表示，标识符其 :math:`id=203` 。" -msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." -msgstr "计算两组顶点之间的边不相交路径。 利用底层最大流量算法来计算路径。" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgstr "边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` 用一条边的行表示，标识符为 :math:`id=304` 。" -msgid "The main characterics are:" -msgstr "主要特点是：" +msgid "The graph can be created as follows:" +msgstr "图表的创建过程如下：" -msgid "Calculates the edge disjoint paths between any two groups of vertices." -msgstr "计算任意两组顶点之间的边相交路径。" +msgid "Line Graph of a directed graph represented with shared edges" +msgstr "用共享边表示的有向图的线图" -msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." -msgstr "当源和目标相同或无法到达时，返回 EMPTY SET。" +msgid "The result is a directed graph." +msgstr "结果就是一个有向图。" -msgid "The graph can be directed or undirected." -msgstr "图可以是有向或无向的。" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgstr "对于 :math:`seq=4` ，从:math:`203 \\leftrightarrow 304` 表示两条边" -msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." -msgstr "使用 :doc:`pgr_boykovKolmogorov` 计算路径。" +msgid "For all the other values of ``seq`` represent one edge." +msgstr "所有其他的 ``seq`` 值都代表一条边。" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgstr "``cost`` 和 ``reverse_cost`` 的值表示边的存在。" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "When positive: the edge exists." +msgstr "当为正数时：边缘存在。" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "When negative: the edge does not exist." +msgstr "负数时：边缘不存在。" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Representation as directed with unique edge identifiers" +msgstr "作为有向图表示，并使用唯一的边标识符" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Single head arrows represent one edge (row) on the edges table." +msgstr "单头箭头代表边表中的一条边（行）。" -msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." -msgstr "使用组合表，相当于计算无向图上从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`\\{10, 15, 14\\}` 的结果。" +msgid "There are no double head arrows" +msgstr "没有双向头箭" -msgid "Manually assigned vertex combinations on an undirected graph." -msgstr "在无向图上手动分配顶点组合。" +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgstr "两对边共享相同的结束节点，不使用 ``reverse_cost`` 列。" -msgid "``pgr_edmondsKarp``" -msgstr "``pgr_edmondsKarp``" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgstr "边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}`分别用两条边表示，边标识符为 :math:`id=203` 和:math:`id=302` 。" -msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." -msgstr "``pgr_edmondsKarp`` — 使用 Edmonds Karp 算法计算图边上的流量，以最大化从源到目标的流量。" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgstr "边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}`分别用两条边表示，边标识符为 :math:`id=304` 和 :math:`id=403` 。" -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(组合)" +msgid "Line Graph of a directed graph represented with unique edges" +msgstr "用唯一边表示的有向图的线图" -msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" -msgstr "从 ``pgr_maxFlowEdmondsKarp`` 更名而来" +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgstr "对于 :math:`seq=7` 从 :math:`203 \\leftrightarrow 302` 代表两条边。" -msgid "Running time: :math:`O( V * E ^ 2)`" -msgstr "运行时间： :math:`O( V * E ^ 2)`" +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgstr "对于 :math:`seq=8` ，从 :math:`304 \\leftrightarrow 403` 表示两条边。" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgid "wikipedia: `Line Graph `__" +msgstr "维基百科: `Line Graph `__" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgid "mathworld: `Line Graph `__" +msgstr "MathWorld在线数学资源: `Line Graph `__" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgid "``pgr_lineGraphFull`` - Experimental" +msgstr "``pgr_lineGraphFull`` - 实验性" -msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgstr "``pgr_lineGraphFull`` — 将给定图转换为新图，其中原始图的所有顶点都转换为线图。" -msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgid "Version 2.6.0" +msgstr "版本2.6.0" -msgid "`Boost: Edmonds Karp max flow `__" -msgstr "`Boost: Edmonds Karp max flow `__" +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgstr "``pgr_lineGraphFull``, 通过将每个顶点转换为完全图并保留所有原始边，将原始有向图转换为有向线图。 新的连接边的成本为 0，并位于相邻的原始边之间，尊重方向性。" -msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgstr "结果图的一个可能的应用是 **\"具有两个边限制的路由\"**：" -msgid "``pgr_edwardMoore`` - Experimental" -msgstr "``pgr_edwardMoore`` - 实验性" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgstr "设置在连接边上的边之间布线时使用顶点的成本" -msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." -msgstr "`pgr_edwardMoore`` - 使用 Edward-Moore 算法返回最短路径。" +msgid "Forbid the routing between two edges by removing the connecting edge" +msgstr "通过删除连接边来禁止两条边之间的布线" -msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." -msgstr "Edward Moore算法是Bellman-Ford算法的改进。 它可以计算加权有向图中从单个源顶点到所有其他顶点的最短路径。 Edward Moore算法和Bellman-Ford算法之间的主要区别在于运行时间。" +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgstr "这是可能的，因为原始图中的每个交叉点（顶点）现在都是完整的图，对于穿过该交叉点的每个可能的转弯都有一条新边。" -msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." -msgstr "该算法的最坏运行时间为 :math:`O(| V | * | E |)` ，类似于Bellman-Ford算法的时间复杂度。然而，实验表明，对于随机图，该算法的平均运行时间复杂度为 :math:`O( | E | )`。这在计算速度上明显更快。" +msgid "This function is for **directed** graphs." +msgstr "该函数适用于 **有向** 图。" -msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" -msgstr "因此，该算法在最好的情况下，明显快于 Bellman-Ford 算法，在最差的情况下，与 Bellman-Ford 算法一样好" +msgid "Results are undefined when a negative vertex id is used in the input graph." +msgstr "当输入图中使用负顶点 id 时，结果是不确定的。" -msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" -msgstr "未包含值 `(v, v)` 的 `agg_cost` 为 :math:`0`" +msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgstr "当输入图中使用重复的边 id 时，结果是不确定的。" -msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." -msgstr "出于优化目的， `start vids` 或`end vids`中的任何重复值都将被忽略。" +msgid "Running time: TBD" +msgstr "运行时间：TBD（待定）" -msgid "Running time:" -msgstr "运行时间：" +msgid "pgr_lineGraphFull(`Edges SQL`_)" +msgstr "pgr_lineGraphFull(`Edges SQL`_)" -msgid "Worst case: :math:`O(| V | * | E |)`" -msgstr "最坏的情况： :math:`O(| V | * | E |)`" +msgid "Returns set of |result-linegf|" +msgstr "返回 |result-linegf| 的集合" -msgid "Average case: :math:`O( | E | )`" -msgstr "平均情况： :math:`O( | E | )`" +msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" +msgstr "边 :math:`\\{4, 7, 8, 10\\}` 子图的全线图" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgstr "示例包含边线 4、7、8 和 10 构成的子图，且包含 ``reverse_cost`` 。" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "The data" +msgstr "数据" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgstr "此示例显示此图形转换如何为图形中的每个可能的转弯创建附加边。" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "|first|" +msgstr "|first|" -msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "first" +msgstr "首先" -msgid "Using a combinations table on an **undirected** graph." -msgstr "在 **无向** 图上使用组合表。" +msgid "The transformation" +msgstr "转变" -msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" +msgid "|second|" +msgstr "|second|" -msgid "``pgr_extractVertices``" -msgstr "``pgr_extractVertices``" +msgid "second" +msgstr "第二" -msgid "``pgr_extractVertices`` — Extracts the vertices information" -msgstr "``pgr_extractVertices`` — 提取顶点信息" +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgstr "在转换后的图中，原始图中的所有边仍然存在（黄色），但现在我们为跨顶点 7 的每个转弯提供了额外的边（橙色）。" -msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." -msgstr "这是一个用于提取图的边集的顶点信息的辅助函数。" +msgid "Creating table that identifies transformed vertices" +msgstr "创建标识变换顶点的表" -msgid "When the edge identifier is given, then it will also calculate the in and out edges" -msgstr "当给出边标识符时，它也会计算出入边" +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgstr "变换后的图中的每个顶点都是通过分割原始图中的顶点而创建的。 除非原始图中的某个顶点是叶顶点，否则它将在变换后的图中生成多个顶点。 转换后的图中新创建的顶点之一将被赋予与原始图中创建它的顶点相同的顶点标识符，但新创建的其余顶点将具有负顶点 id。" -msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" -msgstr "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgstr "以下是如何生成一个表的示例，该表将新创建的顶点的 id 与创建它们的原始顶点进行映射" -msgid "RETURNS SETOF |result-extract|" -msgstr "RETURNS SETOF |result-extract|" +msgid "Store edge results" +msgstr "存储边结果" -msgid "When line geometry is known" -msgstr "当线的几何形状已知时" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" +msgstr "第一步是将 ``pgr_lineGraphFull`` 调用的结果存储到表中" -msgid "(Optional) identifier of the edge." -msgstr "（可选）边的标识符。" +msgid "Create the mapping table" +msgstr "创建映射表" -msgid "``geom``" -msgstr "``geom``" +msgid "From the original graph's vertex information" +msgstr "从原始图的顶点信息" -msgid "``LINESTRING``" -msgstr "``LINESTRING``" +msgid "Add the new vertices" +msgstr "增加新的顶点" -msgid "Geometry of the edge." -msgstr "边的几何形状。" +msgid "Filling the mapping table" +msgstr "填写映射表" -msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." -msgstr "该内部查询优先于接下来的两个内部查询，因此当 ``geom`` 列出现时，其他列将被忽略。" +msgid "The positive vertex identifiers are the original identifiers" +msgstr "正的顶点标识符是原始标识符" -msgid "Ignored columns:" -msgstr "忽略的列：" +msgid "Inspecting the vertices map" +msgstr "检查顶点图" -msgid "``startpoint``" -msgstr "``startpoint``" +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgstr "当从源点到 ``target`` 没有旅行成本，并且源点具有原始值时，会出现自环。" -msgid "``endpoint``" -msgstr "``endpoint``" +msgid "Updating values from self loops" +msgstr "从自循环更新值" -msgid "When vertex geometry is known" -msgstr "当顶点几何形状已知时" +msgid "Inspecting the vertices table" +msgstr "检查顶点表" -msgid "To use this inner query the column ``geom`` should not be part of the set of columns." -msgstr "要使用此内部查询，列 ``geom`` 不应成为列集的一部分。" +msgid "Updating from inner self loops" +msgstr "从内部自我循环更新" -msgid "``POINT``" -msgstr "``POINT``" +msgid "Adding a soft restriction" +msgstr "添加软限制" -msgid "POINT geometry of the starting vertex." -msgstr "起始顶点的 POINT 几何图形。" +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." +msgstr "需要使用边 4 -> 7 从顶点 6 到顶点 3 的软限制。" -msgid "POINT geometry of the ending vertex." -msgstr "结束顶点POINT的几何图形。" +msgid "Identifying the restriction" +msgstr "识别限制条件" -msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." -msgstr "此内部查询优先于下一个内部查询，因此当出现 ``startpoint`` 和 ``endpoint`` 列时，其他列将被忽略。" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgstr "运行 :doc:`pgr_dijkstraNear` 时，成本将会增加的地方是边 8，其成本为 0" -msgid "When identifiers of vertices are known" -msgstr "当顶点的标识符已知时" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgstr "要更改的边是上一个查询中的 ``WHERE cost = 0 AND seq != 1 AND edge != -1`` ：" -msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." -msgstr "要使用此内部查询，列 ``geom`` 、 ``startpoint`` 和 ``endpoint`` 不应成为列集的一部分。" +msgid "Adding a value to the restriction" +msgstr "向限制添加值" -msgid "``NULL`` When the ``id`` is not part of the inner query" -msgstr "``NULL`` 当 ``id`` 不是内部查询的一部分时" +msgid "Updating the cost to the edge:" +msgstr "将成本更新到边：" -msgid "X value of the point geometry" -msgstr "点几何的X值" +msgid "Routing from :math:`6` to :math:`3`" +msgstr "路由从 :math:`6` 到 :math:`3`" -msgid "``NULL`` When no geometry is provided" -msgstr "``NULL`` 当没有提供几何图形时" +msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." +msgstr "现在，该路线不使用边 8，而是在叶顶点上进行 U 形转弯。" -msgid "Geometry of the point" -msgstr "点几何" +msgid "Simplifying leaf vertices" +msgstr "简化叶顶点" -msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." -msgstr "要获取用于生成顶点信息的查询，请使用 ``dryrun := true`` 。" +msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgstr "在这个例子中，遍历叶顶点没有额外的成本。" -msgid "Create a routing topology" -msgstr "创建路由拓扑" +msgid "Using the vertex map give the leaf verices their original value." +msgstr "使用顶点图赋予叶顶点其原始值。" -msgid "Make sure the database does not have the ``vertices_table``" -msgstr "确保数据库没有 ``vertices_table``" +msgid "On the source column" +msgstr "在source 列" -msgid "Clean up the columns of the routing topology to be created" -msgstr "清理要创建的路由拓扑的列" +msgid "On the target column" +msgstr "在target列" -msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" -msgstr "当 ``LINESTRING`` 具有 SRID 时，请使用 ``geom::geometry(POINT, )``" +msgid "Removing self loops on leaf nodes" +msgstr "删除叶节点上的自循环" -msgid "For big edge tables that are been prepared," -msgstr "对于已经准备好的大型边表，" +msgid "The self loops of the leaf nodes are" +msgstr "叶节点的自循环为" -msgid "Create it as ``UNLOGGED`` and" -msgstr "将其创建为 ``UNLOGGED`` 并" +msgid "Which can be removed" +msgstr "哪些可以删除" -msgid "After the table is created ``ALTER TABLE .. SET LOGGED``" -msgstr "创建表后，执行 ``ALTER TABLE .. SET LOGGED`` 操作" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgstr "现在可以使用 :doc:`pgr_dijkstra` 使用原始顶点 id 来完成路由" -msgid "Inspect the vertices table" -msgstr "检查顶点表" +msgid "Complete routing graph" +msgstr "完整的路由图" -msgid "Create the routing topology on the edge table" -msgstr "在边表上创建路由拓扑" +msgid "Add edges from the original graph" +msgstr "从原始图中添加边" -msgid "Updating the ``source`` information" -msgstr "更新 ``source`` 信息" +msgid "Add all the edges that are not involved in the line graph process to the new table" +msgstr "将所有不参与折线图过程的边添加到新表中" -msgid "Updating the ``target`` information" -msgstr "更新 ``target`` 信息" +msgid "Some administrative tasks to get new identifiers for the edges" +msgstr "一些获取边新标识符的管理任务" -msgid "Inspect the routing topology" -msgstr "检查路由拓扑" +msgid "Add the newly calculated edges" +msgstr "添加新计算的边" -msgid "**Generated topology**" -msgstr "**生成拓扑**" +msgid "Using the routing graph" +msgstr "使用路由图" -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" +msgid "When using this method for routing with soft restrictions there will be uturns" +msgstr "当使用这种方法进行具有软限制的路由时，将会出现 uturn" -msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." -msgstr "``pgr_findCloseEdges`` - 查找点几何图形的闭合边。" +msgid "Routing from :math:`5` to :math:`1`" +msgstr "路由从 :math:`5` 到 :math:`1`" -msgid "``partial`` option is removed." -msgstr "``partial`` 选项已被移除。" +msgid "https://en.wikipedia.org/wiki/Line_graph" +msgstr "https://en.wikipedia.org/wiki/Line_graph" -msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." -msgstr "``pgr_findCloseEdges`` - 一个用于查找距离点状geometry最近边的工具函数。" +msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgstr "https://en.wikipedia.org/wiki/Complete_graph" -msgid "The geometries must be in the same coordinate system (have the same SRID)." -msgstr "几何图形必须位于同一坐标系中（具有相同的 SRID）。" +msgid "``pgr_makeConnected`` - Experimental" +msgstr "``pgr_makeConnected`` - 实验性" -msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." -msgstr "可以获取计算代码，以便根据应用需要进行进一步的具体调整。" +msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." +msgstr "``pgr_makeConnected`` — 连接图的边集。" -msgid "``EMPTY SET`` is returned on dryrun executions" -msgstr "空结果集 ``EMPTY SET`` 会在试运行中返回" +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgstr "添加使输入图连接所需的最小边数。 该算法首先识别图中的所有连接组件，然后添加边以将这些组件在路径中连接在一起。 例如，如果一个图包含三个连通分量 A、B 和 C，则 make_connected 将添加两条边。 添加的两条边可能包括一条连接 A 中的顶点与 B 中的顶点的边，以及一条连接 B 中的顶点与 C 中的顶点的边。" -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgstr "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgstr "它将给出图中连接它所需的所有边的最小列表。" -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgstr "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "The algorithm does not considers geometric topology in the calculations." +msgstr "该算法在计算中不考虑遍历成本。" -msgid "**options:** ``[cap, dryrun]``" -msgstr "**options:** ``[cap, dryrun]``" +msgid "pgr_makeConnected(`Edges SQL`_)" +msgstr "pgr_makeConnected(`Edges SQL`_)" -msgid "Returns set of |result-find|" -msgstr "返回集合 |result-find|" +msgid "Returns set of |result-component-make|" +msgstr "返回结果 |result-component-make|" -msgid "One point" -msgstr "一个点" +msgid "List of edges that are needed to connect the graph." +msgstr "连接图形所需的边线列表。" -msgid "Get two close edges to points of interest with :math:`pid = 5`" -msgstr "用 :math:`pid = 5` 获取两条与兴趣点接近的边" +msgid "`Boost: make connected `__" +msgstr "`Boost: 使图连通 `__" -msgid "``cap => 2``" -msgstr "``cap => 2``" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" -msgid "Many points" -msgstr "多点" +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` — 计算图中的最大基数匹配。." -msgid "For each points of interests, find the closest edge." -msgstr "为每个兴趣点找出最近的边。" +msgid "pgr_maxCardinalityMatch(text,boolean)" +msgstr "pgr_maxCardinalityMatch(text,boolean)" -msgid "**point**" -msgstr "**point**" +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "pgr_maxCardinalityMatch(text) 只返回 ``edge`` 列。" -msgid "The point geometry" -msgstr "点几何" +msgid "Deprecated signature" +msgstr "已弃用的签名" -msgid "**points**" -msgstr "**points**" +msgid "directed => ``false`` when used." +msgstr "使用时 directed => ``false`` 。" -msgid "``POINT[]``" -msgstr "``POINT[]``" +msgid "Renamed from ``pgr_maximumCardinalityMatching``" +msgstr "从 ``pgr_maximumCardinalityMatching`` 重命名" -msgid "An array of point geometries" -msgstr "点几何数组" +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgstr "图中的匹配或独立边集是一组没有公共顶点的边。" -msgid "**tolerance**" -msgstr "**tolerance**" +msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgstr "最大匹配是包含尽可能多的边的匹配。" -msgid "Max distance between geometries" -msgstr "几何图形之间的最大距离" +msgid "There may be many maximum matchings." +msgstr "可能有很多最大匹配。" -msgid "Limit output rows" -msgstr "限制输出行数" +msgid "Calculates one possible maximum cardinality matching in a graph." +msgstr "计算图中一种可能的最大基数匹配。" -msgid "When ``false`` calculations are performed." -msgstr "当为 ``false`` 时，执行计算。" +msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" +msgstr "运行时间： :math:`O( E*V * \\alpha(E,V))`" -msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." -msgstr "当为 ``true`` 时，不执行计算，并在 PostgreSQL 的 ``NOTICE`` 中显示执行计算的查询。" +msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." +msgstr ":math:`\\alpha(E,V)` 与 `Ackermann function`_ 相反。" -msgid "``geometry``" -msgstr "``geometry``" +msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" +msgstr "pgr_maxCardinalityMatch(`Edges SQL`_)" -msgid "The ``LINESTRING`` geometry of the edge." -msgstr "边的 ``LINESTRING`` 几何。" +msgid "Using all edges." +msgstr "使用所有边。" -msgid "When :math:`cap = 1`, it is the closest edge." -msgstr "当 :math:`cap = 1` 时，它是最近的边。" +msgid "SQL query, which should return a set of rows with the following columns:" +msgstr "SQL 查询，应返回一组包含以下列的行：" -msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." -msgstr "以 <0,1> 范围内的值，表示相对于边线第一个端点的相对位置。" +msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgstr "正值表示存在边 (``source``, ``target``) 。" -msgid "Value in ``[r, l]`` indicating if the point is:" -msgstr "``[r, l]`` 中的值指示该点是否为：" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgstr "正值表示存在边 (``target``, ``source``)" -msgid "At the right ``r`` of the segment." -msgstr "位于线段右侧 ``r`` 。" +msgid "Identifier of the edge in the original query." +msgstr "原始查询中边的标识符。" -msgid "When the point is on the line it is considered to be on the right." -msgstr "当点在直线上时，它被认为是在右边。" +msgid "`Boost: maximum_matching `__" +msgstr "`Boost: 最大匹配 `__" -msgid "At the left ``l`` of the segment." -msgstr "位于线段左侧 ``l`` 。" +msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" -msgid "``distance``" -msgstr "``distance``" +msgid "https://en.wikipedia.org/wiki/Ackermann_function" +msgstr "https://en.wikipedia.org/wiki/Ackermann_function" -msgid "Distance from the point to the edge." -msgstr "点到边线的距离。" +msgid "``pgr_maxFlow``" +msgstr "``pgr_maxFlow``" -msgid "Original ``POINT`` geometry." -msgstr "原始的 ``POINT`` 几何形状。" +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgstr "``pgr_maxFlow`` — 使用 Push Relabel 算法计算有向图中从源到目标的最大流量。" -msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" -msgstr "连接原始 **point** 和具有标识符 ``edge_id`` 的边的最近点的 ``LINESTRING`` 几何体" +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(组合)" -msgid "One point in an edge" -msgstr "边线上的一个点" +msgid "Calculates the maximum flow from the sources to the targets." +msgstr "计算从源头到目标的最大流量。" -msgid "The green node is the original point." -msgstr "绿色节点为原始点。" +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgstr "当最大流量为 **0** 时则没有流量，返回 **0** 。" -msgid "``geom`` has the value of the original point." -msgstr "``geom`` 包含原始点的坐标值。" +msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." +msgstr "使用 :doc:`pgr_pushRelabel ` 算法。" -msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." -msgstr "几何图形 ``edge`` 是连接原始点与边线 :math:`sp \\rightarrow ep` 的线段。" +msgid "Running time: :math:`O( V ^ 3)`" +msgstr "运行时间： :math:`O( V ^ 3)`" -msgid "The point is located at the left of the edge." -msgstr "该点位于边线的左侧。" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" -msgid "One point dry run execution" -msgstr "单点模拟执行" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" -msgid "Using the query from the previous example:" -msgstr "使用上一个示例中的查询：" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" -msgid "Returns ``EMPTY SET``." -msgstr "返回 ``EMPTY SET`` 。" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" -msgid "``dryrun => true``" -msgstr "``dryrun => true``" +msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" -msgid "Generates a PostgreSQL ``NOTICE`` with the code used." -msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE`` 。" +msgid "RETURNS ``BIGINT``" +msgstr "返回 ``BIGINT``" -msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." -msgstr "生成的代码可用作满足其他要求（如考虑 SRID）的起始基础代码。" +msgid "Maximum flow possible from the source(s) to the target(s)" +msgstr "从 source(s)到 target(s)的可能最大流量" -msgid "Many points in an edge" -msgstr "一条边上有许多点" +msgid "`Boost: push relabel max flow `__" +msgstr "`Boost: 推-重标最大流算法 `__" -msgid "The green nodes are the **original points**" -msgstr "绿色节点为 **原始点**" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" -msgstr "标为 **g1** 和 **g2** 的几何体 ``geom`` 是 **原始点**" +msgid "``pgr_maxFlowMinCost`` - Experimental" +msgstr "``pgr_maxFlowMinCost`` - 实验性" -msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." -msgstr "标为 **edge1** 和 **edge2** 的几何图形 ``edge`` 是一条连接 ** 原始点** 和 :math:`sp \\rightarrow ep` 边上最近点的线。" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost`` — 计算图上最大流的总成本最小化的边" -msgid "Many points dry run execution" -msgstr "多点模拟执行" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "pgr_maxFlowMinCost(组合)" -msgid "Do not process query" -msgstr "不处理查询" +#, fuzzy +msgid "|Boost| Boost Graph Inside." +msgstr "|Boost| Boost 图内部" -msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" -msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE``" +msgid "**TODO** check which statement is true:" +msgstr "**TODO** 检查哪个陈述是正确的：" -msgid "Find at most two routes to a given point" -msgstr "最多找到两条到达给定点的路线" +msgid "The cost value of all input edges must be nonnegative." +msgstr "所有输入边的成本值必须是非负的。" -msgid "Using :doc:`pgr_withPoints`" -msgstr "使用 :doc:`pgr_withPoints`" +msgid "Process is done when the cost value of all input edges is nonnegative." +msgstr "当所有输入边的成本值为非负时，处理完成。" -msgid "A point of interest table" -msgstr "兴趣点表" +msgid "Process is done on edges with nonnegative cost." +msgstr "过程是在具有非负成本的边上完成的。" -msgid "Handling points outside the graph." -msgstr "处理图外的点。" +msgid "Running time: :math:`O(U * (E + V * logV))`" +msgstr "运行时间： :math:`O(U * (E + V * logV))`" -msgid "Points of interest" -msgstr "兴趣点" +msgid "where :math:`U` is the value of the max flow." +msgstr "其中 :math:`U` 是最大流量的值。" -msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." -msgstr "有时应用程序会“即时执行”，从不是图中顶点的位置开始。在pgRouting中，这些位置被称为兴趣点。" +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr ":math:`U`是迭代次数的上限。 在许多现实世界的情况下，迭代次数远小于 :math:`U` 。" -msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." -msgstr "兴趣点所需的信息包括 ``pid``, ``edge_id``, ``side``, ``fraction`` 。" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" -msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." -msgstr "在这份文档中，将有6个固定的兴趣点，并且它们将被存储在一个表中。" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" -msgid "A unique identifier." -msgstr "唯一标识符。" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" -msgid "Identifier of the nearest segment." -msgstr "最近边线的标识符。" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" -msgid "Is it on the left, right or both sides of the segment ``edge_id``." -msgstr "位于边线 ``edge_id`` 的左侧、右侧还是两侧。" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" -msgid "Where in the segment is the point located." -msgstr "该点位于边的哪个位置。" +msgid "Returns set of |result-flow-mincost|" +msgstr "返回 |result-flow-mincost| 的集合" -msgid "The geometry of the points." -msgstr "点的几何形状。" +msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" +msgstr "``pgr_maxFlowMinCost_Cost`` - 实验性" -msgid "The distance between ``geom`` and the segment ``edge_id``." -msgstr "``geom`` 与边线 ``edge_id`` 之间的距离。" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost_Cost`` — 计算图上最大流量的最小总成本" -msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." -msgstr "一个连接点的 ``geom`` 到边 ``edge_id`` 上最近点的线段。" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgstr "pgr_maxFlowMinCost_Cost(组合)" -msgid "``newPoint``" -msgstr "``newPoint``" +msgid "**The cost value of all input edges must be nonnegative.**" +msgstr "**所有输入边的成本值必须是非负的。**" -msgid "A point on segment ``edge_id`` that is the closest to ``geom``." -msgstr "边 ``edge_id`` 上距离 ``geom`` 最近的一个点。" +msgid "When the maximum flow is 0 then there is no flow and **0** is returned." +msgstr "当最大流量为0时则没有流量，返回 **0** 。" -msgid "Points of interest fill up" -msgstr "兴趣点填充" +msgid "Uses :doc:`pgr_maxFlowMinCost`." +msgstr "使用 :doc:`pgr_maxFlowMinCost`。" -msgid "Inserting the points of interest." -msgstr "插入兴趣点。" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" -msgid "Filling the rest of the table." -msgstr "填充表格的其余部分。" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" -msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." -msgstr "任何其他额外的修改：在本手册中，可从两侧到达点 :math:`6`。" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" -msgid "The points of interest:" -msgstr "兴趣点：" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" -msgid "``pgr_floydWarshall``" -msgstr "``pgr_floydWarshall``" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" -msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." -msgstr "``pgr_floydWarshall`` - 使用 Floyd-Warshall 算法返回图中每对节点的最短路径成本之和。" +msgid "RETURNS FLOAT" +msgstr "RETURNS FLOAT" -msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," -msgstr "Floyd-Warshall算法，也被称为 Floyd算法，是计算图中每一对节点间最短路径的路径成本总和的一种良好选择，适用于*密集图*。我们使用Boost的实现，其运行时间为： :math:`\\Theta(V^3)`，" +msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" +msgstr "从source(s) 到target(s)的最小成本最大流量" -msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" -msgstr "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgid "``pgr_pickDeliver`` - Experimental" +msgstr "``pgr_pickDeliver`` - 实验性" -msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图。" +msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliver`` - 接送车辆路径问题" -#, fuzzy -msgid "Boost `Floyd-Warshall `_" -msgstr "Boost `弗洛伊德-沃沙尔算法 `_" +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgstr "问题：将取货-送货对分配并优化到车队中。" -msgid "``pgr_full_version``" -msgstr "``pgr_full_version``" +msgid "Optimization problem is NP-hard." +msgstr "优化问题是NP-hard。" -msgid "``pgr_full_version`` — Get the details of pgRouting version information." -msgstr "``pgr_full_version`` — 获取pgRouting版本信息的详细信息。" +msgid "pickup and Delivery with time windows." +msgstr "有时间窗口的取货和送货。" -msgid "Get complete details of pgRouting version information" -msgstr "获取 pgRouting 版本信息的完整详细信息" +msgid "All vehicles are equal." +msgstr "所有车辆都是平等的。" -msgid "pgr_full_version()" -msgstr "pgr_full_version()" +msgid "Same Starting location." +msgstr "相同的起始位置。" -msgid "RETURNS |result-version|" -msgstr "RETURNS |result-version|" +msgid "Same Ending location which is the same as Starting location." +msgstr "相同的结束位置与开始位置相同。" -msgid "Information about when this documentation was built" -msgstr "有关此文档何时构建的信息" +msgid "All vehicles travel at the same speed." +msgstr "所有车辆以相同的速度行驶。" -msgid "``version``" -msgstr "``version``" +msgid "A customer is for doing a pickup or doing a deliver." +msgstr "客户负责提货或送货。" -msgid "pgRouting version" -msgstr "pgRouting 版本" +msgid "has an open time." +msgstr "有开放时间。" -msgid "``build_type``" -msgstr "``build_type``" +msgid "has a closing time." +msgstr "有关闭时间。" -msgid "The Build type" -msgstr "构建类型" +msgid "has a service time." +msgstr "有服务时间。" -msgid "``compile_date``" -msgstr "``compile_date``" +msgid "has an (x, y) location." +msgstr "具有 (x, y) 位置。" -msgid "Compilation date" -msgstr "编译日期" +msgid "There is a customer where to deliver a pickup." +msgstr "有客户需要送货。" -msgid "``library``" -msgstr "``library``" +msgid "travel time between customers is distance / speed" +msgstr "客户之间的旅行时间是距离/速度" -msgid "Library name and version" -msgstr "库名称和版本" +msgid "pickup and delivery pair is done with the same vehicle." +msgstr "取货和送货是使用同一辆车完成的。" -msgid "``system``" -msgstr "``system``" +msgid "All trucks depart at time 0." +msgstr "所有卡车均在时间 0 出发。" -msgid "Operative system" -msgstr "操作系统" +msgid "the algorithm will raise an exception when" +msgstr "该算法将在以下情况下引发异常" -msgid "``postgreSQL``" -msgstr "``postgreSQL``" +msgid "If there is a pickup-deliver pair than violates time window" +msgstr "如果存在违反时间窗口的取货-送货对" -msgid "pgsql used" -msgstr "使用pgsql" +msgid "The speed, max_cycles, ma_capacity have illegal values" +msgstr "speed、max_cycles、ma_capacity 具有非法值" -msgid "``compiler``" -msgstr "``compiler``" +msgid "Six different initial will be optimized - the best solution found will be result" +msgstr "将优化六个不同的初始值 - 找到的最佳解决方案将是结果" -msgid "Compiler and version" -msgstr "编译器和版本" +msgid "Signature" +msgstr "标识" -msgid "``boost``" -msgstr "``boost``" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgstr "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" -msgid "Boost version" -msgstr "Boost 版本" +msgid "**options:** ``[factor, max_cycles, initial_sol]``" +msgstr "**options:** ``[factor, max_cycles, initial_sol]``" -msgid "``hash``" -msgstr "``hash``" +msgid "Returns set of |result-pickdrop|" +msgstr "返回 |result-pickdrop| 的集合" -msgid "Git hash of pgRouting build" -msgstr "pgRouting 构建的 Git 哈希" +msgid "Solve the following problem" +msgstr "解决以下问题" -msgid "``pgr_hawickCircuits`` - Experimental" -msgstr "``pgr_hawickCircuits`` - 实验性" +msgid "Given the vehicles:" +msgstr "给定车辆：" -msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." -msgstr "``pgr_hawickCircuits`` — 使用 Hawick 电路算法返回电路列表。" +msgid "and the orders:" +msgstr "和顺序：" -msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." -msgstr "Hawick Circuit 算法由 Ken Hawick 和 Health A. James 于 2008 年发表。 该算法解决了图中电路的检测和枚举问题。 它能够在具有有向弧、多弧和自弧的图中进行电路枚举，并具有内存高效和高性能的实现。 它是寻找有向图所有基本电路的约翰逊算法的扩展。" +msgid "The parameters are:" +msgstr "参数是：" -msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." -msgstr "Boost Graph Library 中定义了 2 个变体。 在这里，我们只实现了第二个，因为它服务于最合适和最实用的用例。 在这个变体中，我们在过滤掉由平行边缘引起的电路后得到电路。 当您想要计算数量时，并行边缘电路有更多用例。 也许将来我们也会实现这种变化。" +msgid "A `SELECT` statement that returns the following columns:" +msgstr "返回以下列的 `SELECT` 语句：" -msgid "The algorithm implementation works only for directed graph" -msgstr "该算法实现仅适用于有向图" +msgid "id, demand" +msgstr "id, demand" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." -msgstr "这是对于电路枚举的一种格式，基于Johnson的算法。" +msgid "p_node_id, p_open, p_close, [p_service,]" +msgstr "p_node_id, p_open, p_close, [p_service,]" -msgid "The algorithm outputs the distinct circuits present in the graph." -msgstr "该算法输出图中存在的不同电路。" +msgid "d_node_id, d_open, d_close, [d_service,]" +msgstr "d_node_id, d_open, d_close, [d_service,]" -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" -msgstr "时间复杂度： :math:`O((V + E) (c + 1))`" +msgid "id, capacity" +msgstr "id, capacity" -msgid ":math:`|c|` is the number of circuits in the graph." -msgstr ":math:`|c|` 是图中电路的数目。" +msgid "start_node_id, start_open, start_close [, start_service,]" +msgstr "start_node_id, start_open, start_close [, start_service,]" -msgid "pgr_hawickCircuits(`Edges SQL`_)" -msgstr "pgr_hawickCircuits(`Edges SQL`_)" +msgid "[end_node_id, end_open, end_close, end_service]" +msgstr "[end_node_id, end_open, end_close, end_service]" -msgid "Circuits present in the pgRouting :doc:`sampledata`" -msgstr "pgRouting :doc:`sampledata` 中存在的电路" +msgid "``pgr_pickDeliverEuclidean`` - Experimental" +msgstr "``pgr_pickDeliverEuclidean`` - 实验性" -msgid "Id of the circuit starting from ``1``" -msgstr "电路id从 ``1`` 开始" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliverEuclidean`` - 取货和送货车辆路径问题" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" -msgstr "在路径中的相对位置。数值 ``0`` 表示路径的起点" +msgid "Replaces ``pgr_gsoc_vrppdtw``" +msgstr "替换 ``pgr_gsoc_vrppdtw``" -msgid "Identifier of the starting vertex of the circuit." -msgstr "电路起始顶点的标识符。" +msgid "Pickup and Delivery:" +msgstr "取货和送货：" -msgid "Identifier of the ending vertex of the circuit." -msgstr "电路结束顶点的标识符。" +msgid "capacitated" +msgstr "带容量限制的" -msgid "Identifier of the node in the path from a vid to next vid." -msgstr "从 vid 到下一个 vid 的路径中节点的标识符。" +msgid "with time windows." +msgstr "有时间窗口的。" -msgid "`Boost: Hawick Circuit Algorithm `__" -msgstr "`Boost：Hawick 电路算法 `__" +msgid "have (x, y) start and ending locations." +msgstr "有 (x, y) 开始和结束位置。" -msgid "``pgr_isPlanar`` - Experimental" -msgstr "``pgr_isPlanar`` - 实验性" +msgid "have a start and ending service times." +msgstr "有开始和结束服务时间。" -msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." -msgstr "``pgr_isPlanar`` — 根据图的平面性返回布尔值。" +msgid "An order is for doing a pickup and a a deliver." +msgstr "订单用于取货和送货。" -msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." -msgstr "如果一个图可以在二维空间中绘制，使得它的任意两条边都不相交，那么这个图就是平面图。这种平面图的绘制称为平面绘图。每个平面图也可以表示为一个直线绘图，即在平面绘图中，每条边都由一条线段表示。当一个图包含 :math:`K_5` 或 :math:`K_{3, 3}` 作为子图时，这个图就不是平面图。" +msgid "has (x, y) pickup and delivery locations." +msgstr "有 (x, y) 个取货和送货地点。" -msgid "This implementation use the Boyer-Myrvold Planarity Testing." -msgstr "此实施使用 Boyer-Myrvold 平面度测试。" +msgid "has opening and closing times for the pickup and delivery locations." +msgstr "有提货和送货地点的开放和关闭时间。" -msgid "It will return a boolean value depending upon the planarity of the graph." -msgstr "它将根据图形的平面性返回一个布尔值。" +msgid "has a pickup and deliver service times." +msgstr "有取货和送货服务时间。" -msgid "Applicable only for **undirected** graphs." -msgstr "仅适用于 **无向** 图。" +msgid "Six different optional different initial solutions" +msgstr "六种不同的可选不同初始解决方案" -msgid "The algorithm does not considers traversal costs in the calculations." -msgstr "该算法在计算中不考虑遍历成本。" +msgid "the best solution found will be result" +msgstr "找到的最佳解决方案将作为结果" -msgid "Running time: :math:`O(|V|)`" -msgstr "运行时间： :math:`O(|V|)`" +msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgstr "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" -msgid "pgr_isPlanar(`Edges SQL`)" -msgstr "pgr_isPlanar(`Edges SQL`)" +msgid "p_x, p_y, p_open, p_close, [p_service,]" +msgstr "p_x, p_y, p_open, p_close, [p_service,]" -msgid "RETURNS ``BOOLEAN``" -msgstr "返回 ``BOOLEAN``" +msgid "d_x, d_y, d_open, d_close, [d_service]" +msgstr "d_x, d_y, d_open, d_close, [d_service]" -msgid "Returns a boolean ``(pgr_isplanar)``" -msgstr "返回一个布尔值 ``(pgr_isplanar)``" +msgid "start_x, start_y, start_open, start_close [, start_service, ]" +msgstr "start_x, start_y, start_open, start_close [, start_service, ]" -msgid "``pgr_isplanar``" -msgstr "``pgr_isplanar``" +msgid "[ end_x, end_y, end_open, end_close, end_service ]" +msgstr "[ end_x, end_y, end_open, end_close, end_service ]" -msgid "`true` when the graph is planar." -msgstr "当图形是平面时为 `true`。" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgstr "此数据示例 **lc101** 来自 https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/ 上发布的数据" -msgid "`false` when the graph is not planar." -msgstr "当图形不是平面时为 `false`。" +msgid "There are 25 vehicles in the problem all with the same characteristics." +msgstr "问题中有 25 辆具有相同特征的汽车。" -msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." -msgstr "以下边将构成具有顶点 {10, 15, 11, 16, 13} 的子图，这个子图是一个 :math:`K_1` 图。" +msgid "The original orders" +msgstr "原始订单" -msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." -msgstr "新图不是平面图，因为它具有一个 :math:`K_5` 子图。蓝色的边代表 :math:`K_5` 子图。" +msgid "The data comes in different rows for the pickup and the delivery of the same order." +msgstr "对于同一订单的取货和配送，数据位于不同的行中。" -msgid "`Boost: Boyer Myrvold `__" -msgstr "`Boost: Boyer-Myrvold 算法 `__" +msgid "The original data needs to be converted to an appropriate table:" +msgstr "需要将原始数据转换为适当的表格：" -msgid "``pgr_johnson``" -msgstr "``pgr_johnson``" +msgid "The query" +msgstr "查询" -#, fuzzy -msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." -msgstr "``pgr_johnson`` - 使用 Jhonson 算法返回图中每对节点的最短路径成本之和。" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgstr "仅显示相关信息，以便与 https://www.sintef.no/projectweb/top/pdptw/100-customers/ 上发布的最佳解决方案信息进行比较" -msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," -msgstr "Johnson 算法是计算图中每对节点的最短路径总成本的一个良好选择，特别适用于*稀疏图*。它使用 Boost 实现，运行时间为 :math:`O(V E \\log V)` ，" +msgid "The best solution found for **lc101** is a travel time: 828.94" +msgstr "找到的 **lc101** 的最佳解是行程时间：828.94" -msgid "pgr johnson(`Edges SQL`_, [``directed``])" -msgstr "pgr johnson(`Edges SQL`_, [``directed``])" +msgid "This implementation's travel time: 854.54" +msgstr "此实施的行程时间：854.54" -msgid "Boost `Johnson `_" -msgstr "Boost `Johnson 算法 `_" +msgid "``pgr_prim``" +msgstr "``pgr_prim``" -#, fuzzy -msgid "``pgr_kingOrdering`` - Experimental" -msgstr "``pgr_edgeColoring`` - 实验性" +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgstr "``pgr_prim`` — 使用 Prim 算法的图的最小生成森林。" -#, fuzzy -msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." -msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgstr "该算法使用 Prim 算法在可能断开的图中找到最小生成森林。" -msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." -msgstr "" +msgid "Prim's running time: :math:`O(E * log V)`" +msgstr "Prim运行时间： :math:`O(E * log V)`" -msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." -msgstr "" +msgid "pgr_prim(`Edges SQL`_)" +msgstr "pgr_prim(`Edges SQL`_)" -#, fuzzy -msgid "The implementation targets undirected graphs." -msgstr "该实现适用于 **无向** 图。" +msgid "Minimum spanning forest of a subgraph" +msgstr "子图的最小生成森林" -msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." -msgstr "" +msgid "`Boost: Prim's algorithm documentation `__" +msgstr "`Boost: Prim算法文档 `__" -#, fuzzy -msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" -msgstr "运行时间复杂度为： :math:`O(m log(m)|V|)`" +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primBFS`` — Prim 的深度优先搜索排序最小生成树算法。" -#, fuzzy -msgid "where :math:`|E|` is the number of edges," -msgstr "其中 :math:`|V|` 是顶点数，" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "访问并提取使用 Prims 算法创建的最小生成树的 Breath First Search 排序中的节点信息。" -#, fuzzy -msgid ":math:`m` is the maximum degree among all vertices." -msgstr ":math:`m` 是图中顶点的最大度数。" +msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -#, fuzzy -msgid "pgr_kingOrdering(`Edges SQL`_)" -msgstr "pgr_edgeColoring(`Edges SQL`_)" +msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -#, fuzzy -msgid "`Boost: King Ordering `__" -msgstr "`Boost: 边着色 `__" +msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." +msgstr "``pgr_primDD`` — 使用 Prim 算法的集水区节点。" -msgid "``pgr_kruskal``" -msgstr "``pgr_kruskal``" +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgstr "使用 Prim 算法，从计算出最小生成树中提取出那些与根节点（或根节点组）之间的聚合成本小于或等于某个距离的节点。" -msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." -msgstr "``pgr_kruskal`` — 使用 Kruskal 算法的图的最小生成树。" +msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +msgstr "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." -msgstr "该算法使用 Kruskal 算法在可能断开的图中找到最小生成森林。" +msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgstr "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" -msgid "EMPTY SET is returned when there are no edges in the graph." -msgstr "当图中没有边时，返回 EMPTY SET。" +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primDFS`` — 具有深度优先搜索排序的最小生成树的 Prim 算法。" -msgid "pgr_kruskal(`Edges SQL`_)" -msgstr "pgr_kruskal(`Edges SQL`_)" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "访问并提取使用 Prims 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" -msgid "Returns set of |result-mst|" -msgstr "返回 |result-mst| 的集合" +msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgid "Minimum spanning forest" -msgstr "最小生成森林" +msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." -msgstr "``pgr_kruskalBFS`` — Kruskal 的最小生成树算法，具有广度优先搜索排序。" +msgid "``pgr_pushRelabel``" +msgstr "``pgr_pushRelabel``" -msgid "Added ``pred`` result columns." -msgstr "添加了 ``pred`` 结果列。" +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgstr "``pgr_pushRelabel`` — 使用 Push Relabel 算法计算图边上的流量，以最大化从源到目标的流量。" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "访问并提取使用 Kruskal 算法创建的最小生成树的呼吸优先搜索排序中的节点信息。" +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(组合)" -msgid "Returned tree nodes from a root vertex are on Breath First Search order" -msgstr "从根顶点返回的树节点遵循广度优先搜索顺序" +msgid "Renamed from ``pgr_maxFlowPushRelabel``" +msgstr "由 ``pgr_maxFlowPushRelabel`` 重命名" -msgid "Breath First Search Running time: :math:`O(E + V)`" -msgstr "广度优先搜索运行时间： :math:`O(E + V)`" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" -msgid "The Minimum Spanning Tree having as root vertex :math:`6`" -msgstr "以根顶点为 :math:`6` 的最小生成树" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" -msgstr "以顶点 :math:`\\{9, 6\\}` 为起点， :math:`depth \\leq 3` 的最小生成树" +msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" -msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." -msgstr "``pgr_kruskalDD`` — 使用 Kruskal 算法的汇流节点。" +msgid "``pgr_separateCrossing``" +msgstr "``pgr_separateCrossing``" -msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." -msgstr "使用 Kruskal 算法，在计算的最小生成树中提取总成本小于或等于距 **根** 顶点（或多个顶点） **距离** 的节点。" +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." +msgstr "``pgr_separateCrossing`` - 从交叉几何图形生成不交叉的几何图形。" -msgid "Returned tree nodes from a root vertex are on Depth First Search order." -msgstr "从根顶点返回的树节点遵循深度优先搜索顺序。" +msgid "Proposed function." +msgstr "提议的函数。" -msgid "Depth First Search running time: :math:`O(E + V)`" -msgstr "深度优先搜索运行时间： :math:`O(E + V)`" +msgid "This is an auxiliary function for separating crossing edges." +msgstr "这是一个用于分离交叉边线的辅助函数。" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "RETURNS |result-separate|" +msgstr "返回 |result-separate|" -msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" -msgstr "以顶点 :math:`6` 为起点的，总成本小于或等于 :math:`distance \\leq 3.5` 的最小生成树" +msgid "Get the segments of the crossing geometries" +msgstr "获取交叉点几何形状的线段" -msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" -msgstr "以顶点 :math:`\\{9, 6\\}` 为起点， :math:`distance \\leq 3.5` 的最小生成树" +msgid "``tolerance``" +msgstr "``tolerance``" -msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_kruskalDFS`` — 具有深度优先搜索排序的最小生成树 Kruskal 算法。" +msgid "0.01" +msgstr "0.01" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "访问并提取使用 Kruskal 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" +msgid "Used in ST_Snap before ST_Split" +msgstr "在 ST_Split 前使用 ST_Snap" -msgid "Returned tree nodes from a root vertex are on Depth First Search order" -msgstr "从根顶点返回的树节点按深度优先搜索顺序" +msgid "Get the code for further refinement." +msgstr "获取进一步完善的代码。" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgstr "当由于最终应用或数据质量需要特别处理时，可以通过在 PostgreSQL 中使用 ``NOTICE`` 和 ``dryrun`` 标志来获取代码。" -msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" -msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" -msgstr "``pgr_lengauerTarjanDominatorTree`` - 实验性" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" +msgstr "``pgr_separateTouching`` - 将相互接触的几何图形转换为端点正确连接的几何图形" -msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." -msgstr "``pgr_lengauerTarjanDominatorTree`` — 返回所有顶点的直接支配者。" +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." +msgstr "此辅助函数用于处理几何图形相互接触但未共享端点的情况，通过在相交点处分割图形来增强网络连通性。" -msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." -msgstr "该算法计算每个顶点的*immediate dominator*，称为**idom**，一旦计算出每个顶点的**idom**，就可以将每个顶点的**idom**作为其父节点，从而构建支配者树。" +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgid "The algorithm works in directed graph only." -msgstr "该算法仅适用于有向图。" +msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgstr "``pgr_sequentialVertexColoring`` - 提议中" -msgid "The algorithm returns *idom* of each vertex." -msgstr "该算法返回每个顶点的* idom*。" +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgstr "``pgr_sequentialVertexColoring`` — 使用贪婪方法返回无向图的顶点着色。" -msgid "If the *root vertex* not present in the graph then it returns empty set." -msgstr "如果图中不存在*根顶点*，则返回空集。" +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgstr "顺序顶点着色算法是一种图着色算法，其中颜色标识符以顺序方式分配给图的顶点，使得没有边连接两个相同颜色的顶点。" -msgid "Running time: :math:`O((V+E)log(V+E))`" -msgstr "运行时间： :math:`O((V+E)log(V+E))`" +msgid "The implementation is applicable only for **undirected** graphs." +msgstr "该实现仅适用于 **无向** 图。" -msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" -msgstr "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)" +msgid "Provides the color to be assigned to all the vertices present in the graph." +msgstr "提供要分配给图中存在的所有顶点的颜色。" -msgid "Returns set of |result-idom|" -msgstr "返回 |result-idom| 的集合" +msgid "Color identifiers values are in the Range :math:`[1, |V|]`" +msgstr "颜色标识符值在范围 :math:`[1, |V|]` 内" -msgid "The dominator tree with root vertex :math:`5`" -msgstr "具有根顶点 :math:`5` 的支配树" +msgid "The algorithm tries to assign the least possible color to every vertex." +msgstr "该算法尝试为每个顶点分配尽可能少的颜色。" -msgid "SQL query as described above." -msgstr "SQL 查询如上所述。" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgstr "高效的图着色是一个 NP 困难问题，因此，该算法并不总是产生最佳着色。 它遵循贪婪策略，依次迭代所有顶点，并将其邻居未使用的最小可能颜色分配给每个顶点。" -msgid "**root vertex**" -msgstr "**root vertex**" +msgid "The returned rows are ordered in ascending order of the vertex value." +msgstr "返回的行按顶点值的升序排列。" -msgid "Returns set of ``(seq, vertex_id, idom)``" -msgstr "返回集合 ``(seq, vertex_id, idom)``" +msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" +msgstr "顺序顶点着色运行时间： :math:`O(|V|*(d + k))`" -msgid "``vertex_id``" -msgstr "``vertex_id``" +msgid ":math:`d` is the maximum degree of the vertices in the graph," +msgstr ":math:`d` 是图中顶点的最大度数，" -msgid "Identifier of vertex ." -msgstr "顶点的标识符。" +msgid ":math:`k` is the number of colors used." +msgstr ":math:`k` 是使用的颜色数量。" -msgid "``idom``" -msgstr "``idom``" +msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgstr "pgr_sequentialVertexColoring(`Edges SQL`_)" -msgid "Immediate dominator of vertex." -msgstr "顶点的直接支配者。" +msgid "`Boost: Sequential Vertex Coloring `__" +msgstr "`Boost: 顺序顶点着色 `__" -msgid "Dominator tree of another component." -msgstr "另一个组件的支配树。" +#, fuzzy +msgid "``pgr_sloanOrdering`` - Experimental" +msgstr "``pgr_edgeColoring`` - 实验性" -msgid "`Boost: Lengauer-Tarjan dominator `__" -msgstr "`Boost: Lengauer-Tarjan 支配者算法 `__" +#, fuzzy +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" -msgid "`Wikipedia: dominator tree `__" -msgstr "`维基百科:支配树 `__" +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." +msgstr "" -msgid "``pgr_lineGraph`` - Proposed" -msgstr "``pgr_lineGraph`` - 提议中" +msgid "Finds a pseudoperipheral vertex pair to determine good starting points" +msgstr "" -msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." -msgstr "``pgr_lineGraph`` — 将给定图转换为其相应的基于边的图。" +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." +msgstr "" -msgid "Works for directed and undirected graphs." -msgstr "适用于有向和无向图。" +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." +msgstr "" -msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" -msgstr "给定一个图 :math:`G`，其线图 :math:`L(G)` 是一个图，满足以下条件：" +msgid "Typically produces better orderings than simple breadth-first approaches." +msgstr "" -msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." -msgstr ":math:`L(G)` 的每个顶点代表 :math:`G` 的一条边。" +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." +msgstr "" -msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" -msgstr ":math:`L(G)` 的两个顶点相邻，当且仅当它们对应的边在 :math:`G` 中共享一个共同端点时" +#, fuzzy +msgid "pgr_sloanOrdering(`Edges SQL`_)" +msgstr "pgr_edgeColoring(`Edges SQL`_)" -msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." -msgstr "结果中的 ``cost`` 和 ``reverse_cost`` 列表示边的存在性。" +msgid ":Example : Sloan ordering without specifying start vertex" +msgstr "" -msgid "When the graph is directed the result is directed." -msgstr "当图形是有向的，结果也是有向的。" +#, fuzzy +msgid "New sloan ordering order." +msgstr "新的逆序排列。" -msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." -msgstr "要获取完整的线图，请在双向边上使用唯一标识符 (See `Additional Examples`_)." +msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." +msgstr "" -msgid "When the graph is undirected the result is undirected." -msgstr "当图无向时，成本矩阵是对称的。" +#, fuzzy +msgid "`Boost: Sloan Ordering `__" +msgstr "`Boost: 边着色 `__" -msgid "The ``reverse_cost`` is always :math:`-1`." -msgstr "``reverse_cost`` 始终为 :math:`-1` 。" +msgid "``pgr_stoerWagner`` - Experimental" +msgstr "``pgr_stoerWagner`` - 实验性" -msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" -msgstr "pgr_lineGraph(`Edges SQL`_, [``directed``])" +msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." +msgstr "``pgr_stoerWagner`` — 使用 stoerWagner 算法对图进行最小分割。" -msgid "Returns set of |result-lineg|" -msgstr "返回结果 |result-lineg|" +msgid "Version 3.0" +msgstr "版本3.0" -msgid "For an undirected graph with edges :math:'{2,4,5,8}'" -msgstr "对于一个undirected graph(无向图)，其边为 :math:'{2,4,5,8}'" +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgstr "在图论中，Stoer-Wagner 算法是一种递归算法，用于解决具有非负权重的无向带权图中的最小割问题。 该算法的基本思想是通过合并最密集的顶点来收缩图，直到图仅包含两个组合的顶点集。 在每个阶段，算法都会找到任意选择的两个顶点 s 和 t 的最小 s-t 割。 然后算法缩小 s 和 t 之间的缘以搜索非 s-t 切割。 在所有阶段中找到的最小割将是图的最小加权割。" -msgid "Gives a local identifier for the edge" -msgstr "给出边的本地标识符" +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgstr "割是将图的顶点划分为两个不相交的子集。 最小切割是指切割的尺寸或重量不大于任何其他切割的尺寸的切割。 对于未加权的图，最小割只是具有最少边的割。 对于加权图，割线上所有边的权重之和决定了它是否是最小割。" -msgid "When `negative`: the source is the reverse edge in the original graph." -msgstr "为负时：源是原始图中的反向边。" +msgid "Sum of the weights of all edges between the two sets is mincut." +msgstr "两组之间所有边的权重之和是最小割。" -msgid "When `negative`: the target is the reverse edge in the original graph." -msgstr "为负时：目标是原始图中的反向边。" +msgid "A **mincut** is a cut having the least weight." +msgstr "**最小切割** 是重量最小的切割。" -msgid "Weight of the edge (``source``, ``target``)." -msgstr "边 (``source``, ``target``) 的权重。" +msgid "Values are returned when graph is connected." +msgstr "连接图形时返回值。" -msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." -msgstr "当为负时：边(``source``, ``target``)不存在，因此它不是图的一部分。" +msgid "When there is no edge in graph then EMPTY SET is return." +msgstr "当图中没有边时，则返回 EMPTY SET。" -msgid "Weight of the edge (``target``, ``source``)." -msgstr "边 (``target``, ``source``)的权重。" +msgid "When the graph is unconnected then EMPTY SET is return." +msgstr "当图形未连接时，则返回 EMPTY SET。" -msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." -msgstr "当为负时：边(``target``, ``source``)不存在，因此它不是图的一部分。" +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgstr "有时一个图有多个最小割，但都具有相同的权重。 该函数准确地确定最小切割之一及其权重。" -msgid "Given the following directed graph" -msgstr "给定以下有向图" +msgid "Running time: :math:`O(V*E + V^2*log V)`." +msgstr "运行时间： :math:`O(V*E + V^2*log V)`。" -msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" -msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgid "pgr_stoerWagner(`Edges SQL`_)" +msgstr "pgr_stoerWagner(`Edges SQL`_)" -msgid "Representation as directed with shared edge identifiers" -msgstr "用共享边标识符定向表示" +msgid "Returns set of |result-mincut|" +msgstr "返回 |result-mincut| 的集合" -msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" -msgstr "为了简化数据库中边表的设计，边的标识符采用3位数字表示：" +msgid "min cut of the main subgraph" +msgstr "主子图的最小割" -msgid "hundreds" -msgstr "百位" +msgid "Returns set of ``(seq, edge, cost, mincut)``" +msgstr "返回集合 ``(seq, edge, cost, mincut)``" -msgid "the source vertex" -msgstr "源点" +msgid "Edges which divides the set of vertices into two." +msgstr "将顶点集一分为二的边。" -msgid "tens" -msgstr "十位" +msgid "Cost to traverse of edge." +msgstr "遍历边的成本。" -msgid "always 0, acts as a separator" -msgstr "始终为 0，用作分隔符" +msgid "**mincut**" +msgstr "**mincut**" -msgid "units" -msgstr "个位" +msgid "Min-cut weight of a undirected graph." +msgstr "无向图的最小割权。" -msgid "the target vertex" -msgstr "目标顶点" +msgid "Additional Example:" +msgstr "附加示例：" -msgid "In this image," -msgstr "在这张图片中，" +msgid "min cut of an edge" +msgstr "边的最小割" -msgid "Single or double head arrows represent one edge (row) on the edges table." -msgstr "单向或双向箭头表示边表中的一条边（行）。" +msgid "Using :doc:`pgr_connectedComponents`" +msgstr "使用 :doc:`pgr_connectedComponents`" -msgid "The numbers in the yellow shadow are the edge identifiers." -msgstr "黄色阴影中的数字是边缘标识符。" +msgid "`Boost: Stoer Wagner min cut `__" +msgstr "`Boost: Stoer-Wagner 最小割算法 `__" -msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." -msgstr "当使用 ``reverse_cost`` 列时，两个边对会共享相同的标识符。" +msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." -msgstr "边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` 用一条边行表示，标识符其 :math:`id=203` 。" +msgid "``pgr_strongComponents``" +msgstr "``pgr_strongComponents``" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." -msgstr "边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` 用一条边的行表示，标识符为 :math:`id=304` 。" +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgstr "``pgr_strongComponents`` — 使用基于 DFS 的 Tarjan 算法构建有向图的强连通分量。" -msgid "The graph can be created as follows:" -msgstr "图表的创建过程如下：" +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." +msgstr "有向图的强连接组件是一组彼此可达的顶点。" -msgid "Line Graph of a directed graph represented with shared edges" -msgstr "用共享边表示的有向图的线图" +msgid "Works for **directed** graphs." +msgstr "适用于 **有向** 图。" -msgid "The result is a directed graph." -msgstr "结果就是一个有向图。" +msgid "Components are described by vertices identifiers." +msgstr "组件由顶点标识符描述。" -msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" -msgstr "对于 :math:`seq=4` ，从:math:`203 \\leftrightarrow 304` 表示两条边" +msgid "pgr_strongComponents(`Edges SQL`_)" +msgstr "pgr_strongComponents(`Edges SQL`_)" -msgid "For all the other values of ``seq`` represent one edge." -msgstr "所有其他的 ``seq`` 值都代表一条边。" +msgid "The strong components of the graph" +msgstr "图的重要组成部分" -msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." -msgstr "``cost`` 和 ``reverse_cost`` 的值表示边的存在。" +msgid "`Boost: Strong components `__" +msgstr "`Boost: 强连通分量 `__" -msgid "When positive: the edge exists." -msgstr "当为正数时：边缘存在。" +msgid "wikipedia: `Strongly connected component `__" +msgstr "维基百科: `强连通分量 `__" -msgid "When negative: the edge does not exist." -msgstr "负数时：边缘不存在。" +msgid "``pgr_topologicalSort`` - Experimental" +msgstr "``pgr_topologicalSort`` - 实验性" -msgid "Representation as directed with unique edge identifiers" -msgstr "作为有向图表示，并使用唯一的边标识符" +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgstr "``pgr_topologicalSort`` — 有向无环图 (DAG) 的顶点的线性排序。" -msgid "Single head arrows represent one edge (row) on the edges table." -msgstr "单头箭头代表边表中的一条边（行）。" +#, fuzzy +msgid "Standardize output to |result_node_order|" +msgstr "返回集合 |result-node-color|" -msgid "There are no double head arrows" -msgstr "没有双向头箭" +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgstr "拓扑排序算法创建了一个顶点的线性排序，使得如果图中存在边 :math:`(u,v)`，则在排序中 :math:`v` 出现在 :math:`u` 之前。" -msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." -msgstr "两对边共享相同的结束节点，不使用 ``reverse_cost`` 列。" +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgstr "该过程仅对有向无环图有效。 否则它会抛出警告。" -msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." -msgstr "边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}`分别用两条边表示，边标识符为 :math:`id=203` 和:math:`id=302` 。" +msgid "For optimization purposes, if there are more than one answer, the function" +msgstr "出于优化目的，如果有多个答案，则该函数" -msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." -msgstr "边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}`分别用两条边表示，边标识符为 :math:`id=304` 和 :math:`id=403` 。" +msgid "will return one of them." +msgstr "将返回其中之一。" -msgid "Line Graph of a directed graph represented with unique edges" -msgstr "用唯一边表示的有向图的线图" +msgid "The returned values are ordered in topological order:" +msgstr "返回的值按拓扑顺序排序：" -msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." -msgstr "对于 :math:`seq=7` 从 :math:`203 \\leftrightarrow 302` 代表两条边。" +msgid "pgr_topologicalSort(`Edges SQL`_)" +msgstr "pgr_topologicalSort(`Edges SQL`_)" -msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." -msgstr "对于 :math:`seq=8` ，从 :math:`304 \\leftrightarrow 403` 表示两条边。" +msgid "Topologically sorting the graph" +msgstr "对图进行拓扑排序" -msgid "wikipedia: `Line Graph `__" -msgstr "维基百科: `Line Graph `__" +msgid "Sequential value starting from :math:`1`" +msgstr "从 :math:`1` 开始的连续数值" -msgid "mathworld: `Line Graph `__" -msgstr "MathWorld在线数学资源: `Line Graph `__" +msgid "Linear topological ordering of the vertices" +msgstr "顶点的线性拓扑排序" -msgid "``pgr_lineGraphFull`` - Experimental" -msgstr "``pgr_lineGraphFull`` - 实验性" +msgid "Additional examples" +msgstr "其他示例" -msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." -msgstr "``pgr_lineGraphFull`` — 将给定图转换为新图，其中原始图的所有顶点都转换为线图。" +msgid "Topologically sorting the one way segments" +msgstr "对单向段进行拓扑排序" -msgid "Version 2.6.0" -msgstr "版本2.6.0" +msgid "Graph is not a DAG" +msgstr "图不是 DAG" -msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." -msgstr "``pgr_lineGraphFull``, 通过将每个顶点转换为完全图并保留所有原始边，将原始有向图转换为有向线图。 新的连接边的成本为 0，并位于相邻的原始边之间，尊重方向性。" +msgid "`Boost: topological sort `__" +msgstr "`Boost: 拓扑排序 `__" -msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" -msgstr "结果图的一个可能的应用是 **\"具有两个边限制的路由\"**：" +msgid "``pgr_transitiveClosure`` - Experimental" +msgstr "``pgr_transitiveClosure`` - 实验性" -msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" -msgstr "设置在连接边上的边之间布线时使用顶点的成本" +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgstr "``pgr_transitiveClosure`` — 有向图的传递闭包图。" -msgid "Forbid the routing between two edges by removing the connecting edge" -msgstr "通过删除连接边来禁止两条边之间的布线" +#, fuzzy +msgid "Standardized output to |result-closure|" +msgstr "将输出列标准化为 |result-spantree|" -msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." -msgstr "这是可能的，因为原始图中的每个交叉点（顶点）现在都是完整的图，对于穿过该交叉点的每个可能的转弯都有一条新边。" +msgid "Transforms the input directed graph into the transitive closure of the graph." +msgstr "将输入有向图转换为图的传递闭包。" -msgid "This function is for **directed** graphs." -msgstr "该函数适用于 **有向** 图。" +msgid "Process is valid for directed graphs." +msgstr "过程对于有向图有效。" -msgid "Results are undefined when a negative vertex id is used in the input graph." -msgstr "当输入图中使用负顶点 id 时，结果是不确定的。" +msgid "The transitive closure of an undirected graph produces a cluster graph" +msgstr "无向图的传递闭包产生簇图" -msgid "Results are undefined when a duplicated edge id is used in the input graph." -msgstr "当输入图中使用重复的边 id 时，结果是不确定的。" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgstr "当无向图上的顶点属于同一连通分量时，就会发生它们之间的可达性。（参阅 :doc:`pgr_connectedComponents`）" -msgid "Running time: TBD" -msgstr "运行时间：TBD（待定）" +msgid "The returned values are not ordered" +msgstr "返回值未排序" -msgid "pgr_lineGraphFull(`Edges SQL`_)" -msgstr "pgr_lineGraphFull(`Edges SQL`_)" +msgid "The returned graph is compressed" +msgstr "返回的图形是压缩后的" -msgid "Returns set of |result-linegf|" -msgstr "返回 |result-linegf| 的集合" +msgid "Running time: :math:`O(|V||E|)`" +msgstr "运行时间： :math:`O(|V||E|)`" -msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" -msgstr "边 :math:`\\{4, 7, 8, 10\\}` 子图的全线图" +msgid "The pgr_transitiveClosure function has the following signature:" +msgstr "pgr_transitiveClosure 函数具有以下签名：" -msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." -msgstr "示例包含边线 4、7、8 和 10 构成的子图，且包含 ``reverse_cost`` 。" +msgid "pgr_transitiveClosure(`Edges SQL`_)" +msgstr "pgr_transitiveClosure(`Edges SQL`_)" -msgid "The data" -msgstr "数据" +msgid "Returns set of |result-closure|" +msgstr "返回集合 |result-closure|" -msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." -msgstr "此示例显示此图形转换如何为图形中的每个可能的转弯创建附加边。" +msgid "Rechability of a subgraph" +msgstr "子图的可达性" -msgid "|first|" -msgstr "|first|" +msgid "Identifier of the source of the edges" +msgstr "边来源的标识符" -msgid "first" -msgstr "首先" +msgid "``target_array``" +msgstr "``target_array``" -msgid "The transformation" -msgstr "转变" +msgid "Identifiers of the targets of the edges" +msgstr "边目标的标识符" -msgid "|second|" -msgstr "|second|" +msgid "Identifiers of the vertices that are reachable from vertex v." +msgstr "从顶点 v 可到达的顶点的标识符。" -msgid "second" -msgstr "第二" +msgid "`Boost: transitive closure `__" +msgstr "`Boost: 传递闭包 `__" -msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." -msgstr "在转换后的图中，原始图中的所有边仍然存在（黄色），但现在我们为跨顶点 7 的每个转弯提供了额外的边（橙色）。" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "Creating table that identifies transformed vertices" -msgstr "创建标识变换顶点的表" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" -msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." -msgstr "变换后的图中的每个顶点都是通过分割原始图中的顶点而创建的。 除非原始图中的某个顶点是叶顶点，否则它将在变换后的图中生成多个顶点。 转换后的图中新创建的顶点之一将被赋予与原始图中创建它的顶点相同的顶点标识符，但新创建的其余顶点将具有负顶点 id。" +msgid "``pgr_trsp`` - routing vertices with restrictions." +msgstr "``pgr_trsp`` - 有限制的路由顶点。" -msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" -msgstr "以下是如何生成一个表的示例，该表将新创建的顶点的 id 与创建它们的原始顶点进行映射" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid "Store edge results" -msgstr "存储边结果" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" -msgstr "第一步是将 ``pgr_lineGraphFull`` 调用的结果存储到表中" +msgid "pgr_trsp(One to One)" +msgstr "pgr_trsp(One to One)" -msgid "Create the mapping table" -msgstr "创建映射表" +msgid "pgr_trsp(One to Many)" +msgstr "pgr_trsp(One to Many)" -msgid "From the original graph's vertex information" -msgstr "从原始图的顶点信息" +msgid "pgr_trsp(Many to One)" +msgstr "pgr_trsp(Many to One)" -msgid "Add the new vertices" -msgstr "增加新的顶点" +msgid "pgr_trsp(Many to Many)" +msgstr "pgr_trsp(Many to Many)" -msgid "Filling the mapping table" -msgstr "填写映射表" +msgid "pgr_trsp(Combinations)" +msgstr "pgr_trsp （组合）" -msgid "The positive vertex identifiers are the original identifiers" -msgstr "正的顶点标识符是原始标识符" +msgid "Deprecated signatures" +msgstr "弃用签名" -msgid "Inspecting the vertices map" -msgstr "检查顶点图" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." -msgstr "当从源点到 ``target`` 没有旅行成本，并且源点具有原始值时，会出现自环。" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "Updating values from self loops" -msgstr "从自循环更新值" +msgid "New prototypes" +msgstr "新原型" -msgid "Inspecting the vertices table" -msgstr "检查顶点表" +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "Updating from inner self loops" -msgstr "从内部自我循环更新" +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" -msgid "Adding a soft restriction" -msgstr "添加软限制" +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgstr "转弯限制最短路径 (TRSP) 是一种以查询形式接收转弯限制的算法，就像在现实世界的可通航道路网络中发现的那样。" -msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." -msgstr "需要使用边 4 -> 7 从顶点 6 到顶点 3 的软限制。" +msgid "It does no guarantee the shortest path as it might contain restriction paths." +msgstr "它不保证最短路径，因为它可能包含限制路径。" -msgid "Identifying the restriction" -msgstr "识别限制条件" +msgid "The general algorithm is as follows:" +msgstr "通用算法如下：" -msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" -msgstr "运行 :doc:`pgr_dijkstraNear` 时，成本将会增加的地方是边 8，其成本为 0" +msgid "Execute a Dijkstra." +msgstr "执行 Dijkstra。" -msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" -msgstr "要更改的边是上一个查询中的 ``WHERE cost = 0 AND seq != 1 AND edge != -1`` ：" +msgid "If the solution passes thru a restriction then." +msgstr "如果解决方案通过了限制。" -msgid "Adding a value to the restriction" -msgstr "向限制添加值" +msgid "Execute the **TRSP** algorithm with restrictions." +msgstr "有限制地执行 **TRSP** 算法。" -msgid "Updating the cost to the edge:" -msgstr "将成本更新到边：" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "Routing from :math:`6` to :math:`3`" -msgstr "路由从 :math:`6` 到 :math:`3`" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex." -msgstr "现在，该路线不使用边 8，而是在叶顶点上进行 U 形转弯。" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "Simplifying leaf vertices" -msgstr "简化叶顶点" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "In this example, there is no additional cost for traversing a leaf vertex." -msgstr "在这个例子中，遍历叶顶点没有额外的成本。" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" -msgid "Using the vertex map give the leaf verices their original value." -msgstr "使用顶点图赋予叶顶点其原始值。" +msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." +msgstr "从无向图上的顶点 :math:`6` 到顶点 :math:`10`." -msgid "On the source column" -msgstr "在source 列" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgstr "无向图上从顶点 :math:`6` 到顶点 :math:`\\{10, 1\\}` 。" -msgid "On the target column" -msgstr "在target列" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgstr "有向图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`8`。" -msgid "Removing self loops on leaf nodes" -msgstr "删除叶节点上的自循环" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgstr "无向图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 8\\}`。" -msgid "The self loops of the leaf nodes are" -msgstr "叶节点的自循环为" +msgid "Using a combinations table on an undirected graph." +msgstr "在无向图上使用组合表。" -msgid "Which can be removed" -msgstr "哪些可以删除" +msgid "`Deprecated documentation `_" +msgstr "`已弃用文档 `_" -msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" -msgstr "现在可以使用 :doc:`pgr_dijkstra` 使用原始顶点 id 来完成路由" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" -msgid "Complete routing graph" -msgstr "完整的路由图" +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgstr "``pgr_trspVia`` 穿过有限制的顶点列表的路线。" -msgid "Add edges from the original graph" -msgstr "从原始图中添加边" +#, fuzzy +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgid "Add all the edges that are not involved in the line graph process to the new table" -msgstr "将所有不参与折线图过程的边添加到新表中" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "给定一个顶点列表和一个图，这个函数等同于在所有 :math:`i < size\\_of(via\\;vertices)` 的情况下找到从 :math:`vertex_i` 到 :math:`vertex_{i+1}` 的最短路径，尽量避免使用受限路径。" -msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "一些获取边新标识符的管理任务" +msgid "The paths represents the sections of the route." +msgstr "路径代表路线的各个部分。" -msgid "Add the newly calculated edges" -msgstr "添加新计算的边" +msgid "Execute a :doc:`pgr_dijkstraVia`." +msgstr "执行 :doc:`pgr_dijkstraVia`。" -msgid "Using the routing graph" -msgstr "使用路由图" +msgid "For the set of sub paths of the solution that pass through a restriction then" +msgstr "对于通过限制的解决方案的子路径集，则" -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "当使用这种方法进行具有软限制的路由时，将会出现 uturn" +msgid "Execute the **TRSP** algorithm with restrictions for the paths." +msgstr "执行对路径有限制的 **TRSP** 算法。" -msgid "Routing from :math:`5` to :math:`1`" -msgstr "路由从 :math:`5` 到 :math:`1`" +msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." +msgstr "**注意**，完成此操作后， ``U_turn_on_edge`` 标志将被忽略。" -msgid "https://en.wikipedia.org/wiki/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgstr "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgstr "所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}` 的路线。" -msgid "``pgr_makeConnected`` - Experimental" -msgstr "``pgr_makeConnected`` - 实验性" +msgid "Simulation of how algorithm works." +msgstr "模拟算法的工作原理。" -msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." -msgstr "``pgr_makeConnected`` — 连接图的边集。" +msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" +msgstr "该算法执行 :doc:`pgr_dijkstraVia`" -msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." -msgstr "添加使输入图连接所需的最小边数。 该算法首先识别图中的所有连接组件，然后添加边以将这些组件在路径中连接在一起。 例如，如果一个图包含三个连通分量 A、B 和 C，则 make_connected 将添加两条边。 添加的两条边可能包括一条连接 A 中的顶点与 B 中的顶点的边，以及一条连接 B 中的顶点与 C 中的顶点的边。" +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +msgstr "检测哪些子路径通过了限制，本例中是针对 ``path_id = 5`` 从 ``6`` 到 ``3`` ，因为该路径 :math:`15 \\rightarrow 1` 受到限制。" -msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." -msgstr "它将给出图中连接它所需的所有边的最小列表。" +msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." +msgstr "执行 :doc:`pgr_trsp` 针对冲突路径建议的算法。" -msgid "The algorithm does not considers geometric topology in the calculations." -msgstr "该算法在计算中不考虑遍历成本。" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "从 :doc:`pgr_dijkstraVia` 提议的结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 提议的算法的结果构建解决方案：" -msgid "pgr_makeConnected(`Edges SQL`_)" -msgstr "pgr_makeConnected(`Edges SQL`_)" +msgid "Getting the same result as ``pgr_trspVia``:" +msgstr "得到与 ``pgr_trspVia`` 相同的结果：" -msgid "Returns set of |result-component-make|" -msgstr "返回结果 |result-component-make|" +msgid "Example 8" +msgstr "示例 8" -msgid "List of edges that are needed to connect the graph." -msgstr "连接图形所需的边线列表。" +msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." +msgstr "有时，当设置为 ``false`` 时， ``U_turn_on_edge`` 标志会被忽略。" -msgid "`Boost: make connected `__" -msgstr "`Boost: 使图连通 `__" +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." +msgstr "第一步，进行 :doc:`pgr_dijkstraVia` 不考虑在同一边上掉头。 但路径 :math:`16 \\rightarrow 13` （第 4 行和第 5 行）受到限制，结果正在使用它。" -msgid "``pgr_maxCardinalityMatch``" -msgstr "``pgr_maxCardinalityMatch``" +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "当执行 :doc:`pgr_trsp` 针对冲突路径的算法时，没有 ``U_turn_on_edge`` 标志。" -msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." -msgstr "``pgr_maxCardinalityMatch`` — 计算图中的最大基数匹配。." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." +msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` 标志。" -msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." -msgstr "pgr_maxCardinalityMatch(text) 只返回 ``edge`` 列。" +msgid ":doc:`via-category`" +msgstr ":doc:`via-category`" -msgid "Deprecated signature" -msgstr "已弃用的签名" +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" -msgid "directed => ``false`` when used." -msgstr "使用时 directed => ``false`` 。" +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." +msgstr "``pgr_trspVia_withPoints`` - 经过一系列具有限制的顶点和/或点的路线。" -msgid "Renamed from ``pgr_maximumCardinalityMatching``" -msgstr "从 ``pgr_maximumCardinalityMatching`` 重命名" +#, fuzzy +msgid "**Driving side** parameter is positional unnamed." +msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" -msgid "A matching or independent edge set in a graph is a set of edges without common vertices." -msgstr "图中的匹配或独立边集是一组没有公共顶点的边。" +#, fuzzy +msgid "Valid values depend on kind of graph" +msgstr "有效值因有向图和无向图而异：" -msgid "A maximum matching is a matching that contains the largest possible number of edges." -msgstr "最大匹配是包含尽可能多的边的匹配。" +#, fuzzy +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "There may be many maximum matchings." -msgstr "可能有很多最大匹配。" +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "给定一个图、对图边的一组限制、图边上的一组点和一个顶点列表，该函数相当于查找 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:`vertex` 可以是图上的顶点或点） 对于所有 :math:`i < size\\_of(via\\;vertices)` 尝试不使用受限路径的人。" -msgid "Calculates one possible maximum cardinality matching in a graph." -msgstr "计算图中一种可能的最大基数匹配。" +msgid "is a sequence of paths" +msgstr "是一系列路径" -msgid "Running time: :math:`O( E*V * \\alpha(E,V))`" -msgstr "运行时间： :math:`O( E*V * \\alpha(E,V))`" +msgid "Build the Graph with the new points." +msgstr "用新点构建图表。" -msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_." -msgstr ":math:`\\alpha(E,V)` 与 `Ackermann function`_ 相反。" +msgid "The points identifiers will be converted to negative values." +msgstr "点标识符将转换为负值。" -msgid "pgr_maxCardinalityMatch(`Edges SQL`_)" -msgstr "pgr_maxCardinalityMatch(`Edges SQL`_)" +msgid "The vertices identifiers will remain positive." +msgstr "顶点标识符将保持正值。" -msgid "Using all edges." -msgstr "使用所有边。" +msgid "Execute a :doc:`pgr_withPointsVia`." +msgstr "执行 :doc:`pgr_withPointsVia`。" -msgid "SQL query, which should return a set of rows with the following columns:" -msgstr "SQL 查询，应返回一组包含以下列的行：" +msgid "For the set of paths of the solution that pass through a restriction then" +msgstr "对于通过限制的解决方案的路径集合，则" -msgid "A positive value represents the existence of the edge (``source``, ``target``)." -msgstr "正值表示存在边 (``source``, ``target``) 。" +msgid "Execute the **TRSP** algorithm with restrictions for the path." +msgstr "执行对路径有限制的 **TRSP** 算法。" -msgid "A positive value represents the existence of the edge (``target``, ``source``)" -msgstr "正值表示存在边 (``target``, ``source``)" +msgid "Do not use negative values on identifiers of the inner queries." +msgstr "不要在内部查询的标识符上使用负值。" -msgid "Identifier of the edge in the original query." -msgstr "原始查询中边的标识符。" +#, fuzzy +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**options**])" -msgid "`Boost: maximum_matching `__" -msgstr "`Boost: 最大匹配 `__" +#, fuzzy +msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" +msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" -msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." +msgstr "在有向图上查找按顺序访问顶点 :math:`\\{-6, 15, -5\\}` 的路线。" -msgid "https://en.wikipedia.org/wiki/Ackermann_function" -msgstr "https://en.wikipedia.org/wiki/Ackermann_function" +msgid "When positive it is considered a vertex identifier" +msgstr "当为正时，它被视为顶点标识符" -msgid "``pgr_maxFlow``" -msgstr "``pgr_maxFlow``" +msgid "When negative it is considered a point identifier" +msgstr "当负数时，它被认为是一个点标识符" -msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." -msgstr "``pgr_maxFlow`` — 使用 Push Relabel 算法计算有向图中从源到目标的最大流量。" +#, fuzzy +msgid "[**driving side**]" +msgstr "**driving side**" -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(组合)" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" +msgstr "值在 [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] 中表示驾驶的一侧是：" -msgid "Calculates the maximum flow from the sources to the targets." -msgstr "计算从源头到目标的最大流量。" +#, fuzzy +msgid "For directed graph:" +msgstr "有向图。" -msgid "When the maximum flow is **0** then there is no flow and **0** is returned." -msgstr "当最大流量为 **0** 时则没有流量，返回 **0** 。" +#, fuzzy +msgid "[``r``, ``R``] for right driving side" +msgstr "``r``, ``R`` 表示右侧驾驶，" -msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." -msgstr "使用 :doc:`pgr_pushRelabel ` 算法。" +#, fuzzy +msgid "[``l``, ``L``] for left driving side" +msgstr "``l``, ``L`` 表示左侧驾驶。" -msgid "Running time: :math:`O( V ^ 3)`" -msgstr "运行时间： :math:`O( V ^ 3)`" +#, fuzzy +msgid "For undirected graph:" +msgstr "在无向图上：" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +#, fuzzy +msgid "[``b``, ``B``] for both driving sides" +msgstr "``l``, ``L`` 表示左侧驾驶。" -msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Default values when parameter is missing:" +msgstr "" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +#, fuzzy +msgid "[``r``, ``R``] for directed graph" +msgstr "[``b``, ``B``] 表示两侧通行（仅适用于无向图）" -msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +#, fuzzy +msgid "[``l``, ``L``] for undirected graph" +msgstr "[``b``, ``B``] 表示两侧通行（仅适用于无向图）" -msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgid "With points optional parameters" +msgstr "带点可选参数" -msgid "RETURNS ``BIGINT``" -msgstr "返回 ``BIGINT``" +msgid "``details``" +msgstr "``details``" -msgid "Maximum flow possible from the source(s) to the target(s)" -msgstr "从 source(s)到 target(s)的可能最大流量" +msgid "For showing points stops." +msgstr "" -msgid "`Boost: push relabel max flow `__" -msgstr "`Boost: 推-重标最大流算法 `__" +msgid "When ``true`` the results will include the points that are in the path." +msgstr "如果为 ``true`` ，结果将包括路径中的点。" -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "When ``false`` the results will not include the points that are in the path." +msgstr "如果为 ``false`` ，结果将不包括路径中的点。" -msgid "``pgr_maxFlowMinCost`` - Experimental" -msgstr "``pgr_maxFlowMinCost`` - 实验性" +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgstr "当 ``start_vid`` 、 ``end_vid`` 和 ``node`` 列具有负值时，该标识符用于Point。" -msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" -msgstr "``pgr_maxFlowMinCost`` — 计算图上最大流的总成本最小化的边" +msgid "Use ``pgr_findCloseEdges`` for points on the fly" +msgstr "对动态点使用 ``pgr_findCloseEdges``" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "pgr_maxFlowMinCost(组合)" +msgid "Using :doc:`pgr_findCloseEdges`:" +msgstr "使用 :doc:`pgr_findCloseEdges`:" -#, fuzzy -msgid "|Boost| Boost Graph Inside." -msgstr "|Boost| Boost 图内部" +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." +msgstr "从顶点 :math:`1` 开始，按照距离图形最近的顺序访问点 `(2.9, 1.8)` 上的两个位置。" -msgid "**TODO** check which statement is true:" -msgstr "**TODO** 检查哪个陈述是正确的：" +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgstr "点 :math:`-1`对应于距离点`(2.9, 1.8)` 最近的边。" -msgid "The cost value of all input edges must be nonnegative." -msgstr "所有输入边的成本值必须是非负的。" +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgstr "点 :math:`-2`对应于点`(2.9, 1.8)` 的下一个闭合边。" -msgid "Process is done when the cost value of all input edges is nonnegative." -msgstr "当所有输入边的成本值为非负时，处理完成。" +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgstr "点 :math:`-2`在从顶点 :math:`1` 到点 :math:`-1` 的路线上被访问（参见行 ，其中:math:`seq = 4`）。" -msgid "Process is done on edges with nonnegative cost." -msgstr "过程是在具有非负成本的边上完成的。" +msgid "Usage variations" +msgstr "用法变化" -msgid "Running time: :math:`O(U * (E + V * logV))`" -msgstr "运行时间： :math:`O(U * (E + V * logV))`" +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +msgstr "所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{-6, 7, -4, 8, -2\\}` 的路线。" -msgid "where :math:`U` is the value of the max flow." -msgstr "其中 :math:`U` 是最大流量的值。" +msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." +msgstr "节点、点的\"通过\"或\"访问\"状态。" -msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." -msgstr ":math:`U`是迭代次数的上限。 在许多现实世界的情况下，迭代次数远小于 :math:`U` 。" +msgid "The algorithm performs a :doc:`pgr_withPointsVia`" +msgstr "该算法执行 :doc:`pgr_withPointsVia`" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgstr "检测哪些路径通过了限制，在本例中是针对从 ``-6`` 到 ``15`` 的 ``path_id = 1`` ，因为路径 :math:`9 \\rightarrow 16` 受到限制。" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgstr "对冲突路径执行 :ref:`TRSP-family:TRSP algorithm`。" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "从 :doc:`pgr_withPointsVia` 的结果中移除冲突的路径，并使用 :doc:`pgr_trsp` 算法的结果构建解决方案：" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Getting the same result as ``pgr_trspVia_withPoints``:" +msgstr "得到与 ``pgr_trspVia_withPoints`` 相同的结果：" -msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgstr "第一步，执行 :doc:`pgr_withPointsVia` 不考虑在同一条边上进行掉头。但是路径 :math:`9 \\rightarrow 16` （第4行和第5行）受到限制，结果中使用了它。" -msgid "Returns set of |result-flow-mincost|" -msgstr "返回 |result-flow-mincost| 的集合" +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "当执行 :doc:`pgr_trsp_withPoints` 针对冲突路径的算法时，没有 ``U_turn_on_edge`` 标志。" -msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" -msgstr "``pgr_maxFlowMinCost_Cost`` - 实验性" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` 标志。 从 :doc:`pgr_withPointsVia` 结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 算法的结果构建解决方案。 在这种情况下，使用相同的边缘完成 U 形转弯。" -msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" -msgstr "``pgr_maxFlowMinCost_Cost`` — 计算图上最大流量的最小总成本" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "pgr_maxFlowMinCost_Cost(组合)" +msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." +msgstr "``pgr_trsp_withPoints`` 有限制的路由顶点/点。" -msgid "**The cost value of all input edges must be nonnegative.**" -msgstr "**所有输入边的成本值必须是非负的。**" +#, fuzzy +msgid "**Driving side** parameter is positional unnamed and compulsory." +msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" -msgid "When the maximum flow is 0 then there is no flow and **0** is returned." -msgstr "当最大流量为0时则没有流量，返回 **0** 。" +#, fuzzy +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Uses :doc:`pgr_maxFlowMinCost`." -msgstr "使用 :doc:`pgr_maxFlowMinCost`。" +#, fuzzy +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +#, fuzzy +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +#, fuzzy +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +#, fuzzy +msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +#, fuzzy +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgid "Vertices of the graph are:" +msgstr "图的顶点是：" -msgid "RETURNS FLOAT" -msgstr "RETURNS FLOAT" +msgid "**positive** when it belongs to the `Edges SQL`_" +msgstr "当它属于 `Edges SQL`_ 时为 **正**" -msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" -msgstr "从source(s) 到target(s)的最小成本最大流量" +msgid "**negative** when it belongs to the `Points SQL`_" +msgstr "当它属于 `Points SQL`_ 为 **负**" -msgid "``pgr_pickDeliver`` - Experimental" -msgstr "``pgr_pickDeliver`` - 实验性" +msgid "The `agg_cost` in the non included values `(v, v)` is `0`" +msgstr "非包含值 `(v, v)` 中的 `agg_cost` 为 `0`" -msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" -msgstr "``pgr_pickDeliver`` - 接送车辆路径问题" +msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" +msgstr "非包含值 `(u, v)` 中的 `agg_cost` 为 :math:`\\infty`" -msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." -msgstr "问题：将取货-送货对分配并优化到车队中。" +#, fuzzy +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgstr "出于优化目的， `start vids` 或`end vids`中的任何重复值都将被忽略。" -msgid "Optimization problem is NP-hard." -msgstr "优化问题是NP-hard。" +msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgstr "运行时间： :math:`O(|start\\_vids|\\times(V \\log V + E))`" -msgid "pickup and Delivery with time windows." -msgstr "有时间窗口的取货和送货。" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" -msgid "All vehicles are equal." -msgstr "所有车辆都是平等的。" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Same Starting location." -msgstr "相同的起始位置。" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" -msgid "Same Ending location which is the same as Starting location." -msgstr "相同的结束位置与开始位置相同。" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" -msgid "All vehicles travel at the same speed." -msgstr "所有车辆以相同的速度行驶。" +#, fuzzy +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**options**])" -msgid "A customer is for doing a pickup or doing a deliver." -msgstr "客户负责提货或送货。" +msgid "**options:** ``[directed, details]``" +msgstr "**options:** ``[directed, details]``" -msgid "has an open time." -msgstr "有开放时间。" +#, fuzzy +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" -msgid "has a closing time." -msgstr "有关闭时间。" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "无向图上的点 :math:`1` 到点 :math:`3` 和顶点 :math:`7`" -msgid "has a service time." -msgstr "有服务时间。" +#, fuzzy +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgstr "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细信息。" -msgid "has an (x, y) location." -msgstr "具有 (x, y) 位置。" +#, fuzzy +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgstr "从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 和顶点 :math:`1`。" -msgid "There is a customer where to deliver a pickup." -msgstr "有客户需要送货。" +msgid "Two combinations" +msgstr "两种组合" -msgid "travel time between customers is distance / speed" -msgstr "客户之间的旅行时间是距离/速度" +#, fuzzy +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgstr "从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右侧** 行驶。" -msgid "pickup and delivery pair is done with the same vehicle." -msgstr "取货和送货是使用同一辆车完成的。" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." +msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 。" -msgid "All trucks depart at time 0." -msgstr "所有卡车均在时间 0 出发。" +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "找到从顶点 :math:`1` 到点 `(2.9, 1.8)` 图上两个最近位置的路线。" -msgid "the algorithm will raise an exception when" -msgstr "该算法将在以下情况下引发异常" +#, fuzzy +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgstr "所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的旅行" -msgid "If there is a pickup-deliver pair than violates time window" -msgstr "如果存在违反时间窗口的取货-送货对" +msgid "Passes in front or visits with right side driving." +msgstr "从前方超车或右侧行驶来访。" -msgid "The speed, max_cycles, ma_capacity have illegal values" -msgstr "speed、max_cycles、ma_capacity 具有非法值" +msgid "For point :math:`6` and vertex :math:`11`." +msgstr "对于点 :math:`6` 和顶点 :math:`11` 。" -msgid "Six different initial will be optimized - the best solution found will be result" -msgstr "将优化六个不同的初始值 - 找到的最佳解决方案将是结果" +msgid "Passes in front or visits with left side driving." +msgstr "从前方超车或以左侧驾驶方式行驶。" -msgid "Signature" -msgstr "标识" +msgid "``pgr_turnRestrictedPath`` - Experimental" +msgstr "``pgr_turnRestrictedPath`` - 实验性" -msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" -msgstr "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgstr "``pgr_turnRestrictedPath`` 使用 Yen 算法进行带有限制的顶点到顶点路径规划" -msgid "**options:** ``[factor, max_cycles, initial_sol]``" -msgstr "**options:** ``[factor, max_cycles, initial_sol]``" +#, fuzzy +msgid "Output columns standardized to |nksp-result|" +msgstr "输出列是 |ksp-result|" -msgid "Returns set of |result-pickdrop|" -msgstr "返回 |result-pickdrop| 的集合" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" +msgstr "利用Yen算法获得K条最短路径并对路径进行分析以选择不使用限制的路径" -msgid "Solve the following problem" -msgstr "解决以下问题" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgid "Given the vehicles:" -msgstr "给定车辆：" +msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +msgstr "**options:** ``[directed, heap_paths, stop_on_first, strict]``" -msgid "and the orders:" -msgstr "和顺序：" +msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" +msgstr "从有向图上的顶点 :math:`3` 到顶点 :math:`8`" -msgid "The parameters are:" -msgstr "参数是：" +msgid "Special optional parameters" +msgstr "特殊可选参数" -msgid "A `SELECT` statement that returns the following columns:" -msgstr "返回以下列的 `SELECT` 语句：" +msgid "``stop_on_first``" +msgstr "``stop_on_first``" -msgid "id, demand" -msgstr "id, demand" +msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgstr "当 ``true`` 停止在发现不违反限制的第一条路径上时" -msgid "p_node_id, p_open, p_close, [p_service,]" -msgstr "p_node_id, p_open, p_close, [p_service,]" +msgid "When ``false`` returns at most K paths" +msgstr "当 ``false`` 时返回最多 K 条路径" -msgid "d_node_id, d_open, d_close, [d_service,]" -msgstr "d_node_id, d_open, d_close, [d_service,]" +msgid "When ``true`` returns only paths that do not violate restrictions" +msgstr "当 ``true`` 时仅返回不违反限制的路径" -msgid "id, capacity" -msgstr "id, capacity" +msgid "When ``false`` returns the paths found" +msgstr "当 ``false`` 返回找到的路径" -msgid "start_node_id, start_open, start_close [, start_service,]" -msgstr "start_node_id, start_open, start_close [, start_service,]" +msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." +msgstr "从顶点 :math:`3` 到 :math:`8`，并启用 ``strict`` 标志。" -msgid "[end_node_id, end_open, end_close, end_service]" -msgstr "[end_node_id, end_open, end_close, end_service]" +msgid "No results because the only path available follows a restriction." +msgstr "没有结果，因为唯一可用的路径受到限制。" -msgid "``pgr_pickDeliverEuclidean`` - Experimental" -msgstr "``pgr_pickDeliverEuclidean`` - 实验性" +msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" +msgstr "从无向图上的顶点 :math:`3` 到顶点 :math:`8`" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" -msgstr "``pgr_pickDeliverEuclidean`` - 取货和送货车辆路径问题" +msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" +msgstr "从顶点 :math:`3` 到顶点 :math:`8` 更多选择" -msgid "Replaces ``pgr_gsoc_vrppdtw``" -msgstr "替换 ``pgr_gsoc_vrppdtw``" +msgid "``pgr_version``" +msgstr "``pgr_version``" -msgid "Pickup and Delivery:" -msgstr "取货和送货：" +msgid "``pgr_version`` — Query for pgRouting version information." +msgstr "``pgr_version`` — 查询pgRouting版本信息。" -msgid "capacitated" -msgstr "带容量限制的" +msgid "Breaking change on result columns" +msgstr "结果列的重大变化" -msgid "with time windows." -msgstr "有时间窗口的。" +msgid "Support for old signature ends" +msgstr "对旧签名的支持结束" -msgid "have (x, y) start and ending locations." -msgstr "有 (x, y) 开始和结束位置。" +msgid "Returns pgRouting version information." +msgstr "返回 pgRouting 版本信息。" -msgid "have a start and ending service times." -msgstr "有开始和结束服务时间。" +msgid "pgr_version()" +msgstr "pgr_version()" -msgid "An order is for doing a pickup and a a deliver." -msgstr "订单用于取货和送货。" +msgid "RETURNS ``TEXT``" +msgstr "返回 ``TEXT``" -msgid "has (x, y) pickup and delivery locations." -msgstr "有 (x, y) 个取货和送货地点。" +msgid "pgRouting Version for this documentation" +msgstr "本文档的 pgRouting 版本" -msgid "has opening and closing times for the pickup and delivery locations." -msgstr "有提货和送货地点的开放和关闭时间。" +msgid "``pgr_vrpOneDepot`` - Experimental" +msgstr "``pgr_vrpOneDepot`` - 实验性" -msgid "has a pickup and deliver service times." -msgstr "有取货和送货服务时间。" +msgid "**No documentation available**" +msgstr "**无可用文档**" -msgid "Six different optional different initial solutions" -msgstr "六种不同的可选不同初始解决方案" +msgid "**TBD**" +msgstr "**TBD**" -msgid "the best solution found will be result" -msgstr "找到的最佳解决方案将作为结果" +msgid "TBD" +msgstr "TBD" -msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" -msgstr "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgstr "``pgr_withPoints`` - 返回图中带有附加临时顶点的最短路径。" -msgid "p_x, p_y, p_open, p_close, [p_service,]" -msgstr "p_x, p_y, p_open, p_close, [p_service,]" +#, fuzzy +msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "d_x, d_y, d_open, d_close, [d_service]" -msgstr "d_x, d_y, d_open, d_close, [d_service]" +#, fuzzy +msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "start_x, start_y, start_open, start_close [, start_service, ]" -msgstr "start_x, start_y, start_open, start_close [, start_service, ]" +#, fuzzy +msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "[ end_x, end_y, end_open, end_close, end_service ]" -msgstr "[ end_x, end_y, end_open, end_close, end_service ]" +#, fuzzy +msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" -msgstr "此数据示例 **lc101** 来自 https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/ 上发布的数据" +#, fuzzy +msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "There are 25 vehicles in the problem all with the same characteristics." -msgstr "问题中有 25 辆具有相同特征的汽车。" +msgid "pgr_withPoints(Combinations)" +msgstr "pgr_withPoints（组合）" -msgid "The original orders" -msgstr "原始订单" +#, fuzzy +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" -msgid "The data comes in different rows for the pickup and the delivery of the same order." -msgstr "对于同一订单的取货和配送，数据位于不同的行中。" +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "The original data needs to be converted to an appropriate table:" -msgstr "需要将原始数据转换为适当的表格：" +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "The query" -msgstr "查询" +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" -msgstr "仅显示相关信息，以便与 https://www.sintef.no/projectweb/top/pdptw/100-customers/ 上发布的最佳解决方案信息进行比较" +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "The best solution found for **lc101** is a travel time: 828.94" -msgstr "找到的 **lc101** 的最佳解是行程时间：828.94" +#, fuzzy +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" -msgid "This implementation's travel time: 854.54" -msgstr "此实施的行程时间：854.54" +#, fuzzy +msgid "**options:** ``[directed, details])``" +msgstr "**options:** ``[directed, details]``" -msgid "``pgr_prim``" -msgstr "``pgr_prim``" +#, fuzzy +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." -msgstr "``pgr_prim`` — 使用 Prim 算法的图的最小生成森林。" +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgstr "路径起始顶点的标识符。 负值用于点的标识符。" -msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." -msgstr "该算法使用 Prim 算法在可能断开的图中找到最小生成森林。" +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgstr "起始顶点的标识符数组。 负值用于点的标识符。" -msgid "Prim's running time: :math:`O(E * log V)`" -msgstr "Prim运行时间： :math:`O(E * log V)`" +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgstr "路径结束顶点的标识符。 负值用于点的标识符。" -msgid "pgr_prim(`Edges SQL`_)" -msgstr "pgr_prim(`Edges SQL`_)" +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +msgstr "结束顶点的标识符数组。 负值用于点的标识符。" -msgid "Minimum spanning forest of a subgraph" -msgstr "子图的最小生成森林" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的旅行" -msgid "`Boost: Prim's algorithm documentation `__" -msgstr "`Boost: Prim算法文档 `__" +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." +msgstr "``pgr_withPointsCost`` - 计算最短路径，并只返回所给点组合的最短路径的总成本。" -msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_primBFS`` — Prim 的深度优先搜索排序最小生成树算法。" +#, fuzzy +msgid "**Driving side** parameter is unnamed and compulsory." +msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" -msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." -msgstr "访问并提取使用 Prims 算法创建的最小生成树的 Breath First Search 排序中的节点信息。" +#, fuzzy +msgid "Output columns standardized to |matrix-result|" +msgstr "输出列是 |ksp-result|" -msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +#, fuzzy +msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +msgstr "_pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +#, fuzzy +msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +msgstr "_pgr_trsp(text,text,anyarray,bigint,boolean)" -msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." -msgstr "``pgr_primDD`` — 使用 Prim 算法的集水区节点。" +#, fuzzy +msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" -msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." -msgstr "使用 Prim 算法，从计算出最小生成树中提取出那些与根节点（或根节点组）之间的聚合成本小于或等于某个距离的节点。" +#, fuzzy +msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +#, fuzzy +msgid "pgr_withpointscost(text,text,text,boolean,character)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgid "pgr_withPointsCost(Combinations)" +msgstr "pgr_withPointsCost（组合）" -msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." -msgstr "``pgr_primDFS`` — 具有深度优先搜索排序的最小生成树的 Prim 算法。" +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." +msgstr "修改图形以包含由 points_sql 定义的点。使用 Dijkstra 算法，只返回找到的最短路径的总成本。" -msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." -msgstr "访问并提取使用 Prims 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgstr "返回修改图中顶点对组合的最短路径成本之和。" -msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +#, fuzzy +msgid "The returned values are in the form of a set of |matrix-result|." +msgstr "返回值的形式为一组`(start_vid, end_vid, agg_cost)` 。" -msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgid "**positive** when it belongs to the edges_sql" +msgstr "当它属于edges_sql时为 **正**" -msgid "``pgr_pushRelabel``" -msgstr "``pgr_pushRelabel``" +msgid "**negative** when it belongs to the points_sql" +msgstr "当它属于 points_sql时为 **负**" -msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." -msgstr "``pgr_pushRelabel`` — 使用 Push Relabel 算法计算图边上的流量，以最大化从源到目标的流量。" +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgstr "如果返回的值存储在表中，则唯一索引将是这一对： `(start_vid, end_vid)` 。" -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(组合)" +msgid "For **undirected** graphs, the results are **symmetric**." +msgstr "对于 **无向** 图，结果是 **对称** 的。" -msgid "Renamed from ``pgr_maxFlowPushRelabel``" -msgstr "由 ``pgr_maxFlowPushRelabel`` 重命名" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +#, fuzzy +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" -msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +#, fuzzy +msgid "**options:** ``[directed]``" +msgstr "**options:** ``[directed, cap]``" -msgid "``pgr_separateCrossing``" -msgstr "``pgr_separateCrossing``" +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgstr "与 withPoints 函数系列的其他成员不同，没有 **详细信息** 标志。" -msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." -msgstr "``pgr_separateCrossing`` - 从交叉几何图形生成不交叉的几何图形。" +#, fuzzy +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" -msgid "Proposed function." -msgstr "提议的函数。" +#, fuzzy +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgstr "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细信息。" -msgid "This is an auxiliary function for separating crossing edges." -msgstr "这是一个用于分离交叉边线的辅助函数。" +#, fuzzy +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgstr "从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右侧** 行驶。" -msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "求从顶点 :math:`1` 到图中点 `(2.9, 1.8)` 的两个最近位置的路线成本。" -msgid "RETURNS |result-separate|" -msgstr "返回 |result-separate|" +msgid "Being close to the graph does not mean have a shorter route." +msgstr "靠近图表并不意味着路线更短。" -msgid "Get the segments of the crossing geometries" -msgstr "获取交叉点几何形状的线段" +msgid "Right side driving topology" +msgstr "右侧驾驶拓扑" -msgid "``tolerance``" -msgstr "``tolerance``" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "从点 :math:`1` 和顶点 :math:`5` 出发，前往点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}`" -msgid "0.01" -msgstr "0.01" +msgid "Left side driving topology" +msgstr "左侧驾驶拓扑" -msgid "Used in ST_Snap before ST_Split" -msgstr "在 ST_Split 前使用 ST_Snap" +msgid "Does not matter driving side driving topology" +msgstr "与驱动端驱动拓扑无关" -msgid "Get the code for further refinement." -msgstr "获取进一步完善的代码。" +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgstr "``pgr_withPointsCostMatrix`` - 使用 :doc:`pgr_withPoints` 计算成本矩阵。" -msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." -msgstr "当由于最终应用或数据质量需要特别处理时，可以通过在 PostgreSQL 中使用 ``NOTICE`` 和 ``dryrun`` 标志来获取代码。" +#, fuzzy +msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "``pgr_separateTouching``" -msgstr "``pgr_separateTouching``" +#, fuzzy +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**options**])" -msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" -msgstr "``pgr_separateTouching`` - 将相互接触的几何图形转换为端点正确连接的几何图形" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgstr "**无向** 图上的点 :math:`\\{1, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的成本矩阵" -msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." -msgstr "此辅助函数用于处理几何图形相互接触但未共享端点的情况，通过在相交点处分割图形来增强网络连通性。" +msgid "Returning a **symmetrical** cost matrix" +msgstr "返回 **对称** 成本矩阵" -msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" -msgstr "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgid "Using the default ``side`` value on the **points_sql** query" +msgstr "在 **points_sql** 查询上使用默认 ``side`` 值" -msgid "``pgr_sequentialVertexColoring`` - Proposed" -msgstr "``pgr_sequentialVertexColoring`` - 提议中" +#, fuzzy +msgid "Using the default ``driving side`` value" +msgstr "使用默认 ``driving_side`` 值" -msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." -msgstr "``pgr_sequentialVertexColoring`` — 使用贪婪方法返回无向图的顶点着色。" +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "求从顶点 :math:`1` 到图上点 `(2.9, 1.8)` 的两个最近位置的路线的矩阵成本。" -msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." -msgstr "顺序顶点着色算法是一种图着色算法，其中颜色标识符以顺序方式分配给图的顶点，使得没有边连接两个相同颜色的顶点。" +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." +msgstr "``pgr_withPointsDD`` - 返回从起点开始的行驶 **距离** 。" -msgid "The implementation is applicable only for **undirected** graphs." -msgstr "该实现仅适用于 **无向** 图。" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "Provides the color to be assigned to all the vertices present in the graph." -msgstr "提供要分配给图中存在的所有顶点的颜色。" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Color identifiers values are in the Range :math:`[1, |V|]`" -msgstr "颜色标识符值在范围 :math:`[1, |V|]` 内" +#, fuzzy +msgid "Output columns standardized to |result-spantree|" +msgstr "新的输出列是 |result-spantree|" -msgid "The algorithm tries to assign the least possible color to every vertex." -msgstr "该算法尝试为每个顶点分配尽可能少的颜色。" +msgid "When ``details`` is ``false``:" +msgstr "当 ``details`` 为 ``false`` 时：" -msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." -msgstr "高效的图着色是一个 NP 困难问题，因此，该算法并不总是产生最佳着色。 它遵循贪婪策略，依次迭代所有顶点，并将其邻居未使用的最小可能颜色分配给每个顶点。" +#, fuzzy +msgid "Points reached within the distance are not included." +msgstr "只有那些被访问的兴趣点会被移除，也就是说，位于一定距离范围内被到达的兴趣点会被包含在内" -msgid "The returned rows are ordered in ascending order of the vertex value." -msgstr "返回的行按顶点值的升序排列。" +#, fuzzy +msgid "Deprecated signatures:" +msgstr "弃用签名" -msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" -msgstr "顺序顶点着色运行时间： :math:`O(|V|*(d + k))`" +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgstr "修改图以包含点，并使用 Dijkstra 算法，提取成本小于或等于距起点 ``**距离**`` 值的所有节点和点。 提取的边将符合相应的生成树。" -msgid ":math:`d` is the maximum degree of the vertices in the graph," -msgstr ":math:`d` 是图中顶点的最大度数，" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" -msgid ":math:`k` is the number of colors used." -msgstr ":math:`k` 是使用的颜色数量。" +#, fuzzy +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" -msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" -msgstr "pgr_sequentialVertexColoring(`Edges SQL`_)" +msgid "**options A:** ``[directed, details]``" +msgstr "**options A:** ``[directed, details]``" -msgid "`Boost: Sequential Vertex Coloring `__" -msgstr "`Boost: 顺序顶点着色 `__" +msgid "**options B:** ``[directed, details, equicost]``" +msgstr "**options B:** ``[directed, details, equicost]``" #, fuzzy -msgid "``pgr_sloanOrdering`` - Experimental" -msgstr "``pgr_edgeColoring`` - 实验性" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" + +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgstr "右侧驾驶拓扑，从点 :math:`1` 开始，距离不超过 :math:`3.3`，并提供详细信息。" #, fuzzy -msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" -msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" -msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." -msgstr "" +msgid "**options:** ``[directed, details, equicost]``" +msgstr "**options:** ``[directed, details, equicost]``" -msgid "Finds a pseudoperipheral vertex pair to determine good starting points" -msgstr "" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgstr "从点 :math:`1` 和顶点 :math:`16` 出发，在有向图上以 ``equicost`` 模式，在距离不超过 :math:`3.3` 的范围内" -msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." -msgstr "" +msgid "Negative values represent a point" +msgstr "负值代表一个点" -msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." -msgstr "" +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "求图上点 `(2.9, 1.8)` 距离最近的两个位置的行驶距离。" -msgid "Typically produces better orderings than simple breadth-first approaches." -msgstr "" +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgstr "点 :math:`-1` 对应距离点 :math:`(2.9, 1.8)` 最近的边。" -msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." -msgstr "" +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgstr "点 :math:`-2` 对应于点 :math:`(2.9, 1.8)` 的下一条近边。" -#, fuzzy -msgid "pgr_sloanOrdering(`Edges SQL`_)" -msgstr "pgr_edgeColoring(`Edges SQL`_)" +msgid "Driving side does not matter" +msgstr "驾驶侧并不重要" -msgid ":Example : Sloan ordering without specifying start vertex" -msgstr "" +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgstr "从点 :math:`1` 开始，在距离不超过 :math:`3.3` 的范围内，无论驾驶方向如何，提供详细信息。" -#, fuzzy -msgid "New sloan ordering order." -msgstr "新的逆序排列。" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" -msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." -msgstr "" +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_withPointsKSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" #, fuzzy -msgid "`Boost: Sloan Ordering `__" -msgstr "`Boost: 边着色 `__" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "``pgr_stoerWagner`` - Experimental" -msgstr "``pgr_stoerWagner`` - 实验性" +msgid "pgr_withPointsKSP(One to Many)" +msgstr "pgr_withPointsKSP(One to Many)" -msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." -msgstr "``pgr_stoerWagner`` — 使用 stoerWagner 算法对图进行最小分割。" +msgid "pgr_withPointsKSP(Many to One)" +msgstr "pgr_withPointsKSP(Many to One)" -msgid "Version 3.0" -msgstr "版本3.0" +msgid "pgr_withPointsKSP(Many to Many)" +msgstr "pgr_withPointsKSP(Many to Many)" -msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." -msgstr "在图论中，Stoer-Wagner 算法是一种递归算法，用于解决具有非负权重的无向带权图中的最小割问题。 该算法的基本思想是通过合并最密集的顶点来收缩图，直到图仅包含两个组合的顶点集。 在每个阶段，算法都会找到任意选择的两个顶点 s 和 t 的最小 s-t 割。 然后算法缩小 s 和 t 之间的缘以搜索非 s-t 切割。 在所有阶段中找到的最小割将是图的最小加权割。" +msgid "pgr_withPointsKSP(Combinations)" +msgstr "pgr_withPointsKSP(Combinations)" -msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." -msgstr "割是将图的顶点划分为两个不相交的子集。 最小切割是指切割的尺寸或重量不大于任何其他切割的尺寸的切割。 对于未加权的图，最小割只是具有最少边的割。 对于加权图，割线上所有边的权重之和决定了它是否是最小割。" +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgstr "修改图以包括 `Points SQL`_ 中定义的点并使用 Yen 算法查找 :math:`K` 最短路径。" -msgid "Sum of the weights of all edges between the two sets is mincut." -msgstr "两组之间所有边的权重之和是最小割。" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "A **mincut** is a cut having the least weight." -msgstr "**最小切割** 是重量最小的切割。" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "Values are returned when graph is connected." -msgstr "连接图形时返回值。" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" -msgid "When there is no edge in graph then EMPTY SET is return." -msgstr "当图中没有边时，则返回 EMPTY SET。" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" -msgid "When the graph is unconnected then EMPTY SET is return." -msgstr "当图形未连接时，则返回 EMPTY SET。" +#, fuzzy +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" -msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." -msgstr "有时一个图有多个最小割，但都具有相同的权重。 该函数准确地确定最小切割之一及其权重。" +msgid "**options:** ``[directed, heap_paths, details]``" +msgstr "**options:** ``[directed, heap_paths, details]``" -msgid "Running time: :math:`O(V*E + V^2*log V)`." -msgstr "运行时间： :math:`O(V*E + V^2*log V)`。" +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgstr "在具有 **左侧** 驾驶的有向图上，从点 :math:`1` 到点 :math:`2` 获取两条路径。" -msgid "pgr_stoerWagner(`Edges SQL`_)" -msgstr "pgr_stoerWagner(`Edges SQL`_)" +msgid "For a directed graph." +msgstr "有向图。" -msgid "Returns set of |result-mincut|" -msgstr "返回 |result-mincut| 的集合" +msgid "No details are given about distance of other points of the query." +msgstr "没有给出有关查询的其他点的距离的详细信息。" -msgid "min cut of the main subgraph" -msgstr "主子图的最小割" +msgid "No heap paths are returned." +msgstr "不返回堆路径。" -msgid "Returns set of ``(seq, edge, cost, mincut)``" -msgstr "返回集合 ``(seq, edge, cost, mincut)``" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "在无向图上从点 :math:`1` 到点 :math:`3` 和顶点 :math:`7` 获取两条路径" -msgid "Edges which divides the set of vertices into two." -msgstr "将顶点集一分为二的边。" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgstr "在具有 **右侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 获取一条路径，且 **details** 设置为 **True**" -msgid "Cost to traverse of edge." -msgstr "遍历边的成本。" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgstr "在具有 **左侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 和顶点 :math:`1` 获取一条路径，且 **heap_paths** 设置为 **True**" -msgid "**mincut**" -msgstr "**mincut**" +msgid "Using a combinations table on an **directed** graph" +msgstr "在 **有向** 图上使用组合表" -msgid "Min-cut weight of a undirected graph." -msgstr "无向图的最小割权。" +msgid "Number of required paths" +msgstr "所需路径的数量" -msgid "Additional Example:" -msgstr "附加示例：" +msgid "withPointsKSP optional parameters" +msgstr "withPointsKSP可选参数" -msgid "min cut of an edge" -msgstr "边的最小割" +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgstr "使用左侧驾驶拓扑，从顶点 :math:`1` 到离点 `(2.9, 1.8)` 最近的位置获取 :math:`2` 条路径。" -msgid "Using :doc:`pgr_connectedComponents`" -msgstr "使用 :doc:`pgr_connectedComponents`" +msgid "Left driving side" +msgstr "左驾驶侧" -msgid "`Boost: Stoer Wagner min cut `__" -msgstr "`Boost: Stoer-Wagner 最小割算法 `__" +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgstr "使用左侧驾驶拓扑，从点 :math:`1` 到点 :math:`3` 获取 :math:`2` 条路径，并包含详细信息。" -msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" -msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" +msgid "Right driving side" +msgstr "右驾驶侧" -msgid "``pgr_strongComponents``" -msgstr "``pgr_strongComponents``" +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgstr "使用右侧驾驶拓扑，从点 :math:`1` 到点 :math:`2` 获取 :math:`2` 条路径，同时使用堆路径（heap paths）并包含详细信息。" -msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." -msgstr "``pgr_strongComponents`` — 使用基于 DFS 的 Tarjan 算法构建有向图的强连通分量。" +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" -msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." -msgstr "有向图的强连接组件是一组彼此可达的顶点。" +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgstr "``pgr_withPointsVia`` - 经过一系列顶点和/或点的路线。" -msgid "Works for **directed** graphs." -msgstr "适用于 **有向** 图。" +#, fuzzy +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Components are described by vertices identifiers." -msgstr "组件由顶点标识符描述。" +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "给定一个图、图上边缘的一组点以及一个顶点列表，此函数相当于找到 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:`vertex` 可以是一个顶点或图上的一个点），对于所有的 :math:`i` ，满足 :math:`i < size\\_of(via\\;vertices)` 。" -msgid "pgr_strongComponents(`Edges SQL`_)" -msgstr "pgr_strongComponents(`Edges SQL`_)" +#, fuzzy +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgstr "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**options**])" -msgid "The strong components of the graph" -msgstr "图的重要组成部分" +#, fuzzy +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgstr "在有向图上查找按顺序访问顶点 :math:`\\{-6, 15, -5\\}` 的路线。" -msgid "`Boost: Strong components `__" -msgstr "`Boost: 强连通分量 `__" +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" +msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 函数" -msgid "wikipedia: `Strongly connected component `__" -msgstr "维基百科: `强连通分量 `__" +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." +msgstr "所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{-1, 7, -3, 16, 15\\}` 的路线。" -msgid "``pgr_topologicalSort`` - Experimental" -msgstr "``pgr_topologicalSort`` - 实验性" +msgid "Prim - Family of functions" +msgstr "Prim - 函数族" -msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." -msgstr "``pgr_topologicalSort`` — 有向无环图 (DAG) 的顶点的线性排序。" +msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." +msgstr "prim 算法由捷克数学家 Vojtěch Jarník 于 1930 年开发。 它是一种贪心算法，为带权无向图找到最小生成树。 这意味着它找到形成包含每个顶点的树的边的子集，其中树中所有边的总权重最小化。 该算法的运行方式是从任意起始顶点一次构建一个顶点，在每一步添加从树到另一个顶点的最便宜的可能连接。" -msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." -msgstr "拓扑排序算法创建了一个顶点的线性排序，使得如果图中存在边 :math:`(u,v)`，则在排序中 :math:`v` 出现在 :math:`u` 之前。" +msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." +msgstr "该算法在可能不连通的图中找到最小生成森林； 相反，Prim 算法的最基本形式只能在连通图中找到最小生成树。 然而，对图的每个连通分量分别运行Prim算法，则称为最小生成森林。" -msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." -msgstr "该过程仅对有向无环图有效。 否则它会抛出警告。" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgstr "来自 boost Graph：“Boost.Graph 中实现的算法不会在具有平行边的图上产生正确的结果。”" -msgid "For optimization purposes, if there are more than one answer, the function" -msgstr "出于优化目的，如果有多个答案，则该函数" +msgid "Boost: `Prim's algorithm `__" +msgstr "Boost: `Prim算法 `__" -msgid "will return one of them." -msgstr "将返回其中之一。" +msgid "Wikipedia: `Prim's algorithm `__" +msgstr "维基百科: `Prim算法 `__" -msgid "The returned values are ordered in topological order:" -msgstr "返回的值按拓扑顺序排序：" +msgid "Proposed Functions" +msgstr "提议的功能" -msgid "pgr_topologicalSort(`Edges SQL`_)" -msgstr "pgr_topologicalSort(`Edges SQL`_)" +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr ":doc:`pgr_lineGraph` - 用于生成折线图的转换算法。" -msgid "Topologically sorting the graph" -msgstr "对图进行拓扑排序" +msgid "Reference" +msgstr "参考" -msgid "Sequential value starting from :math:`1`" -msgstr "从 :math:`1` 开始的连续数值" +msgid "Release Notes" +msgstr "发布说明" -msgid "Linear topological ordering of the vertices" -msgstr "顶点的线性拓扑排序" +msgid "To see the full list of changes check the list of `Git commits `_ on Github." +msgstr "要查看完整的更改列表，请检查 Github 上的 `Git提交列表 `_ 。" -msgid "Additional examples" -msgstr "其他示例" +msgid "Mayors" +msgstr "主要版本" -msgid "Topologically sorting the one way segments" -msgstr "对单向段进行拓扑排序" +msgid "pgRouting 4" +msgstr "pgRouting 4" -msgid "Graph is not a DAG" -msgstr "图不是 DAG" +msgid "Minors 4.x" +msgstr "Minors 4.x" -msgid "`Boost: topological sort `__" -msgstr "`Boost: 拓扑排序 `__" +#, fuzzy +msgid "pgRouting 4.1" +msgstr "pgRouting 4.0" -msgid "``pgr_transitiveClosure`` - Experimental" -msgstr "``pgr_transitiveClosure`` - 实验性" +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." -msgstr "``pgr_transitiveClosure`` — 有向图的传递闭包图。" +#, fuzzy +msgid "pgRouting 4.0.1 Release Notes" +msgstr "pgRouting 3.0.1 发布说明" -msgid "Transforms the input directed graph into the transitive closure of the graph." -msgstr "将输入有向图转换为图的传递闭包。" +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" -msgid "Process is valid for directed graphs." -msgstr "过程对于有向图有效。" +msgid "Bug Fixes" +msgstr "Bug修复" -msgid "The transitive closure of an undirected graph produces a cluster graph" -msgstr "无向图的传递闭包产生簇图" +#, fuzzy +msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" +msgstr "`#2683 `__: pgr_trsp" -msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" -msgstr "当无向图上的顶点属于同一连通分量时，就会发生它们之间的可达性。（参阅 :doc:`pgr_connectedComponents`）" +#, fuzzy +msgid "`#3034 `__: metrics driver should not be using new" +msgstr "`#2683 `__: pgr_trsp" -msgid "The returned values are not ordered" -msgstr "返回值未排序" +#, fuzzy +msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" +msgstr "`#2802 `__:pgr_contraction 函数进行了代码重构" -msgid "The returned graph is compressed" -msgstr "返回的图形是压缩后的" +#, fuzzy +msgid "`#3040 `__: Check and fix cppcoreguidelines-virtual-class-destructor" +msgstr "`#1002 `__: 修复收缩问题：" -msgid "Running time: :math:`O(|V||E|)`" -msgstr "运行时间： :math:`O(|V||E|)`" +#, fuzzy +msgid "`#3039 `__: Check and fix cppcoreguidelines-special-member-functions" +msgstr "`#2605 `__ 标准化生成树函数的输出" -msgid "The pgr_transitiveClosure function has the following signature:" -msgstr "pgr_transitiveClosure 函数具有以下签名：" +#, fuzzy +msgid "`#3038 `__: Check and fix cppcoreguidelines-prefer-member-initializer" +msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +msgid "`#3037 `__: Check and fix cppcoreguidelines-init-variables" +msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +msgid "`#3035 `__: Pass by reference on existing drivers" +msgstr "`#2683 `__: pgr_trsp" -msgid "pgr_transitiveClosure(`Edges SQL`_)" -msgstr "pgr_transitiveClosure(`Edges SQL`_)" +#, fuzzy +msgid "Administration" +msgstr "局限性" -msgid "Returns set of |result-closure|" -msgstr "返回集合 |result-closure|" +#, fuzzy +msgid "`#3031 `__: pgtap license to Creative commons and License texts standardization" +msgstr "`#2683 `__: pgr_trsp" -msgid "Rechability of a subgraph" -msgstr "子图的可达性" +#, fuzzy +msgid "pgRouting 4.0.0 Release Notes" +msgstr "pgRouting 3.1.0 发布说明" -msgid "Identifier of the source of the edges" -msgstr "边来源的标识符" +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" -msgid "``target_array``" -msgstr "``target_array``" +msgid "Build" +msgstr "构建" -msgid "Identifiers of the targets of the edges" -msgstr "边目标的标识符" +msgid "C++ standard is std17" +msgstr "" -msgid "Identifiers of the vertices that are reachable from vertex v." -msgstr "从顶点 v 可到达的顶点的标识符。" +msgid "Using this standard, all supported toolchains across our CI matrix will work." +msgstr "" -msgid "`Boost: transitive closure `__" -msgstr "`Boost: 传递闭包 `__" +msgid "The code is not yet modified to use std17:" +msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" -msgstr "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard." +msgstr "" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +#, fuzzy +msgid "The user's documentation is built by default." +msgstr "用于用户文档" -msgid "``pgr_trsp`` - routing vertices with restrictions." -msgstr "``pgr_trsp`` - 有限制的路由顶点。" +#, fuzzy +msgid "The doxygen documentation is built by default." +msgstr "用于用户文档" -msgid "pgr_trsp(One to One)" -msgstr "pgr_trsp(One to One)" +#, fuzzy +msgid "For developers:" +msgstr "对于开发者文档" -msgid "pgr_trsp(One to Many)" -msgstr "pgr_trsp(One to Many)" +msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks." +msgstr "" -msgid "pgr_trsp(Many to One)" -msgstr "pgr_trsp(Many to One)" +msgid "Tidy checks are done on CI." +msgstr "" -msgid "pgr_trsp(Many to Many)" -msgstr "pgr_trsp(Many to Many)" +#, fuzzy +msgid "Documentation build" +msgstr "文档" -msgid "pgr_trsp(Combinations)" -msgstr "pgr_trsp （组合）" +#, fuzzy +msgid "The doxygen documentation is built by default" +msgstr "用于用户文档" -msgid "Deprecated signatures" -msgstr "弃用签名" +#, fuzzy +msgid "The HTML documentation is built by default" +msgstr "用于用户文档" -msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +#, fuzzy +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" +msgstr "用于用户文档" -msgid "New prototypes" -msgstr "新原型" +msgid "`WITH-DOC` is not used anymore" +msgstr "" -msgid "pgr_trspViaVertices" -msgstr "pgr_trspViaVertices" +#, fuzzy +msgid "User Documentation is not built when" +msgstr "对于开发者文档" -msgid "pgr_trspViaEdges" -msgstr "pgr_trspViaEdges" +msgid "Sphinx is not found" +msgstr "" -msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." -msgstr "转弯限制最短路径 (TRSP) 是一种以查询形式接收转弯限制的算法，就像在现实世界的可通航道路网络中发现的那样。" +msgid "When all Sphinx formats are OFF" +msgstr "" -msgid "It does no guarantee the shortest path as it might contain restriction paths." -msgstr "它不保证最短路径，因为它可能包含限制路径。" +msgid "To not build HTML default format: `-DBUILD_HTML=OFF`" +msgstr "" -msgid "The general algorithm is as follows:" -msgstr "通用算法如下：" +msgid "When all languages are OFF" +msgstr "" -msgid "Execute a Dijkstra." -msgstr "执行 Dijkstra。" +msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`" +msgstr "" -msgid "If the solution passes thru a restriction then." -msgstr "如果解决方案通过了限制。" +msgid "Documentation output location: ``build/doc/_build/``" +msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions." -msgstr "有限制地执行 **TRSP** 算法。" +msgid "For example: for HTML output is on `build/doc/_build/html` directory" +msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +#, fuzzy +msgid "Developers' Documentation is not built when" +msgstr "对于开发者文档" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Doxygen is not found" +msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" +msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "Summary of changes by function" +msgstr "" -msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_aStar" +msgstr "pgr_aStar" -msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." -msgstr "从无向图上的顶点 :math:`6` 到顶点 :math:`10`." +msgid "pgr_aStarCost" +msgstr "pgr_aStarCost" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." -msgstr "无向图上从顶点 :math:`6` 到顶点 :math:`\\{10, 1\\}` 。" +msgid "pgr_bandwidth" +msgstr "pgr_bandwidth" -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." -msgstr "有向图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`8`。" +msgid "pgr_bdAstar" +msgstr "pgr_bdAstar" -msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." -msgstr "无向图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 8\\}`。" +msgid "pgr_bdAstarCost" +msgstr "pgr_bdAstarCost" -msgid "Using a combinations table on an undirected graph." -msgstr "在无向图上使用组合表。" +msgid "pgr_bdDijkstra" +msgstr "pgr_bdDijkstra" -msgid "`Deprecated documentation `_" -msgstr "`已弃用文档 `_" +msgid "pgr_bdDijkstraCost" +msgstr "pgr_bdDijkstraCost" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" +msgid "pgr_bellmanFord" +msgstr "pgr_bellmanFord" -msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." -msgstr "``pgr_trspVia`` 穿过有限制的顶点列表的路线。" +msgid "pgr_binaryBreadthFirstSearch" +msgstr "pgr_binaryBreadthFirstSearch" -msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "给定一个顶点列表和一个图，这个函数等同于在所有 :math:`i < size\\_of(via\\;vertices)` 的情况下找到从 :math:`vertex_i` 到 :math:`vertex_{i+1}` 的最短路径，尽量避免使用受限路径。" +msgid "pgr_bipartite" +msgstr "pgr_bipartite" -msgid "The paths represents the sections of the route." -msgstr "路径代表路线的各个部分。" +msgid "pgr_boykovKolmogorov" +msgstr "pgr_boykovKolmogorov" -msgid "Execute a :doc:`pgr_dijkstraVia`." -msgstr "执行 :doc:`pgr_dijkstraVia`。" +msgid "pgr_breadthFirstSearch" +msgstr "pgr_breadthFirstSearch" -msgid "For the set of sub paths of the solution that pass through a restriction then" -msgstr "对于通过限制的解决方案的子路径集，则" +msgid ":" +msgstr "" -msgid "Execute the **TRSP** algorithm with restrictions for the paths." -msgstr "执行对路径有限制的 **TRSP** 算法。" +msgid "pgr_contraction" +msgstr "pgr_contraction" -msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." -msgstr "**注意**，完成此操作后， ``U_turn_on_edge`` 标志将被忽略。" +msgid "pgr_dagShortestPath" +msgstr "pgr_dagShortestPath" -msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgstr "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgid "pgr_depthFirstSearch" +msgstr "pgr_depthFirstSearch" -msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." -msgstr "所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}` 的路线。" +msgid "pgr_dijkstra" +msgstr "pgr_dijkstra" -msgid "Simulation of how algorithm works." -msgstr "模拟算法的工作原理。" +msgid "pgr_dijkstraCost" +msgstr "pgr_dijkstraCost" -msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" -msgstr "该算法执行 :doc:`pgr_dijkstraVia`" +msgid "pgr_dijkstraNear" +msgstr "pgr_dijkstraNear" -msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." -msgstr "检测哪些子路径通过了限制，本例中是针对 ``path_id = 5`` 从 ``6`` 到 ``3`` ，因为该路径 :math:`15 \\rightarrow 1` 受到限制。" +msgid "pgr_dijkstraNearCost" +msgstr "pgr_dijkstraNearCost" -msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." -msgstr "执行 :doc:`pgr_trsp` 针对冲突路径建议的算法。" +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" -msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "从 :doc:`pgr_dijkstraVia` 提议的结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 提议的算法的结果构建解决方案：" +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" -msgid "Getting the same result as ``pgr_trspVia``:" -msgstr "得到与 ``pgr_trspVia`` 相同的结果：" +msgid "pgr_edgeDisjointPaths" +msgstr "pgr_edgeDisjointPaths" -msgid "Example 8" -msgstr "示例 8" +msgid "pgr_edmondsKarp" +msgstr "pgr_edmondsKarp" -msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." -msgstr "有时，当设置为 ``false`` 时， ``U_turn_on_edge`` 标志会被忽略。" +msgid "pgr_edwardMoore" +msgstr "pgr_edwardMoore" -msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." -msgstr "第一步，进行 :doc:`pgr_dijkstraVia` 不考虑在同一边上掉头。 但路径 :math:`16 \\rightarrow 13` （第 4 行和第 5 行）受到限制，结果正在使用它。" +msgid "pgr_kingOrdering" +msgstr "pgr_kingOrdering" -msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "当执行 :doc:`pgr_trsp` 针对冲突路径的算法时，没有 ``U_turn_on_edge`` 标志。" +msgid "pgr_KSP" +msgstr "pgr_KSP" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." -msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` 标志。" +msgid "pgr_maxCardinalityMatch" +msgstr "pgr_maxCardinalityMatch" -msgid ":doc:`via-category`" -msgstr ":doc:`via-category`" +msgid "pgr_maxFlow" +msgstr "pgr_maxFlow" -msgid "``pgr_trspVia_withPoints``" -msgstr "``pgr_trspVia_withPoints``" +msgid "pgr_pushRelabel" +msgstr "pgr_pushRelabel" + +msgid "pgr_sequentialVertexColoring" +msgstr "pgr_sequentialVertexColoring" -msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." -msgstr "``pgr_trspVia_withPoints`` - 经过一系列具有限制的顶点和/或点的路线。" +msgid "pgr_sloanOrdering" +msgstr "pgr_sloanOrdering" -msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "给定一个图、对图边的一组限制、图边上的一组点和一个顶点列表，该函数相当于查找 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:`vertex` 可以是图上的顶点或点） 对于所有 :math:`i < size\\_of(via\\;vertices)` 尝试不使用受限路径的人。" +msgid "pgr_topologicalSort" +msgstr "pgr_topologicalSort" -msgid "is a sequence of paths" -msgstr "是一系列路径" +msgid "pgr_transitiveClosure" +msgstr "pgr_transitiveClosure" -msgid "Build the Graph with the new points." -msgstr "用新点构建图表。" +msgid "pgr_trsp" +msgstr "pgr_trsp" -msgid "The points identifiers will be converted to negative values." -msgstr "点标识符将转换为负值。" +msgid "pgr_trspVia" +msgstr "pgr_trspVia" -msgid "The vertices identifiers will remain positive." -msgstr "顶点标识符将保持正值。" +msgid "pgr_trspVia_withPoints" +msgstr "pgr_trspVia_withPoints" -msgid "Execute a :doc:`pgr_withPointsVia`." -msgstr "执行 :doc:`pgr_withPointsVia`。" +msgid "pgr_trsp_withPoints" +msgstr "pgr_trsp_withPoints" -msgid "For the set of paths of the solution that pass through a restriction then" -msgstr "对于通过限制的解决方案的路径集合，则" +msgid "pgr_TSP" +msgstr "pgr_TSP" -msgid "Execute the **TRSP** algorithm with restrictions for the path." -msgstr "执行对路径有限制的 **TRSP** 算法。" +msgid "pgr_TSPeuclidean" +msgstr "pgr_TSPeuclidean" -msgid "Do not use negative values on identifiers of the inner queries." -msgstr "不要在内部查询的标识符上使用负值。" +msgid "pgr_turnRestrictedPath" +msgstr "pgr_turnRestrictedPath" -#, fuzzy -msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" -msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**options**])" +msgid "pgr_withPoints" +msgstr "pgr_withPoints" -#, fuzzy -msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" -msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." -msgstr "在有向图上查找按顺序访问顶点 :math:`\\{-6, 15, -5\\}` 的路线。" +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" -msgid "When positive it is considered a vertex identifier" -msgstr "当为正时，它被视为顶点标识符" +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" -msgid "When negative it is considered a point identifier" -msgstr "当负数时，它被认为是一个点标识符" +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" -#, fuzzy -msgid "[**driving side**]" -msgstr "**driving side**" +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" -msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" -msgstr "值在 [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] 中表示驾驶的一侧是：" +msgid "Functions promoted to official" +msgstr "正式版功能函数" #, fuzzy -msgid "For directed graph:" -msgstr "有向图。" +msgid "`#2701 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "[``r``, ``R``] for right driving side" -msgstr "``r``, ``R`` 表示右侧驾驶，" +msgid "`#2701 `__: pgr_trspVia" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "[``l``, ``L``] for left driving side" -msgstr "``l``, ``L`` 表示左侧驾驶。" +msgid "`#2701 `__: pgr_trspVia_withPoints" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "For undirected graph:" -msgstr "在无向图上：" +msgid "`#2701 `__: pgr_trsp_withPoints" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "[``b``, ``B``] for both driving sides" -msgstr "``l``, ``L`` 表示左侧驾驶。" - -msgid "Default values when parameter is missing:" -msgstr "" +msgid "`#2700 `__: pgr_withPoints" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "[``r``, ``R``] for directed graph" -msgstr "[``b``, ``B``] 表示两侧通行（仅适用于无向图）" +msgid "`#2700 `__: pgr_withPointsCost" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "[``l``, ``L``] for undirected graph" -msgstr "[``b``, ``B``] 表示两侧通行（仅适用于无向图）" - -msgid "With points optional parameters" -msgstr "带点可选参数" - -msgid "``details``" -msgstr "``details``" - -msgid "For showing points stops." -msgstr "" - -msgid "When ``true`` the results will include the points that are in the path." -msgstr "如果为 ``true`` ，结果将包括路径中的点。" - -msgid "When ``false`` the results will not include the points that are in the path." -msgstr "如果为 ``false`` ，结果将不包括路径中的点。" - -msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." -msgstr "当 ``start_vid`` 、 ``end_vid`` 和 ``node`` 列具有负值时，该标识符用于Point。" - -msgid "Use ``pgr_findCloseEdges`` for points on the fly" -msgstr "对动态点使用 ``pgr_findCloseEdges``" - -msgid "Using :doc:`pgr_findCloseEdges`:" -msgstr "使用 :doc:`pgr_findCloseEdges`:" - -msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." -msgstr "从顶点 :math:`1` 开始，按照距离图形最近的顺序访问点 `(2.9, 1.8)` 上的两个位置。" +msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgstr "`#2683 `__: pgr_trsp" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." -msgstr "点 :math:`-1`对应于距离点`(2.9, 1.8)` 最近的边。" +#, fuzzy +msgid "`#2700 `__: pgr_withPointsDD" +msgstr "`#2683 `__: pgr_trsp" -msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." -msgstr "点 :math:`-2`对应于点`(2.9, 1.8)` 的下一个闭合边。" +#, fuzzy +msgid "`#2700 `__: pgr_withPointsKSP" +msgstr "`#2683 `__: pgr_trsp" -msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." -msgstr "点 :math:`-2`在从顶点 :math:`1` 到点 :math:`-1` 的路线上被访问（参见行 ，其中:math:`seq = 4`）。" +#, fuzzy +msgid "`#2700 `__: pgr_withPointsVia" +msgstr "`#2683 `__: pgr_trsp" -msgid "Usage variations" -msgstr "用法变化" +#, fuzzy +msgid "`#2983 `__: pgr_dijkstraNear" +msgstr "`#2683 `__: pgr_trsp" -msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." -msgstr "所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{-6, 7, -4, 8, -2\\}` 的路线。" +#, fuzzy +msgid "`#2983 `__: pgr_dijkstraNearCost" +msgstr "`#2683 `__: pgr_trsp" -msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." -msgstr "节点、点的\"通过\"或\"访问\"状态。" +#, fuzzy +msgid "`#2983 `__: pgr_dijkstraVia" +msgstr "`#2683 `__: pgr_trsp" -msgid "The algorithm performs a :doc:`pgr_withPointsVia`" -msgstr "该算法执行 :doc:`pgr_withPointsVia`" +msgid "Signatures promoted to official" +msgstr "正式版函数签名" -msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." -msgstr "检测哪些路径通过了限制，在本例中是针对从 ``-6`` 到 ``15`` 的 ``path_id = 1`` ，因为路径 :math:`9 \\rightarrow 16` 受到限制。" +#, fuzzy +msgid "`#2718 `__: pgr_aStar(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." -msgstr "对冲突路径执行 :ref:`TRSP-family:TRSP algorithm`。" +#, fuzzy +msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "从 :doc:`pgr_withPointsVia` 的结果中移除冲突的路径，并使用 :doc:`pgr_trsp` 算法的结果构建解决方案：" +#, fuzzy +msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "Getting the same result as ``pgr_trspVia_withPoints``:" -msgstr "得到与 ``pgr_trspVia_withPoints`` 相同的结果：" +#, fuzzy +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." -msgstr "第一步，执行 :doc:`pgr_withPointsVia` 不考虑在同一条边上进行掉头。但是路径 :math:`9 \\rightarrow 16` （第4行和第5行）受到限制，结果中使用了它。" +#, fuzzy +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" +msgstr "`#2683 `__: pgr_trsp" -msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." -msgstr "当执行 :doc:`pgr_trsp_withPoints` 针对冲突路径的算法时，没有 ``U_turn_on_edge`` 标志。" +#, fuzzy +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." -msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` 标志。 从 :doc:`pgr_withPointsVia` 结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 算法的结果构建解决方案。 在这种情况下，使用相同的边缘完成 U 形转弯。" +#, fuzzy +msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +#, fuzzy +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." -msgstr "``pgr_trsp_withPoints`` 有限制的路由顶点/点。" +#, fuzzy +msgid "`#2718 `__: pgr_KSP(All signatures)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." -msgstr "修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "Vertices of the graph are:" -msgstr "图的顶点是：" +#, fuzzy +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "**positive** when it belongs to the `Edges SQL`_" -msgstr "当它属于 `Edges SQL`_ 时为 **正**" +#, fuzzy +msgid "`#2718 `__: pgr_maxFlow(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "**negative** when it belongs to the `Points SQL`_" -msgstr "当它属于 `Points SQL`_ 为 **负**" +#, fuzzy +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" +msgstr "`#2798 `__: pgr_contraction" -msgid "The `agg_cost` in the non included values `(v, v)` is `0`" -msgstr "非包含值 `(v, v)` 中的 `agg_cost` 为 `0`" +#, fuzzy +msgid "New experimental functions." +msgstr "新实验性函数" -msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" -msgstr "非包含值 `(u, v)` 中的 `agg_cost` 为 :math:`\\infty`" +msgid "Metrics" +msgstr "Metrics" #, fuzzy -msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." -msgstr "出于优化目的， `start vids` 或`end vids`中的任何重复值都将被忽略。" +msgid "`#2951 `__: pgr_bandwidth" +msgstr "`#2683 `__: pgr_trsp" -msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" -msgstr "运行时间： :math:`O(|start\\_vids|\\times(V \\log V + E))`" +msgid "Ordering" +msgstr "排序" #, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +msgid "`#2954 `__: pgr_kingOrdering" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +msgid "`#2955 `__: pgr_sloanOrdering" +msgstr "`#2683 `__: pgr_trsp" + +msgid "SQL signatures and output standardization" +msgstr "" #, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +msgid "`#2904 `__: Standardize output columns of functions with different output" +msgstr "`#2057 `__: trspViaEdges 列的顺序不同" #, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" -msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +msgid "columns within overloads" +msgstr "函数的重载" #, fuzzy -msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" -msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**options**])" - -msgid "**options:** ``[directed, details]``" -msgstr "**options:** ``[directed, details]``" +msgid "Standardized to |short-generic-result|" +msgstr "将输出列标准化为 |short-generic-result|" #, fuzzy -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" -msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" +msgid "`#2905 `__: pgr_withPoints" +msgstr "`#2683 `__: pgr_trsp" -msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" -msgstr "无向图上的点 :math:`1` 到点 :math:`3` 和顶点 :math:`7`" +#, fuzzy +msgid "`#2906 `__: pgr_bdDijkstra" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" -msgstr "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细信息。" +msgid "`#2907 `__: pgr_bellmanFord" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." -msgstr "从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 和顶点 :math:`1`。" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgstr "`#2683 `__: pgr_trsp" -msgid "Two combinations" -msgstr "两种组合" +#, fuzzy +msgid "`#2910 `__: pgr_edwardMoore" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" -msgstr "从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右侧** 行驶。" +msgid "`#2913 `__: pgr_dagShortestPath" +msgstr "`#2683 `__: pgr_trsp" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." -msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 。" +#, fuzzy +msgid "Standardized to |matrix-result|" +msgstr "输出列是 |ksp-result|" -msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "找到从顶点 :math:`1` 到点 `(2.9, 1.8)` 图上两个最近位置的路线。" +#, fuzzy +msgid "`#2905 `__: pgr_withPointsCost" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" -msgstr "所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的旅行" +msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgstr "`#2683 `__: pgr_trsp" -msgid "Passes in front or visits with right side driving." -msgstr "从前方超车或右侧行驶来访。" +#, fuzzy +msgid "Standardized to |generic-result|" +msgstr "将输出列标准化为 |short-generic-result|" -msgid "For point :math:`6` and vertex :math:`11`." -msgstr "对于点 :math:`6` 和顶点 :math:`11` 。" +#, fuzzy +msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgstr "`#2683 `__: pgr_trsp" -msgid "Passes in front or visits with left side driving." -msgstr "从前方超车或以左侧驾驶方式行驶。" +#, fuzzy +msgid "`#2909 `__: pgr_turnRestrictedPath" +msgstr "`#2683 `__: pgr_trsp" -msgid "``pgr_turnRestrictedPath`` - Experimental" -msgstr "``pgr_turnRestrictedPath`` - 实验性" +#, fuzzy +msgid "Standardized to |result_edge_color|" +msgstr "返回集合 |result-edge-color|" -msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" -msgstr "``pgr_turnRestrictedPath`` 使用 Yen 算法进行带有限制的顶点到顶点路径规划" +#, fuzzy +msgid "`#2924 `__: pgr_edgeColoring" +msgstr "`#2683 `__: pgr_trsp" -msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" -msgstr "利用Yen算法获得K条最短路径并对路径进行分析以选择不使用限制的路径" +#, fuzzy +msgid "Standardized to |result_node_color|" +msgstr "返回集合 |result-node-color|" -msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +#, fuzzy +msgid "`#2924 `__: pgr_bipartite" +msgstr "`#2683 `__: pgr_trsp" -msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" -msgstr "**options:** ``[directed, heap_paths, stop_on_first, strict]``" +#, fuzzy +msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgstr "`#2202 `__: pgr_sequentialVertexColoring 变为提议状态" -msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph" -msgstr "从有向图上的顶点 :math:`3` 到顶点 :math:`8`" +#, fuzzy +msgid "Standardized to |result-spantree|" +msgstr "将输出列标准化为 |result-spantree|" -msgid "Special optional parameters" -msgstr "特殊可选参数" +#, fuzzy +msgid "`#2931 `__: pgr_breadthFirstSearch" +msgstr "`#2683 `__: pgr_trsp" -msgid "``stop_on_first``" -msgstr "``stop_on_first``" +#, fuzzy +msgid "`#2931 `__: pgr_depthFirstSearch" +msgstr "`#2683 `__: pgr_trsp" -msgid "When ``true`` stops on first path found that dos not violate restrictions" -msgstr "当 ``true`` 停止在发现不违反限制的第一条路径上时" +#, fuzzy +msgid "Standardized to |result_node_order|" +msgstr "返回集合 |result-node-color|" -msgid "When ``false`` returns at most K paths" -msgstr "当 ``false`` 时返回最多 K 条路径" +#, fuzzy +msgid "`#2934 `__: pgr_topologicalSort" +msgstr "`#2683 `__: pgr_trsp" -msgid "When ``true`` returns only paths that do not violate restrictions" -msgstr "当 ``true`` 时仅返回不违反限制的路径" +#, fuzzy +msgid "Standardized to |result-closure|" +msgstr "将输出列标准化为 |result-spantree|" -msgid "When ``false`` returns the paths found" -msgstr "当 ``false`` 返回找到的路径" +#, fuzzy +msgid "`#2934 `__: pgr_transitiveClosure" +msgstr "`#2683 `__: pgr_trsp" -msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." -msgstr "从顶点 :math:`3` 到 :math:`8`，并启用 ``strict`` 标志。" +msgid "Removal of SQL deprecated signatures" +msgstr "移除已弃用的 SQL 函数签名" -msgid "No results because the only path available follows a restriction." -msgstr "没有结果，因为唯一可用的路径受到限制。" +msgid "`#2798 `__: pgr_contraction" +msgstr "`#2798 `__: pgr_contraction" -msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" -msgstr "从无向图上的顶点 :math:`3` 到顶点 :math:`8`" +msgid "`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" -msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" -msgstr "从顶点 :math:`3` 到顶点 :math:`8` 更多选择" +#, fuzzy +msgid "`#2683 `__: pgr_trspVia" +msgstr "`#2683 `__: pgr_trsp" -msgid "``pgr_version``" -msgstr "``pgr_version``" +#, fuzzy +msgid "`#2888 `__: pgr_findCloseEdges" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" -msgid "``pgr_version`` — Query for pgRouting version information." -msgstr "``pgr_version`` — 查询pgRouting版本信息。" +#, fuzzy +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "Breaking change on result columns" -msgstr "结果列的重大变化" +#, fuzzy +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "Support for old signature ends" -msgstr "对旧签名的支持结束" +#, fuzzy +msgid "`#2890 `__: pgr_withPointsDD" +msgstr "`#2683 `__: pgr_trsp" -msgid "Returns pgRouting version information." -msgstr "返回 pgRouting 版本信息。" +#, fuzzy +msgid "`#2895 `__: pgr_withPointsKSP" +msgstr "`#2683 `__: pgr_trsp" -msgid "pgr_version()" -msgstr "pgr_version()" +#, fuzzy +msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgstr "`#2683 `__: pgr_trsp" -msgid "RETURNS ``TEXT``" -msgstr "返回 ``TEXT``" +#, fuzzy +msgid "`#2901 `__: pgr_TSP" +msgstr "`#2683 `__: pgr_trsp" -msgid "pgRouting Version for this documentation" -msgstr "本文档的 pgRouting 版本" +#, fuzzy +msgid "`#2901 `__: pgr_TSPeuclidean" +msgstr "`#2683 `__: pgr_trsp" -msgid "``pgr_vrpOneDepot`` - Experimental" -msgstr "``pgr_vrpOneDepot`` - 实验性" +msgid "Removal of SQL deprecated functions" +msgstr "移除已弃用的SQL函数" -msgid "**No documentation available**" -msgstr "**无可用文档**" +#, fuzzy +msgid "`#2681 `__: pgr_trspViaedges" +msgstr "`#2681 `__: pgr_trspviaedges" -msgid "**TBD**" -msgstr "**TBD**" +#, fuzzy +msgid "`#2682 `__: pgr_trspViaVertices" +msgstr "`#2682 `__: pgr_trspviavertices" -msgid "TBD" -msgstr "TBD" +msgid "`#2748 `__: pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" -msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." -msgstr "``pgr_withPoints`` - 返回图中带有附加临时顶点的最短路径。" +#, fuzzy +msgid "`#2751 `__: pgr_createTopology" +msgstr "`#2751 `__: pgr_createTopology" -msgid "pgr_withPoints(Combinations)" -msgstr "pgr_withPoints（组合）" +msgid "`#2752 `__: pgr_analyzeGraph" +msgstr "`#2752 `__: pgr_analyzeGraph" -#, fuzzy -msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." -msgstr "修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" +msgid "`#2755 `__: pgr_analyzeOneWay" +msgstr "`#2755 `__: pgr_analyzeOneWay" -#, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" +msgid "`#2827 `__: pgr_createVerticesTable" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" +msgid "`#2886 `__: pgr_nodeNetwork" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" +msgid "Removal of SQL deprecated internal functions" +msgstr "移除已弃用的SQL内部函数" #, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "**options:** ``[directed, details])``" -msgstr "**options:** ``[directed, details]``" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" #, fuzzy -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" -msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" - -msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." -msgstr "路径起始顶点的标识符。 负值用于点的标识符。" - -msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." -msgstr "起始顶点的标识符数组。 负值用于点的标识符。" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" -msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." -msgstr "路径结束顶点的标识符。 负值用于点的标识符。" +#, fuzzy +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." -msgstr "结束顶点的标识符数组。 负值用于点的标识符。" +#, fuzzy +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的旅行" +#, fuzzy +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" -msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." -msgstr "``pgr_withPointsCost`` - 计算最短路径，并只返回所给点组合的最短路径的总成本。" +#, fuzzy +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" -msgid "pgr_withPointsCost(Combinations)" -msgstr "pgr_withPointsCost（组合）" +#, fuzzy +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." -msgstr "修改图形以包含由 points_sql 定义的点。使用 Dijkstra 算法，只返回找到的最短路径的总成本。" +#, fuzzy +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." -msgstr "返回修改图中顶点对组合的最短路径成本之和。" +#, fuzzy +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" #, fuzzy -msgid "The returned values are in the form of a set of |matrix-result|." -msgstr "返回值的形式为一组`(start_vid, end_vid, agg_cost)` 。" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" -msgid "**positive** when it belongs to the edges_sql" -msgstr "当它属于edges_sql时为 **正**" +#, fuzzy +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "`#2798 `__: pgr_contraction" -msgid "**negative** when it belongs to the points_sql" -msgstr "当它属于 points_sql时为 **负**" +#, fuzzy +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" -msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." -msgstr "如果返回的值存储在表中，则唯一索引将是这一对： `(start_vid, end_vid)` 。" +#, fuzzy +msgid "`#2861 `__ _pgr_endPoint(geometry)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" -msgid "For **undirected** graphs, the results are **symmetric**." -msgstr "对于 **无向** 图，结果是 **对称** 的。" +#, fuzzy +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" #, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "**options:** ``[directed]``" -msgstr "**options:** ``[directed, cap]``" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" -msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." -msgstr "与 withPoints 函数系列的其他成员不同，没有 **详细信息** 标志。" +#, fuzzy +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." -msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "`#2087 `__: pgr_extractVertices 变为提议状态" #, fuzzy -msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." -msgstr "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细信息。" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" #, fuzzy -msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." -msgstr "从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右侧** 行驶。" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "求从顶点 :math:`1` 到图中点 `(2.9, 1.8)` 的两个最近位置的路线成本。" +#, fuzzy +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" +msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "Being close to the graph does not mean have a shorter route." -msgstr "靠近图表并不意味着路线更短。" +#, fuzzy +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Right side driving topology" -msgstr "右侧驾驶拓扑" +#, fuzzy +msgid "`#2861 `__ _pgr_msg(integer,text,text)" +msgstr "`#2681 `__: pgr_trspviaedges" -msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "从点 :math:`1` 和顶点 :math:`5` 出发，前往点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}`" +#, fuzzy +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" +msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "Left side driving topology" -msgstr "左侧驾驶拓扑" +#, fuzzy +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" -msgid "Does not matter driving side driving topology" -msgstr "与驱动端驱动拓扑无关" +#, fuzzy +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "`#2087 `__: pgr_extractVertices 变为提议状态" -msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." -msgstr "``pgr_withPointsCostMatrix`` - 使用 :doc:`pgr_withPoints` 计算成本矩阵。" +#, fuzzy +msgid "`#2861 `__ _pgr_quote_ident(text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" -msgstr "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**options**])" +msgid "`#2861 `__ _pgr_startPoint(geometry)" +msgstr "`#2681 `__: pgr_trspviaedges" -msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" -msgstr "**无向** 图上的点 :math:`\\{1, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的成本矩阵" +#, fuzzy +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "Returning a **symmetrical** cost matrix" -msgstr "返回 **对称** 成本矩阵" +#, fuzzy +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Using the default ``side`` value on the **points_sql** query" -msgstr "在 **points_sql** 查询上使用默认 ``side`` 值" +#, fuzzy +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "Using the default ``driving side`` value" -msgstr "使用默认 ``driving_side`` 值" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "求从顶点 :math:`1` 到图上点 `(2.9, 1.8)` 的两个最近位置的路线的矩阵成本。" +#, fuzzy +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." -msgstr "``pgr_withPointsDD`` - 返回从起点开始的行驶 **距离** 。" +#, fuzzy +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -msgid "Output columns standardized to |result-spantree|" -msgstr "新的输出列是 |result-spantree|" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "When ``details`` is ``false``:" -msgstr "当 ``details`` 为 ``false`` 时：" +#, fuzzy +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "Points reached within the distance are not included." -msgstr "只有那些被访问的兴趣点会被移除，也就是说，位于一定距离范围内被到达的兴趣点会被包含在内" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "Deprecated signatures:" -msgstr "弃用签名" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." -msgstr "修改图以包含点，并使用 Dijkstra 算法，提取成本小于或等于距起点 ``**距离**`` 值的所有节点和点。 提取的边将符合相应的生成树。" +#, fuzzy +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" +msgid "`#2861 `__ _pgr_versionLess(text,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "**options A:** ``[directed, details]``" -msgstr "**options A:** ``[directed, details]``" +#, fuzzy +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "**options B:** ``[directed, details, equicost]``" -msgstr "**options B:** ``[directed, details, equicost]``" +#, fuzzy +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." -msgstr "右侧驾驶拓扑，从点 :math:`1` 开始，距离不超过 :math:`3.3`，并提供详细信息。" +#, fuzzy +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" -msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "**options:** ``[directed, details, equicost]``" -msgstr "**options:** ``[directed, details, equicost]``" +#, fuzzy +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" -msgstr "从点 :math:`1` 和顶点 :math:`16` 出发，在有向图上以 ``equicost`` 模式，在距离不超过 :math:`3.3` 的范围内" +#, fuzzy +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Negative values represent a point" -msgstr "负值代表一个点" +#, fuzzy +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." -msgstr "求图上点 `(2.9, 1.8)` 距离最近的两个位置的行驶距离。" +#, fuzzy +msgid "Summary of functions and signatures no longer on pgrouting" +msgstr "为 pgRouting 添加功能" -msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." -msgstr "点 :math:`-1` 对应距离点 :math:`(2.9, 1.8)` 最近的边。" +#, fuzzy +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgstr "`#2748 `__: pgr_alphaShape" -msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." -msgstr "点 :math:`-2` 对应于点 :math:`(2.9, 1.8)` 的下一条近边。" +#, fuzzy +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgstr "`#2752 `__: pgr_analyzeGraph" -msgid "Driving side does not matter" -msgstr "驾驶侧并不重要" +#, fuzzy +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgstr "_pgr_createindex(text,text,text,text,integer,text)" -msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." -msgstr "从点 :math:`1` 开始，在距离不超过 :math:`3.3` 的范围内，无论驾驶方向如何，提供详细信息。" +#, fuzzy +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "`#2798 `__: pgr_contraction" -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +#, fuzzy +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgstr "_pgr_createindex(text,text,text,text,integer,text)" -msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "``pgr_withPointsKSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" +#, fuzzy +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "pgr_withPointsKSP(One to Many)" -msgstr "pgr_withPointsKSP(One to Many)" +#, fuzzy +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "pgr_withPointsKSP(Many to One)" -msgstr "pgr_withPointsKSP(Many to One)" +#, fuzzy +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "pgr_withPointsKSP(Many to Many)" -msgstr "pgr_withPointsKSP(Many to Many)" +#, fuzzy +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "pgr_withPointsKSP(Combinations)" -msgstr "pgr_withPointsKSP(Combinations)" +#, fuzzy +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" -msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." -msgstr "修改图以包括 `Points SQL`_ 中定义的点并使用 Yen 算法查找 :math:`K` 最短路径。" +#, fuzzy +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" -msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "**options:** ``[directed, heap_paths, details]``" -msgstr "**options:** ``[directed, heap_paths, details]``" +#, fuzzy +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." -msgstr "在具有 **左侧** 驾驶的有向图上，从点 :math:`1` 到点 :math:`2` 获取两条路径。" +#, fuzzy +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "For a directed graph." -msgstr "有向图。" +#, fuzzy +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "No details are given about distance of other points of the query." -msgstr "没有给出有关查询的其他点的距离的详细信息。" +#, fuzzy +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2683 `__: pgr_trsp" -msgid "No heap paths are returned." -msgstr "不返回堆路径。" +#, fuzzy +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" -msgstr "在无向图上从点 :math:`1` 到点 :math:`3` 和顶点 :math:`7` 获取两条路径" +#, fuzzy +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" -msgstr "在具有 **右侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 获取一条路径，且 **details** 设置为 **True**" +#, fuzzy +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" -msgstr "在具有 **左侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 和顶点 :math:`1` 获取一条路径，且 **heap_paths** 设置为 **True**" +#, fuzzy +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Using a combinations table on an **directed** graph" -msgstr "在 **有向** 图上使用组合表" +#, fuzzy +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Number of required paths" -msgstr "所需路径的数量" +#, fuzzy +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" -msgid "withPointsKSP optional parameters" -msgstr "withPointsKSP可选参数" +#, fuzzy +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." -msgstr "使用左侧驾驶拓扑，从顶点 :math:`1` 到离点 `(2.9, 1.8)` 最近的位置获取 :math:`2` 条路径。" +#, fuzzy +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" -msgid "Left driving side" -msgstr "左驾驶侧" +#, fuzzy +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." -msgstr "使用左侧驾驶拓扑，从点 :math:`1` 到点 :math:`3` 获取 :math:`2` 条路径，并包含详细信息。" +#, fuzzy +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "Right driving side" -msgstr "右驾驶侧" +#, fuzzy +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." -msgstr "使用右侧驾驶拓扑，从点 :math:`1` 到点 :math:`2` 获取 :math:`2` 条路径，同时使用堆路径（heap paths）并包含详细信息。" +#, fuzzy +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +#, fuzzy +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." -msgstr "``pgr_withPointsVia`` - 经过一系列顶点和/或点的路线。" +#, fuzzy +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." -msgstr "给定一个图、图上边缘的一组点以及一个顶点列表，此函数相当于找到 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:`vertex` 可以是一个顶点或图上的一个点），对于所有的 :math:`i` ，满足 :math:`i < size\\_of(via\\;vertices)` 。" +#, fuzzy +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" -msgstr "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**options**])" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." -msgstr "在有向图上查找按顺序访问顶点 :math:`\\{-6, 15, -5\\}` 的路线。" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" -msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 函数" +msgid "Removal of unused C/C++ code" +msgstr "移除未使用的C/C++代码" -msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." -msgstr "所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{-1, 7, -3, 16, 15\\}` 的路线。" +msgid "Refactor the Script to build the update PostgreSQL file." +msgstr "" -msgid "Prim - Family of functions" -msgstr "Prim - 函数族" +msgid "One process & driver for:" +msgstr "" -msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." -msgstr "prim 算法由捷克数学家 Vojtěch Jarník 于 1930 年开发。 它是一种贪心算法，为带权无向图找到最小生成树。 这意味着它找到形成包含每个顶点的树的边的子集，其中树中所有边的总权重最小化。 该算法的运行方式是从任意起始顶点一次构建一个顶点，在每一步添加从树到另一个顶点的最便宜的可能连接。" +msgid "allpairs: johnson and Floyd-Warshall" +msgstr "" -msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." -msgstr "该算法在可能不连通的图中找到最小生成森林； 相反，Prim 算法的最基本形式只能在连通图中找到最小生成树。 然而，对图的每个连通分量分别运行Prim算法，则称为最小生成森林。" +msgid "Shortest path: Dijkstra and withPoints using Dijkstra" +msgstr "" -msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" -msgstr "来自 boost Graph：“Boost.Graph 中实现的算法不会在具有平行边的图上产生正确的结果。”" +msgid "Deprecation of internal C/C++ functions" +msgstr "弃用内部C/C++函数" -msgid "Boost: `Prim's algorithm `__" -msgstr "Boost: `Prim算法 `__" +msgid "Deprecated functions are substituted by new function." +msgstr "" -msgid "Wikipedia: `Prim's algorithm `__" -msgstr "维基百科: `Prim算法 `__" +#, fuzzy +msgid "_pgr_drivingDistance => _pgr_drivingDistancev4" +msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" -msgid "Proposed Functions" -msgstr "提议的功能" +#, fuzzy +msgid "_pgr_withPointsDD => _pgr_withPointsddv4" +msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" -msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr ":doc:`pgr_lineGraph` - 用于生成折线图的转换算法。" +msgid "_pgr_kruskal => _pgr_kruskalv4" +msgstr "" -msgid "Reference" -msgstr "参考" +msgid "_pgr_prim => _pgr_primv4" +msgstr "" -msgid "Release Notes" -msgstr "发布说明" +#, fuzzy +msgid "_pgr_dijkstra => _pgr_dijkstra_v4" +msgstr "pgr_bddijkstra - 使用 pgr_bdDijkstra代替" -msgid "To see the full list of changes check the list of `Git commits `_ on Github." -msgstr "要查看完整的更改列表，请检查 Github 上的 `Git提交列表 `_ 。" +#, fuzzy +msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4" +msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" -msgid "Mayors" -msgstr "主要版本" +#, fuzzy +msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4" +msgstr "pgr_withPoints 是 **带有点** 的 pgr_dijkstra" -msgid "pgRouting 4" -msgstr "pgRouting 4" +#, fuzzy +msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4" +msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" -msgid "Minors 4.x" -msgstr "Minors 4.x" +#, fuzzy +msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4" +msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" + +msgid "Internal C/C++ functions in legacy" +msgstr "遗留代码中内部 C/C++ 函数" #, fuzzy -msgid "pgRouting 4.1" -msgstr "pgRouting 4.0" +msgid "`#2683 `__ _trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "pgRouting 4.1.0 Release Notes" -msgstr "pgRouting 3.1.0 发布说明" +msgid "`#2683 `__ _v4trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" -msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" +msgid "`#2748 `__ _pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" -msgid "No changes yet" -msgstr "" +#, fuzzy +msgid "`#2913 `__ _pgr_dagShortestPath" +msgstr "`#2683 `__: pgr_trsp" msgid "pgRouting 3" msgstr "pgRouting 3" @@ -15163,9 +15247,6 @@ msgstr "收缩：" msgid "Removed unnecessary column seq" msgstr "删除了不必要的列 seq" -msgid "Bug Fixes" -msgstr "Bug修复" - msgid "pgr_maxFlowMinCost" msgstr "pgr_maxFlowMinCost" @@ -16779,3 +16860,7 @@ msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" + +#, fuzzy +#~ msgid "pgRouting 4.0.0-alpha1 Release Notes" +#~ msgstr "pgRouting 4.0.0 发布说明"