diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index 19236fa461d..98a9c3e2872 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: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-10-24 01:29+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Anonymous \n" "Language-Team: German \n" @@ -338,6 +338,12 @@ msgstr "" msgid "Experimental" msgstr "" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "" @@ -2468,6 +2474,112 @@ msgstr "" msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "" +msgid "Circuits - Family of Functions" +msgstr "" + +msgid "The following functions work on circuits of directed graphs." +msgstr "" + +msgid ":doc:`pgr_hawickCircuits` - Hawick's circuits algorithm." +msgstr "" + +#, fuzzy +msgid "``start vid``" +msgstr "``start_vid``" + +msgid "A vertex of the circuits: - All the circuits that contain the vertex are returned. - When ``0`` all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``start vids``" +msgstr "``start_vid``" + +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "" + +msgid "Vertices of the circuits: for each requested vertex: - All the circuits that contain the vertex are returned: - When empty all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``min_depth``" +msgstr "``max_depth``" + +msgid "Minimum number of vertices in a circuit. * Exclude 2 edge circuits by increasing this number." +msgstr "" + +msgid "``9223372036854775807``" +msgstr "" + +msgid "Maximum number of vertices in a circuit." +msgstr "" + +msgid "``self_loops``" +msgstr "" + +msgid "When ``true`` self loops are included in the results." +msgstr "" + +msgid "When ``false`` self loops are excluded from the results." +msgstr "" + +msgid "Self loops are included or excluded regardless of ``min_depth`` and ``max_depth``." +msgstr "" + +#, fuzzy +msgid "``u_turn_on_edge``" +msgstr "``U_turn_on_edge``" + +msgid "A u-turn on an edge is a 2 edge circuit that uses the same ``id`` on both directions of the edge." +msgstr "" + +msgid "When ``true``: u-turns are part of the results." +msgstr "" + +msgid "When ``false``: u-turns are discarded when the circuit can be formed with two different edges; a u-turn is kept when it is the only option, that is, when the two vertices are connected by a single edge." +msgstr "" + +msgid "Self loops are not affected." +msgstr "" + +msgid "Sequential value starting from ``1``" +msgstr "" + +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Id of the circuit starting from ``1``" +msgstr "" + +msgid "Relative position in the circuit. Has value **0** for the beginning of a circuit" +msgstr "" + +msgid "Identifier of the starting vertex of the circuit." +msgstr "" + +msgid "Identifier of the ending vertex of the circuit." +msgstr "" + +msgid "``pred``" +msgstr "``pred``" + +msgid "Identifier of the node that precedes ``node`` in the circuit." +msgstr "" + +msgid "When ``node`` is the first node of the circuit, it has the same value as ``node``." +msgstr "" + +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "" + +msgid "Identifier of the edge used to arrive from ``pred`` to ``node``. - ``-1`` when :math:`depth = 0`." +msgstr "" + +msgid "Cost to traverse from ``pred`` to ``node`` using ``edge``. - ``0`` when :math:`depth = 0`." +msgstr "" + +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "" + msgid "Coloring - Family of functions" msgstr "" @@ -3020,9 +3132,6 @@ msgstr "" msgid ":math:`depth-1` is the depth of ``pred``" msgstr "" -msgid "``pred``" -msgstr "``pred``" - msgid "Predecessor of ``node``." msgstr "" @@ -3047,6 +3156,9 @@ msgstr "" msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." msgstr "" +msgid ":doc:`pgr_maxWeightedMatch` - Calculates a maximum weighted matching in a graph." +msgstr "" + msgid ":doc:`chinesePostmanProblem-family`" msgstr "" @@ -3098,9 +3210,27 @@ msgstr "" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr "" +msgid ":doc:`pgr_coreNumbers` - Computes the core number of each vertex." +msgstr "" + msgid ":doc:`TRSP-family`" msgstr "" +msgid ":doc:`planar-family`" +msgstr "" + +msgid ":doc:`pgr_isPlanar` - Returns a boolean depending upon the planarity of the graph." +msgstr "" + +msgid ":doc:`pgr_makeBiconnectedPlanar` - Returns edges to add to a planar graph to make each connected component biconnected." +msgstr "" + +msgid ":doc:`pgr_planarFaces` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +msgid ":doc:`circuits-family`" +msgstr "" + msgid "categories" msgstr "" @@ -3119,12 +3249,6 @@ msgstr "" msgid ":doc:`pgr_edwardMoore`" msgstr "" -msgid "Planar Family" -msgstr "" - -msgid ":doc:`pgr_isPlanar`" -msgstr "" - msgid "Miscellaneous Algorithms" msgstr "" @@ -3137,9 +3261,6 @@ msgstr "" msgid ":doc:`pgr_transitiveClosure`" msgstr "" -msgid ":doc:`pgr_hawickCircuits`" -msgstr "" - msgid "Flow - Family of functions" msgstr "" @@ -3527,7 +3648,84 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "" -msgid "Code enhancements" +msgid "4.1.0 Build" +msgstr "" + +#, fuzzy +msgid "PostgreSQL:" +msgstr "``postgreSQL``" + +msgid "Minimum requirement: 14" +msgstr "" + +msgid "Boost library:" +msgstr "" + +msgid "Minimum requirement: 1.74" +msgstr "" + +msgid "cmake:" +msgstr "" + +msgid "Minimum requirement: 3.22" +msgstr "" + +msgid "4.1.0 Summary of changes by function" +msgstr "" + +#, fuzzy +msgid "pgr_coreNumbers" +msgstr "pgr_nodeNetwork" + +msgid "New experimental function." +msgstr "" + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" + +msgid "Fix the way it builds the graph" +msgstr "" + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + +msgid "New optional parameters: ``min_depth``, ``max_depth``, ``self_loops`` and ``u_turn_on_edge``." +msgstr "" + +msgid "New signatures to select starting vertices." +msgstr "" + +msgid "Deprecated signature: ``pgr_hawickCircuits(text)``." +msgstr "" + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar" +msgstr "pgr_makeConnected" + +#, fuzzy +msgid "pgr_maxWeightedMatch" +msgstr "pgr_maxCardinalityMatch" + +#, fuzzy +msgid "pgr_planarFaces" +msgstr "pgr_isPlanar" + +msgid "4.1.0 New experimental functions." +msgstr "" + +msgid "`#3136 `__: pgr_maxWeightedMatch" +msgstr "" + +msgid "`#3140 `__: pgr_makeBiconnectedPlanar" +msgstr "" + +msgid "`#3142 `__: pgr_coreNumbers" +msgstr "" + +msgid "`#3143 `__: pgr_planarFaces" +msgstr "" + +msgid "4.1.0 Code enhancements" msgstr "" msgid "`#3049 `__: Use enumeration on drivers and process." @@ -3563,19 +3761,31 @@ msgstr "" msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "" -msgid "Bug Fixes" +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" msgstr "" -msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" +msgid "`#3131 `__: binaryBreadthFirstSearch: Integrate into existing process/driver pair" msgstr "" -msgid "Summary of changes by function" +msgid "`#3154 `__: betweennessCentrality: use allpairs/process and driver" msgstr "" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +msgid "`#3163 `__: KSP & KSP WithPoints Use ShortestPath driver files" +msgstr "" -msgid "Fix the way it builds the graph" +msgid "`#3170 `__: pgr_hawickCircuits: wrong Boost function referenced" +msgstr "" + +msgid "4.1.0 Bug Fixes" +msgstr "" + +msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" +msgstr "" + +msgid "4.1.0 Requirements" +msgstr "" + +msgid "`#3120 `__: Up min requirements: Boost to 1.74 Postgres to 14 cmake to 3.22." msgstr "" msgid "All releases" @@ -5843,9 +6053,6 @@ msgstr "" msgid "Returns set of |generic-result|" msgstr "" -msgid "``path_id``" -msgstr "``path_id``" - msgid "Path identifier." msgstr "" @@ -5996,22 +6203,19 @@ msgstr "" msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "" -msgid "C and C++0x compilers" -msgstr "" - -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgid "C++ standard" msgstr "" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "C++17" msgstr "" -msgid "Postgresql version >= 13" +msgid "Postgresql version >= 14" msgstr "" -msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgid "The Boost Graph Library (BGL) >= 1.74.0" msgstr "" -msgid "CMake >= 3.12" +msgid "CMake >= 3.22" msgstr "" msgid "For user's documentation" @@ -6272,7 +6476,7 @@ msgstr "" msgid "Individuals (in alphabetical order)" 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, 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 "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, Mayur Galhate, 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 "Corporate Sponsors (in alphabetical order)" @@ -6995,9 +7199,6 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -msgid "New experimental function." -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 "" @@ -7724,9 +7925,6 @@ msgstr "" msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "" -msgid "Sequential value starting from ``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." msgstr "" @@ -8153,9 +8351,6 @@ msgstr "" msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." msgstr "" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "" - msgid "**Empty**" msgstr "" @@ -8612,196 +8807,506 @@ msgstr "" msgid "Create the contracted graph." msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgid "``pgr_coreNumbers`` - Experimental" msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgid "``pgr_coreNumbers`` - Computes the core number of each vertex in an undirected graph using k-core decomposition." msgstr "" -msgid "Version 3.4.0" +msgid "Version 4.1.0" 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 "The **core number** of a vertex is the largest value :math:`k` such that the vertex **belongs to the** :math:`k`-core of the graph." 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 "The :math:`k`-core of a graph is the maximal subgraph in which every vertex has degree at least :math:`k` within that subgraph. K-core decomposition iteratively removes vertices of degree less than :math:`k` until no such vertices remain, increasing :math:`k` at each stage. The process assigns one core number to every vertex." msgstr "" -msgid "The implementation is for **undirected** graphs." +msgid "The core number says how deeply a vertex sits inside the graph:" msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "Core :math:`1` vertices are peeled in the first step. They are terminal nodes of the peeled graph, adjacent to at most one other vertex in the induced subgraph." msgstr "" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgid "Core :math:`2` vertices survive that step. They lie on cycles, or on the chains joining them." msgstr "" -msgid "where :math:`|V|` is the number of vertices," +msgid "Core :math:`3` and above mark dense regions where every vertex keeps three or more neighbors however much of the graph is peeled away." msgstr "" -msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgid "Parallel edges between the same pair of vertices are collapsed into a single edge before the peeling starts, so edge multiplicity does not inflate core numbers." msgstr "" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgid "Three parallel edges between two vertices give both vertices core :math:`1`, the same as a single edge." msgstr "" -msgid "Returns set of |result_node_order|" +msgid "Self loop: a vertex is not a neighbor of its own vertex, so it is dropped before peeling and does not contribute to that vertex's degree." msgstr "" -msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgid "A vertex whose only edge is a self loop has no real neighbors left, So the core number is 0." msgstr "" -msgid "Returns set of ``(seq, node)``" +msgid "Loops and parallel edges are removed." msgstr "" -msgid "Sequence of the order starting from 1." +msgid "All vertices are kept" msgstr "" -msgid "New ordering in reverse order." +msgid "Costs are ignored" msgstr "" -msgid "`Boost: Cuthill-McKee Ordering `__" +msgid "Each vertex receives exactly one core number" msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgid "Results:" msgstr "" -msgid "``pgr_dagShortestPath`` - Experimental" +msgid "Number of returned rows: :math:`|V|`." 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 "Ordered by ``node`` ascending." msgstr "" -msgid "pgr_dagShortestPath(Combinations)" +msgid "No rows returned when no edges found. Emits a ``NOTICE``" 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 "Running time: :math:`O(|E| + |E| + |V| log |V|)`" msgstr "" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgid "Loop and parallel removal: :math:`O(|E|)`" 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 "Peeling algorithm: :math:`O(|E|)`" msgstr "" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgid "Sorting: :math:`|V| log |V|`" msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgid "pgr_coreNumbers(`Edges SQL`_)" msgstr "" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgid "Returns set of ``(seq, node, core)``" msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgid "Core numbers on a subgraph of :doc:`sampledata`" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Vertices are colored by core number in the diagrams below: ``deepskyblue`` for core :math:`1` and ``green`` for core :math:`2`." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgid "All returned vertices have core number :math:`1`; they belong to the 1-core but not to any higher core." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Vertices :math:`6`, :math:`7`, and :math:`10` have higher degree here, but peeling degree-:math:`1` vertices first removes the entire subgraph before a 2-core can form." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgid "The following diagram shows edges :math:`\\{1, \\ldots, 7\\}` from :doc:`sampledata`; every vertex label shows ``node (core)``." msgstr "" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgid "The next subgraph uses edges :math:`\\{1, 2, 3, 4\\}`, the same set as the main example of :doc:`pgr_betweennessCentrality`. Every vertex is still core :math:`1` because the structure is a tree-like path with terminal nodes at :math:`5` and :math:`15`." msgstr "" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgid "K-core peeling (illustration)" msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgid "On edges :math:`id < 10`, vertices :math:`5` and :math:`15` are removed first because they have degree :math:`1`. After further peeling, vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` remain as the 2-core (shown in green below)." msgstr "" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgid "Sequential value starting from 1." msgstr "" -msgid "Return columns" +#, fuzzy +msgid "``core``" +msgstr "``color``" + +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." msgstr "" -msgid "Making **start_vids** the same as **end_vids**" +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" -msgid "`Boost: DAG shortest paths `__" +msgid "Sample network overview" msgstr "" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" +msgstr "" -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgid "Both functions use the same ``Edges SQL`` format. The betweenness example on edges :math:`\\{1, 2, 3, 4\\}` measures shortest-path influence; core numbers measure peeling resilience." msgstr "" -msgid "Error messages adjustment." +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" msgstr "" -msgid "New signature with only Edges SQL." +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." msgstr "" -msgid "Calculates the degree of the vertices of an undirected graph" +msgid "Vertex :math:`6` has degree :math:`3` in this subgraph but still has core :math:`1`, because removing :math:`5` and :math:`15` first leaves no subgraph where every vertex has degree at least :math:`2`." msgstr "" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgid "Compare with :doc:`pgr_betweennessCentrality` on the same edges: vertex :math:`6` has the highest betweenness, but core number does not rank vertices by path importance." msgstr "" -msgid "A loop contributes 2 to a vertex's degree." +msgid "Subgraph with core-:math:`2` vertices" msgstr "" -msgid "A vertex with degree 0 is called an isolated vertex." +msgid "Adding edges :math:`5` through :math:`9` connects the inner vertices into a 2-core. The undirected layout below shows the same network." msgstr "" -msgid "Isolated vertex is not part of the result" +msgid "Undirected view of the sample network" msgstr "" -msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgid "2) Core numbers on edges :math:`id < 10`" msgstr "" -msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." msgstr "" -msgid "The code can be used as base code for the particular application requirements." +msgid "Vertices :math:`1`, :math:`3`, :math:`5`, :math:`15`, and :math:`16` are attached by tree-like branches and remain core :math:`1`." msgstr "" -msgid "No ordering is performed." +msgid "Edge :math:`8` (between :math:`7` and :math:`11`) closes a cycle with edges :math:`4`, :math:`2`, and :math:`5`, which is why the inner four vertices survive peeling." msgstr "" -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgid "Filtering results in SQL" msgstr "" -msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." msgstr "" -msgid "RETURNS SETOF |result-degree|" +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" msgstr "" -msgid "Edges" +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." msgstr "" -msgid "example" +msgid "Use it to export only the hub vertices for further analysis." msgstr "" -msgid "Get the degree of the vertices defined on the edges table" +msgid "Full sample graph" msgstr "" -msgid "Edges and Vertices" +msgid "4) Core numbers on all edges" msgstr "" -msgid "Extracting the vertex information" +msgid "The full network has :math:`17` vertices and maximum core number :math:`2`." msgstr "" -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgid "Terminal branches (vertices :math:`1`, :math:`2`, :math:`3`, :math:`4`, :math:`5`, :math:`9`, :math:`13`, :math:`14`) remain core :math:`1`." 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 "The 2-core is vertices :math:`6`, :math:`7`, :math:`8`, :math:`10`, :math:`11`, :math:`12`, :math:`15`, :math:`16` and :math:`17`: the central block of the city network. Vertex :math:`9` hangs off :math:`8` by edge :math:`14` alone, so it is peeled first and stays core :math:`1`." +msgstr "" + +msgid "Small graphs" +msgstr "" + +msgid "5) Single edge (two terminal nodes)" +msgstr "" + +msgid "Both endpoints have core number :math:`1`." +msgstr "" + +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." +msgstr "" + +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." +msgstr "" + +msgid "6) Triangle (all vertices core :math:`2`)" +msgstr "" + +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." +msgstr "" + +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." +msgstr "" + +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." +msgstr "" + +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" +msgstr "" + +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." +msgstr "" + +msgid "This is the 2-core heart of example 2) before branches are attached." +msgstr "" + +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." +msgstr "" + +msgid "8) Star graph (hub and spokes, all core :math:`1`)" +msgstr "" + +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." +msgstr "" + +msgid "The hub has degree :math:`4`, but removing the four leaves leaves an isolated vertex, so the hub never belongs to a 2-core." +msgstr "" + +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." +msgstr "" + +msgid "Empty edge set" +msgstr "" + +msgid "9) No edges in the SQL query" +msgstr "" + +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." +msgstr "" + +msgid "No exception is raised." +msgstr "" + +msgid "Core numbers and planarity" +msgstr "" + +msgid "Vertices with higher core numbers often lie in densely connected regions. The workflow below computes core numbers, filters the 2-core, and checks whether the subgraph can be drawn without edge crossings using :doc:`pgr_isPlanar`." +msgstr "" + +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" +msgstr "" + +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" +msgstr "" + +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." +msgstr "" + +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." +msgstr "" + +msgid "Planarity and core number measure different properties: a graph can be planar while still having a mix of core-:math:`1` and core-:math:`2` vertices." +msgstr "" + +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" +msgstr "" + +msgid "The examples above reach at most core :math:`2`, because the :doc:`sampledata` network has degeneracy :math:`2`. Higher cores need a denser graph. In the complete graph :math:`K_4` every vertex is adjacent to the other three, so no vertex can ever be peeled at :math:`k \\leq 3` and the whole graph is its own 3-core." +msgstr "" + +msgid "Every vertex has degree :math:`3`, so nothing is removed while peeling at :math:`k = 1`, :math:`2` or :math:`3`: all four vertices have core :math:`3`." +msgstr "" + +msgid "In general the complete graph :math:`K_n` has core number :math:`n - 1` for every vertex, which is the maximum possible core number on :math:`n` vertices." +msgstr "" + +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." +msgstr "" + +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" +msgstr "" + +msgid "`Wikipedia: Degeneracy (graph theory) `__" +msgstr "" + +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "" + +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "" + +msgid "Version 3.4.0" +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." +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." +msgstr "" + +msgid "The implementation is for **undirected** graphs." +msgstr "" + +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "" + +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "" + +msgid "where :math:`|V|` is the number of vertices," +msgstr "" + +msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgstr "" + +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "" + +msgid "Returns set of |result_node_order|" +msgstr "" + +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "" + +msgid "Returns set of ``(seq, node)``" +msgstr "" + +msgid "Sequence of the order starting from 1." +msgstr "" + +msgid "New ordering in reverse order." +msgstr "" + +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "" + +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "" + +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_dagShortestPath(Combinations)" +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 "" + +msgid "This implementation can only be used with a directed graph with no cycles i.e. directed acyclic 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 "" + +msgid "Process is valid for weighted directed acyclic graphs only." +msgstr "" + +msgid "Avoids one edge cycle: `reverse_cost` column is used when :math:`cost < 0`." +msgstr "" + +msgid "If the graph is not DAG, will throw a PostgreSQL `ERROR`." +msgstr "" + +msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgstr "" + +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgstr "" + +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "" + +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgstr "" + +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "" + +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgstr "" + +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "" + +msgid "`reverse_cost` column is used when :math:`cost < 0` to avoid edge cycle." +msgstr "" + +msgid "Return columns" +msgstr "" + +msgid "Making **start_vids** the same as **end_vids**" +msgstr "" + +msgid "`Boost: DAG shortest paths `__" +msgstr "" + +msgid "https://en.wikipedia.org/wiki/Topological_sorting" +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." +msgstr "" + +msgid "Error messages adjustment." +msgstr "" + +msgid "New signature with only Edges SQL." +msgstr "" + +msgid "Calculates the degree of the vertices of an undirected graph" +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 "A loop contributes 2 to a vertex's degree." +msgstr "" + +msgid "A vertex with degree 0 is called an isolated vertex." +msgstr "" + +msgid "Isolated vertex is not part of the result" +msgstr "" + +msgid "Vertex not participating on the subgraph is considered and isolated vertex." +msgstr "" + +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgstr "" + +msgid "The code can be used as base code for the particular application requirements." +msgstr "" + +msgid "No ordering is performed." +msgstr "" + +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgstr "" + +msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +msgstr "" + +msgid "RETURNS SETOF |result-degree|" +msgstr "" + +msgid "Edges" +msgstr "" + +msgid "example" +msgstr "" + +msgid "Get the degree of the vertices defined on the edges table" +msgstr "" + +msgid "Edges and Vertices" +msgstr "" + +msgid "Extracting the vertex information" +msgstr "" + +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +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`_)" msgstr "" msgid "Calculate the degree of the nodes:" @@ -9032,9 +9537,6 @@ msgstr "" msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network." -msgstr "" - msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" @@ -9491,6 +9993,12 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" +msgid "Version 4.0.2" +msgstr "" + +msgid "Fix: bad alloc" +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 "" @@ -9575,6 +10083,15 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "" @@ -9638,9 +10155,6 @@ msgstr "" msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" -msgid "end-before" -msgstr "" - msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" @@ -9650,9 +10164,6 @@ msgstr "" msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -msgid "Version 4.1.0" -msgstr "" - msgid "Output columns standardized to |result_edge_color|" msgstr "" @@ -10274,79 +10785,127 @@ msgstr "``system``" msgid "Operative system" msgstr "" -msgid "``postgreSQL``" -msgstr "``postgreSQL``" +msgid "``postgreSQL``" +msgstr "``postgreSQL``" + +msgid "pgsql used" +msgstr "" + +msgid "``compiler``" +msgstr "``compiler``" + +msgid "Compiler and version" +msgstr "" + +msgid "``boost``" +msgstr "``boost``" + +msgid "Boost version" +msgstr "" + +msgid "``hash``" +msgstr "``hash``" + +msgid "Git hash of pgRouting build" +msgstr "" + +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr "" + +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgstr "" + +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Heath A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs." +msgstr "" + +msgid "Circuit enumeration in directed graphs, where circuits with parallel arcs are enumerated." +msgstr "" + +msgid "Each combination of parallel arcs is returned as a different circuit." +msgstr "" + +msgid "Works for directed graphs." +msgstr "" + +msgid "The algorithm outputs the distinct circuits present in the graph." +msgstr "" + +msgid "The circuits are elementary: a vertex is not repeated within a circuit, except the starting vertex that closes the circuit." +msgstr "" + +msgid "When no initial vertices are given all circuits are in canonical order of the vertices insertion of the graph: A circuit with vertices ``u``, ``v``: ``u`` starting circuits containing ``v`` will not be listed on ``start_vid = v`` rows." +msgstr "" -msgid "pgsql used" +msgid "Different edge ordering gives different canonical ordering." msgstr "" -msgid "``compiler``" -msgstr "``compiler``" +msgid "When start vertices are given, all circuits are returned for each requested vertex it contains, and the results are grouped by ``start_vid``." +msgstr "" -msgid "Compiler and version" +msgid "The graph passed to the algorithm discard parallel edges with higher costs." msgstr "" -msgid "``boost``" -msgstr "``boost``" +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgstr "" -msgid "Boost version" +msgid "where :math:`|V|` is the number of vertices in the graph." msgstr "" -msgid "``hash``" -msgstr "``hash``" +msgid "where :math:`|c|` is the number of circuits in the graph." +msgstr "" -msgid "Git hash of pgRouting build" +msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "" -msgid "``pgr_hawickCircuits`` - Experimental" +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vid** [, **options**])" msgstr "" -msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vids** [, **options**])" 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 "**options:** ``[min_depth, max_depth, self_loops, u_turn_on_edge]``" 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 "Returns set of |circuits-result|" msgstr "" -msgid "The algorithm implementation works only for directed graph" +msgid "All circuits" msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgid "pgr_hawickCircuits(`Edges SQL`_ [, **options**])" msgstr "" -msgid "The algorithm outputs the distinct circuits present in the graph." +msgid "All the circuits of the pgRouting :doc:`sampledata`" msgstr "" -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgid "When no starting vertex is given, all the circuits of the graph are returned. The result has 94 rows, one ``path_id`` for each circuit:" msgstr "" -msgid ":math:`|c|` is the number of circuits in the graph." +msgid "Single start vertex" msgstr "" -msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgid "Circuits that contain vertex :math:`10`" msgstr "" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +msgid "Many start vertices" msgstr "" -msgid "Id of the circuit starting from ``1``" +msgid "Circuits that contain vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgid "The examples use the following table ``c_example``, that represent a cul_de_sac where the exit is on vertex :math:`5` and the vehicle is on vertex :math:`1` but pointing at the wrong direction of the exit." msgstr "" -msgid "Identifier of the starting vertex of the circuit." +msgid "All possible ways to return to vertex :math:`1`." msgstr "" -msgid "Identifier of the ending vertex of the circuit." +msgid "Exclude self loops." msgstr "" -msgid "Identifier of the node in the path from a vid to next vid." +msgid "Exclude self loops and U-turn on the same edge." msgstr "" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" msgid "``pgr_isPlanar`` - Experimental" @@ -10964,6 +11523,78 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "" +msgid "``pgr_makeBiconnectedPlanar`` - Experimental" +msgstr "" + +msgid "``pgr_makeBiconnectedPlanar`` — Returns the set of edges needed to make each connected component of a planar graph biconnected." +msgstr "" + +msgid "``pgr_makeBiconnectedPlanar`` identifies the missing edges that need to be added to each connected component of an existing planar graph to make those components biconnected, while ensuring the graph remains planar." +msgstr "" + +msgid "A graph is considered **biconnected** if it is connected and cannot be broken into disconnected pieces by deleting any single vertex (it has no articulation points). A planar graph is one that can be drawn in two-dimensional space with no two of its edges crossing." +msgstr "" + +msgid "If the graph is not connected it will treat each component as an idividual graph." +msgstr "" + +msgid "Run :doc:`pgr_makeConnected` to connect all components." +msgstr "" + +msgid "When the graph is not planar it will emit an ``ERROR``" +msgstr "" + +msgid "Run :doc:`pgr_isPlanar` first." +msgstr "" + +msgid "All vertices are kept." +msgstr "" + +msgid "Costs are ignored." +msgstr "" + +msgid "Returns a list of all new edges needed to make biconected graphs out of each connected component." +msgstr "" + +msgid "Empty results when the graph is already biconnected planar." +msgstr "" + +msgid "Running time: :math:`O(|V| + |E| + R \\log R)` for each component" +msgstr "" + +msgid ":math:`R` is the number of returned edges." +msgstr "" + +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "" + +msgid "Returns set of |result-component-make|" +msgstr "" + +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "" + +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." +msgstr "" + +msgid "When a graph contains multiple disconnected components, each component is processed independently. Components (2,4) and (13,14) are already biconnected (0 articulation points) and require no new edges." +msgstr "" + +msgid "4-vertex path graph." +msgstr "" + +msgid "Create a 4-vertex tree graph." +msgstr "" + +msgid "Get the edges needed to have biconnected planar graph." +msgstr "" + +msgid "Adding the edges to the graph" +msgstr "" + +msgid "`Boost: make_biconnected_planar `__" +msgstr "" + msgid "``pgr_makeConnected`` - Experimental" msgstr "" @@ -10982,9 +11613,6 @@ msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "" -msgid "Returns set of |result-component-make|" -msgstr "" - msgid "List of edges that are needed to connect the graph." msgstr "" @@ -11195,6 +11823,42 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" +msgid "``pgr_maxWeightedMatch`` - Experimental" +msgstr "" + +msgid "``pgr_maxWeightedMatch`` — Calculates a maximum weighted matching in a graph." +msgstr "" + +msgid "A **maximum weighted matching** in a graph is a matching where the sum of the weights of selected edges is maximized." +msgstr "" + +msgid "Each vertex is matched with at most one other vertex." +msgstr "" + +msgid "Maximizes the total edge weight sum." +msgstr "" + +msgid "There may be many maximum weighted matchings." +msgstr "" + +msgid "Calculates one possible maximum weighted matching in a graph." +msgstr "" + +msgid "Running time: :math:`O(V^3)`." +msgstr "" + +msgid "pgr_maxWeightedMatch(`Edges SQL`_)" +msgstr "" + +msgid "Set of |result-edge|" +msgstr "" + +msgid "Maximum weighted matching on a custom 5-vertex graph." +msgstr "" + +msgid "`Boost: maximum_weighted_matching `__" +msgstr "" + msgid "``pgr_pickDeliver`` - Experimental" msgstr "" @@ -11390,6 +12054,151 @@ msgstr "" msgid "This implementation's travel time: 854.54" msgstr "" +msgid "``pgr_planarFaces`` - Experimental" +msgstr "" + +msgid "``pgr_planarFaces`` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +msgid "In a planar embedding, the graph is drawn in the plane so that edges meet only at vertices. A face is a maximal connected region of the plane bounded by edges." +msgstr "" + +msgid "Every bounded face is a cycle of edges enclosing an interior region. The exterior face, also called the unbounded face, is the region outside the outermost cycle." +msgstr "" + +msgid "Once an embedding is fixed, each undirected edge has a left and a right side when walked in the direction the embedding assigns around each vertex." +msgstr "" + +msgid "In a connected planar undirected graph, each edge separates exactly two faces, so it contributes one row on the left and one on the right." +msgstr "" + +msgid "``pgr_planarFaces`` returns those incidences: ``face_id`` names the face, ``edge_id`` is the border edge, and ``side`` is ``1`` (left) or ``2`` (right) relative to the embedding." +msgstr "" + +msgid "The function first computes a planar embedding with the Boyer-Myrvold planarity test, then walks faces with Boost ``planar_face_traversal``.i" +msgstr "" + +msgid "Loops and paralell edges are preserved." +msgstr "" + +msgid "They are used to determine the existance of an edge" +msgstr "" + +msgid "Run :doc:`pgr_isPlanar` first" +msgstr "" + +msgid "The result has one row per edge-side pair" +msgstr "" + +msgid "Graph with :math:`|E|` edges yields :math:`2|E|` rows." +msgstr "" + +msgid "Number of faces: * Obeys Euler's formula: :math:`|V| - |E| + |F| = 2` * On a graph with :math:`C` components: :math:`|V| - |E| + |F| = 2C`." +msgstr "" + +msgid "Running time: :math:`O(|E| + |V|)`" +msgstr "" + +msgid "pgr_planarFaces(`Edges SQL`_)" +msgstr "" + +msgid "Returns set of ``(seq, face_id, edge_id, side)``" +msgstr "" + +msgid "Faces of the full :doc:`sampledata` graph" +msgstr "" + +msgid "The query returns **36 rows**, twice the **18** edges in ``edges``, consistent with :math:`2|E|`." +msgstr "" + +msgid "``face_id`` runs from **1** through **7** on this network; each id is one face of the embedding, including the unbounded **exterior face** (here ``face_id = 1`` borders the outer layout of the city block)." +msgstr "" + +msgid "Every ``edge_id`` appears **twice**, once with ``side = 1`` and once with ``side = 2``." +msgstr "" + +msgid "Rows follow the counterclockwise walk of each face in the computed embedding." +msgstr "" + +msgid "Have :math:`3` components then number if faces = :math:`17 - 18 + 7 = 6 = 2 \\times 3`." +msgstr "" + +#, fuzzy +msgid "``face_id``" +msgstr "``end_id``" + +msgid "Identifier of the face in the computed embedding." +msgstr "" + +msgid "Identifier of the edge that borders the face." +msgstr "" + +msgid "``1`` when the edge borders the face on the left side." +msgstr "" + +msgid "``2`` when the edge borders the face on the right side." +msgstr "" + +msgid "Non-planar graphs" +msgstr "" + +msgid "Face extraction requires a planar graph. Subgraphs containing a :math:`K_5` or :math:`K_{3,3}` minor cannot be embedded without crossings; ``pgr_planarFaces`` raises ``ERROR: Graph is not planar`` in that case. The :doc:`pgr_isPlanar` documentation shows a non-planar subgraph of ``sampledata`` (edges highlighted in blue in the figure)." +msgstr "" + +msgid "Create a :math:`K_5` graph." +msgstr "" + +msgid "Test planarity: dont execute when is not planar." +msgstr "" + +msgid "Or get an error: (not shown)" +msgstr "" + +msgid "Planarity of loops" +msgstr "" + +msgid "One loop graph with only one vertex:" +msgstr "" + +msgid "Two loop graph with only one vertex:" +msgstr "" + +msgid "Triangular graphs" +msgstr "" + +msgid "Triangular graph (no duplicate edges)" +msgstr "" + +msgid "Six rows are returned: :math:`2 \\times 3` edges." +msgstr "" + +msgid ":math:`face\\_id = 1` is the interior face." +msgstr "" + +msgid ":math:`face\\_id = 2` is the exterior face. face." +msgstr "" + +msgid "Each edge lists ``1`` on one face and ``2`` on the other." +msgstr "" + +msgid "Triangular graph (duplicate edges)" +msgstr "" + +msgid ":doc:`pgr_isPlanar`" +msgstr "" + +msgid "Boost Graph Library: `Planar Face Traversal `__" +msgstr "" + +msgid "Boost Graph Library: `Boost: Boyer Myrvold planarity `__" +msgstr "" + +msgid "Wikipedia: `Planar graph `__" +msgstr "" + +msgid "Boyer, J. M. and Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity Algorithms by Edge Addition. Journal of Graph Algorithms and Applications, 8(3), 241-273." +msgstr "" + msgid "``pgr_prim``" msgstr "``pgr_prim``" @@ -12683,6 +13492,9 @@ 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 "" +msgid "Planar - Family of functions" +msgstr "" + msgid "Prim - Family of functions" msgstr "" @@ -12731,12 +13543,45 @@ msgstr "" msgid "pgRouting 4.0" msgstr "" +msgid "pgRouting 4.0.2 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "4.0.2 Bug Fixes" +msgstr "" + +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "" + +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "" + msgid "pgRouting 4.0.1 Release Notes" msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" msgstr "" +msgid "Bug Fixes" +msgstr "" + msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "" @@ -12746,6 +13591,9 @@ msgstr "" msgid "`#3010 `__: Performance issue with pgr_separateTouching()" msgstr "" +msgid "Code enhancements" +msgstr "" + msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" msgstr "" @@ -12776,7 +13624,7 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" -msgid "Build" +msgid "4.0.0 Build" msgstr "" msgid "C++ standard is std17" @@ -12854,6 +13702,9 @@ msgstr "" msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" +msgid "Summary of changes by function" +msgstr "" + msgid "pgr_aStar" msgstr "pgr_aStar" @@ -12914,9 +13765,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -12983,15 +13831,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "" @@ -13715,6 +14557,9 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "" +msgid "Build" +msgstr "" + msgid "`#2713 `__: cmake missing some policies and min version" msgstr "" @@ -14096,9 +14941,6 @@ msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "" -msgid "pgr_hawickCircuits" -msgstr "pgr_hawickCircuits" - msgid "Flow functions" msgstr "" @@ -14792,9 +15634,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -16240,3 +17079,7 @@ msgstr "" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" + +#, fuzzy +#~ msgid "Planar" +#~ msgstr "pgr_isPlanar" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 01288baec9f..7296cae90b2 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -10,7 +10,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-10-24 01:29+0000\n" "PO-Revision-Date: 2025-12-10 20:25+0000\n" "Last-Translator: DeepL \n" "Language-Team: Spanish \n" @@ -343,6 +343,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - Ruteo Vía Punto/Vértice con restriccio msgid "Experimental" msgstr "Experimental" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "Funciones experimentales" @@ -2473,6 +2479,125 @@ msgstr "El grafo debe estar conectado." msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "Un SQL de aristas que representa un grafo **dirigido** con las siguientes columnas" +#, fuzzy +msgid "Circuits - Family of Functions" +msgstr "Prim - Familia de funciones" + +#, fuzzy +msgid "The following functions work on circuits of directed graphs." +msgstr "Esta función es para grafos **dirigidos**." + +#, fuzzy +msgid ":doc:`pgr_hawickCircuits` - Hawick's circuits algorithm." +msgstr "``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de circutos de Hawick." + +#, fuzzy +msgid "``start vid``" +msgstr "``start_vid``" + +msgid "A vertex of the circuits: - All the circuits that contain the vertex are returned. - When ``0`` all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``start vids``" +msgstr "``start_vid``" + +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" + +msgid "Vertices of the circuits: for each requested vertex: - All the circuits that contain the vertex are returned: - When empty all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``min_depth``" +msgstr "``max_depth``" + +msgid "Minimum number of vertices in a circuit. * Exclude 2 edge circuits by increasing this number." +msgstr "" + +#, fuzzy +msgid "``9223372036854775807``" +msgstr ":math:`9223372036854775807`" + +#, fuzzy +msgid "Maximum number of vertices in a circuit." +msgstr "es la cantidad de aristas dadas como entradas." + +msgid "``self_loops``" +msgstr "" + +#, fuzzy +msgid "When ``true`` self loops are included in the results." +msgstr "Cuando ``true`` los resultados incluyen los puntos que están en el camino." + +#, fuzzy +msgid "When ``false`` self loops are excluded from the results." +msgstr "Cuando ``false`` se realizan los cálculos." + +msgid "Self loops are included or excluded regardless of ``min_depth`` and ``max_depth``." +msgstr "" + +#, fuzzy +msgid "``u_turn_on_edge``" +msgstr "``U_turn_on_edge``" + +msgid "A u-turn on an edge is a 2 edge circuit that uses the same ``id`` on both directions of the edge." +msgstr "" + +#, fuzzy +msgid "When ``true``: u-turns are part of the results." +msgstr "Cuando ``false`` Regresa a lo más K caminos." + +msgid "When ``false``: u-turns are discarded when the circuit can be formed with two different edges; a u-turn is kept when it is the only option, that is, when the two vertices are connected by a single edge." +msgstr "" + +msgid "Self loops are not affected." +msgstr "" + +msgid "Sequential value starting from ``1``" +msgstr "Valor secuencial a partir de ``1``" + +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Id of the circuit starting from ``1``" +msgstr "Identificador del circuito comenzando con ``1``" + +#, fuzzy +msgid "Relative position in the circuit. Has value **0** for the beginning of a circuit" +msgstr "Posición relativa en la ruta. Tiene el valor **1** para el inicio de una ruta." + +msgid "Identifier of the starting vertex of the circuit." +msgstr "Identificador del vértice inicial del circuito." + +msgid "Identifier of the ending vertex of the circuit." +msgstr "Identificador del vértice final del circuito." + +msgid "``pred``" +msgstr "``pred``" + +#, fuzzy +msgid "Identifier of the node that precedes ``node`` in the circuit." +msgstr "Identificador del vértice inicial del circuito." + +#, fuzzy +msgid "When ``node`` is the first node of the circuit, it has the same value as ``node``." +msgstr "Cuando ``node`` = ``start_vid`` entonces tiene el valor ``node``." + +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." + +#, fuzzy +msgid "Identifier of the edge used to arrive from ``pred`` to ``node``. - ``-1`` when :math:`depth = 0`." +msgstr "Identificador del ``edge`` utilizado para llegar desde ``pred`` hasta ``node``." + +#, fuzzy +msgid "Cost to traverse from ``pred`` to ``node`` using ``edge``. - ``0`` when :math:`depth = 0`." +msgstr "Costo para atravesar desde ``node`` usando ``edge`` hasta el siguiente nodo en la secuencia de la ruta." + +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost: Algoritmo de Circutios de Hawick `__" + msgid "Coloring - Family of functions" msgstr "Coloración - Familia de funciones" @@ -3025,9 +3150,6 @@ msgstr "Regresa el conjunto de |result-spantree|" msgid ":math:`depth-1` is the depth of ``pred``" msgstr ":math:`depth-1` es la profundidad de ``pred``" -msgid "``pred``" -msgstr "``pred``" - msgid "Predecessor of ``node``." msgstr "Presdecesor de ``node``." @@ -3052,6 +3174,10 @@ msgstr ":doc:`pgr_maxFlowMinCost` - Detalles del flujo y el coste en los bordes. msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Solo el cálculo del Coste Mínimo." +#, fuzzy +msgid ":doc:`pgr_maxWeightedMatch` - Calculates a maximum weighted matching in a graph." +msgstr ":doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de coincidencia dentro de un grafo." + msgid ":doc:`chinesePostmanProblem-family`" msgstr ":doc:`chinesePostmanProblem-family`" @@ -3103,9 +3229,32 @@ msgstr ":doc:`pgr_betweennessCentrality` - Calcula la centralidad intermedia rel msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr ":doc:`pgr_bandwidth` - Calcula el ancho de banda de un grafo." +#, fuzzy +msgid ":doc:`pgr_coreNumbers` - Computes the core number of each vertex." +msgstr ":doc:`pgr_dijkstraNearCost` - Consigue el costo del vértice más cercano." + msgid ":doc:`TRSP-family`" msgstr ":doc:`TRSP-family`" +#, fuzzy +msgid ":doc:`planar-family`" +msgstr ":doc:`aStar-family`" + +#, fuzzy +msgid ":doc:`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." + +#, fuzzy +msgid ":doc:`pgr_makeBiconnectedPlanar` - Returns edges to add to a planar graph to make each connected component biconnected." +msgstr ":doc:`pgr_makeConnected` - Detalles de aristas para hacer grafos conectados." + +msgid ":doc:`pgr_planarFaces` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +#, fuzzy +msgid ":doc:`circuits-family`" +msgstr ":doc:`utilities-family`" + msgid "categories" msgstr "Categorías" @@ -3124,12 +3273,6 @@ msgstr ":doc:`pgr_dagShortestPath`" msgid ":doc:`pgr_edwardMoore`" msgstr ":doc:`pgr_edwardMoore`" -msgid "Planar Family" -msgstr "Familia Planar" - -msgid ":doc:`pgr_isPlanar`" -msgstr ":doc:`pgr_isPlanar`" - msgid "Miscellaneous Algorithms" msgstr "Algoritmos Diversos" @@ -3142,9 +3285,6 @@ msgstr ":doc:`pgr_stoerWagner`" msgid ":doc:`pgr_transitiveClosure`" msgstr ":doc:`pgr_transitiveClosure`" -msgid ":doc:`pgr_hawickCircuits`" -msgstr ":doc:`pgr_hawickCircuits`" - msgid "Flow - Family of functions" msgstr "Flow - Familia de funciones" @@ -3534,7 +3674,96 @@ 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.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 "Code enhancements" +#, fuzzy +msgid "4.1.0 Build" +msgstr "Corrección de errores" + +#, fuzzy +msgid "PostgreSQL:" +msgstr "``postgreSQL``" + +#, fuzzy +msgid "Minimum requirement: 14" +msgstr "Requerimientos mínimos para Sphinx: versión 1.8" + +msgid "Boost library:" +msgstr "" + +#, fuzzy +msgid "Minimum requirement: 1.74" +msgstr "Requerimientos mínimos para Sphinx: versión 1.8" + +msgid "cmake:" +msgstr "" + +msgid "Minimum requirement: 3.22" +msgstr "" + +msgid "4.1.0 Summary of changes by function" +msgstr "" + +#, fuzzy +msgid "pgr_coreNumbers" +msgstr "pgr_nodeNetwork" + +msgid "New experimental function." +msgstr "Nueva función experimental." + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" + +#, fuzzy +msgid "Fix the way it builds the graph" +msgstr "da el ancho de banda del grafo." + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + +msgid "New optional parameters: ``min_depth``, ``max_depth``, ``self_loops`` and ``u_turn_on_edge``." +msgstr "" + +#, fuzzy +msgid "New signatures to select starting vertices." +msgstr "Arreglo de identificadores de vértices iniciales." + +#, fuzzy +msgid "Deprecated signature: ``pgr_hawickCircuits(text)``." +msgstr "Firmas obsoletas." + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar" +msgstr "pgr_makeConnected" + +#, fuzzy +msgid "pgr_maxWeightedMatch" +msgstr "pgr_maxCardinalityMatch" + +#, fuzzy +msgid "pgr_planarFaces" +msgstr "pgr_isPlanar" + +#, fuzzy +msgid "4.1.0 New experimental functions." +msgstr "Nuevas funciones experimentales." + +#, fuzzy +msgid "`#3136 `__: pgr_maxWeightedMatch" +msgstr "`#2913 `__: pgr_dagShortestPath" + +#, fuzzy +msgid "`#3140 `__: pgr_makeBiconnectedPlanar" +msgstr "`#2886 `__: pgr_nodeNetwork" + +#, fuzzy +msgid "`#3142 `__: pgr_coreNumbers" +msgstr "`#2886 `__: pgr_nodeNetwork" + +#, fuzzy +msgid "`#3143 `__: pgr_planarFaces" +msgstr "`#2886 `__: pgr_nodeNetwork" + +#, fuzzy +msgid "4.1.0 Code enhancements" msgstr "Mejoras del código" #, fuzzy @@ -3581,22 +3810,41 @@ msgstr "`#2954 `__: pgr_king msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "`#2954 `__: pgr_kingOrdering" -msgid "Bug Fixes" +#, fuzzy +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "`#2931 `__: pgr_breadthFirstSearch" + +#, fuzzy +msgid "`#3131 `__: binaryBreadthFirstSearch: Integrate into existing process/driver pair" +msgstr "`#2954 `__: pgr_kingOrdering" + +#, fuzzy +msgid "`#3154 `__: betweennessCentrality: use allpairs/process and driver" +msgstr "`#2954 `__: pgr_kingOrdering" + +#, fuzzy +msgid "`#3163 `__: KSP & KSP WithPoints Use ShortestPath driver files" +msgstr "`#2954 `__: pgr_kingOrdering" + +#, fuzzy +msgid "`#3170 `__: pgr_hawickCircuits: wrong Boost function referenced" +msgstr "`#2886 `__: pgr_nodeNetwork" + +#, fuzzy +msgid "4.1.0 Bug Fixes" msgstr "Corrección de errores" #, fuzzy msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" msgstr "`#2924 `__: pgr_edgeColoring" -msgid "Summary of changes by function" -msgstr "" - -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +#, fuzzy +msgid "4.1.0 Requirements" +msgstr "Mejoras del código" #, fuzzy -msgid "Fix the way it builds the graph" -msgstr "da el ancho de banda del grafo." +msgid "`#3120 `__: Up min requirements: Boost to 1.74 Postgres to 14 cmake to 3.22." +msgstr "`#1850 `__: Cambie la versión mínima de Boost a 1.56" msgid "All releases" msgstr "Todas las versiones" @@ -5863,9 +6111,6 @@ msgstr ":doc:`pgr_withPointsKSP`" msgid "Returns set of |generic-result|" msgstr "Regresa el conjunto de |generic-result|" -msgid "``path_id``" -msgstr "``path_id``" - msgid "Path identifier." msgstr "Identificador del camino." @@ -6016,22 +6261,22 @@ msgstr "Dependencias de Compilación" 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 "C and C++0x compilers" -msgstr "Compiladores C y C++0x" - -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 "C++ standard" +msgstr "" -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 "C++17" +msgstr "" -msgid "Postgresql version >= 13" +#, fuzzy +msgid "Postgresql version >= 14" msgstr "Postgresql version >= 13" -msgid "The Boost Graph Library (BGL) >= 1.56.0" +#, fuzzy +msgid "The Boost Graph Library (BGL) >= 1.74.0" msgstr "La Librería de Grafos Boost (BGL) >= 1.56.0" -msgid "CMake >= 3.12" +#, fuzzy +msgid "CMake >= 3.22" msgstr "CMake >= 3.12" msgid "For user's documentation" @@ -6295,7 +6540,7 @@ msgid "Individuals (in alphabetical order)" msgstr "Personas (en orden alfabético)" #, 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" +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, Mayur Galhate, 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 "Corporate Sponsors (in alphabetical order)" @@ -7018,9 +7263,6 @@ msgstr "Cambio de columnas de resultados: ``seq`` se elimina" msgid "Version 2.5.0" msgstr "Versión 2.5.0" -msgid "New experimental function." -msgstr "Nueva función experimental." - 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." @@ -7747,9 +7989,6 @@ msgstr "Regresa el conjunto de |result-1-1-no-seq|" msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" -msgid "Sequential value starting from ``1``" -msgstr "Valor secuencial a partir de ``1``" - 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." @@ -8176,9 +8415,6 @@ msgstr "Los nodos verdes son nodos sin salida." 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 "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" - msgid "**Empty**" msgstr "**vacío**" @@ -8638,17 +8874,347 @@ msgstr "El arista :math:`1 \\rightarrow 3` tiene la información de los costos y msgid "Create the contracted graph." msgstr "Crear el grafo contraído." -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "``pgr_cuthillMckeeOrdering`` - Experimental" +#, fuzzy +msgid "``pgr_coreNumbers`` - Experimental" +msgstr "``pgr_pickDeliver`` - Experimental" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" -msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" +msgid "``pgr_coreNumbers`` - Computes the core number of each vertex in an undirected graph using k-core decomposition." +msgstr "" -msgid "Version 3.4.0" -msgstr "Versión 3.4.0" +#, fuzzy +msgid "Version 4.1.0" +msgstr "Versión 4.0.0" -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 "The **core number** of a vertex is the largest value :math:`k` such that the vertex **belongs to the** :math:`k`-core of the graph." +msgstr "" + +msgid "The :math:`k`-core of a graph is the maximal subgraph in which every vertex has degree at least :math:`k` within that subgraph. K-core decomposition iteratively removes vertices of degree less than :math:`k` until no such vertices remain, increasing :math:`k` at each stage. The process assigns one core number to every vertex." +msgstr "" + +msgid "The core number says how deeply a vertex sits inside the graph:" +msgstr "" + +msgid "Core :math:`1` vertices are peeled in the first step. They are terminal nodes of the peeled graph, adjacent to at most one other vertex in the induced subgraph." +msgstr "" + +msgid "Core :math:`2` vertices survive that step. They lie on cycles, or on the chains joining them." +msgstr "" + +msgid "Core :math:`3` and above mark dense regions where every vertex keeps three or more neighbors however much of the graph is peeled away." +msgstr "" + +msgid "Parallel edges between the same pair of vertices are collapsed into a single edge before the peeling starts, so edge multiplicity does not inflate core numbers." +msgstr "" + +msgid "Three parallel edges between two vertices give both vertices core :math:`1`, the same as a single edge." +msgstr "" + +msgid "Self loop: a vertex is not a neighbor of its own vertex, so it is dropped before peeling and does not contribute to that vertex's degree." +msgstr "" + +msgid "A vertex whose only edge is a self loop has no real neighbors left, So the core number is 0." +msgstr "" + +#, fuzzy +msgid "Loops and parallel edges are removed." +msgstr "Sin auto ciclos ni aristas paralelas." + +#, fuzzy +msgid "All vertices are kept" +msgstr "Todos los vehículos son iguales." + +#, fuzzy +msgid "Costs are ignored" +msgstr "Costos negativos son ignorados." + +msgid "Each vertex receives exactly one core number" +msgstr "" + +#, fuzzy +msgid "Results:" +msgstr "Resultados" + +#, fuzzy +msgid "Number of returned rows: :math:`|V|`." +msgstr "Cantidad de rutas requeridas." + +#, fuzzy +msgid "Ordered by ``node`` ascending." +msgstr "``node`` ascendente" + +msgid "No rows returned when no edges found. Emits a ``NOTICE``" +msgstr "" + +#, fuzzy +msgid "Running time: :math:`O(|E| + |E| + |V| log |V|)`" +msgstr "Tiempo de ejecución: :math:`O(E * (E + V * logV))`" + +msgid "Loop and parallel removal: :math:`O(|E|)`" +msgstr "" + +#, fuzzy +msgid "Peeling algorithm: :math:`O(|E|)`" +msgstr "Tiempo de ejecución: :math:`O(|V|)`" + +#, fuzzy +msgid "Sorting: :math:`|V| log |V|`" +msgstr "Peor caso: :math:`O(| V | * | E |)`" + +#, fuzzy +msgid "pgr_coreNumbers(`Edges SQL`_)" +msgstr "pgr_prim(`SQL de aristas`_)" + +#, fuzzy +msgid "Returns set of ``(seq, node, core)``" +msgstr "Regresa el conjunto de ``(seq, node)``" + +#, fuzzy +msgid "Core numbers on a subgraph of :doc:`sampledata`" +msgstr "Para el siguiente sub-grafo de :doc:`sampledata`:" + +msgid "Vertices are colored by core number in the diagrams below: ``deepskyblue`` for core :math:`1` and ``green`` for core :math:`2`." +msgstr "" + +msgid "All returned vertices have core number :math:`1`; they belong to the 1-core but not to any higher core." +msgstr "" + +#, fuzzy +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." +msgstr "Sean :math:`v` y :math:`u` nodos en el grafo:" + +msgid "Vertices :math:`6`, :math:`7`, and :math:`10` have higher degree here, but peeling degree-:math:`1` vertices first removes the entire subgraph before a 2-core can form." +msgstr "" + +msgid "The following diagram shows edges :math:`\\{1, \\ldots, 7\\}` from :doc:`sampledata`; every vertex label shows ``node (core)``." +msgstr "" + +msgid "The next subgraph uses edges :math:`\\{1, 2, 3, 4\\}`, the same set as the main example of :doc:`pgr_betweennessCentrality`. Every vertex is still core :math:`1` because the structure is a tree-like path with terminal nodes at :math:`5` and :math:`15`." +msgstr "" + +msgid "K-core peeling (illustration)" +msgstr "" + +msgid "On edges :math:`id < 10`, vertices :math:`5` and :math:`15` are removed first because they have degree :math:`1`. After further peeling, vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` remain as the 2-core (shown in green below)." +msgstr "" + +#, fuzzy +msgid "Sequential value starting from 1." +msgstr "Valor secuencial a partir de **1**." + +#, fuzzy +msgid "``core``" +msgstr "``color``" + +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "" + +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 "Sample network overview" +msgstr "" + +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." +msgstr "" + +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" +msgstr "" + +msgid "Both functions use the same ``Edges SQL`` format. The betweenness example on edges :math:`\\{1, 2, 3, 4\\}` measures shortest-path influence; core numbers measure peeling resilience." +msgstr "" + +#, fuzzy +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" +msgstr "Para sub-grafo con aristas :math:`\\{1, 2, 3, 4\\}`." + +#, fuzzy +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." +msgstr "Sean :math:`v` y :math:`u` nodos en el grafo:" + +msgid "Vertex :math:`6` has degree :math:`3` in this subgraph but still has core :math:`1`, because removing :math:`5` and :math:`15` first leaves no subgraph where every vertex has degree at least :math:`2`." +msgstr "" + +msgid "Compare with :doc:`pgr_betweennessCentrality` on the same edges: vertex :math:`6` has the highest betweenness, but core number does not rank vertices by path importance." +msgstr "" + +msgid "Subgraph with core-:math:`2` vertices" +msgstr "" + +msgid "Adding edges :math:`5` through :math:`9` connects the inner vertices into a 2-core. The undirected layout below shows the same network." +msgstr "" + +#, fuzzy +msgid "Undirected view of the sample network" +msgstr "Grafo no dirigido simple" + +#, fuzzy +msgid "2) Core numbers on edges :math:`id < 10`" +msgstr "El conjunto de aristas :math:`E`" + +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." +msgstr "" + +msgid "Vertices :math:`1`, :math:`3`, :math:`5`, :math:`15`, and :math:`16` are attached by tree-like branches and remain core :math:`1`." +msgstr "" + +msgid "Edge :math:`8` (between :math:`7` and :math:`11`) closes a cycle with edges :math:`4`, :math:`2`, and :math:`5`, which is why the inner four vertices survive peeling." +msgstr "" + +msgid "Filtering results in SQL" +msgstr "" + +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." +msgstr "" + +#, fuzzy +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" +msgstr "3) Ruta de :math:`12` a :math:`10`" + +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." +msgstr "" + +msgid "Use it to export only the hub vertices for further analysis." +msgstr "" + +#, fuzzy +msgid "Full sample graph" +msgstr "Grafo dirigido simple" + +msgid "4) Core numbers on all edges" +msgstr "" + +msgid "The full network has :math:`17` vertices and maximum core number :math:`2`." +msgstr "" + +msgid "Terminal branches (vertices :math:`1`, :math:`2`, :math:`3`, :math:`4`, :math:`5`, :math:`9`, :math:`13`, :math:`14`) remain core :math:`1`." +msgstr "" + +msgid "The 2-core is vertices :math:`6`, :math:`7`, :math:`8`, :math:`10`, :math:`11`, :math:`12`, :math:`15`, :math:`16` and :math:`17`: the central block of the city network. Vertex :math:`9` hangs off :math:`8` by edge :math:`14` alone, so it is peeled first and stays core :math:`1`." +msgstr "" + +msgid "Small graphs" +msgstr "" + +msgid "5) Single edge (two terminal nodes)" +msgstr "" + +msgid "Both endpoints have core number :math:`1`." +msgstr "" + +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." +msgstr "" + +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." +msgstr "" + +#, fuzzy +msgid "6) Triangle (all vertices core :math:`2`)" +msgstr "Conjunto de vértices :math:`V`" + +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." +msgstr "" + +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." +msgstr "" + +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." +msgstr "" + +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" +msgstr "" + +#, fuzzy +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." +msgstr "De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}`" + +msgid "This is the 2-core heart of example 2) before branches are attached." +msgstr "" + +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." +msgstr "" + +msgid "8) Star graph (hub and spokes, all core :math:`1`)" +msgstr "" + +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." +msgstr "" + +msgid "The hub has degree :math:`4`, but removing the four leaves leaves an isolated vertex, so the hub never belongs to a 2-core." +msgstr "" + +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." +msgstr "" + +#, fuzzy +msgid "Empty edge set" +msgstr "Aristas de capacidad" + +msgid "9) No edges in the SQL query" +msgstr "" + +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." +msgstr "" + +#, fuzzy +msgid "No exception is raised." +msgstr "sección de migración es creada." + +msgid "Core numbers and planarity" +msgstr "" + +msgid "Vertices with higher core numbers often lie in densely connected regions. The workflow below computes core numbers, filters the 2-core, and checks whether the subgraph can be drawn without edge crossings using :doc:`pgr_isPlanar`." +msgstr "" + +#, fuzzy +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" +msgstr "Para sub-grafo con aristas :math:`\\{1, 2, 3, 4\\}`." + +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" +msgstr "" + +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." +msgstr "" + +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." +msgstr "" + +msgid "Planarity and core number measure different properties: a graph can be planar while still having a mix of core-:math:`1` and core-:math:`2` vertices." +msgstr "" + +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" +msgstr "" + +msgid "The examples above reach at most core :math:`2`, because the :doc:`sampledata` network has degeneracy :math:`2`. Higher cores need a denser graph. In the complete graph :math:`K_4` every vertex is adjacent to the other three, so no vertex can ever be peeled at :math:`k \\leq 3` and the whole graph is its own 3-core." +msgstr "" + +msgid "Every vertex has degree :math:`3`, so nothing is removed while peeling at :math:`k = 1`, :math:`2` or :math:`3`: all four vertices have core :math:`3`." +msgstr "" + +msgid "In general the complete graph :math:`K_n` has core number :math:`n - 1` for every vertex, which is the maximum possible core number on :math:`n` vertices." +msgstr "" + +#, fuzzy +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." +msgstr "Los ejemplos de esta sección se basan en la red :doc:`sampledata`." + +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" +msgstr "" + +#, fuzzy +msgid "`Wikipedia: Degeneracy (graph theory) `__" +msgstr "'Wikipedia: árbol de dominador' `__" + +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "``pgr_cuthillMckeeOrdering`` - Experimental" + +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" + +msgid "Version 3.4.0" +msgstr "Versión 3.4.0" + +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 "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." @@ -8704,15 +9270,24 @@ msgstr "pgr_dagShortestPath(Combinaciones)" 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 "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +#, fuzzy +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 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 "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +#, fuzzy +msgid "Process is valid for weighted directed acyclic graphs only." msgstr "El proceso solo es válido para grafos acíclicos dirigidos ponderados, de lo contrario lanzará advertencias." +msgid "Avoids one edge cycle: `reverse_cost` column is used when :math:`cost < 0`." +msgstr "" + +#, fuzzy +msgid "If the graph is not DAG, will throw a PostgreSQL `ERROR`." +msgstr "Cuando el grafo es bi-partido" + 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`" @@ -8749,6 +9324,9 @@ msgstr "Desde los vértices :math:`\\{5, 10\\}` al vértice :math:`11`" 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 "`reverse_cost` column is used when :math:`cost < 0` to avoid edge cycle." +msgstr "" + msgid "Return columns" msgstr "Columnas de Resultados" @@ -9058,9 +9636,6 @@ msgstr "pgr_dijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``]) 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 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 "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "Para grafos **dirigidos** con columnas ``cost`` and ``reverse_cost``" @@ -9521,6 +10096,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - Ruta que recorre una lista de vértices." +#, fuzzy +msgid "Version 4.0.2" +msgstr "Versión 4.0.0" + +msgid "Fix: bad alloc" +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 "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)`." @@ -9605,6 +10187,15 @@ msgstr ":doc:`dijkstra-family`." 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 "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "pgr_drivingDistance(Vértice único)" @@ -9669,9 +10260,6 @@ msgstr "Cuando ``true`` el nodo solo aparece en la lista más cercana a ``start_ 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 "end-before" -msgstr "" - 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" @@ -9681,10 +10269,6 @@ msgstr "``pgr_edgeColoring`` - Experimental" 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" -#, fuzzy -msgid "Version 4.1.0" -msgstr "Versión 4.0.0" - msgid "Output columns standardized to |result_edge_color|" msgstr "Columnas de resultados estandarizados a |result_edge_color|" @@ -10338,50 +10922,113 @@ msgstr "``pgr_hawickCircuits`` - Experimental" 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 "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 "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Heath A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs." +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 "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 "Circuit enumeration in directed graphs, where circuits with parallel arcs are enumerated." +msgstr "" -msgid "The algorithm implementation works only for directed graph" -msgstr "La implementación del algoritmo sirve solo para grafos dirigidos" +msgid "Each combination of parallel arcs is returned as a different circuit." +msgstr "" -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." +#, fuzzy +msgid "Works for directed graphs." +msgstr "Funciona para grafos no dirigidos." 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 "The circuits are elementary: a vertex is not repeated within a circuit, except the starting vertex that closes the circuit." +msgstr "" + +msgid "When no initial vertices are given all circuits are in canonical order of the vertices insertion of the graph: A circuit with vertices ``u``, ``v``: ``u`` starting circuits containing ``v`` will not be listed on ``start_vid = v`` rows." +msgstr "" + +msgid "Different edge ordering gives different canonical ordering." +msgstr "" + +msgid "When start vertices are given, all circuits are returned for each requested vertex it contains, and the results are grouped by ``start_vid``." +msgstr "" + +msgid "The graph passed to the algorithm discard parallel edges with higher costs." +msgstr "" + msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "Complejidad temporal: :math:`O((V + E) (c + 1))`" -msgid ":math:`|c|` is the number of circuits in the graph." +#, fuzzy +msgid "where :math:`|V|` is the number of vertices in the graph." +msgstr ":math:`|V|` es la cantidad de vertices del grafo." + +#, fuzzy +msgid "where :math:`|c|` is the number of circuits in the graph." msgstr ":math:`|c|` es la cantidad de circuitos en el grafo." msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "pgr_hawickCircuits(`SQL de aristas`_)" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vid** [, **options**])" +msgstr "pgr_aStarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" + +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vids** [, **options**])" +msgstr "pgr_aStarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" + +#, fuzzy +msgid "**options:** ``[min_depth, max_depth, self_loops, u_turn_on_edge]``" +msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``" + +#, fuzzy +msgid "Returns set of |circuits-result|" +msgstr "Regresa el conjunto de |nksp-result|" + +msgid "All circuits" +msgstr "" + +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_ [, **options**])" +msgstr "pgr_hawickCircuits(`SQL de aristas`_)" + +#, fuzzy +msgid "All the circuits of the pgRouting :doc:`sampledata`" msgstr "Circuitos dentro de los :doc:`sampledata` de pgRouting" -msgid "Id of the circuit starting from ``1``" -msgstr "Identificador del circuito comenzando con ``1``" +msgid "When no starting vertex is given, all the circuits of the graph are returned. The result has 94 rows, one ``path_id`` for each circuit:" +msgstr "" #, 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 "Single start vertex" +msgstr "Vértice único" -msgid "Identifier of the starting vertex of the circuit." -msgstr "Identificador del vértice inicial del circuito." +#, fuzzy +msgid "Circuits that contain vertex :math:`10`" +msgstr "Contrayendo el vértice :math:`3`," -msgid "Identifier of the ending vertex of the circuit." -msgstr "Identificador del vértice final del circuito." +#, fuzzy +msgid "Many start vertices" +msgstr "Desde **muchos** vértices iniciales" -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." +#, fuzzy +msgid "Circuits that contain vertices :math:`\\{10, 11\\}`" +msgstr "Desde el vértice :math:`5` a los vértices :math:`\\{ 7, 11\\}`" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "The examples use the following table ``c_example``, that represent a cul_de_sac where the exit is on vertex :math:`5` and the vehicle is on vertex :math:`1` but pointing at the wrong direction of the exit." +msgstr "" + +#, fuzzy +msgid "All possible ways to return to vertex :math:`1`." +msgstr "El árbol dominante con vértice raíz :math:`5`" + +msgid "Exclude self loops." +msgstr "" + +#, fuzzy +msgid "Exclude self loops and U-turn on the same edge." +msgstr "Sin auto ciclos ni aristas paralelas." + +#, fuzzy +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "`Boost: Algoritmo de Circutios de Hawick `__" msgid "``pgr_isPlanar`` - Experimental" @@ -10986,29 +11633,117 @@ msgstr "" msgid "Add edges from the original graph" msgstr "" -msgid "Add all the edges that are not involved in the line graph process to the new table" -msgstr "" +msgid "Add all the edges that are not involved in the line graph process to the new table" +msgstr "" + +msgid "Some administrative tasks to get new identifiers for the edges" +msgstr "" + +msgid "Add the newly calculated edges" +msgstr "" + +msgid "Using the routing graph" +msgstr "" + +msgid "When using this method for routing with soft restrictions there will be uturns" +msgstr "" + +msgid "Routing from :math:`5` to :math:`1`" +msgstr "" + +msgid "https://en.wikipedia.org/wiki/Line_graph" +msgstr "https://en.wikipedia.org/wiki/Line_graph" + +msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgstr "https://en.wikipedia.org/wiki/Complete_graph" + +#, fuzzy +msgid "``pgr_makeBiconnectedPlanar`` - Experimental" +msgstr "``pgr_makeConnected`` - Experimental" + +msgid "``pgr_makeBiconnectedPlanar`` — Returns the set of edges needed to make each connected component of a planar graph biconnected." +msgstr "" + +msgid "``pgr_makeBiconnectedPlanar`` identifies the missing edges that need to be added to each connected component of an existing planar graph to make those components biconnected, while ensuring the graph remains planar." +msgstr "" + +msgid "A graph is considered **biconnected** if it is connected and cannot be broken into disconnected pieces by deleting any single vertex (it has no articulation points). A planar graph is one that can be drawn in two-dimensional space with no two of its edges crossing." +msgstr "" + +msgid "If the graph is not connected it will treat each component as an idividual graph." +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_makeConnected` to connect all components." +msgstr "Usando :doc:`pgr_connectedComponents`" + +#, fuzzy +msgid "When the graph is not planar it will emit an ``ERROR``" +msgstr "Cuando el grafo es bi-partido" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first." +msgstr ":doc:`pgr_isPlanar`" + +#, fuzzy +msgid "All vertices are kept." +msgstr "Todos los vehículos son iguales." + +#, fuzzy +msgid "Costs are ignored." +msgstr "Costos negativos son ignorados." + +msgid "Returns a list of all new edges needed to make biconected graphs out of each connected component." +msgstr "" + +#, fuzzy +msgid "Empty results when the graph is already biconnected planar." +msgstr "`false` cuando el grafo no es planar." + +#, fuzzy +msgid "Running time: :math:`O(|V| + |E| + R \\log R)` for each component" +msgstr "Tiempo de ejecución: :math:`O(E * (E + V * logV))`" + +#, fuzzy +msgid ":math:`R` is the number of returned edges." +msgstr ":math:`k` es el número de colores utilizados." + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "pgr_makeConnected(`SQL de aristas`_)" + +msgid "Returns set of |result-component-make|" +msgstr "Regresa conjunto de |result-component-make|" -msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "" +#, fuzzy +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "Lista de aristas que se necesitan para conectar el grafo." -msgid "Add the newly calculated edges" +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." msgstr "" -msgid "Using the routing graph" +msgid "When a graph contains multiple disconnected components, each component is processed independently. Components (2,4) and (13,14) are already biconnected (0 articulation points) and require no new edges." msgstr "" -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "" +#, fuzzy +msgid "4-vertex path graph." +msgstr "Prepara el grafo" -msgid "Routing from :math:`5` to :math:`1`" -msgstr "" +#, fuzzy +msgid "Create a 4-vertex tree graph." +msgstr "Crear el grafo contraído." -msgid "https://en.wikipedia.org/wiki/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +#, fuzzy +msgid "Get the edges needed to have biconnected planar graph." +msgstr "Lista de aristas que se necesitan para conectar el grafo." -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +#, fuzzy +msgid "Adding the edges to the graph" +msgstr "Los puentes del grafo" + +#, fuzzy +msgid "`Boost: make_biconnected_planar `__" +msgstr "`Boost: conectar `__" msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - Experimental" @@ -11028,9 +11763,6 @@ msgstr "El algoritmo no considera la topología geométrica en los cálculos." msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "pgr_makeConnected(`SQL de aristas`_)" -msgid "Returns set of |result-component-make|" -msgstr "Regresa conjunto de |result-component-make|" - msgid "List of edges that are needed to connect the graph." msgstr "Lista de aristas que se necesitan para conectar el grafo." @@ -11241,6 +11973,50 @@ 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)" +#, fuzzy +msgid "``pgr_maxWeightedMatch`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimental" + +#, fuzzy +msgid "``pgr_maxWeightedMatch`` — Calculates a maximum weighted matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad máxima en un grafo." + +msgid "A **maximum weighted matching** in a graph is a matching where the sum of the weights of selected edges is maximized." +msgstr "" + +msgid "Each vertex is matched with at most one other vertex." +msgstr "" + +msgid "Maximizes the total edge weight sum." +msgstr "" + +#, fuzzy +msgid "There may be many maximum weighted matchings." +msgstr "Puede haber muchas coincidencias máximas." + +#, fuzzy +msgid "Calculates one possible maximum weighted matching in a graph." +msgstr "Calcula una posible coincidencia máxima de cardinalidad en un grafo." + +#, fuzzy +msgid "Running time: :math:`O(V^3)`." +msgstr "Tiempo de ejecución: :math:`O( V ^ 3)`" + +#, fuzzy +msgid "pgr_maxWeightedMatch(`Edges SQL`_)" +msgstr "pgr_maxCardinalityMatch(`SQL de aristas`_)" + +#, fuzzy +msgid "Set of |result-edge|" +msgstr "Regresa conjunto de |result-edge|" + +msgid "Maximum weighted matching on a custom 5-vertex graph." +msgstr "" + +#, fuzzy +msgid "`Boost: maximum_weighted_matching `__" +msgstr "`Boost: Coincidencia máxima `__" + msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - Experimental" @@ -11436,6 +12212,169 @@ msgstr "" msgid "This implementation's travel time: 854.54" msgstr "" +#, fuzzy +msgid "``pgr_planarFaces`` - Experimental" +msgstr "``pgr_isPlanar`` - Experimental" + +msgid "``pgr_planarFaces`` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +msgid "In a planar embedding, the graph is drawn in the plane so that edges meet only at vertices. A face is a maximal connected region of the plane bounded by edges." +msgstr "" + +msgid "Every bounded face is a cycle of edges enclosing an interior region. The exterior face, also called the unbounded face, is the region outside the outermost cycle." +msgstr "" + +msgid "Once an embedding is fixed, each undirected edge has a left and a right side when walked in the direction the embedding assigns around each vertex." +msgstr "" + +msgid "In a connected planar undirected graph, each edge separates exactly two faces, so it contributes one row on the left and one on the right." +msgstr "" + +msgid "``pgr_planarFaces`` returns those incidences: ``face_id`` names the face, ``edge_id`` is the border edge, and ``side`` is ``1`` (left) or ``2`` (right) relative to the embedding." +msgstr "" + +msgid "The function first computes a planar embedding with the Boyer-Myrvold planarity test, then walks faces with Boost ``planar_face_traversal``.i" +msgstr "" + +#, fuzzy +msgid "Loops and paralell edges are preserved." +msgstr "Sin auto ciclos ni aristas paralelas." + +msgid "They are used to determine the existance of an edge" +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first" +msgstr ":doc:`pgr_isPlanar`" + +msgid "The result has one row per edge-side pair" +msgstr "" + +msgid "Graph with :math:`|E|` edges yields :math:`2|E|` rows." +msgstr "" + +msgid "Number of faces: * Obeys Euler's formula: :math:`|V| - |E| + |F| = 2` * On a graph with :math:`C` components: :math:`|V| - |E| + |F| = 2C`." +msgstr "" + +#, fuzzy +msgid "Running time: :math:`O(|E| + |V|)`" +msgstr "Tiempo de ejecución: :math:`O(E + V)`" + +#, fuzzy +msgid "pgr_planarFaces(`Edges SQL`_)" +msgstr "pgr_isPlanar(`SQL de aristas`)" + +#, fuzzy +msgid "Returns set of ``(seq, face_id, edge_id, side)``" +msgstr "Devuelve el conjunto de ``(seq, vertex_id, idom)``" + +#, fuzzy +msgid "Faces of the full :doc:`sampledata` graph" +msgstr "Circuitos dentro de los :doc:`sampledata` de pgRouting" + +msgid "The query returns **36 rows**, twice the **18** edges in ``edges``, consistent with :math:`2|E|`." +msgstr "" + +msgid "``face_id`` runs from **1** through **7** on this network; each id is one face of the embedding, including the unbounded **exterior face** (here ``face_id = 1`` borders the outer layout of the city block)." +msgstr "" + +msgid "Every ``edge_id`` appears **twice**, once with ``side = 1`` and once with ``side = 2``." +msgstr "" + +msgid "Rows follow the counterclockwise walk of each face in the computed embedding." +msgstr "" + +msgid "Have :math:`3` components then number if faces = :math:`17 - 18 + 7 = 6 = 2 \\times 3`." +msgstr "" + +#, fuzzy +msgid "``face_id``" +msgstr "``end_id``" + +#, fuzzy +msgid "Identifier of the face in the computed embedding." +msgstr "Identificador del primer vértice de la arista." + +#, fuzzy +msgid "Identifier of the edge that borders the face." +msgstr "Identificador del borde que es un puente." + +#, fuzzy +msgid "``1`` when the edge borders the face on the left side." +msgstr ":math:`-1` cuando la arista no existe en el grafo" + +#, fuzzy +msgid "``2`` when the edge borders the face on the right side." +msgstr ":math:`-1` cuando la arista no existe en el grafo" + +msgid "Non-planar graphs" +msgstr "" + +msgid "Face extraction requires a planar graph. Subgraphs containing a :math:`K_5` or :math:`K_{3,3}` minor cannot be embedded without crossings; ``pgr_planarFaces`` raises ``ERROR: Graph is not planar`` in that case. The :doc:`pgr_isPlanar` documentation shows a non-planar subgraph of ``sampledata`` (edges highlighted in blue in the figure)." +msgstr "" + +#, fuzzy +msgid "Create a :math:`K_5` graph." +msgstr "Crear el grafo contraído." + +msgid "Test planarity: dont execute when is not planar." +msgstr "" + +msgid "Or get an error: (not shown)" +msgstr "" + +msgid "Planarity of loops" +msgstr "" + +#, fuzzy +msgid "One loop graph with only one vertex:" +msgstr "Un componente de grafo con un solo segmento." + +#, fuzzy +msgid "Two loop graph with only one vertex:" +msgstr "Un componente de grafo con un solo segmento." + +#, fuzzy +msgid "Triangular graphs" +msgstr "El grafo original:" + +msgid "Triangular graph (no duplicate edges)" +msgstr "" + +msgid "Six rows are returned: :math:`2 \\times 3` edges." +msgstr "" + +msgid ":math:`face\\_id = 1` is the interior face." +msgstr "" + +msgid ":math:`face\\_id = 2` is the exterior face. face." +msgstr "" + +msgid "Each edge lists ``1`` on one face and ``2`` on the other." +msgstr "" + +msgid "Triangular graph (duplicate edges)" +msgstr "" + +msgid ":doc:`pgr_isPlanar`" +msgstr ":doc:`pgr_isPlanar`" + +#, fuzzy +msgid "Boost Graph Library: `Planar Face Traversal `__" +msgstr "`Boost: Búsqueda A* `__" + +#, fuzzy +msgid "Boost Graph Library: `Boost: Boyer Myrvold planarity `__" +msgstr "`Boost: Boyer Myrvold `__" + +#, fuzzy +msgid "Wikipedia: `Planar graph `__" +msgstr "wikipedia: `Grafo lineal `__" + +msgid "Boyer, J. M. and Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity Algorithms by Edge Addition. Journal of Graph Algorithms and Applications, 8(3), 241-273." +msgstr "" + msgid "``pgr_prim``" msgstr "``pgr_prim``" @@ -12806,6 +13745,10 @@ 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 "" +#, fuzzy +msgid "Planar - Family of functions" +msgstr "Prim - Familia de funciones" + msgid "Prim - Family of functions" msgstr "Prim - Familia de funciones" @@ -12855,6 +13798,41 @@ msgstr "pgRouting 4.0" msgid "pgRouting 4.0" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.0.2 Release Notes" +msgstr "Notas de la versión 3.0.1 de pgRouting" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +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 "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +#, fuzzy +msgid "4.0.2 Bug Fixes" +msgstr "Corrección de errores" + +#, fuzzy +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "`#1640 `__: pgr_withPoints falla cuando points_sql está vacía" + +#, fuzzy +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "`#2954 `__: pgr_kingOrdering" + #, fuzzy msgid "pgRouting 4.0.1 Release Notes" msgstr "Notas de la versión 3.0.1 de pgRouting" @@ -12863,6 +13841,9 @@ msgstr "Notas de la versión 3.0.1 de pgRouting" 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 "Bug Fixes" +msgstr "Corrección de errores" + #, fuzzy msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "`#2905 `__: pgr_withPointsCostMatrix" @@ -12875,6 +13856,9 @@ msgstr "`#2934 `__: pgr_tran msgid "`#3010 `__: Performance issue with pgr_separateTouching()" msgstr "`#2760 `__: pgr_degree" +msgid "Code enhancements" +msgstr "Mejoras del código" + #, fuzzy msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" msgstr "`#2786 `__: pgr_contraction" @@ -12914,7 +13898,8 @@ 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" +#, fuzzy +msgid "4.0.0 Build" msgstr "Construir" msgid "C++ standard is std17" @@ -12992,6 +13977,9 @@ msgstr "" msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" +msgid "Summary of changes by function" +msgstr "" + msgid "pgr_aStar" msgstr "pgr_aStar" @@ -13052,9 +14040,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13121,15 +14106,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "Funciones promovidas a oficial" @@ -13878,6 +14857,9 @@ msgstr "Notas de la versión de pgRouting 3.7.2" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.2 `__" +msgid "Build" +msgstr "Construir" + #, fuzzy msgid "`#2713 `__: cmake missing some policies and min version" msgstr "`#2713 `__ cmake le falta algunas políticas y versión minima" @@ -14299,9 +15281,6 @@ msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "No clasificado" -msgid "pgr_hawickCircuits" -msgstr "pgr_hawickCircuits" - msgid "Flow functions" msgstr "Funciones de flujo" @@ -15025,9 +16004,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (proposed)" @@ -16505,6 +17481,45 @@ 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 ":doc:`pgr_hawickCircuits`" +#~ msgstr ":doc:`pgr_hawickCircuits`" + +#~ 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 "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 "The algorithm implementation works only for directed graph" +#~ msgstr "La implementación del algoritmo sirve solo para grafos dirigidos" + +#~ 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." + +#, 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 "C and C++0x compilers" +#~ msgstr "Compiladores C y C++0x" + +#~ 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 "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" + +#, fuzzy +#~ msgid "Planar" +#~ msgstr "pgr_isPlanar" + +#, fuzzy +#~ msgid ":doc:`pgr_isPlanar` - Returns whether the graph is planar." +#~ msgstr "`true` cuando el grafo es planar." + +#~ msgid "Planar Family" +#~ msgstr "Familia Planar" + #~ msgid "pgRouting 4.0.0-alpha1 Release Notes" #~ msgstr "Notas de la versión de pgRouting 4.0.0-alpha1" diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index 84c7a7a5573..f559c2d905a 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -22,8 +22,8 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" -"PO-Revision-Date: 2026-06-10 16:05+0000\n" +"POT-Creation-Date: 2026-10-24 01:29+0000\n" +"PO-Revision-Date: 2026-10-28 00:39+0000\n" "Last-Translator: Teramoto Ikuhiro \n" "Language-Team: Japanese \n" "Language: ja\n" @@ -31,7 +31,7 @@ msgstr "" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=1; plural=0;\n" -"X-Generator: Weblate 5.16.2\n" +"X-Generator: Weblate 2026.10.1\n" "Generated-By: Babel 2.10.3\n" msgid "BFS - Category" @@ -271,10 +271,10 @@ msgid "See Also" msgstr "参照" msgid "`Boost: Prim's algorithm `__" -msgstr "`Boost: プリム法 (英語) `__" +msgstr "`Boost: プリム法 (英語) `__" msgid "`Boost: Kruskal's algorithm `__" -msgstr "`Boost: クラスカル法 (英語) `__" +msgstr "`Boost: クラスカル法 (英語) `__" msgid "`Wikipedia: Prim's algorithm `__" msgstr "`Wikipedia: プリム法 `__" @@ -362,6 +362,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - 制約付き頂点/ポイントのルー msgid "Experimental" msgstr "実験段階" +msgid "Possible server crash" +msgstr "サーバー異常終了の可能性" + +msgid "These functions might create a server crash" +msgstr "これらの関数はサーバー異常終了を引き起こす可能性があります" + msgid "Experimental functions" msgstr "実験段階関数" @@ -602,13 +608,11 @@ msgstr "``0でない値`` で、かつ ``start_id = 0`` のとき、これが最 msgid "References" msgstr "参照" -#, fuzzy msgid "`Boost: metric TSP approx `__" -msgstr "`Boost: metric TSP approx `__" +msgstr "`Boost: メトリック巡回セールスマン問題 (英語) `__" -#, fuzzy msgid "`University of Waterloo TSP `__" -msgstr "`University of Waterloo TSP `__" +msgstr "`ウォータールー大学 巡回セールスマン問題 `__" msgid "`Wikipedia: Traveling Salesman Problem `__" msgstr "`Wikipedia: 巡回セールスマン問題 `__" @@ -730,22 +734,26 @@ msgstr "使用箇所 :doc:`pgr_pickDeliverEuclidean`" msgid "`Orders SQL`_" msgstr "`Orders SQL`_" +#, fuzzy msgid "`Orders SQL`_ as described below." msgstr "`Orders SQL`_ は下に説明があります。" +#, fuzzy msgid "`Vehicles SQL`_" msgstr "`Vehicles SQL`_" +#, fuzzy msgid "`Vehicles SQL`_ as described below." msgstr "`Vehicles SQL`_ は下に説明があります。" -#, fuzzy msgid "Used in :doc:`pgr_pickDeliver`" -msgstr "Used in :doc:`pgr_pickDeliver`" +msgstr "使用箇所 :doc:`pgr_pickDeliver`" +#, fuzzy msgid "`Matrix SQL`_" msgstr "`Matrix SQL`_" +#, fuzzy msgid "`Matrix SQL`_ as described below." msgstr "`Matrix SQL`_ は下に説明があります。" @@ -782,7 +790,6 @@ msgstr "``initial_sol``" msgid "4" msgstr "4" -#, fuzzy msgid "Initial solution to be used." msgstr "使用する初期解。" @@ -845,7 +852,7 @@ msgid "The duration of the loading at the pickup location." msgstr "集荷位置での積込時間。" msgid "When missing: 0 time units are used" -msgstr "無い場合: 0時間を使用" +msgstr "無い場合: 0時間単位を使用" msgid "``d_open``" msgstr "``d_open``" @@ -1088,7 +1095,7 @@ msgid "Kind of stop location the vehicle is at" msgstr "車両の立寄り地点の種別" msgid ":math:`-1`: at the solution summary row" -msgstr "" +msgstr ":math:`-1`: 解の要約行" msgid ":math:`1`: Starting location" msgstr ":math:`1`: 開始位置" @@ -1119,37 +1126,37 @@ msgid "Cargo units of the vehicle when leaving the stop." msgstr "停止位置から出発したときの車両の貨物の単位。" msgid "Value :math:`-1` on solution summary row." -msgstr "" +msgstr "Value :math:`-1` 解の要約行。" msgid "``travel_time``" msgstr "``travel_time``" msgid "Travel time from previous ``stop_seq`` to current ``stop_seq``." -msgstr "" +msgstr "前の ``stop_seq`` から現在の ``stop_seq`` までの移動時間。" msgid "Summary has the **total traveling time**:" -msgstr "" +msgstr "要約には **総移動時間** があります:" msgid "The sum of all the ``travel_time``." -msgstr "" +msgstr "全ての ``travel_time`` の合計。" msgid "``arrival_time``" msgstr "``arrival_time``" msgid "Time spent waiting for current location to open." -msgstr "" +msgstr "現在の位置が開くまでの待機時間。" msgid ":math:`-1`: at the solution summary row." -msgstr "" +msgstr ":math:`-1`: 解の要約行。" msgid ":math:`0`: at the starting location." -msgstr "" +msgstr ":math:`0`: 開始位置。" msgid "``wait_time``" msgstr "``wait_time``" msgid "Summary row has the **total waiting time**:" -msgstr "" +msgstr "要約行には **合計待機時間** があります:" msgid "The sum of all the ``wait_time``." msgstr "``wait_time``の全ての合計。" @@ -1158,415 +1165,421 @@ msgid "``service_time``" msgstr "``service_time``" msgid "Service duration at current location." -msgstr "" +msgstr "現在地でのサービス時間。" msgid "Summary row has the **total service time**:" -msgstr "" +msgstr "要約行には **合計サービス時間** があります。" msgid "The sum of all the ``service_time``." -msgstr "" +msgstr "全ての ``service_time`` の合計。" msgid "``departure_time``" msgstr "``departure_time``" msgid "The time at which the vehicle departs from the stop." -msgstr "" +msgstr "車両が立寄り地点から出発する時刻。" msgid ":math:`arrival\\_time + wait\\_time + service\\_time`." -msgstr "" +msgstr ":math:`arrival\\_time + wait\\_time + service\\_time`。" msgid "The ending location has the **total time** used by the current vehicle." -msgstr "" +msgstr "終了位置には現在の車両が使った **合計時間** が入ります。" msgid "Summary row has the **total solution time**:" -msgstr "" +msgstr "要約行には **合計解決時間** が入ります。" msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." -msgstr "" +msgstr ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." msgid "Summary Row" -msgstr "" +msgstr "要約行" msgid "Continues the sequence" -msgstr "" +msgstr "シーケンスの継続" msgid "**total capacity violations**:" -msgstr "" +msgstr "**全体容量違反**:" msgid "**total time windows violations**:" -msgstr "" +msgstr "**総時間帯違反**:" msgid ":math:`-1`" -msgstr "" +msgstr ":math:`-1`" msgid "**total traveling time**:" -msgstr "" +msgstr "**総移動時間**:" msgid "**total waiting time**:" -msgstr "" +msgstr "**総待機時間**:" msgid "**total service time**:" -msgstr "" +msgstr "**総稼働時間**:" msgid "Handling Parameters" -msgstr "" +msgstr "パラメーターを扱う" +#, fuzzy msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered." -msgstr "" +msgstr "問題を定義します。結果の一貫性を得るには、いくつかの考慮がなされる必要があります、本節によってどのようにパラメーターが考慮されているかが分かるようになります。" +#, fuzzy msgid "`Capacity and Demand Units Handling`_" -msgstr "" +msgstr "`容量と需要の単位の取扱い`_" msgid "`Locations`_" -msgstr "" +msgstr "`位置`_" msgid "`Time Handling`_" -msgstr "" +msgstr "`時間の取扱い`_" msgid "`Factor Handling`_" -msgstr "" +msgstr "`係数の取扱い`_" msgid "Capacity and Demand Units Handling" -msgstr "" +msgstr "容量と需要の単位の取扱い" msgid "The `capacity` of a vehicle, can be measured in:" -msgstr "" +msgstr "車両の `容量` は次のように計測できます:" msgid "Volume units like :math:`m^3`." -msgstr "" +msgstr ":math:`m^3` のような体積単位。" msgid "Area units like :math:`m^2` (when no stacking is allowed)." -msgstr "" +msgstr ":math:`m^2` のような面積の単位 (重ね積み禁止の時)。" msgid "Weight units like :math:`kg`." -msgstr "" +msgstr ":math:`kg` のような重さの単位。" msgid "Number of boxes that fit in the vehicle." -msgstr "" +msgstr "車両に適した箱の数量。" msgid "Number of seats in the vehicle" -msgstr "" +msgstr "車両内の座席数" msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`." -msgstr "" +msgstr "集配注文の `demand` の単位は車両の `capacity` と同じでなければなりません。" +#, fuzzy msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)." -msgstr "" +msgstr "次のような問題の処理: 10個のリング箱 (次元は同じ) と5kg (箱に入れていない) の輸送。" msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed." -msgstr "" +msgstr "車両の **容量** の単位が箱だと、`kg単位の羽` から `箱数` への変換が必要です。" msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed." -msgstr "" +msgstr "車両の**容量**の単位が `kg` の場合には、`リンゴ箱数` から `kg` への変換が必要です。" msgid "Showing how the 2 possible conversions can be done" -msgstr "" +msgstr "考えられる二通りの変換方法の提示" msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples." -msgstr "" +msgstr "次の通りとする: - :math:`f\\_boxes`: 羽 `1` kg の箱数。- :math:`a\\_weight`: リンゴ `1 ` 箱の重量。" msgid "Capacity Units" -msgstr "" +msgstr "容量単位" msgid "apples" -msgstr "" +msgstr "リンゴ" msgid "feathers" -msgstr "" +msgstr "羽" msgid "boxes" -msgstr "" +msgstr "箱" msgid ":math:`5 * f\\_boxes`" -msgstr "" +msgstr ":math:`5 * f\\_boxes`" msgid "kg" -msgstr "" +msgstr "kg" msgid ":math:`10 * a\\_weight`" -msgstr "" +msgstr ":math:`10 * a\\_weight`" msgid "5" -msgstr "" +msgstr "5" msgid "Locations" -msgstr "" +msgstr "位置" msgid "When using :doc:`pgr_pickDeliverEuclidean`:" -msgstr "" +msgstr ":doc:`pgr_pickDeliverEuclidean` 使用時:" msgid "The vehicles have :math:`(x, y)` pairs for start and ending locations." -msgstr "" +msgstr "車両は、開始位置と終了位置の :math:`(x, y)`ペアを持っています。" msgid "The orders Have :math:`(x, y)` pairs for pickup and delivery locations." -msgstr "" +msgstr "注文は、集荷位置と配送位置の :math:`(x, y)` ペアを持っています。" msgid "When using :doc:`pgr_pickDeliver`:" -msgstr "" +msgstr ":doc:`pgr_pickDeliver` を使う時:" msgid "The vehicles have identifiers for the start and ending locations." -msgstr "" +msgstr "車両には、始点と終点の識別子がついています。" msgid "The orders have identifiers for the pickup and delivery locations." -msgstr "" +msgstr "注文には、集荷場所と配達場所の識別子がついています。" msgid "All the identifiers are indices to the given matrix." -msgstr "" +msgstr "すべての識別子は、与えられた行列へのインデックスです。" msgid "Time Handling" -msgstr "" +msgstr "時刻の扱い" msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units." -msgstr "" +msgstr "時間は**0**を基準とした相対的なものです。すべての時間単位は、**0**を基準として、同じ時間単位に変換する必要があります。" msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." -msgstr "" +msgstr "車両の運転手が業務を午前 9:00 に開始し、午後 4:30 に終了し、訪問先作業時間は 10分30秒 とします。" msgid "Meaning of 0" -msgstr "" +msgstr "0の意味" msgid "time units" -msgstr "" +msgstr "時間単位" msgid "9:00 am" -msgstr "" +msgstr "午前 9:00" msgid "4:30 pm" -msgstr "" +msgstr "午後 4:30" msgid "10 min 30 secs" -msgstr "" +msgstr "10分30秒" msgid "0:00 am" -msgstr "" +msgstr "午前 0:00" msgid "hours" -msgstr "" +msgstr "時" msgid "9" -msgstr "" +msgstr "9" msgid "16.5" -msgstr "" +msgstr "16.5" msgid ":math:`10.5 / 60 = 0.175`" -msgstr "" +msgstr ":math:`10.5 / 60 = 0.175`" msgid "minutes" -msgstr "" +msgstr "分" msgid ":math:`9*60 = 54`" -msgstr "" +msgstr ":math:`9*60 = 54`" msgid ":math:`16.5*60 = 990`" -msgstr "" +msgstr ":math:`16.5*60 = 990`" msgid "10.5" -msgstr "" +msgstr "10.5" msgid "0" -msgstr "" +msgstr "0" msgid "7.5" -msgstr "" +msgstr "7.5" msgid ":math:`7.5*60 = 540`" -msgstr "" +msgstr ":math:`7.5*60 = 540`" msgid "Factor handling" -msgstr "" +msgstr "係数処理" +#, fuzzy msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values." -msgstr "" +msgstr "``factor`` は距離値を時刻単位に変換する配列値またはユークリッド距離値として機能します。" msgid "When the values are already in the desired time units" -msgstr "" +msgstr "値が既に求める時間単位になっている時" msgid "``factor`` should be **1**" -msgstr "" +msgstr "``factor`` は **1** とします" msgid "When ``factor`` > 1 the travel times are faster" -msgstr "" +msgstr "``factor`` > 1 の時、移動時間は速くなります" msgid "When ``factor`` < 1 the travel times are slower" -msgstr "" +msgstr "``factor`` < 1 の時、移動時間は遅くなります" +#, fuzzy msgid "For the :doc:`pgr_pickDeliverEuclidean`:" -msgstr "" +msgstr ":doc:`pgr_pickDeliverEuclidean` では:" msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity." -msgstr "" +msgstr "作業の時間単位は秒で x/y は 緯度/経度 のとき: Factor: はポイントの位置と、平均速度に依存します。平均速度を 25m/s と仮定します。" msgid "Latitude" -msgstr "" +msgstr "緯度" msgid "Conversion" -msgstr "" +msgstr "変換" msgid "Factor" -msgstr "" +msgstr "係数" msgid "45" -msgstr "" +msgstr "45" msgid "1 longitude degree is (78846.81m)/(25m/s)" -msgstr "" +msgstr "経度 1度について (78846.81m)/(25m/s)" msgid "3153 s" -msgstr "" +msgstr "3153 s" msgid "1 longitude degree is (111319.46 m)/(25m/s)" -msgstr "" +msgstr "経度1度について (111319.46 m)/(25m/s)" msgid "4452 s" -msgstr "" +msgstr "4452 s" msgid "For the :doc:`pgr_pickDeliver`:" -msgstr "" +msgstr ":doc:`pgr_pickDeliver` では:" msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`" -msgstr "" +msgstr ":math:`v = d / t` より :math:`t = d / v` となり ``factor`` は :math:`1 / v` となります" msgid "v" -msgstr "" +msgstr "v" msgid "Velocity" -msgstr "" +msgstr "速度 (Velocity)" msgid "d" -msgstr "" +msgstr "d" msgid "Distance" -msgstr "" +msgstr "距離 (Distance)" msgid "t" -msgstr "" +msgstr "t" msgid "Time" -msgstr "" +msgstr "時間 (Time)" msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" -msgstr "" +msgstr "換算関係 :math:`10m/s \\approx 600m/min \\approx 36 km/hr` について" msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" -msgstr "" +msgstr "作業の時間単位は秒、行列の単位はメートルで、行列上の値が 1000m長のとき:" msgid "Units" -msgstr "" +msgstr "単位" msgid "velocity" -msgstr "" +msgstr "速度" msgid "Result" -msgstr "" +msgstr "結果" msgid "seconds" -msgstr "" +msgstr "秒" msgid ":math:`10 m/s`" -msgstr "" +msgstr ":math:`10 m/s`" msgid ":math:`\\frac{1}{10m/s}`" -msgstr "" +msgstr ":math:`\\frac{1}{10m/s}`" msgid ":math:`0.1s/m`" -msgstr "" +msgstr ":math:`0.1s/m`" msgid ":math:`1000m * 0.1s/m = 100s`" -msgstr "" +msgstr ":math:`1000m * 0.1s/m = 100s`" msgid ":math:`600 m/min`" -msgstr "" +msgstr ":math:`600 m/min`" msgid ":math:`\\frac{1}{600m/min}`" -msgstr "" +msgstr ":math:`\\frac{1}{600m/min}`" msgid ":math:`0.0016min/m`" -msgstr "" +msgstr ":math:`0.0016min/m`" msgid ":math:`1000m * 0.0016min/m = 1.6min`" -msgstr "" +msgstr ":math:`1000m * 0.0016min/m = 1.6min`" msgid "Hours" -msgstr "" +msgstr "時" msgid ":math:`36 km/hr`" -msgstr "" +msgstr ":math:`36 km/hr`" msgid ":math:`\\frac{1}{36 km/hr}`" -msgstr "" +msgstr ":math:`\\frac{1}{36 km/hr}`" msgid ":math:`0.0277hr/km`" -msgstr "" +msgstr ":math:`0.0277hr/km`" msgid ":math:`1km * 0.0277hr/km = 0.0277hr`" -msgstr "" +msgstr ":math:`1km * 0.0277hr/km = 0.0277hr`" +#, fuzzy msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" -msgstr "" +msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgid ":doc:`sampledata`" -msgstr "" +msgstr ":doc:`sampledata`" msgid "A* - Family of functions" -msgstr "" +msgstr "A* - 関数群" msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph." -msgstr "" +msgstr "A* (「エースター」と読みます) アルゴリズムはダイクストラ法を基にして、最短経路問題を解くために、グラフ全体の一部だけを評価するヒューリスティックを付けたものです。" msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." -msgstr "" +msgstr ":doc:`pgr_aStar` - 最短経路を求める A* アルゴリズム。" msgid ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths." -msgstr "" +msgstr ":doc:`pgr_aStarCost` - 最短経路のコストの合計を得ます。" msgid ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." -msgstr "" +msgstr ":doc:`pgr_aStarCostMatrix` - 最短経路のコスト行列を得ます。" msgid "The main Characteristics are:" -msgstr "" +msgstr "主要な特徴は次の通りです:" msgid "Process works for directed and undirected graphs." -msgstr "" +msgstr "無向グラフ、有向グラフのどちらでも動作します。" msgid "Ordering is:" -msgstr "" +msgstr "並び順は次の通りです:" msgid "first by ``start_vid`` (if exists)" -msgstr "" +msgstr "最初に ``start_vid`` (存在するなら)" msgid "then by ``end_vid``" -msgstr "" +msgstr "続いて ``end_vid``" msgid "Values are returned when there is a path." -msgstr "" +msgstr "値はパスが存在する時に返ります。" msgid "Let :math:`v` and :math:`u` be nodes on the graph:" -msgstr "" +msgstr ":math:`v` と :math:`u` がグラフのノードとします:" msgid "If there is no path from :math:`v` to :math:`u`:" -msgstr "" +msgstr ":math:`v` から :math:`u` へのパスが無い場合:" msgid "no corresponding row is returned" -msgstr "" +msgstr "対応する行は返りません" msgid "``agg_cost`` from :math:`v` to :math:`u` is :math:`\\infty`" -msgstr "" +msgstr ":math:`v` から :math:`u` への ``agg_cost`` は :math:`\\infty` です" msgid "There is no path when :math:`v = u` therefore" -msgstr "" +msgstr ":math:`v = u`の時パスは存在しないので" msgid "``agg_cost`` from `v` to `u` is :math:`0`" -msgstr "" +msgstr "`v` から `u` への ``agg_cost`` は :math:`0`" msgid "When :math:`(x,y)` coordinates for the same vertex identifier differ:" -msgstr "" +msgstr "頂点識別子が同じで :math:`(x,y)` 座標が異なる時:" msgid "A random selection of the vertex's :math:`(x,y)` coordinates is used." -msgstr "" +msgstr "選択される :math:`(x,y)` 座標は不定です。" msgid "Running time: :math:`O((E + V) * \\log V)`" -msgstr "" +msgstr "実行時間: :math:`O((E + V) * \\log V)`" #, fuzzy msgid "aStar optional parameters" @@ -1576,88 +1589,88 @@ msgid "``heuristic``" msgstr "``heuristic``" msgid "Heuristic number. Current valid values 0~5." -msgstr "" +msgstr "ヒューリスティック番号。現在の妥当な値は 0~5です。" msgid "0: :math:`h(v) = 0` (Use this value to compare with pgr_dijkstra)" -msgstr "" +msgstr "0: :math:`h(v) = 0` (この値を使って pgr_dijkstra と比較してみて下さい)" msgid "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`" -msgstr "" +msgstr "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`" msgid "2: :math:`h(v) = abs(min(\\Delta x, \\Delta y))`" -msgstr "" +msgstr "2: :math:`h(v) = abs(min(\\Delta x, \\Delta y))`" msgid "3: :math:`h(v) = \\Delta x * \\Delta x + \\Delta y * \\Delta y`" -msgstr "" +msgstr "3: :math:`h(v) = \\Delta x * \\Delta x + \\Delta y * \\Delta y`" msgid "4: :math:`h(v) = sqrt(\\Delta x * \\Delta x + \\Delta y * \\Delta y)`" -msgstr "" +msgstr "4: :math:`h(v) = sqrt(\\Delta x * \\Delta x + \\Delta y * \\Delta y)`" msgid "5: :math:`h(v) = abs(\\Delta x) + abs(\\Delta y)`" -msgstr "" +msgstr "5: :math:`h(v) = abs(\\Delta x) + abs(\\Delta y)`" msgid "``1``" msgstr "``1``" msgid "For units manipulation. :math:`factor > 0`." -msgstr "" +msgstr "単位調整用。:math:`factor > 0`." msgid "``epsilon``" msgstr "``epsilon``" msgid "For less restricted results. :math:`epsilon >= 1`." -msgstr "" +msgstr "制約の少ない結果を得るために使用。:math:`epsilon >= 1`." msgid "See :ref:`heuristics ` available and :ref:`factor ` handling." -msgstr "" +msgstr "利用できる :ref:`heuristics ` および :ref:`factor ` の取り扱いを参照してください。" msgid "Advanced documentation" -msgstr "" +msgstr "高度なドキュメント" msgid "Heuristic" -msgstr "" +msgstr "ヒューリスティック" msgid "Currently the heuristic functions available are:" -msgstr "" +msgstr "現在利用できるヒューリスティック関数は次の通りです。" msgid "where :math:`\\Delta x = x_1 - x_0` and :math:`\\Delta y = y_1 - y_0`" -msgstr "" +msgstr "ここで :math:`\\Delta x = x_1 - x_0`、:math:`\\Delta y = y_1 - y_0`" msgid "Analysis 1" -msgstr "" +msgstr "解析 1" msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)" -msgstr "" +msgstr "コスト/逆コスト を度単位の長さとし、x/y を 緯度/経度 とする: Factor = 1 (単位変換不要)" msgid "Analysis 2" -msgstr "" +msgstr "解析 2" msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:" -msgstr "" +msgstr "コスト/逆コスト をメートル単位の長さとし、x/y を 緯度/経度 とする: Factor = 点の位置に次の通り依存します:" msgid "1 longitude degree is 78846.81 m" -msgstr "" +msgstr "経度 1度は 78846.81 m" msgid "78846" -msgstr "" +msgstr "78846" msgid "1 longitude degree is 111319.46 m" -msgstr "" +msgstr "経度 1度は 111319.46 m" msgid "111319" -msgstr "" +msgstr "111319" msgid "Analysis 3" -msgstr "" +msgstr "解析 3" msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed." -msgstr "" +msgstr "コスト/逆コスト を秒単位の時間とし、x/y を 緯度/経度 とする: Factor = 点の位置と平均速度 (たとえば 25m/s) に依存します。" msgid ":doc:`bdAstar-family`" -msgstr "" +msgstr ":doc:`bdAstar-family`" msgid "`Boost: A* search `__" -msgstr "" +msgstr "`Boost: A* 探索 (英語) `__" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" msgstr "" @@ -2407,7 +2420,7 @@ msgid ":doc:`pgr_floydWarshall`" msgstr "" msgid "Boost `floyd-Warshall `__" -msgstr "" +msgstr "Boost `ワーシャル–フロイド法 (英語) `__" msgid "Bidirectional A* - Family of functions" msgstr "" @@ -2492,7 +2505,7 @@ msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`" msgstr "" msgid "`Boost `__" -msgstr "" +msgstr "`Boost (英語) `__" #, fuzzy msgid "Chinese Postman Problem - Family of functions" @@ -2519,84 +2532,199 @@ msgstr "" msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "" -msgid "Coloring - Family of functions" -msgstr "" +#, fuzzy +msgid "Circuits - Family of Functions" +msgstr "ダイクストラ関連機能" -msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." -msgstr "" +#, fuzzy +msgid "The following functions work on circuits of directed graphs." +msgstr "導かれないグラフ。" -msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." +msgid ":doc:`pgr_hawickCircuits` - Hawick's circuits algorithm." msgstr "" -msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +#, fuzzy +msgid "``start vid``" +msgstr "``start_vid``" + +msgid "A vertex of the circuits: - All the circuits that contain the vertex are returned. - When ``0`` all the circuits are returned in canonical order." msgstr "" #, fuzzy -msgid "Returns set of |result_edge_color|" -msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" +msgid "``start vids``" +msgstr "``start_vid``" -msgid "``color``" -msgstr "``color``" +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "" -msgid "Color of the edge." +msgid "Vertices of the circuits: for each requested vertex: - All the circuits that contain the vertex are returned: - When empty all the circuits are returned in canonical order." msgstr "" -msgid "The minimum value of color is 1." +#, fuzzy +msgid "``min_depth``" +msgstr "``max_depth``" + +msgid "Minimum number of vertices in a circuit. * Exclude 2 edge circuits by increasing this number." msgstr "" #, fuzzy -msgid "Returns set of |result_node_color|" -msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" +msgid "``9223372036854775807``" +msgstr ":math:`9223372036854775807`" #, fuzzy -msgid "Identifier of the node." -msgstr "終了ノードの識別子。" +msgid "Maximum number of vertices in a circuit." +msgstr "最適化の最大周回数。" -msgid "Color of the node." +msgid "``self_loops``" msgstr "" -msgid "`Boost: `__" +msgid "When ``true`` self loops are included in the results." msgstr "" -msgid "Components - Family of functions" +msgid "When ``false`` self loops are excluded from the results." msgstr "" -msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgid "Self loops are included or excluded regardless of ``min_depth`` and ``max_depth``." msgstr "" -msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." -msgstr "" +#, fuzzy +msgid "``u_turn_on_edge``" +msgstr "``U_turn_on_edge``" -msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." +msgid "A u-turn on an edge is a 2 edge circuit that uses the same ``id`` on both directions of the edge." msgstr "" -msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgid "When ``true``: u-turns are part of the results." msgstr "" -msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." +msgid "When ``false``: u-turns are discarded when the circuit can be formed with two different edges; a u-turn is kept when it is the only option, that is, when the two vertices are connected by a single edge." msgstr "" -msgid ":doc:`pgr_makeConnected` - Details of edges to make graph connected." +msgid "Self loops are not affected." msgstr "" -msgid "Contraction - Family of functions" +msgid "Sequential value starting from ``1``" msgstr "" -msgid ":doc:`pgr_contraction`" +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Id of the circuit starting from ``1``" msgstr "" -msgid ":doc:`pgr_contractionDeadEnd`" +msgid "Relative position in the circuit. Has value **0** for the beginning of a circuit" msgstr "" #, fuzzy -msgid ":doc:`pgr_contractionLinear`" -msgstr ":doc:`pgr_kruskalBFS`" +msgid "Identifier of the starting vertex of the circuit." +msgstr "開始ノードの識別子。" -msgid ":doc:`pgr_contractionHierarchies`" -msgstr "" +#, fuzzy +msgid "Identifier of the ending vertex of the circuit." +msgstr "終了ノードの識別子。" -msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." -msgstr "" +msgid "``pred``" +msgstr "``pred``" + +#, fuzzy +msgid "Identifier of the node that precedes ``node`` in the circuit." +msgstr "開始ノードの識別子。" + +msgid "When ``node`` is the first node of the circuit, it has the same value as ``node``." +msgstr "" + +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "" + +#, fuzzy +msgid "Identifier of the edge used to arrive from ``pred`` to ``node``. - ``-1`` when :math:`depth = 0`." +msgstr "start_vid から end_vid まで行くのにかかるコスト" + +#, fuzzy +msgid "Cost to traverse from ``pred`` to ``node`` using ``edge``. - ``0`` when :math:`depth = 0`." +msgstr "現在の ``ノード`` から次の ``ノード`` まで移動する際の経路にかかるコスト。" + +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "" + +msgid "Coloring - Family of functions" +msgstr "" + +msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." +msgstr "" + +msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." +msgstr "" + +msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgstr "" + +#, fuzzy +msgid "Returns set of |result_edge_color|" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +msgid "``color``" +msgstr "``color``" + +msgid "Color of the edge." +msgstr "" + +msgid "The minimum value of color is 1." +msgstr "" + +#, fuzzy +msgid "Returns set of |result_node_color|" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +#, fuzzy +msgid "Identifier of the node." +msgstr "終了ノードの識別子。" + +msgid "Color of the node." +msgstr "" + +msgid "`Boost: `__" +msgstr "" + +msgid "Components - Family of functions" +msgstr "" + +msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgstr "" + +msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." +msgstr "" + +msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." +msgstr "" + +msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgstr "" + +msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." +msgstr "" + +msgid ":doc:`pgr_makeConnected` - Details of edges to make graph connected." +msgstr "" + +msgid "Contraction - Family of functions" +msgstr "" + +msgid ":doc:`pgr_contraction`" +msgstr "" + +msgid ":doc:`pgr_contractionDeadEnd`" +msgstr "" + +#, fuzzy +msgid ":doc:`pgr_contractionLinear`" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid ":doc:`pgr_contractionHierarchies`" +msgstr "" + +msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." +msgstr "" msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms." msgstr "" @@ -3082,9 +3210,6 @@ msgstr "" msgid ":math:`depth-1` is the depth of ``pred``" msgstr "" -msgid "``pred``" -msgstr "``pred``" - msgid "Predecessor of ``node``." msgstr "" @@ -3110,6 +3235,9 @@ msgstr "" msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." msgstr "" +msgid ":doc:`pgr_maxWeightedMatch` - Calculates a maximum weighted matching in a graph." +msgstr "" + msgid ":doc:`chinesePostmanProblem-family`" msgstr "" @@ -3162,9 +3290,29 @@ msgstr "" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr "" +msgid ":doc:`pgr_coreNumbers` - Computes the core number of each vertex." +msgstr "" + msgid ":doc:`TRSP-family`" msgstr "" +#, fuzzy +msgid ":doc:`planar-family`" +msgstr ":doc:`TSP-family`" + +msgid ":doc:`pgr_isPlanar` - Returns a boolean depending upon the planarity of the graph." +msgstr "" + +msgid ":doc:`pgr_makeBiconnectedPlanar` - Returns edges to add to a planar graph to make each connected component biconnected." +msgstr "" + +msgid ":doc:`pgr_planarFaces` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +#, fuzzy +msgid ":doc:`circuits-family`" +msgstr ":doc:`ordering-family`" + msgid "categories" msgstr "" @@ -3184,12 +3332,6 @@ msgstr "" msgid ":doc:`pgr_edwardMoore`" msgstr "" -msgid "Planar Family" -msgstr "" - -msgid ":doc:`pgr_isPlanar`" -msgstr "" - msgid "Miscellaneous Algorithms" msgstr "" @@ -3202,9 +3344,6 @@ msgstr "" msgid ":doc:`pgr_transitiveClosure`" msgstr "" -msgid ":doc:`pgr_hawickCircuits`" -msgstr "" - msgid "Flow - Family of functions" msgstr "" @@ -3594,7 +3733,87 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "" -msgid "Code enhancements" +msgid "4.1.0 Build" +msgstr "" + +#, fuzzy +msgid "PostgreSQL:" +msgstr "``postgreSQL``" + +msgid "Minimum requirement: 14" +msgstr "" + +msgid "Boost library:" +msgstr "" + +msgid "Minimum requirement: 1.74" +msgstr "" + +msgid "cmake:" +msgstr "" + +msgid "Minimum requirement: 3.22" +msgstr "" + +msgid "4.1.0 Summary of changes by function" +msgstr "" + +#, fuzzy +msgid "pgr_coreNumbers" +msgstr "pgr_nodeNetwork" + +#, fuzzy +msgid "New experimental function." +msgstr "新しい **公式** 機能" + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" + +msgid "Fix the way it builds the graph" +msgstr "" + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + +msgid "New optional parameters: ``min_depth``, ``max_depth``, ``self_loops`` and ``u_turn_on_edge``." +msgstr "" + +#, fuzzy +msgid "New signatures to select starting vertices." +msgstr "開始ノードの識別子。" + +msgid "Deprecated signature: ``pgr_hawickCircuits(text)``." +msgstr "" + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar" +msgstr "pgr_makeConnected" + +#, fuzzy +msgid "pgr_maxWeightedMatch" +msgstr "pgr_maxCardinalityMatch" + +#, fuzzy +msgid "pgr_planarFaces" +msgstr "pgr_isPlanar" + +#, fuzzy +msgid "4.1.0 New experimental functions." +msgstr "新しい **公式** 機能" + +msgid "`#3136 `__: pgr_maxWeightedMatch" +msgstr "" + +msgid "`#3140 `__: pgr_makeBiconnectedPlanar" +msgstr "" + +msgid "`#3142 `__: pgr_coreNumbers" +msgstr "" + +msgid "`#3143 `__: pgr_planarFaces" +msgstr "" + +msgid "4.1.0 Code enhancements" msgstr "" msgid "`#3049 `__: Use enumeration on drivers and process." @@ -3630,19 +3849,31 @@ msgstr "" msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "" -msgid "Bug Fixes" +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" msgstr "" -msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" +msgid "`#3131 `__: binaryBreadthFirstSearch: Integrate into existing process/driver pair" msgstr "" -msgid "Summary of changes by function" +msgid "`#3154 `__: betweennessCentrality: use allpairs/process and driver" msgstr "" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +msgid "`#3163 `__: KSP & KSP WithPoints Use ShortestPath driver files" +msgstr "" -msgid "Fix the way it builds the graph" +msgid "`#3170 `__: pgr_hawickCircuits: wrong Boost function referenced" +msgstr "" + +msgid "4.1.0 Bug Fixes" +msgstr "" + +msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" +msgstr "" + +msgid "4.1.0 Requirements" +msgstr "" + +msgid "`#3120 `__: Up min requirements: Boost to 1.74 Postgres to 14 cmake to 3.22." msgstr "" msgid "All releases" @@ -5999,9 +6230,6 @@ msgstr "pgr_TSP" msgid "Returns set of |generic-result|" msgstr "" -msgid "``path_id``" -msgstr "``path_id``" - msgid "Path identifier." msgstr "" @@ -6154,22 +6382,20 @@ msgstr "" msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "" -msgid "C and C++0x compilers" -msgstr "" - -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgid "C++ standard" msgstr "" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "C++17" msgstr "" -msgid "Postgresql version >= 13" -msgstr "" +#, fuzzy +msgid "Postgresql version >= 14" +msgstr "バージョン 3.0.0" -msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgid "The Boost Graph Library (BGL) >= 1.74.0" msgstr "" -msgid "CMake >= 3.12" +msgid "CMake >= 3.22" msgstr "" msgid "For user's documentation" @@ -6434,7 +6660,7 @@ msgstr "これまでの貢献者と現在の貢献者:" msgid "Individuals (in alphabetical order)" 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, 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 "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, Mayur Galhate, 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 "Corporate Sponsors (in alphabetical order)" @@ -6880,7 +7106,7 @@ msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, int msgstr "" msgid "Using `Boost: metric TSP approx `__" -msgstr "" +msgstr "`Boost: メトリック巡回セールスマン問題 (英語) `__ を使用" msgid "Version 3.0.0" msgstr "バージョン 3.0.0" @@ -7171,10 +7397,6 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -#, fuzzy -msgid "New experimental function." -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 "" @@ -7203,7 +7425,7 @@ msgid "Identifier of the vertex." msgstr "" msgid "`Boost: Biconnected components & articulation points `__" -msgstr "" +msgstr "`Boost: 二重連結成分 & 関節点 (英語) `__" msgid "wikipedia: `Biconnected component `__" msgstr "" @@ -7258,7 +7480,7 @@ msgid "Undirected graph with edges after optimization." msgstr "" msgid "`Boost: bandwidth `_" -msgstr "" +msgstr "`Boost: グラフ帯域幅 (英語) `_" msgid "``pgr_bdAstar``" msgstr "``pgr_bdAstar``" @@ -7518,7 +7740,7 @@ msgid "Using a combinations table on an undirected graph" msgstr "導かれないグラフ。" msgid "`Boost: Bellman Ford `__" -msgstr "" +msgstr "`Boost: ベルマンーフォード法 (英語) `__" msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" @@ -7917,9 +8139,6 @@ msgstr "" msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "" -msgid "Sequential value starting from ``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." msgstr "" @@ -8356,9 +8575,6 @@ msgstr "" msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." msgstr "" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "" - msgid "**Empty**" msgstr "" @@ -8851,6 +9067,317 @@ msgstr "" msgid "Create the contracted graph." msgstr "次のクエリを実行します。" +#, fuzzy +msgid "``pgr_coreNumbers`` - Experimental" +msgstr "p" + +msgid "``pgr_coreNumbers`` - Computes the core number of each vertex in an undirected graph using k-core decomposition." +msgstr "" + +#, fuzzy +msgid "Version 4.1.0" +msgstr "バージョン 2.0.0" + +msgid "The **core number** of a vertex is the largest value :math:`k` such that the vertex **belongs to the** :math:`k`-core of the graph." +msgstr "" + +msgid "The :math:`k`-core of a graph is the maximal subgraph in which every vertex has degree at least :math:`k` within that subgraph. K-core decomposition iteratively removes vertices of degree less than :math:`k` until no such vertices remain, increasing :math:`k` at each stage. The process assigns one core number to every vertex." +msgstr "" + +msgid "The core number says how deeply a vertex sits inside the graph:" +msgstr "" + +msgid "Core :math:`1` vertices are peeled in the first step. They are terminal nodes of the peeled graph, adjacent to at most one other vertex in the induced subgraph." +msgstr "" + +msgid "Core :math:`2` vertices survive that step. They lie on cycles, or on the chains joining them." +msgstr "" + +msgid "Core :math:`3` and above mark dense regions where every vertex keeps three or more neighbors however much of the graph is peeled away." +msgstr "" + +msgid "Parallel edges between the same pair of vertices are collapsed into a single edge before the peeling starts, so edge multiplicity does not inflate core numbers." +msgstr "" + +msgid "Three parallel edges between two vertices give both vertices core :math:`1`, the same as a single edge." +msgstr "" + +msgid "Self loop: a vertex is not a neighbor of its own vertex, so it is dropped before peeling and does not contribute to that vertex's degree." +msgstr "" + +msgid "A vertex whose only edge is a self loop has no real neighbors left, So the core number is 0." +msgstr "" + +msgid "Loops and parallel edges are removed." +msgstr "" + +msgid "All vertices are kept" +msgstr "" + +#, fuzzy +msgid "Costs are ignored" +msgstr ":math:`0` 値は無視されます" + +msgid "Each vertex receives exactly one core number" +msgstr "" + +#, fuzzy +msgid "Results:" +msgstr "結果として返却されるカラム" + +msgid "Number of returned rows: :math:`|V|`." +msgstr "" + +msgid "Ordered by ``node`` ascending." +msgstr "" + +msgid "No rows returned when no edges found. Emits a ``NOTICE``" +msgstr "" + +msgid "Running time: :math:`O(|E| + |E| + |V| log |V|)`" +msgstr "" + +msgid "Loop and parallel removal: :math:`O(|E|)`" +msgstr "" + +msgid "Peeling algorithm: :math:`O(|E|)`" +msgstr "" + +msgid "Sorting: :math:`|V| log |V|`" +msgstr "" + +#, fuzzy +msgid "pgr_coreNumbers(`Edges SQL`_)" +msgstr "p" + +#, fuzzy +msgid "Returns set of ``(seq, node, core)``" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +msgid "Core numbers on a subgraph of :doc:`sampledata`" +msgstr "" + +msgid "Vertices are colored by core number in the diagrams below: ``deepskyblue`` for core :math:`1` and ``green`` for core :math:`2`." +msgstr "" + +msgid "All returned vertices have core number :math:`1`; they belong to the 1-core but not to any higher core." +msgstr "" + +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." +msgstr "" + +msgid "Vertices :math:`6`, :math:`7`, and :math:`10` have higher degree here, but peeling degree-:math:`1` vertices first removes the entire subgraph before a 2-core can form." +msgstr "" + +msgid "The following diagram shows edges :math:`\\{1, \\ldots, 7\\}` from :doc:`sampledata`; every vertex label shows ``node (core)``." +msgstr "" + +msgid "The next subgraph uses edges :math:`\\{1, 2, 3, 4\\}`, the same set as the main example of :doc:`pgr_betweennessCentrality`. Every vertex is still core :math:`1` because the structure is a tree-like path with terminal nodes at :math:`5` and :math:`15`." +msgstr "" + +msgid "K-core peeling (illustration)" +msgstr "" + +msgid "On edges :math:`id < 10`, vertices :math:`5` and :math:`15` are removed first because they have degree :math:`1`. After further peeling, vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` remain as the 2-core (shown in green below)." +msgstr "" + +#, fuzzy +msgid "Sequential value starting from 1." +msgstr "**1** 始まりの順序値。" + +#, fuzzy +msgid "``core``" +msgstr "``color``" + +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "" + +msgid "The examples of this section are based on the :doc:`sampledata` network." +msgstr "" + +msgid "Sample network overview" +msgstr "" + +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." +msgstr "" + +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" +msgstr "" + +msgid "Both functions use the same ``Edges SQL`` format. The betweenness example on edges :math:`\\{1, 2, 3, 4\\}` measures shortest-path influence; core numbers measure peeling resilience." +msgstr "" + +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" +msgstr "" + +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." +msgstr "" + +msgid "Vertex :math:`6` has degree :math:`3` in this subgraph but still has core :math:`1`, because removing :math:`5` and :math:`15` first leaves no subgraph where every vertex has degree at least :math:`2`." +msgstr "" + +msgid "Compare with :doc:`pgr_betweennessCentrality` on the same edges: vertex :math:`6` has the highest betweenness, but core number does not rank vertices by path importance." +msgstr "" + +msgid "Subgraph with core-:math:`2` vertices" +msgstr "" + +msgid "Adding edges :math:`5` through :math:`9` connects the inner vertices into a 2-core. The undirected layout below shows the same network." +msgstr "" + +msgid "Undirected view of the sample network" +msgstr "" + +#, fuzzy +msgid "2) Core numbers on edges :math:`id < 10`" +msgstr "エッジのセット:math:`E`" + +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." +msgstr "" + +msgid "Vertices :math:`1`, :math:`3`, :math:`5`, :math:`15`, and :math:`16` are attached by tree-like branches and remain core :math:`1`." +msgstr "" + +msgid "Edge :math:`8` (between :math:`7` and :math:`11`) closes a cycle with edges :math:`4`, :math:`2`, and :math:`5`, which is why the inner four vertices survive peeling." +msgstr "" + +msgid "Filtering results in SQL" +msgstr "" + +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." +msgstr "" + +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" +msgstr "" + +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." +msgstr "" + +msgid "Use it to export only the hub vertices for further analysis." +msgstr "" + +msgid "Full sample graph" +msgstr "" + +msgid "4) Core numbers on all edges" +msgstr "" + +msgid "The full network has :math:`17` vertices and maximum core number :math:`2`." +msgstr "" + +msgid "Terminal branches (vertices :math:`1`, :math:`2`, :math:`3`, :math:`4`, :math:`5`, :math:`9`, :math:`13`, :math:`14`) remain core :math:`1`." +msgstr "" + +msgid "The 2-core is vertices :math:`6`, :math:`7`, :math:`8`, :math:`10`, :math:`11`, :math:`12`, :math:`15`, :math:`16` and :math:`17`: the central block of the city network. Vertex :math:`9` hangs off :math:`8` by edge :math:`14` alone, so it is peeled first and stays core :math:`1`." +msgstr "" + +msgid "Small graphs" +msgstr "" + +msgid "5) Single edge (two terminal nodes)" +msgstr "" + +msgid "Both endpoints have core number :math:`1`." +msgstr "" + +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." +msgstr "" + +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." +msgstr "" + +#, fuzzy +msgid "6) Triangle (all vertices core :math:`2`)" +msgstr "ノードのセット :math:`V`" + +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." +msgstr "" + +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." +msgstr "" + +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." +msgstr "" + +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" +msgstr "" + +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." +msgstr "" + +msgid "This is the 2-core heart of example 2) before branches are attached." +msgstr "" + +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." +msgstr "" + +msgid "8) Star graph (hub and spokes, all core :math:`1`)" +msgstr "" + +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." +msgstr "" + +msgid "The hub has degree :math:`4`, but removing the four leaves leaves an isolated vertex, so the hub never belongs to a 2-core." +msgstr "" + +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." +msgstr "" + +msgid "Empty edge set" +msgstr "" + +msgid "9) No edges in the SQL query" +msgstr "" + +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." +msgstr "" + +msgid "No exception is raised." +msgstr "" + +msgid "Core numbers and planarity" +msgstr "" + +msgid "Vertices with higher core numbers often lie in densely connected regions. The workflow below computes core numbers, filters the 2-core, and checks whether the subgraph can be drawn without edge crossings using :doc:`pgr_isPlanar`." +msgstr "" + +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" +msgstr "" + +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" +msgstr "" + +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." +msgstr "" + +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." +msgstr "" + +msgid "Planarity and core number measure different properties: a graph can be planar while still having a mix of core-:math:`1` and core-:math:`2` vertices." +msgstr "" + +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" +msgstr "" + +msgid "The examples above reach at most core :math:`2`, because the :doc:`sampledata` network has degeneracy :math:`2`. Higher cores need a denser graph. In the complete graph :math:`K_4` every vertex is adjacent to the other three, so no vertex can ever be peeled at :math:`k \\leq 3` and the whole graph is its own 3-core." +msgstr "" + +msgid "Every vertex has degree :math:`3`, so nothing is removed while peeling at :math:`k = 1`, :math:`2` or :math:`3`: all four vertices have core :math:`3`." +msgstr "" + +msgid "In general the complete graph :math:`K_n` has core number :math:`n - 1` for every vertex, which is the maximum possible core number on :math:`n` vertices." +msgstr "" + +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." +msgstr "" + +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" +msgstr "" + +#, fuzzy +msgid "`Wikipedia: Degeneracy (graph theory) `__" +msgstr "`Wikipedia: 巡回セールスマン問題 `__" + msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" @@ -8919,13 +9446,20 @@ 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 "" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." -msgstr "" +#, fuzzy +msgid "This implementation can only be used with a directed graph with no cycles i.e. directed acyclic 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 "" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgid "Process is valid for weighted directed acyclic graphs only." +msgstr "" + +msgid "Avoids one edge cycle: `reverse_cost` column is used when :math:`cost < 0`." +msgstr "" + +msgid "If the graph is not DAG, will throw a PostgreSQL `ERROR`." msgstr "" msgid "The `agg_cost` the non included values `(v, v)` is `0`" @@ -8966,6 +9500,9 @@ msgstr "" msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "" +msgid "`reverse_cost` column is used when :math:`cost < 0` to avoid edge cycle." +msgstr "" + #, fuzzy msgid "Return columns" msgstr "結果として返却されるカラム" @@ -9283,9 +9820,6 @@ msgstr "" msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network." -msgstr "" - msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" @@ -9746,6 +10280,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" +#, fuzzy +msgid "Version 4.0.2" +msgstr "バージョン 2.0.0" + +msgid "Fix: bad alloc" +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 "" @@ -9830,6 +10371,15 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "" @@ -9895,9 +10445,6 @@ msgstr "" msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" -msgid "end-before" -msgstr "" - msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" @@ -9907,10 +10454,6 @@ msgstr "" msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -#, fuzzy -msgid "Version 4.1.0" -msgstr "バージョン 2.0.0" - msgid "Output columns standardized to |result_edge_color|" msgstr "" @@ -10564,53 +11107,107 @@ msgstr "" msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." 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 "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Heath A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs." 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 "Circuit enumeration in directed graphs, where circuits with parallel arcs are enumerated." msgstr "" -msgid "The algorithm implementation works only for directed graph" +msgid "Each combination of parallel arcs is returned as a different circuit." msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." -msgstr "" +#, fuzzy +msgid "Works for directed graphs." +msgstr "導かれないグラフ。" msgid "The algorithm outputs the distinct circuits present in the graph." msgstr "" +msgid "The circuits are elementary: a vertex is not repeated within a circuit, except the starting vertex that closes the circuit." +msgstr "" + +msgid "When no initial vertices are given all circuits are in canonical order of the vertices insertion of the graph: A circuit with vertices ``u``, ``v``: ``u`` starting circuits containing ``v`` will not be listed on ``start_vid = v`` rows." +msgstr "" + +msgid "Different edge ordering gives different canonical ordering." +msgstr "" + +msgid "When start vertices are given, all circuits are returned for each requested vertex it contains, and the results are grouped by ``start_vid``." +msgstr "" + +msgid "The graph passed to the algorithm discard parallel edges with higher costs." +msgstr "" + msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "" -msgid ":math:`|c|` is the number of circuits in the graph." +#, fuzzy +msgid "where :math:`|V|` is the number of vertices in the graph." +msgstr ":math:`v` と :math:`u` がグラフのノードとします:" + +msgid "where :math:`|c|` is the number of circuits in the graph." msgstr "" msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "" -msgid "Circuits present in the pgRouting :doc:`sampledata`" -msgstr "" +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vid** [, **options**])" +msgstr "p" -msgid "Id of the circuit starting from ``1``" +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vids** [, **options**])" +msgstr "p" + +msgid "**options:** ``[min_depth, max_depth, self_loops, u_turn_on_edge]``" msgstr "" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" +#, fuzzy +msgid "Returns set of |circuits-result|" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +msgid "All circuits" msgstr "" #, fuzzy -msgid "Identifier of the starting vertex of the circuit." -msgstr "開始ノードの識別子。" +msgid "pgr_hawickCircuits(`Edges SQL`_ [, **options**])" +msgstr "pg" + +msgid "All the circuits of the pgRouting :doc:`sampledata`" +msgstr "" + +msgid "When no starting vertex is given, all the circuits of the graph are returned. The result has 94 rows, one ``path_id`` for each circuit:" +msgstr "" + +msgid "Single start vertex" +msgstr "" #, fuzzy -msgid "Identifier of the ending vertex of the circuit." -msgstr "終了ノードの識別子。" +msgid "Circuits that contain vertex :math:`10`" +msgstr "エッジのセット :math:`5`:" + +msgid "Many start vertices" +msgstr "" + +msgid "Circuits that contain vertices :math:`\\{10, 11\\}`" +msgstr "" + +msgid "The examples use the following table ``c_example``, that represent a cul_de_sac where the exit is on vertex :math:`5` and the vehicle is on vertex :math:`1` but pointing at the wrong direction of the exit." +msgstr "" + +msgid "All possible ways to return to vertex :math:`1`." +msgstr "" -msgid "Identifier of the node in the path from a vid to next vid." +msgid "Exclude self loops." msgstr "" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "Exclude self loops and U-turn on the same edge." msgstr "" +#, fuzzy +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost: プリム法 (英語) `__" + msgid "``pgr_isPlanar`` - Experimental" msgstr "" @@ -11236,6 +11833,84 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "" +#, fuzzy +msgid "``pgr_makeBiconnectedPlanar`` - Experimental" +msgstr "p" + +msgid "``pgr_makeBiconnectedPlanar`` — Returns the set of edges needed to make each connected component of a planar graph biconnected." +msgstr "" + +msgid "``pgr_makeBiconnectedPlanar`` identifies the missing edges that need to be added to each connected component of an existing planar graph to make those components biconnected, while ensuring the graph remains planar." +msgstr "" + +msgid "A graph is considered **biconnected** if it is connected and cannot be broken into disconnected pieces by deleting any single vertex (it has no articulation points). A planar graph is one that can be drawn in two-dimensional space with no two of its edges crossing." +msgstr "" + +msgid "If the graph is not connected it will treat each component as an idividual graph." +msgstr "" + +msgid "Run :doc:`pgr_makeConnected` to connect all components." +msgstr "" + +msgid "When the graph is not planar it will emit an ``ERROR``" +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first." +msgstr ":doc:`pgr_kruskalBFS`" + +msgid "All vertices are kept." +msgstr "" + +#, fuzzy +msgid "Costs are ignored." +msgstr ":math:`0` 値は無視されます" + +msgid "Returns a list of all new edges needed to make biconected graphs out of each connected component." +msgstr "" + +#, fuzzy +msgid "Empty results when the graph is already biconnected planar." +msgstr "フラフが接続されている時には" + +msgid "Running time: :math:`O(|V| + |E| + R \\log R)` for each component" +msgstr "" + +msgid ":math:`R` is the number of returned edges." +msgstr "" + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "p" + +msgid "Returns set of |result-component-make|" +msgstr "" + +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "" + +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." +msgstr "" + +msgid "When a graph contains multiple disconnected components, each component is processed independently. Components (2,4) and (13,14) are already biconnected (0 articulation points) and require no new edges." +msgstr "" + +msgid "4-vertex path graph." +msgstr "" + +#, fuzzy +msgid "Create a 4-vertex tree graph." +msgstr "次のクエリを実行します。" + +msgid "Get the edges needed to have biconnected planar graph." +msgstr "" + +msgid "Adding the edges to the graph" +msgstr "" + +msgid "`Boost: make_biconnected_planar `__" +msgstr "" + msgid "``pgr_makeConnected`` - Experimental" msgstr "" @@ -11254,9 +11929,6 @@ msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "" -msgid "Returns set of |result-component-make|" -msgstr "" - msgid "List of edges that are needed to connect the graph." msgstr "" @@ -11467,6 +12139,47 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" +#, fuzzy +msgid "``pgr_maxWeightedMatch`` - Experimental" +msgstr "p" + +msgid "``pgr_maxWeightedMatch`` — Calculates a maximum weighted matching in a graph." +msgstr "" + +msgid "A **maximum weighted matching** in a graph is a matching where the sum of the weights of selected edges is maximized." +msgstr "" + +msgid "Each vertex is matched with at most one other vertex." +msgstr "" + +msgid "Maximizes the total edge weight sum." +msgstr "" + +msgid "There may be many maximum weighted matchings." +msgstr "" + +msgid "Calculates one possible maximum weighted matching in a graph." +msgstr "" + +#, fuzzy +msgid "Running time: :math:`O(V^3)`." +msgstr ":math:`m^3` のような体積単位。" + +#, fuzzy +msgid "pgr_maxWeightedMatch(`Edges SQL`_)" +msgstr "p" + +#, fuzzy +msgid "Set of |result-edge|" +msgstr "|matrix-result| 集合" + +msgid "Maximum weighted matching on a custom 5-vertex graph." +msgstr "" + +#, fuzzy +msgid "`Boost: maximum_weighted_matching `__" +msgstr "`Boost: プリム法 (英語) `__" + msgid "``pgr_pickDeliver`` - Experimental" msgstr "" @@ -11662,6 +12375,161 @@ msgstr "" msgid "This implementation's travel time: 854.54" msgstr "" +#, fuzzy +msgid "``pgr_planarFaces`` - Experimental" +msgstr "p" + +msgid "``pgr_planarFaces`` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +msgid "In a planar embedding, the graph is drawn in the plane so that edges meet only at vertices. A face is a maximal connected region of the plane bounded by edges." +msgstr "" + +msgid "Every bounded face is a cycle of edges enclosing an interior region. The exterior face, also called the unbounded face, is the region outside the outermost cycle." +msgstr "" + +msgid "Once an embedding is fixed, each undirected edge has a left and a right side when walked in the direction the embedding assigns around each vertex." +msgstr "" + +msgid "In a connected planar undirected graph, each edge separates exactly two faces, so it contributes one row on the left and one on the right." +msgstr "" + +msgid "``pgr_planarFaces`` returns those incidences: ``face_id`` names the face, ``edge_id`` is the border edge, and ``side`` is ``1`` (left) or ``2`` (right) relative to the embedding." +msgstr "" + +msgid "The function first computes a planar embedding with the Boyer-Myrvold planarity test, then walks faces with Boost ``planar_face_traversal``.i" +msgstr "" + +msgid "Loops and paralell edges are preserved." +msgstr "" + +msgid "They are used to determine the existance of an edge" +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid "The result has one row per edge-side pair" +msgstr "" + +msgid "Graph with :math:`|E|` edges yields :math:`2|E|` rows." +msgstr "" + +msgid "Number of faces: * Obeys Euler's formula: :math:`|V| - |E| + |F| = 2` * On a graph with :math:`C` components: :math:`|V| - |E| + |F| = 2C`." +msgstr "" + +msgid "Running time: :math:`O(|E| + |V|)`" +msgstr "" + +#, fuzzy +msgid "pgr_planarFaces(`Edges SQL`_)" +msgstr "p" + +#, fuzzy +msgid "Returns set of ``(seq, face_id, edge_id, side)``" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +msgid "Faces of the full :doc:`sampledata` graph" +msgstr "" + +msgid "The query returns **36 rows**, twice the **18** edges in ``edges``, consistent with :math:`2|E|`." +msgstr "" + +msgid "``face_id`` runs from **1** through **7** on this network; each id is one face of the embedding, including the unbounded **exterior face** (here ``face_id = 1`` borders the outer layout of the city block)." +msgstr "" + +msgid "Every ``edge_id`` appears **twice**, once with ``side = 1`` and once with ``side = 2``." +msgstr "" + +msgid "Rows follow the counterclockwise walk of each face in the computed embedding." +msgstr "" + +msgid "Have :math:`3` components then number if faces = :math:`17 - 18 + 7 = 6 = 2 \\times 3`." +msgstr "" + +#, fuzzy +msgid "``face_id``" +msgstr "``end_id``" + +#, fuzzy +msgid "Identifier of the face in the computed embedding." +msgstr "一つ目のエッジの終端頂点の識別番号。" + +#, fuzzy +msgid "Identifier of the edge that borders the face." +msgstr "開始ノードの識別子。" + +msgid "``1`` when the edge borders the face on the left side." +msgstr "" + +msgid "``2`` when the edge borders the face on the right side." +msgstr "" + +msgid "Non-planar graphs" +msgstr "" + +msgid "Face extraction requires a planar graph. Subgraphs containing a :math:`K_5` or :math:`K_{3,3}` minor cannot be embedded without crossings; ``pgr_planarFaces`` raises ``ERROR: Graph is not planar`` in that case. The :doc:`pgr_isPlanar` documentation shows a non-planar subgraph of ``sampledata`` (edges highlighted in blue in the figure)." +msgstr "" + +#, fuzzy +msgid "Create a :math:`K_5` graph." +msgstr "次のクエリを実行します。" + +msgid "Test planarity: dont execute when is not planar." +msgstr "" + +msgid "Or get an error: (not shown)" +msgstr "" + +msgid "Planarity of loops" +msgstr "" + +msgid "One loop graph with only one vertex:" +msgstr "" + +msgid "Two loop graph with only one vertex:" +msgstr "" + +msgid "Triangular graphs" +msgstr "" + +msgid "Triangular graph (no duplicate edges)" +msgstr "" + +msgid "Six rows are returned: :math:`2 \\times 3` edges." +msgstr "" + +msgid ":math:`face\\_id = 1` is the interior face." +msgstr "" + +msgid ":math:`face\\_id = 2` is the exterior face. face." +msgstr "" + +msgid "Each edge lists ``1`` on one face and ``2`` on the other." +msgstr "" + +msgid "Triangular graph (duplicate edges)" +msgstr "" + +msgid ":doc:`pgr_isPlanar`" +msgstr "" + +#, fuzzy +msgid "Boost Graph Library: `Planar Face Traversal `__" +msgstr "`Boost: metric TSP approx `__" + +#, fuzzy +msgid "Boost Graph Library: `Boost: Boyer Myrvold planarity `__" +msgstr "`Boost: metric TSP approx `__" + +#, fuzzy +msgid "Wikipedia: `Planar graph `__" +msgstr "`Wikipedia: 巡回セールスマン問題 `__" + +msgid "Boyer, J. M. and Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity Algorithms by Edge Addition. Journal of Graph Algorithms and Applications, 8(3), 241-273." +msgstr "" + msgid "``pgr_prim``" msgstr "``pgr_prim``" @@ -12996,6 +13864,10 @@ 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 "" +#, fuzzy +msgid "Planar - Family of functions" +msgstr "TRSP - 関数ファミリー" + msgid "Prim - Family of functions" msgstr "" @@ -13045,12 +13917,45 @@ msgstr "" msgid "pgRouting 4.0" msgstr "" +msgid "pgRouting 4.0.2 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "4.0.2 Bug Fixes" +msgstr "" + +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "" + +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "" + msgid "pgRouting 4.0.1 Release Notes" msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" msgstr "" +msgid "Bug Fixes" +msgstr "" + msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "" @@ -13060,6 +13965,9 @@ msgstr "" msgid "`#3010 `__: Performance issue with pgr_separateTouching()" msgstr "" +msgid "Code enhancements" +msgstr "" + msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" msgstr "" @@ -13091,7 +13999,7 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" -msgid "Build" +msgid "4.0.0 Build" msgstr "" msgid "C++ standard is std17" @@ -13171,6 +14079,9 @@ msgstr "" msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" +msgid "Summary of changes by function" +msgstr "" + msgid "pgr_aStar" msgstr "pgr_aStar" @@ -13231,9 +14142,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13300,15 +14208,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "" @@ -14042,6 +14944,9 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "" +msgid "Build" +msgstr "" + msgid "`#2713 `__: cmake missing some policies and min version" msgstr "" @@ -14428,9 +15333,6 @@ msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "" -msgid "pgr_hawickCircuits" -msgstr "pgr_hawickCircuits" - msgid "Flow functions" msgstr "" @@ -15124,9 +16026,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -16581,3 +17480,7 @@ msgstr "" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" + +#, fuzzy +#~ msgid "Planar" +#~ msgstr "pgr_isPlanar" diff --git a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po index 7a49cd0b4b5..a7e59236975 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: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-10-24 01:29+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Hyung-Gyu Ryoo \n" "Language-Team: Korean \n" @@ -343,6 +343,12 @@ msgstr "" msgid "Experimental" msgstr ":doc:`experimental`" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "" @@ -2475,6 +2481,116 @@ msgstr "" msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "" +#, fuzzy +msgid "Circuits - Family of Functions" +msgstr ":doc:`pgr_withPoints`" + +#, fuzzy +msgid "The following functions work on circuits of directed graphs." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +#, fuzzy +msgid ":doc:`pgr_hawickCircuits` - Hawick's circuits algorithm." +msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." + +#, fuzzy +msgid "``start vid``" +msgstr "``start_vid``" + +msgid "A vertex of the circuits: - All the circuits that contain the vertex are returned. - When ``0`` all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``start vids``" +msgstr "``start_vid``" + +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "" + +msgid "Vertices of the circuits: for each requested vertex: - All the circuits that contain the vertex are returned: - When empty all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``min_depth``" +msgstr "``max_depth``" + +msgid "Minimum number of vertices in a circuit. * Exclude 2 edge circuits by increasing this number." +msgstr "" + +#, fuzzy +msgid "``9223372036854775807``" +msgstr ":math:`9223372036854775807`" + +msgid "Maximum number of vertices in a circuit." +msgstr "" + +msgid "``self_loops``" +msgstr "" + +msgid "When ``true`` self loops are included in the results." +msgstr "" + +msgid "When ``false`` self loops are excluded from the results." +msgstr "" + +msgid "Self loops are included or excluded regardless of ``min_depth`` and ``max_depth``." +msgstr "" + +#, fuzzy +msgid "``u_turn_on_edge``" +msgstr "``U_turn_on_edge``" + +msgid "A u-turn on an edge is a 2 edge circuit that uses the same ``id`` on both directions of the edge." +msgstr "" + +msgid "When ``true``: u-turns are part of the results." +msgstr "" + +msgid "When ``false``: u-turns are discarded when the circuit can be formed with two different edges; a u-turn is kept when it is the only option, that is, when the two vertices are connected by a single edge." +msgstr "" + +msgid "Self loops are not affected." +msgstr "" + +msgid "Sequential value starting from ``1``" +msgstr "" + +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Id of the circuit starting from ``1``" +msgstr "" + +msgid "Relative position in the circuit. Has value **0** for the beginning of a circuit" +msgstr "" + +msgid "Identifier of the starting vertex of the circuit." +msgstr "" + +msgid "Identifier of the ending vertex of the circuit." +msgstr "" + +msgid "``pred``" +msgstr "``pred``" + +msgid "Identifier of the node that precedes ``node`` in the circuit." +msgstr "" + +msgid "When ``node`` is the first node of the circuit, it has the same value as ``node``." +msgstr "" + +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "" + +msgid "Identifier of the edge used to arrive from ``pred`` to ``node``. - ``-1`` when :math:`depth = 0`." +msgstr "" + +msgid "Cost to traverse from ``pred`` to ``node`` using ``edge``. - ``0`` when :math:`depth = 0`." +msgstr "" + +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "" + msgid "Coloring - Family of functions" msgstr "" @@ -3031,9 +3147,6 @@ msgstr "" msgid ":math:`depth-1` is the depth of ``pred``" msgstr "" -msgid "``pred``" -msgstr "``pred``" - msgid "Predecessor of ``node``." msgstr "" @@ -3058,6 +3171,10 @@ msgstr "" msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." msgstr "" +#, fuzzy +msgid ":doc:`pgr_maxWeightedMatch` - Calculates a maximum weighted matching in a graph." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + msgid ":doc:`chinesePostmanProblem-family`" msgstr ":doc:`chinesePostmanProblem-family`" @@ -3113,9 +3230,31 @@ msgstr "" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." +#, fuzzy +msgid ":doc:`pgr_coreNumbers` - Computes the core number of each vertex." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + msgid ":doc:`TRSP-family`" msgstr ":doc:`TRSP-family`" +#, fuzzy +msgid ":doc:`planar-family`" +msgstr ":doc:`aStar-family`" + +#, fuzzy +msgid ":doc:`pgr_isPlanar` - Returns a boolean depending upon the planarity of the graph." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid ":doc:`pgr_makeBiconnectedPlanar` - Returns edges to add to a planar graph to make each connected component biconnected." +msgstr "" + +msgid ":doc:`pgr_planarFaces` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +#, fuzzy +msgid ":doc:`circuits-family`" +msgstr ":doc:`prim-family`" + msgid "categories" msgstr "" @@ -3135,12 +3274,6 @@ msgstr ":doc:`pgr_dagShortestPath`" msgid ":doc:`pgr_edwardMoore`" msgstr ":doc:`pgr_edwardMoore`" -msgid "Planar Family" -msgstr "" - -msgid ":doc:`pgr_isPlanar`" -msgstr ":doc:`pgr_isPlanar`" - msgid "Miscellaneous Algorithms" msgstr "" @@ -3153,9 +3286,6 @@ msgstr ":doc:`pgr_stoerWagner`" msgid ":doc:`pgr_transitiveClosure`" msgstr ":doc:`pgr_transitiveClosure`" -msgid ":doc:`pgr_hawickCircuits`" -msgstr ":doc:`pgr_hawickCircuits`" - msgid "Flow - Family of functions" msgstr "" @@ -3545,7 +3675,85 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" msgstr "" -msgid "Code enhancements" +msgid "4.1.0 Build" +msgstr "" + +#, fuzzy +msgid "PostgreSQL:" +msgstr "``postgreSQL``" + +msgid "Minimum requirement: 14" +msgstr "" + +msgid "Boost library:" +msgstr "" + +msgid "Minimum requirement: 1.74" +msgstr "" + +msgid "cmake:" +msgstr "" + +msgid "Minimum requirement: 3.22" +msgstr "" + +msgid "4.1.0 Summary of changes by function" +msgstr "" + +#, fuzzy +msgid "pgr_coreNumbers" +msgstr "pgr_nodeNetwork" + +msgid "New experimental function." +msgstr "" + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" + +msgid "Fix the way it builds the graph" +msgstr "" + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + +msgid "New optional parameters: ``min_depth``, ``max_depth``, ``self_loops`` and ``u_turn_on_edge``." +msgstr "" + +msgid "New signatures to select starting vertices." +msgstr "" + +msgid "Deprecated signature: ``pgr_hawickCircuits(text)``." +msgstr "" + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar" +msgstr "pgr_makeConnected" + +#, fuzzy +msgid "pgr_maxWeightedMatch" +msgstr "pgr_maxCardinalityMatch" + +#, fuzzy +msgid "pgr_planarFaces" +msgstr "pgr_isPlanar" + +#, fuzzy +msgid "4.1.0 New experimental functions." +msgstr ":doc:`routingFunctions`" + +msgid "`#3136 `__: pgr_maxWeightedMatch" +msgstr "" + +msgid "`#3140 `__: pgr_makeBiconnectedPlanar" +msgstr "" + +msgid "`#3142 `__: pgr_coreNumbers" +msgstr "" + +msgid "`#3143 `__: pgr_planarFaces" +msgstr "" + +msgid "4.1.0 Code enhancements" msgstr "" msgid "`#3049 `__: Use enumeration on drivers and process." @@ -3581,19 +3789,31 @@ msgstr "" msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "" -msgid "Bug Fixes" +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" msgstr "" -msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" +msgid "`#3131 `__: binaryBreadthFirstSearch: Integrate into existing process/driver pair" msgstr "" -msgid "Summary of changes by function" +msgid "`#3154 `__: betweennessCentrality: use allpairs/process and driver" msgstr "" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +msgid "`#3163 `__: KSP & KSP WithPoints Use ShortestPath driver files" +msgstr "" -msgid "Fix the way it builds the graph" +msgid "`#3170 `__: pgr_hawickCircuits: wrong Boost function referenced" +msgstr "" + +msgid "4.1.0 Bug Fixes" +msgstr "" + +msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" +msgstr "" + +msgid "4.1.0 Requirements" +msgstr "" + +msgid "`#3120 `__: Up min requirements: Boost to 1.74 Postgres to 14 cmake to 3.22." msgstr "" msgid "All releases" @@ -5950,9 +6170,6 @@ msgstr ":doc:`pgr_withPoints`" msgid "Returns set of |generic-result|" msgstr "" -msgid "``path_id``" -msgstr "``path_id``" - msgid "Path identifier." msgstr "" @@ -6104,24 +6321,21 @@ msgstr "컴파일 종속성" msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "pgRouting을 컴파일 하기 위해, 다음 종속성이 충족되는지 확인하세요:" -msgid "C and C++0x compilers" -msgstr "C 와 C++0x 컴파일러" - -msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgid "C++ standard" msgstr "" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "C++17" msgstr "" -msgid "Postgresql version >= 13" +msgid "Postgresql version >= 14" msgstr "" #, fuzzy -msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgid "The Boost Graph Library (BGL) >= 1.74.0" msgstr "The Boost Graph Library (BGL). Version >= 1.56" #, fuzzy -msgid "CMake >= 3.12" +msgid "CMake >= 3.22" msgstr "CMake >= 3.2" msgid "For user's documentation" @@ -6383,7 +6597,7 @@ msgstr "" msgid "Individuals (in alphabetical order)" 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, 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 "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, Mayur Galhate, 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 "Corporate Sponsors (in alphabetical order)" @@ -7119,9 +7333,6 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -msgid "New experimental function." -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 "" @@ -7867,9 +8078,6 @@ msgstr "" msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "" -msgid "Sequential value starting from ``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." msgstr "" @@ -8298,9 +8506,6 @@ msgstr "" msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." msgstr "" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "" - msgid "**Empty**" msgstr "" @@ -8779,119 +8984,434 @@ msgstr "" msgid "Create the contracted graph." msgstr "" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "" - -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" -msgstr "" +#, fuzzy +msgid "``pgr_coreNumbers`` - Experimental" +msgstr ":doc:`pgr_stoerWagner`" -msgid "Version 3.4.0" +msgid "``pgr_coreNumbers`` - Computes the core number of each vertex in an undirected graph using k-core decomposition." 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." -msgstr "" +#, fuzzy +msgid "Version 4.1.0" +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 "The **core number** of a vertex is the largest value :math:`k` such that the vertex **belongs to the** :math:`k`-core of the graph." msgstr "" -msgid "The implementation is for **undirected** graphs." +msgid "The :math:`k`-core of a graph is the maximal subgraph in which every vertex has degree at least :math:`k` within that subgraph. K-core decomposition iteratively removes vertices of degree less than :math:`k` until no such vertices remain, increasing :math:`k` at each stage. The process assigns one core number to every vertex." msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "The core number says how deeply a vertex sits inside the graph:" msgstr "" -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgid "Core :math:`1` vertices are peeled in the first step. They are terminal nodes of the peeled graph, adjacent to at most one other vertex in the induced subgraph." msgstr "" -msgid "where :math:`|V|` is the number of vertices," +msgid "Core :math:`2` vertices survive that step. They lie on cycles, or on the chains joining them." msgstr "" -msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgid "Core :math:`3` and above mark dense regions where every vertex keeps three or more neighbors however much of the graph is peeled away." msgstr "" -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgid "Parallel edges between the same pair of vertices are collapsed into a single edge before the peeling starts, so edge multiplicity does not inflate core numbers." msgstr "" -msgid "Returns set of |result_node_order|" +msgid "Three parallel edges between two vertices give both vertices core :math:`1`, the same as a single edge." msgstr "" -msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgid "Self loop: a vertex is not a neighbor of its own vertex, so it is dropped before peeling and does not contribute to that vertex's degree." msgstr "" -msgid "Returns set of ``(seq, node)``" +msgid "A vertex whose only edge is a self loop has no real neighbors left, So the core number is 0." msgstr "" -msgid "Sequence of the order starting from 1." +msgid "Loops and parallel edges are removed." msgstr "" -msgid "New ordering in reverse order." +msgid "All vertices are kept" msgstr "" -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "" +#, fuzzy +msgid "Costs are ignored" +msgstr ":math:`0` 값은 무시됩니다" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgid "Each vertex receives exactly one core number" msgstr "" #, fuzzy -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr ":doc:`pgr_dagShortestPath`" +msgid "Results:" +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 "Number of returned rows: :math:`|V|`." msgstr "" -msgid "pgr_dagShortestPath(Combinations)" +msgid "Ordered by ``node`` ascending." 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 "No rows returned when no edges found. Emits a ``NOTICE``" msgstr "" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgid "Running time: :math:`O(|E| + |E| + |V| log |V|)`" 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 "Loop and parallel removal: :math:`O(|E|)`" msgstr "" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgid "Peeling algorithm: :math:`O(|E|)`" msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgid "Sorting: :math:`|V| log |V|`" msgstr "" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgid "pgr_coreNumbers(`Edges SQL`_)" msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgid "Returns set of ``(seq, node, core)``" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgid "Core numbers on a subgraph of :doc:`sampledata`" msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgid "Vertices are colored by core number in the diagrams below: ``deepskyblue`` for core :math:`1` and ``green`` for core :math:`2`." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgid "All returned vertices have core number :math:`1`; they belong to the 1-core but not to any higher core." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgid "Vertices :math:`6`, :math:`7`, and :math:`10` have higher degree here, but peeling degree-:math:`1` vertices first removes the entire subgraph before a 2-core can form." msgstr "" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgid "The following diagram shows edges :math:`\\{1, \\ldots, 7\\}` from :doc:`sampledata`; every vertex label shows ``node (core)``." msgstr "" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgid "The next subgraph uses edges :math:`\\{1, 2, 3, 4\\}`, the same set as the main example of :doc:`pgr_betweennessCentrality`. Every vertex is still core :math:`1` because the structure is a tree-like path with terminal nodes at :math:`5` and :math:`15`." msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgid "K-core peeling (illustration)" msgstr "" -msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgid "On edges :math:`id < 10`, vertices :math:`5` and :math:`15` are removed first because they have degree :math:`1`. After further peeling, vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` remain as the 2-core (shown in green below)." msgstr "" -#, fuzzy +msgid "Sequential value starting from 1." +msgstr "" + +#, fuzzy +msgid "``core``" +msgstr "``color``" + +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "" + +msgid "The examples of this section are based on the :doc:`sampledata` network." +msgstr "" + +msgid "Sample network overview" +msgstr "" + +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." +msgstr "" + +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" +msgstr "" + +msgid "Both functions use the same ``Edges SQL`` format. The betweenness example on edges :math:`\\{1, 2, 3, 4\\}` measures shortest-path influence; core numbers measure peeling resilience." +msgstr "" + +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" +msgstr "" + +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." +msgstr "" + +msgid "Vertex :math:`6` has degree :math:`3` in this subgraph but still has core :math:`1`, because removing :math:`5` and :math:`15` first leaves no subgraph where every vertex has degree at least :math:`2`." +msgstr "" + +msgid "Compare with :doc:`pgr_betweennessCentrality` on the same edges: vertex :math:`6` has the highest betweenness, but core number does not rank vertices by path importance." +msgstr "" + +msgid "Subgraph with core-:math:`2` vertices" +msgstr "" + +msgid "Adding edges :math:`5` through :math:`9` connects the inner vertices into a 2-core. The undirected layout below shows the same network." +msgstr "" + +msgid "Undirected view of the sample network" +msgstr "" + +msgid "2) Core numbers on edges :math:`id < 10`" +msgstr "" + +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." +msgstr "" + +msgid "Vertices :math:`1`, :math:`3`, :math:`5`, :math:`15`, and :math:`16` are attached by tree-like branches and remain core :math:`1`." +msgstr "" + +msgid "Edge :math:`8` (between :math:`7` and :math:`11`) closes a cycle with edges :math:`4`, :math:`2`, and :math:`5`, which is why the inner four vertices survive peeling." +msgstr "" + +msgid "Filtering results in SQL" +msgstr "" + +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." +msgstr "" + +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" +msgstr "" + +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." +msgstr "" + +msgid "Use it to export only the hub vertices for further analysis." +msgstr "" + +msgid "Full sample graph" +msgstr "" + +msgid "4) Core numbers on all edges" +msgstr "" + +msgid "The full network has :math:`17` vertices and maximum core number :math:`2`." +msgstr "" + +msgid "Terminal branches (vertices :math:`1`, :math:`2`, :math:`3`, :math:`4`, :math:`5`, :math:`9`, :math:`13`, :math:`14`) remain core :math:`1`." +msgstr "" + +msgid "The 2-core is vertices :math:`6`, :math:`7`, :math:`8`, :math:`10`, :math:`11`, :math:`12`, :math:`15`, :math:`16` and :math:`17`: the central block of the city network. Vertex :math:`9` hangs off :math:`8` by edge :math:`14` alone, so it is peeled first and stays core :math:`1`." +msgstr "" + +msgid "Small graphs" +msgstr "" + +msgid "5) Single edge (two terminal nodes)" +msgstr "" + +msgid "Both endpoints have core number :math:`1`." +msgstr "" + +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." +msgstr "" + +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." +msgstr "" + +msgid "6) Triangle (all vertices core :math:`2`)" +msgstr "" + +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." +msgstr "" + +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." +msgstr "" + +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." +msgstr "" + +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" +msgstr "" + +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." +msgstr "" + +msgid "This is the 2-core heart of example 2) before branches are attached." +msgstr "" + +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." +msgstr "" + +msgid "8) Star graph (hub and spokes, all core :math:`1`)" +msgstr "" + +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." +msgstr "" + +msgid "The hub has degree :math:`4`, but removing the four leaves leaves an isolated vertex, so the hub never belongs to a 2-core." +msgstr "" + +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." +msgstr "" + +msgid "Empty edge set" +msgstr "" + +msgid "9) No edges in the SQL query" +msgstr "" + +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." +msgstr "" + +msgid "No exception is raised." +msgstr "" + +msgid "Core numbers and planarity" +msgstr "" + +msgid "Vertices with higher core numbers often lie in densely connected regions. The workflow below computes core numbers, filters the 2-core, and checks whether the subgraph can be drawn without edge crossings using :doc:`pgr_isPlanar`." +msgstr "" + +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" +msgstr "" + +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" +msgstr "" + +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." +msgstr "" + +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." +msgstr "" + +msgid "Planarity and core number measure different properties: a graph can be planar while still having a mix of core-:math:`1` and core-:math:`2` vertices." +msgstr "" + +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" +msgstr "" + +msgid "The examples above reach at most core :math:`2`, because the :doc:`sampledata` network has degeneracy :math:`2`. Higher cores need a denser graph. In the complete graph :math:`K_4` every vertex is adjacent to the other three, so no vertex can ever be peeled at :math:`k \\leq 3` and the whole graph is its own 3-core." +msgstr "" + +msgid "Every vertex has degree :math:`3`, so nothing is removed while peeling at :math:`k = 1`, :math:`2` or :math:`3`: all four vertices have core :math:`3`." +msgstr "" + +msgid "In general the complete graph :math:`K_n` has core number :math:`n - 1` for every vertex, which is the maximum possible core number on :math:`n` vertices." +msgstr "" + +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." +msgstr "" + +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" +msgstr "" + +msgid "`Wikipedia: Degeneracy (graph theory) `__" +msgstr "" + +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "" + +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "" + +msgid "Version 3.4.0" +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." +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." +msgstr "" + +msgid "The implementation is for **undirected** graphs." +msgstr "" + +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "" + +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "" + +msgid "where :math:`|V|` is the number of vertices," +msgstr "" + +msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgstr "" + +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "" + +msgid "Returns set of |result_node_order|" +msgstr "" + +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "" + +msgid "Returns set of ``(seq, node)``" +msgstr "" + +msgid "Sequence of the order starting from 1." +msgstr "" + +msgid "New ordering in reverse order." +msgstr "" + +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "" + +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "" + +#, fuzzy +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr ":doc:`pgr_dagShortestPath`" + +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_dagShortestPath(Combinations)" +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 "" + +#, fuzzy +msgid "This implementation can only be used with a directed graph with no cycles i.e. directed acyclic graph." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +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 "Process is valid for weighted directed acyclic graphs only." +msgstr "" + +msgid "Avoids one edge cycle: `reverse_cost` column is used when :math:`cost < 0`." +msgstr "" + +msgid "If the graph is not DAG, will throw a PostgreSQL `ERROR`." +msgstr "" + +msgid "The `agg_cost` the non included values `(v, v)` is `0`" +msgstr "" + +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgstr "" + +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "" + +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "" + +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgstr "" + +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "" + +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +msgstr "" + +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "" + +msgid "`reverse_cost` column is used when :math:`cost < 0` to avoid edge cycle." +msgstr "" + +#, fuzzy msgid "Return columns" msgstr "결과 컬럼" @@ -9207,9 +9727,6 @@ msgstr "" msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network." -msgstr "" - msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "" @@ -9669,6 +10186,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" +#, fuzzy +msgid "Version 4.0.2" +msgstr "짧은 버전" + +msgid "Fix: bad alloc" +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 "" @@ -9753,6 +10277,15 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + #, fuzzy msgid "pgr_drivingDistance(Single vertex)" msgstr ":doc:`pgr_drivingDistance`" @@ -9818,9 +10351,6 @@ msgstr "" msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" -msgid "end-before" -msgstr "" - msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" @@ -9830,10 +10360,6 @@ msgstr "" msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -#, fuzzy -msgid "Version 4.1.0" -msgstr "짧은 버전" - msgid "Output columns standardized to |result_edge_color|" msgstr "" @@ -10488,49 +11014,100 @@ msgstr ":doc:`pgr_hawickCircuits`" 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." +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Heath A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs." +msgstr "" + +msgid "Circuit enumeration in directed graphs, where circuits with parallel arcs are enumerated." +msgstr "" + +msgid "Each combination of parallel arcs is returned as a different circuit." +msgstr "" + +#, fuzzy +msgid "Works for directed graphs." +msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." + +msgid "The algorithm outputs the distinct circuits present in the graph." +msgstr "" + +msgid "The circuits are elementary: a vertex is not repeated within a circuit, except the starting vertex that closes the circuit." +msgstr "" + +msgid "When no initial vertices are given all circuits are in canonical order of the vertices insertion of the graph: A circuit with vertices ``u``, ``v``: ``u`` starting circuits containing ``v`` will not be listed on ``start_vid = v`` rows." +msgstr "" + +msgid "Different edge ordering gives different canonical ordering." +msgstr "" + +msgid "When start vertices are given, all circuits are returned for each requested vertex it contains, and the results are grouped by ``start_vid``." +msgstr "" + +msgid "The graph passed to the algorithm discard parallel edges with higher costs." +msgstr "" + +msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgstr "" + +msgid "where :math:`|V|` is the number of vertices in the graph." +msgstr "" + +msgid "where :math:`|c|` is the number of circuits in the graph." +msgstr "" + +msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgstr "" + +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vid** [, **options**])" 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_hawickCircuits(`Edges SQL`_, **start vids** [, **options**])" msgstr "" -msgid "The algorithm implementation works only for directed graph" +msgid "**options:** ``[min_depth, max_depth, self_loops, u_turn_on_edge]``" msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." +msgid "Returns set of |circuits-result|" msgstr "" -msgid "The algorithm outputs the distinct circuits present in the graph." +msgid "All circuits" msgstr "" -msgid "Time Complexity: :math:`O((V + E) (c + 1))`" +msgid "pgr_hawickCircuits(`Edges SQL`_ [, **options**])" msgstr "" -msgid ":math:`|c|` is the number of circuits in the graph." +msgid "All the circuits of the pgRouting :doc:`sampledata`" msgstr "" -msgid "pgr_hawickCircuits(`Edges SQL`_)" +msgid "When no starting vertex is given, all the circuits of the graph are returned. The result has 94 rows, one ``path_id`` for each circuit:" msgstr "" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +#, fuzzy +msgid "Single start vertex" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Circuits that contain vertex :math:`10`" msgstr "" -msgid "Id of the circuit starting from ``1``" +#, fuzzy +msgid "Many start vertices" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "Circuits that contain vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgid "The examples use the following table ``c_example``, that represent a cul_de_sac where the exit is on vertex :math:`5` and the vehicle is on vertex :math:`1` but pointing at the wrong direction of the exit." msgstr "" -msgid "Identifier of the starting vertex of the circuit." +msgid "All possible ways to return to vertex :math:`1`." msgstr "" -msgid "Identifier of the ending vertex of the circuit." +msgid "Exclude self loops." msgstr "" -msgid "Identifier of the node in the path from a vid to next vid." +msgid "Exclude self loops and U-turn on the same edge." msgstr "" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" msgid "``pgr_isPlanar`` - Experimental" @@ -11156,6 +11733,82 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "" +#, fuzzy +msgid "``pgr_makeBiconnectedPlanar`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" + +msgid "``pgr_makeBiconnectedPlanar`` — Returns the set of edges needed to make each connected component of a planar graph biconnected." +msgstr "" + +msgid "``pgr_makeBiconnectedPlanar`` identifies the missing edges that need to be added to each connected component of an existing planar graph to make those components biconnected, while ensuring the graph remains planar." +msgstr "" + +msgid "A graph is considered **biconnected** if it is connected and cannot be broken into disconnected pieces by deleting any single vertex (it has no articulation points). A planar graph is one that can be drawn in two-dimensional space with no two of its edges crossing." +msgstr "" + +msgid "If the graph is not connected it will treat each component as an idividual graph." +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_makeConnected` to connect all components." +msgstr ":doc:`pgr_contraction`" + +msgid "When the graph is not planar it will emit an ``ERROR``" +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first." +msgstr ":doc:`pgr_isPlanar`" + +msgid "All vertices are kept." +msgstr "" + +#, fuzzy +msgid "Costs are ignored." +msgstr ":math:`0` 값은 무시됩니다" + +msgid "Returns a list of all new edges needed to make biconected graphs out of each connected component." +msgstr "" + +msgid "Empty results when the graph is already biconnected planar." +msgstr "" + +msgid "Running time: :math:`O(|V| + |E| + R \\log R)` for each component" +msgstr "" + +msgid ":math:`R` is the number of returned edges." +msgstr "" + +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "" + +msgid "Returns set of |result-component-make|" +msgstr "" + +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "" + +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." +msgstr "" + +msgid "When a graph contains multiple disconnected components, each component is processed independently. Components (2,4) and (13,14) are already biconnected (0 articulation points) and require no new edges." +msgstr "" + +msgid "4-vertex path graph." +msgstr "" + +msgid "Create a 4-vertex tree graph." +msgstr "" + +msgid "Get the edges needed to have biconnected planar graph." +msgstr "" + +msgid "Adding the edges to the graph" +msgstr "" + +msgid "`Boost: make_biconnected_planar `__" +msgstr "" + msgid "``pgr_makeConnected`` - Experimental" msgstr "" @@ -11174,9 +11827,6 @@ msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "" -msgid "Returns set of |result-component-make|" -msgstr "" - msgid "List of edges that are needed to connect the graph." msgstr "" @@ -11387,6 +12037,44 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" +#, fuzzy +msgid "``pgr_maxWeightedMatch`` - Experimental" +msgstr ":doc:`pgr_dagShortestPath`" + +msgid "``pgr_maxWeightedMatch`` — Calculates a maximum weighted matching in a graph." +msgstr "" + +msgid "A **maximum weighted matching** in a graph is a matching where the sum of the weights of selected edges is maximized." +msgstr "" + +msgid "Each vertex is matched with at most one other vertex." +msgstr "" + +msgid "Maximizes the total edge weight sum." +msgstr "" + +msgid "There may be many maximum weighted matchings." +msgstr "" + +msgid "Calculates one possible maximum weighted matching in a graph." +msgstr "" + +msgid "Running time: :math:`O(V^3)`." +msgstr "" + +msgid "pgr_maxWeightedMatch(`Edges SQL`_)" +msgstr "" + +#, fuzzy +msgid "Set of |result-edge|" +msgstr ":doc:`pgr_withPoints`" + +msgid "Maximum weighted matching on a custom 5-vertex graph." +msgstr "" + +msgid "`Boost: maximum_weighted_matching `__" +msgstr "" + msgid "``pgr_pickDeliver`` - Experimental" msgstr "" @@ -11582,6 +12270,153 @@ msgstr "" msgid "This implementation's travel time: 854.54" msgstr "" +#, fuzzy +msgid "``pgr_planarFaces`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" + +msgid "``pgr_planarFaces`` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +msgid "In a planar embedding, the graph is drawn in the plane so that edges meet only at vertices. A face is a maximal connected region of the plane bounded by edges." +msgstr "" + +msgid "Every bounded face is a cycle of edges enclosing an interior region. The exterior face, also called the unbounded face, is the region outside the outermost cycle." +msgstr "" + +msgid "Once an embedding is fixed, each undirected edge has a left and a right side when walked in the direction the embedding assigns around each vertex." +msgstr "" + +msgid "In a connected planar undirected graph, each edge separates exactly two faces, so it contributes one row on the left and one on the right." +msgstr "" + +msgid "``pgr_planarFaces`` returns those incidences: ``face_id`` names the face, ``edge_id`` is the border edge, and ``side`` is ``1`` (left) or ``2`` (right) relative to the embedding." +msgstr "" + +msgid "The function first computes a planar embedding with the Boyer-Myrvold planarity test, then walks faces with Boost ``planar_face_traversal``.i" +msgstr "" + +msgid "Loops and paralell edges are preserved." +msgstr "" + +msgid "They are used to determine the existance of an edge" +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first" +msgstr ":doc:`pgr_isPlanar`" + +msgid "The result has one row per edge-side pair" +msgstr "" + +msgid "Graph with :math:`|E|` edges yields :math:`2|E|` rows." +msgstr "" + +msgid "Number of faces: * Obeys Euler's formula: :math:`|V| - |E| + |F| = 2` * On a graph with :math:`C` components: :math:`|V| - |E| + |F| = 2C`." +msgstr "" + +msgid "Running time: :math:`O(|E| + |V|)`" +msgstr "" + +msgid "pgr_planarFaces(`Edges SQL`_)" +msgstr "" + +msgid "Returns set of ``(seq, face_id, edge_id, side)``" +msgstr "" + +msgid "Faces of the full :doc:`sampledata` graph" +msgstr "" + +msgid "The query returns **36 rows**, twice the **18** edges in ``edges``, consistent with :math:`2|E|`." +msgstr "" + +msgid "``face_id`` runs from **1** through **7** on this network; each id is one face of the embedding, including the unbounded **exterior face** (here ``face_id = 1`` borders the outer layout of the city block)." +msgstr "" + +msgid "Every ``edge_id`` appears **twice**, once with ``side = 1`` and once with ``side = 2``." +msgstr "" + +msgid "Rows follow the counterclockwise walk of each face in the computed embedding." +msgstr "" + +msgid "Have :math:`3` components then number if faces = :math:`17 - 18 + 7 = 6 = 2 \\times 3`." +msgstr "" + +#, fuzzy +msgid "``face_id``" +msgstr "``end_id``" + +msgid "Identifier of the face in the computed embedding." +msgstr "" + +msgid "Identifier of the edge that borders the face." +msgstr "" + +msgid "``1`` when the edge borders the face on the left side." +msgstr "" + +msgid "``2`` when the edge borders the face on the right side." +msgstr "" + +msgid "Non-planar graphs" +msgstr "" + +msgid "Face extraction requires a planar graph. Subgraphs containing a :math:`K_5` or :math:`K_{3,3}` minor cannot be embedded without crossings; ``pgr_planarFaces`` raises ``ERROR: Graph is not planar`` in that case. The :doc:`pgr_isPlanar` documentation shows a non-planar subgraph of ``sampledata`` (edges highlighted in blue in the figure)." +msgstr "" + +msgid "Create a :math:`K_5` graph." +msgstr "" + +msgid "Test planarity: dont execute when is not planar." +msgstr "" + +msgid "Or get an error: (not shown)" +msgstr "" + +msgid "Planarity of loops" +msgstr "" + +msgid "One loop graph with only one vertex:" +msgstr "" + +msgid "Two loop graph with only one vertex:" +msgstr "" + +msgid "Triangular graphs" +msgstr "" + +msgid "Triangular graph (no duplicate edges)" +msgstr "" + +msgid "Six rows are returned: :math:`2 \\times 3` edges." +msgstr "" + +msgid ":math:`face\\_id = 1` is the interior face." +msgstr "" + +msgid ":math:`face\\_id = 2` is the exterior face. face." +msgstr "" + +msgid "Each edge lists ``1`` on one face and ``2`` on the other." +msgstr "" + +msgid "Triangular graph (duplicate edges)" +msgstr "" + +msgid ":doc:`pgr_isPlanar`" +msgstr ":doc:`pgr_isPlanar`" + +msgid "Boost Graph Library: `Planar Face Traversal `__" +msgstr "" + +msgid "Boost Graph Library: `Boost: Boyer Myrvold planarity `__" +msgstr "" + +msgid "Wikipedia: `Planar graph `__" +msgstr "" + +msgid "Boyer, J. M. and Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity Algorithms by Edge Addition. Journal of Graph Algorithms and Applications, 8(3), 241-273." +msgstr "" + msgid "``pgr_prim``" msgstr "``pgr_prim``" @@ -12895,6 +13730,10 @@ 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 "" +#, fuzzy +msgid "Planar - Family of functions" +msgstr ":doc:`pgr_withPoints`" + msgid "Prim - Family of functions" msgstr "" @@ -12943,12 +13782,45 @@ msgstr "" msgid "pgRouting 4.0" msgstr "" +msgid "pgRouting 4.0.2 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "4.0.2 Bug Fixes" +msgstr "" + +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "" + +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "" + msgid "pgRouting 4.0.1 Release Notes" msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" msgstr "" +msgid "Bug Fixes" +msgstr "" + msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "" @@ -12958,6 +13830,9 @@ msgstr "" msgid "`#3010 `__: Performance issue with pgr_separateTouching()" msgstr "" +msgid "Code enhancements" +msgstr "" + msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" msgstr "" @@ -12989,7 +13864,7 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" -msgid "Build" +msgid "4.0.0 Build" msgstr "" msgid "C++ standard is std17" @@ -13067,6 +13942,9 @@ msgstr "" msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" +msgid "Summary of changes by function" +msgstr "" + msgid "pgr_aStar" msgstr "pgr_aStar" @@ -13127,9 +14005,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13198,15 +14073,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "" @@ -13946,6 +14815,9 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "" +msgid "Build" +msgstr "" + msgid "`#2713 `__: cmake missing some policies and min version" msgstr "" @@ -14341,9 +15213,6 @@ msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "" -msgid "pgr_hawickCircuits" -msgstr "pgr_hawickCircuits" - msgid "Flow functions" msgstr "" @@ -15065,9 +15934,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -16539,3 +17405,13 @@ msgstr "" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" + +#~ msgid ":doc:`pgr_hawickCircuits`" +#~ msgstr ":doc:`pgr_hawickCircuits`" + +#~ msgid "C and C++0x compilers" +#~ msgstr "C 와 C++0x 컴파일러" + +#, fuzzy +#~ msgid "Planar" +#~ msgstr "pgr_isPlanar" diff --git a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po index 2cc6d5a23e0..7a9e34262bb 100644 --- a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po @@ -2,13 +2,13 @@ # Copyright (C) pgRouting Contributors - Version v4.1 # This file is distributed under the same license as the pgRouting package. # Celia Virginia Vergara Castillo , 2025. -# Daniel Nylander , 2025. +# Daniel Nylander , 2025, 2026. msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" -"PO-Revision-Date: 2025-12-08 08:47+0000\n" +"POT-Creation-Date: 2026-10-24 01:29+0000\n" +"PO-Revision-Date: 2026-10-05 18:39+0000\n" "Last-Translator: Daniel Nylander \n" "Language-Team: Swedish \n" "Language: sv\n" @@ -16,7 +16,7 @@ msgstr "" "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" +"X-Generator: Weblate 5.16.2\n" msgid "BFS - Category" msgstr "BFS - Kategori" @@ -304,7 +304,7 @@ msgid "Documentation might need refinement." msgstr "Dokumentationen kan behöva förbättras." msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." -msgstr ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgstr ":doc:`pgr_depthFirstSearch` - Djupet först-genomgång av grafen." msgid "In general:" msgstr "I allmänhet:" @@ -313,10 +313,10 @@ msgid "K shortest paths - Category" msgstr "K kortaste vägarna - Kategori" msgid ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra" -msgstr ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra" +msgstr ":doc:`pgr_KSP` - Yens algoritm baserad på pgr_dijkstra" msgid ":doc:`pgr_withPointsKSP` - Yen's algorithm based on pgr_withPoints" -msgstr ":doc:`pgr_withPointsKSP` - Yen's algorithm based on pgr_withPoints" +msgstr ":doc:`pgr_withPointsKSP` - Yens algoritm baserad på pgr_withPoints" msgid "TRSP - Family of functions" msgstr "TRSP - Familj av funktioner" @@ -325,20 +325,26 @@ msgid "When points are also given as input:" msgstr "När punkt också ges som input:" msgid ":doc:`pgr_trsp` - Routing with restrictions." -msgstr ":doc:`pgr_trsp` - Routing with restrictions." +msgstr ":doc:`pgr_trsp` - Ruttplanering med begränsningar." msgid ":doc:`pgr_trspVia` - Via Vertices routing with restrictions." -msgstr ":doc:`pgr_trspVia` - Via Vertices routing with restrictions." +msgstr ":doc:`pgr_trspVia` - Ruttplanering via hörn med begränsningar." msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." -msgstr ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." +msgstr ":doc:`pgr_trsp_withPoints` - Ruttplanering via hörn/punkter med begränsningar." msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." -msgstr ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgstr ":doc:`pgr_trspVia_withPoints` - Ruttplanering via hörn/punkter med begränsningar." msgid "Experimental" msgstr "Experiment" +msgid "Possible server crash" +msgstr "Möjlig serverkrasch" + +msgid "These functions might create a server crash" +msgstr "Dessa funktioner kan orsaka en serverkrasch" + msgid "Experimental functions" msgstr "Experimentella funktioner" @@ -373,7 +379,7 @@ msgid "Might need a lot of feedback from the community." msgstr "Det kan behövas mycket feedback från samhället." msgid ":doc:`pgr_turnRestrictedPath` - Routing with restrictions." -msgstr ":doc:`pgr_turnRestrictedPath` - Routing with restrictions." +msgstr ":doc:`pgr_turnRestrictedPath` - Ruttplanering med begränsningar." msgid "Introduction" msgstr "Introduktion" @@ -412,7 +418,7 @@ msgid "On road networks, there are restrictions such as left or right turn restr msgstr "På vägnätet finns det begränsningar, till exempel begränsningar för vänster- eller högersväng, inga begränsningar för U-sväng." msgid "A restriction is a sequence of edges, called path and that path is to be avoided." -msgstr "En restriktion är en sekvens av kanter, som kallas väg, och den vägen ska undvikas." +msgstr "En restriktion är en sekvens av kanter som kallas väg och den vägen ska undvikas." msgid "**Restrictions on the road network**" msgstr "**Begränsningar av vägnätet**" @@ -445,10 +451,10 @@ msgid "Traveling Sales Person - Family of functions" msgstr "Resande säljare - Familj av funktioner" msgid ":doc:`pgr_TSP` - When input is given as matrix cell information." -msgstr ":doc:`pgr_TSP` - When input is given as matrix cell information." +msgstr ":doc:`pgr_TSP` - När indata anges som matriscellsinformation." msgid ":doc:`pgr_TSPeuclidean` - When input are coordinates." -msgstr ":doc:`pgr_TSPeuclidean` - When input are coordinates." +msgstr ":doc:`pgr_TSPeuclidean` - När indata är koordinater." msgid "Table of Contents" msgstr "Innehåll" @@ -583,16 +589,16 @@ msgid "Pickup and delivery problem" msgstr "Problem med upphämtning och leverans" msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" -msgstr ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" +msgstr ":doc:`pgr_pickDeliver` - Hämtning och leverans med en kostnadsmatris" msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" -msgstr ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgstr ":doc:`pgr_pickDeliverEuclidean` - Hämtning och leverans med euklidiska avstånd" msgid "Distribution problem" msgstr "Distributionsproblem" msgid ":doc:`pgr_vrpOneDepot` - From a single depot, distributes orders" -msgstr ":doc:`pgr_vrpOneDepot` - From a single depot, distributes orders" +msgstr ":doc:`pgr_vrpOneDepot` - Distribuerar beställningar från en enda depå" msgid "Contents" msgstr "Innehåll" @@ -634,7 +640,7 @@ msgid "Less wait time is better." msgstr "Kortare väntetid är bättre." msgid "Pick & Delivery" -msgstr "Pick & Delivery" +msgstr "Upphämtning och leverans" msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows" msgstr "Problem: `CVRPPDTW` Kapaciterade plock- och leveransfordons ruttproblem med tidsfönster" @@ -844,25 +850,25 @@ msgid "``p_x``" msgstr "``p_x``" msgid ":math:`x` value of the pick up location" -msgstr ":math:`x` value of the pick up location" +msgstr ":math:`x`-värde för upphämtningsplatsen" msgid "``p_y``" msgstr "``p_y``" msgid ":math:`y` value of the pick up location" -msgstr ":math:`y` value of the pick up location" +msgstr ":math:`y`-värde för upphämtningsplatsen" msgid "``d_x``" msgstr "``d_x``" msgid ":math:`x` value of the delivery location" -msgstr ":math:`x` value of the delivery location" +msgstr ":math:`x`-värde för leveransplatsen" msgid "``d_y``" msgstr "``d_y``" msgid ":math:`y` value of the delivery location" -msgstr ":math:`y` value of the delivery location" +msgstr ":math:`y`-värde för leveransplatsen" msgid "Vehicles SQL" msgstr "Fordon SQL" @@ -949,19 +955,19 @@ msgid "``start_x``" msgstr "``start_x``" msgid ":math:`x` value of the starting location" -msgstr ":math:`x` value of the starting location" +msgstr ":math:`x`-värde för startplatsen" msgid "``start_y``" msgstr "``start_y``" msgid ":math:`y` value of the starting location" -msgstr ":math:`y` value of the starting location" +msgstr ":math:`y`-värde för startplatsen" msgid "[``end_x``]" msgstr "[``end_x``]" msgid ":math:`x` value of the ending location" -msgstr ":math:`x` value of the ending location" +msgstr ":math:`x`-värde för slutplatsen" msgid "When missing: ``start_x`` is used." msgstr "När den saknas: ``start_x`` används." @@ -970,7 +976,7 @@ msgid "[``end_y``]" msgstr "[``end_y``]" msgid ":math:`y` value of the ending location" -msgstr ":math:`y` value of the ending location" +msgstr ":math:`y`-värde för slutplatsen" msgid "When missing: ``start_y`` is used." msgstr "När den saknas: ``start_y`` används." @@ -1042,19 +1048,19 @@ msgid "Kind of stop location the vehicle is at" msgstr "Typ av stopplats som fordonet befinner sig på" msgid ":math:`-1`: at the solution summary row" -msgstr ":math:`-1`: at the solution summary row" +msgstr ":math:`-1`: på sammanfattningsraden för lösningen" msgid ":math:`1`: Starting location" -msgstr ":math:`1`: Starting location" +msgstr ":math:`1`: Startposition" msgid ":math:`2`: Pickup location" -msgstr ":math:`2`: Pickup location" +msgstr ":math:`2`: Upphämtningsplats" msgid ":math:`3`: Delivery location" -msgstr ":math:`3`: Delivery location" +msgstr ":math:`3`: Leveransplats" msgid ":math:`6`: Ending location and indicates the vehicle's summary row" -msgstr ":math:`6`: Ending location and indicates the vehicle's summary row" +msgstr ":math:`6`: Slutplats och anger fordonets sammanfattningsrad" msgid "``order_id``" msgstr "``order_id``" @@ -1093,10 +1099,10 @@ msgid "Time spent waiting for current location to open." msgstr "Tidsåtgång för att vänta på att den aktuella platsen ska öppnas." msgid ":math:`-1`: at the solution summary row." -msgstr ":math:`-1`: at the solution summary row." +msgstr ":math:`-1`: på sammanfattningsraden för lösningen." msgid ":math:`0`: at the starting location." -msgstr ":math:`0`: at the starting location." +msgstr ":math:`0`: vid startplatsen." msgid "``wait_time``" msgstr "``wait_time``" @@ -1282,16 +1288,16 @@ msgid "time units" msgstr "tidsenheter" msgid "9:00 am" -msgstr "9:00" +msgstr "9.00" msgid "4:30 pm" -msgstr "16:30" +msgstr "16.30" msgid "10 min 30 secs" msgstr "10 min 30 sek" msgid "0:00 am" -msgstr "0:00 am" +msgstr "0.00" msgid "hours" msgstr "timmar" @@ -1468,13 +1474,13 @@ msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm msgstr "Algoritmen A* (uttalas \"A Star\") är baserad på Dijkstras algoritm med en heuristik som gör att den kan lösa de flesta problem med kortaste vägen genom att endast utvärdera en delmängd av den totala grafen." msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." -msgstr ":doc:`pgr_aStar` - A* algorithm for the shortest path." +msgstr ":doc:`pgr_aStar` - A*-algoritm för den kortaste vägen." msgid ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths." -msgstr ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths." +msgstr ":doc:`pgr_aStarCost` - Hämta den sammanlagda kostnaden för de kortaste vägarna." msgid ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." -msgstr ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." +msgstr ":doc:`pgr_aStarCostMatrix` - Hämta kostnadsmatrisen för de kortaste vägarna." msgid "The main Characteristics are:" msgstr "De viktigaste egenskaperna är:" @@ -1621,10 +1627,10 @@ msgid "The following functions work on all vertices pair combinations" msgstr "Följande funktioner fungerar på alla kombinationer av toppar och par" msgid ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm." -msgstr ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm." +msgstr ":doc:`pgr_floydWarshall` - Floyd–Warshalls algoritm." msgid ":doc:`pgr_johnson` - Johnson's algorithm" -msgstr ":doc:`pgr_johnson` - Johnson's algorithm" +msgstr ":doc:`pgr_johnson` - Johnsons algoritm" msgid "The main characteristics are:" msgstr "De viktigaste egenskaperna är:" @@ -2368,16 +2374,16 @@ msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* msgstr "Den dubbelriktade algoritmen A* (uttalas \"A Star\") är baserad på A*-algoritmen." msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." -msgstr ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." +msgstr ":doc:`pgr_bdAstar` - Dubbelriktad A*-algoritm för att hitta vägar." msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." -msgstr ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." +msgstr ":doc:`pgr_bdAstarCost` - Dubbelriktad A*-algoritm för att beräkna vägars kostnad." msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." -msgstr ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." +msgstr ":doc:`pgr_bdAstarCostMatrix` - Dubbelriktad A*-algoritm för att beräkna en kostnadsmatris för vägar." msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph." -msgstr "Baserat på A*-algoritmen hittar den dubbelriktade sökningen den kortaste vägen från ett startvertex (``start_vid``) till ett slutvertex (``end_vid``). Den kör två samtidiga sökningar: en framåt från ``start_vid`` och en bakåt från ``slut_vid``, och stannar när de två möts i mitten. Den här implementationen kan användas med en riktad graf och en oriktad graf." +msgstr "Med A*-algoritmen hittar den dubbelriktade sökningen den kortaste vägen från en starthörnpunkt (``start_vid``) till en sluthornpunkt (``end_vid``). Den kör två samtidiga sökningar: en framåt från ``start_vid`` och en bakåt från ``end_vid`` och stannar när de två möts i mitten. Den här implementationen kan användas med en riktad graf och en oriktad graf." msgid "For large graphs where there is a path between the starting vertex and ending vertex:" msgstr "För stora grafer där det finns en väg mellan start- och slutvertexen:" @@ -2392,13 +2398,13 @@ msgid "Bidirectional Dijkstra - Family of functions" msgstr "Dubbelriktad Dijkstra - Familj av funktioner" msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." -msgstr ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." +msgstr ":doc:`pgr_bdDijkstra` - Dubbelriktad Dijkstra-algoritm för de kortaste vägarna." msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" -msgstr ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" +msgstr ":doc:`pgr_bdDijkstraCost` - Dubbelriktad Dijkstra för att beräkna kostnaden för de kortaste vägarna" msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." -msgstr ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." +msgstr ":doc:`pgr_bdDijkstraCostMatrix` - Dubbelriktad Dijkstra-algoritm för att skapa en matris med kostnader för de kortaste vägarna." msgid "Synopsis" msgstr "Sammanfattning" @@ -2407,7 +2413,7 @@ msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest msgstr "Baserat på Dijkstras algoritm hittar den dubbelriktade sökningen den kortaste vägen från en startpunkt till en slutpunkt." msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle." -msgstr "Den kör två samtidiga sökningar: en framåt från källan och en bakåt från målet, och stannar när de två möts i mitten." +msgstr "Den kör två samtidiga sökningar: en framåt från källan och en bakåt från målet och stannar när de två möts i mitten." msgid "This implementation can be used with a directed graph and an undirected graph." msgstr "Denna implementation kan användas med en riktad graf och en oriktad graf." @@ -2469,17 +2475,136 @@ msgstr "Grafen måste vara ansluten." msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "En Edges SQL som representerar en **riktad** graf med följande kolumner" +#, fuzzy +msgid "Circuits - Family of Functions" +msgstr "Prim - Familj av funktioner" + +#, fuzzy +msgid "The following functions work on circuits of directed graphs." +msgstr "Denna funktion är avsedd för **riktade** grafer." + +#, fuzzy +msgid ":doc:`pgr_hawickCircuits` - Hawick's circuits algorithm." +msgstr "``pgr_hawickCircuits`` - Returnerar listan över kretsar som använder Hawick-kretsalgoritmen." + +#, fuzzy +msgid "``start vid``" +msgstr "``start_vid``" + +msgid "A vertex of the circuits: - All the circuits that contain the vertex are returned. - When ``0`` all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``start vids``" +msgstr "``start_vid``" + +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` |ANY-INTEGER| ``]`` ``" + +msgid "Vertices of the circuits: for each requested vertex: - All the circuits that contain the vertex are returned: - When empty all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``min_depth``" +msgstr "``max_depth``" + +msgid "Minimum number of vertices in a circuit. * Exclude 2 edge circuits by increasing this number." +msgstr "" + +#, fuzzy +msgid "``9223372036854775807``" +msgstr ":math:`9223372036854775807`" + +#, fuzzy +msgid "Maximum number of vertices in a circuit." +msgstr "är antalet kanter som anges som indata." + +msgid "``self_loops``" +msgstr "" + +#, fuzzy +msgid "When ``true`` self loops are included in the results." +msgstr "När ``true`` visas kommer resultaten att inkludera de punkter som ligger i banan." + +#, fuzzy +msgid "When ``false`` self loops are excluded from the results." +msgstr "När ``falska`` beräkningar utförs." + +msgid "Self loops are included or excluded regardless of ``min_depth`` and ``max_depth``." +msgstr "" + +#, fuzzy +msgid "``u_turn_on_edge``" +msgstr "``U_turn_on_edge``" + +msgid "A u-turn on an edge is a 2 edge circuit that uses the same ``id`` on both directions of the edge." +msgstr "" + +#, fuzzy +msgid "When ``true``: u-turns are part of the results." +msgstr "När ``true`` returnerar endast sökvägar som inte bryter mot begränsningar" + +msgid "When ``false``: u-turns are discarded when the circuit can be formed with two different edges; a u-turn is kept when it is the only option, that is, when the two vertices are connected by a single edge." +msgstr "" + +msgid "Self loops are not affected." +msgstr "" + +msgid "Sequential value starting from ``1``" +msgstr "Sekventiellt värde med början från ``1``" + +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Id of the circuit starting from ``1``" +msgstr "Id för kretsen med början från ``1``" + +#, fuzzy +msgid "Relative position in the circuit. Has value **0** for the beginning of a circuit" +msgstr "Relativ position i tågläget. Har värdet **1** för början av ett tågläge." + +msgid "Identifier of the starting vertex of the circuit." +msgstr "Identifierare av kretsens startvertex." + +msgid "Identifier of the ending vertex of the circuit." +msgstr "Identifierare för kretsens slutpunkt." + +msgid "``pred``" +msgstr "``pred``" + +#, fuzzy +msgid "Identifier of the node that precedes ``node`` in the circuit." +msgstr "Identifierare av kretsens startvertex." + +#, fuzzy +msgid "When ``node`` is the first node of the circuit, it has the same value as ``node``." +msgstr "När ``node`` = ``start_vid`` så har värdet ``node``." + +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." + +#, fuzzy +msgid "Identifier of the edge used to arrive from ``pred`` to ``node``. - ``-1`` when :math:`depth = 0`." +msgstr "Identifierare av den ``edge`` som används för att komma från ``pred`` till ``node``." + +#, fuzzy +msgid "Cost to traverse from ``pred`` to ``node`` using ``edge``. - ``0`` when :math:`depth = 0`." +msgstr "Kostnad för att gå från ``nod`` med hjälp av ``edge`` till nästa nod i vägsekvensen." + +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost: Hawick Circuit Algorithm `__" + msgid "Coloring - Family of functions" msgstr "Färgläggning - Familj av funktioner" msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." -msgstr ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." +msgstr ":doc:`pgr_sequentialVertexColoring` - Algoritm för hörnfärgning med girig metod." msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." -msgstr ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." +msgstr ":doc:`pgr_bipartite` - Algoritm för bipartita grafer med DFS-baserad färgning." msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." -msgstr ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgstr ":doc:`pgr_edgeColoring` - Algoritm för kantfärgning med Vizings sats." msgid "Returns set of |result_edge_color|" msgstr "Returnerar uppsättning av |result_edge_color|" @@ -2509,22 +2634,22 @@ msgid "Components - Family of functions" msgstr "Komponenter - Familj av funktioner" msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." -msgstr ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgstr ":doc:`pgr_connectedComponents` - Sammanhängande komponenter i en oriktad graf." msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." -msgstr ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." +msgstr ":doc:`pgr_strongComponents` - Starkt sammanhängande komponenter i en riktad graf." msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." -msgstr ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." +msgstr ":doc:`pgr_biconnectedComponents` - Bikonnekterade komponenter i en oriktad graf." msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." -msgstr ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgstr ":doc:`pgr_articulationPoints` - Artikulationspunkter i en oriktad graf." msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." -msgstr ":doc:`pgr_bridges` - Bridges of an undirected graph." +msgstr ":doc:`pgr_bridges` - Broar i en oriktad graf." msgid ":doc:`pgr_makeConnected` - Details of edges to make graph connected." -msgstr ":doc:`pgr_makeConnected` - Details of edges to make graph connected." +msgstr ":doc:`pgr_makeConnected` - Information om kanter för att göra grafen sammanhängande." msgid "Contraction - Family of functions" msgstr "Sammandragning - Familj av funktioner" @@ -2776,28 +2901,28 @@ msgid "Dijkstra - Family of functions" msgstr "Dijkstra - Familj av funktioner" msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -msgstr ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." +msgstr ":doc:`pgr_dijkstra` - Dijkstras algoritm för de kortaste vägarna." msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." -msgstr ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." +msgstr ":doc:`pgr_dijkstraCost` - Hämta den sammanlagda kostnaden för de kortaste vägarna." msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgstr ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgstr ":doc:`pgr_dijkstraCostMatrix` - Använd pgr_dijkstra för att skapa en kostnadsmatris." msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." -msgstr ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." +msgstr ":doc:`pgr_drivingDistance` - Använd pgr_dijkstra för att beräkna avrinningsområdesinformation." msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." -msgstr ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." +msgstr ":doc:`pgr_KSP` - Använd Yens algoritm med pgr_dijkstra för att få de K kortaste vägarna." msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." -msgstr ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." +msgstr ":doc:`pgr_dijkstraVia` - Hämta en rutt genom en följd av hörn." msgid ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex." -msgstr ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex." +msgstr ":doc:`pgr_dijkstraNear` - Hämta rutten till närmaste hörn." msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." -msgstr ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." +msgstr ":doc:`pgr_dijkstraNearCost` - Hämta kostnaden till närmaste hörn." msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph." msgstr "Dijkstras algoritm, skapad av den holländske datavetaren Edsger Dijkstra 1956. Det är en algoritm för grafsökning som löser problemet med kortaste vägen för en graf med icke-negativa kantvägskostnader, vilket ger en kortaste väg från ett startvertex till ett slutvertex. Den här implementationen kan användas med en riktad graf och en oriktad graf." @@ -2950,13 +3075,13 @@ msgid "In other words: The algorithm returns a the shortest path between :math:` msgstr "Eller med andra ord Algoritmen returnerar den kortaste vägen mellan :math:`start_{vid}` och :math:`slut_{vid}`, om den finns, i form av en sekvens av noder och kanter," msgid ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`." -msgstr ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`." +msgstr ":math:`path\\_seq` anger den relativa positionen i vägen för :math:`node` eller :math:`edge`." msgid ":math:`cost` is the cost of the edge to be used to go to the next node." -msgstr ":math:`cost` is the cost of the edge to be used to go to the next node." +msgstr ":math:`cost` är kostnaden för den kant som används för att gå till nästa nod." msgid ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." -msgstr ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgstr ":math:`agg\\_cost` är kostnaden från :math:`start_{vid}` till noden." msgid "If there is no path, the resulting set is empty." msgstr "Om det inte finns någon väg är den resulterande uppsättningen tom." @@ -2965,16 +3090,16 @@ msgid "Driving Distance - Category" msgstr "Köravstånd - Kategori" msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" -msgstr ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgstr ":doc:`pgr_drivingDistance` - Köravstånd baserat på Dijkstras algoritm" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" -msgstr ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" +msgstr ":doc:`pgr_primDD` - Köravstånd baserat på Prims algoritm" msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" -msgstr ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" +msgstr ":doc:`pgr_kruskalDD` - Köravstånd baserat på Kruskals algoritm" msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" -msgstr ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" +msgstr ":doc:`pgr_withPointsDD` - Köravstånd baserat på pgr_withPoints" msgid "Calculate nodes that are within a distance." msgstr "Beräkna noder som ligger inom ett visst avstånd." @@ -3021,9 +3146,6 @@ msgstr "Returnerar uppsättning av |result-spantree|" msgid ":math:`depth-1` is the depth of ``pred``" msgstr ":math:`depth-1` is the depth of ``pred``" -msgid "``pred``" -msgstr "``pred``" - msgid "Predecessor of ``node``." msgstr "Föregångare till ``node``." @@ -3043,10 +3165,13 @@ msgid ":doc:`flow-family`" msgstr ":doc:`flow-family`" msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." -msgstr ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." +msgstr ":doc:`pgr_maxFlowMinCost` - Information om flöde och kostnad på kanter." msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." -msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." +msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Endast beräkning av lägsta kostnad." + +msgid ":doc:`pgr_maxWeightedMatch` - Calculates a maximum weighted matching in a graph." +msgstr ":doc:`pgr_maxWeightedMatch` – Beräknar en maximal viktad matchning i en graf." msgid ":doc:`chinesePostmanProblem-family`" msgstr ":doc:`chinesePostmanProblem-family`" @@ -3061,16 +3186,16 @@ msgid ":doc:`transformation-family`" msgstr ":doc:`transformation-family`" msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." -msgstr ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." +msgstr ":doc:`pgr_lineGraphFull` - Omvandlingsalgoritm som skapar en linjegraf av varje hörn i indatagrafen." msgid ":doc:`traversal-family`" msgstr ":doc:`traversal-family`" msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." -msgstr ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgstr ":doc:`pgr_breadthFirstSearch` - Bredden först-genomgång av grafen." msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." -msgstr ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." +msgstr ":doc:`pgr_binaryBreadthFirstSearch` - Bredden först-genomgång av grafen." msgid ":doc:`components-family`" msgstr ":doc:`components-family`" @@ -3079,10 +3204,10 @@ msgid ":doc:`ordering-family`" msgstr ":doc:`ordering-family`" msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." -msgstr ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." +msgstr ":doc:`pgr_cuthillMckeeOrdering` - Returnera omvänd Cuthill–McKee-ordning för en oriktad graf." msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." -msgstr ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." +msgstr ":doc:`pgr_topologicalSort` - Linjär ordning av hörnen i en riktad acyklisk graf." msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." msgstr ":doc:`pgr_sloanOrdering` - Returnerar sloan-ordningen för en odränerad graf." @@ -3094,14 +3219,33 @@ msgid ":doc:`metrics-family`" msgstr ":doc:`metrics-family`" msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" -msgstr ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" +msgstr ":doc:`pgr_betweennessCentrality` - Beräknar relativ mellanknutscentralitet med Brandes algoritm" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr ":doc:`pgr_bandwidth` - Beräknar bandbredden för en graf." +msgid ":doc:`pgr_coreNumbers` - Computes the core number of each vertex." +msgstr ":doc:`pgr_coreNumbers` – Beräknar kärntalet för varje hörnpunkt." + msgid ":doc:`TRSP-family`" msgstr ":doc:`TRSP-family`" +msgid ":doc:`planar-family`" +msgstr ":doc:`planar-family`" + +msgid ":doc:`pgr_isPlanar` - Returns a boolean depending upon the planarity of the graph." +msgstr ":doc:`pgr_isPlanar` – Returnerar ett booleskt värde beroende på om grafen är plan." + +msgid ":doc:`pgr_makeBiconnectedPlanar` - Returns edges to add to a planar graph to make each connected component biconnected." +msgstr ":doc:`pgr_makeBiconnectedPlanar` – Returnerar kanter som kan läggas till i en plan graf för att göra varje sammanhängande komponent tvåhörnssammanhängande." + +msgid ":doc:`pgr_planarFaces` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr ":doc:`pgr_planarFaces` – Identifierar ytorna i en plan inbäddning och listar varje incidens mellan kant och yta för en oriktad graf." + +#, fuzzy +msgid ":doc:`circuits-family`" +msgstr ":doc:`utilities-family`" + msgid "categories" msgstr "kategorier" @@ -3120,12 +3264,6 @@ msgstr ":doc:`pgr_dagShortestPath`" msgid ":doc:`pgr_edwardMoore`" msgstr ":doc:`pgr_edwardMoore`" -msgid "Planar Family" -msgstr "Planar familj" - -msgid ":doc:`pgr_isPlanar`" -msgstr ":doc:`pgr_isPlanar`" - msgid "Miscellaneous Algorithms" msgstr "Diverse algoritmer" @@ -3138,32 +3276,29 @@ msgstr ":doc:`pgr_stoerWagner`" msgid ":doc:`pgr_transitiveClosure`" msgstr ":doc:`pgr_transitiveClosure`" -msgid ":doc:`pgr_hawickCircuits`" -msgstr ":doc:`pgr_hawickCircuits`" - msgid "Flow - Family of functions" msgstr "Flow - Familj av funktioner" msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." -msgstr ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." +msgstr ":doc:`pgr_maxFlow` - Endast beräkningen av maximalt flöde med push-relabel-algoritmen." msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." -msgstr ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." +msgstr ":doc:`pgr_boykovKolmogorov` - Boykov och Kolmogorov med detaljer om flödet på kanter." msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." -msgstr ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." +msgstr ":doc:`pgr_edmondsKarp` - Edmonds-Karps algoritm med detaljer om flödet på kanter." msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." -msgstr ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." +msgstr ":doc:`pgr_pushRelabel` - Push-relabel-algoritmen med detaljer om flödet på kanter." msgid "Applications" msgstr "Ansökningar" msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." -msgstr ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." +msgstr ":doc:`pgr_edgeDisjointPaths` - Beräknar kantdisjunkta vägar mellan två grupper av hörn." msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." -msgstr ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." +msgstr ":doc:`pgr_maxCardinalityMatch` - Beräknar en matchning med maximal kardinalitet i en graf." msgid "Flow Functions General Information" msgstr "Flödesfunktioner Allmän information" @@ -3208,7 +3343,7 @@ msgid "By aggregation of the incoming flow to the targets" msgstr "Genom aggregering av det inkommande flödet till målen" msgid ":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary." -msgstr ":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary." +msgstr ":doc:`pgr_maxFlow` är det maximala flödet och detta maximum garanteras vara detsamma för funktionerna :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp` och :doc:`pgr_boykovKolmogorov`, men det faktiska flödet genom varje kant kan variera." msgid "Capacity edges" msgstr "Kapacitet kanter" @@ -3394,7 +3529,7 @@ msgid "General" msgstr "Allmänt" msgid ":doc:`sampledata` that is used in the examples of this manual." -msgstr ":doc:`sampledata` that is used in the examples of this manual." +msgstr ":doc:`sampledata` som används i exemplen i den här handboken." msgid "Pgrouting Concepts" msgstr "Koncept för injektering" @@ -3421,7 +3556,7 @@ msgid ":doc:`pgr_kruskalDD`" msgstr ":doc:`pgr_kruskalDD`" msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." -msgstr ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." +msgstr ":doc:`pgr_degree` - Returnerar en mängd hörn och motsvarande antal incidenta kanter för hörnet." msgid ":doc:`prim-family`" msgstr ":doc:`prim-family`" @@ -3445,37 +3580,37 @@ msgid ":doc:`utilities-family`" msgstr ":doc:`utilities-family`" msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." -msgstr ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." +msgstr ":doc:`pgr_extractVertices` - Extraherar hörninformation baserat på informationen i kanttabellen." msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" -msgstr ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" +msgstr ":doc:`pgr_findCloseEdges` - Hittar närliggande kanter till punkter vid behov" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." -msgstr ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." +msgstr ":doc:`pgr_separateCrossing` - Delar upp geometrier som korsar varandra." msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." -msgstr ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." +msgstr ":doc:`pgr_separateTouching` - Delar upp geometrier som (nästan) vidrör varandra." msgid ":doc:`withPoints-family`" msgstr ":doc:`withPoints-family`" msgid ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph." -msgstr ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph." +msgstr ":doc:`pgr_withPoints` - Rutt från/till punkter var som helst i grafen." msgid ":doc:`pgr_withPointsCost` - Costs of the shortest paths." -msgstr ":doc:`pgr_withPointsCost` - Costs of the shortest paths." +msgstr ":doc:`pgr_withPointsCost` - Kostnader för de kortaste vägarna." msgid ":doc:`pgr_withPointsCostMatrix` - Costs of the shortest paths." -msgstr ":doc:`pgr_withPointsCostMatrix` - Costs of the shortest paths." +msgstr ":doc:`pgr_withPointsCostMatrix` - Kostnader för de kortaste vägarna." msgid ":doc:`pgr_withPointsKSP` - K shortest paths." -msgstr ":doc:`pgr_withPointsKSP` - K shortest paths." +msgstr ":doc:`pgr_withPointsKSP` - K kortaste vägar." msgid ":doc:`pgr_withPointsDD` - Driving distance." -msgstr ":doc:`pgr_withPointsDD` - Driving distance." +msgstr ":doc:`pgr_withPointsDD` - Köravstånd." msgid ":doc:`pgr_withPointsVia` - Via routing" -msgstr ":doc:`pgr_withPointsVia` - Via routing" +msgstr ":doc:`pgr_withPointsVia` - Ruttplanering via punkter" msgid "Functions by categories" msgstr "Funktioner per kategori" @@ -3505,7 +3640,7 @@ msgid ":doc:`withPoints-category`" msgstr ":doc:`withPoints-category`" msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." -msgstr ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." +msgstr ":doc:`withPoints-family` - Funktioner baserade på Dijkstras algoritm." msgid "From the :doc:`TRSP-family`:" msgstr "Från :doc:`TRSP-familjen `:" @@ -3528,69 +3663,144 @@ msgstr "Versionsinformation för pgRouting 4.1.0" 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 "Code enhancements" -msgstr "Förbättringar av koden" +msgid "4.1.0 Build" +msgstr "4.1.0 Bygge" + +msgid "PostgreSQL:" +msgstr "PostgreSQL:" + +msgid "Minimum requirement: 14" +msgstr "Minimikrav: 14" + +msgid "Boost library:" +msgstr "Boost-bibliotek:" + +msgid "Minimum requirement: 1.74" +msgstr "Minimikrav: 1.74" + +msgid "cmake:" +msgstr "cmake:" + +msgid "Minimum requirement: 3.22" +msgstr "Minimikrav: 3.22" + +msgid "4.1.0 Summary of changes by function" +msgstr "4.1.0 Sammanfattning av ändringar per funktion" + +msgid "pgr_coreNumbers" +msgstr "pgr_coreNumbers" + +msgid "New experimental function." +msgstr "Ny experimentell funktion." + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" + +msgid "Fix the way it builds the graph" +msgstr "Rättar hur grafen byggs" + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + +msgid "New optional parameters: ``min_depth``, ``max_depth``, ``self_loops`` and ``u_turn_on_edge``." +msgstr "" #, fuzzy -msgid "`#3049 `__: Use enumeration on drivers and process." -msgstr "`#2934 `__: pgr_transitiveClosure" +msgid "New signatures to select starting vertices." +msgstr "Array med identifierare för startpunkter." #, fuzzy +msgid "Deprecated signature: ``pgr_hawickCircuits(text)``." +msgstr "Föråldrade signaturer." + +msgid "pgr_makeBiconnectedPlanar" +msgstr "pgr_makeBiconnectedPlanar" + +msgid "pgr_maxWeightedMatch" +msgstr "pgr_maxWeightedMatch" + +msgid "pgr_planarFaces" +msgstr "pgr_planarFaces" + +msgid "4.1.0 New experimental functions." +msgstr "4.1.0 Nya experimentella funktioner." + +msgid "`#3136 `__: pgr_maxWeightedMatch" +msgstr "`#3136 `__: pgr_maxWeightedMatch" + +msgid "`#3140 `__: pgr_makeBiconnectedPlanar" +msgstr "`#3140 `__: pgr_makeBiconnectedPlanar" + +msgid "`#3142 `__: pgr_coreNumbers" +msgstr "`#3142 `__: pgr_coreNumbers" + +msgid "`#3143 `__: pgr_planarFaces" +msgstr "`#3143 `__: pgr_planarFaces" + +msgid "4.1.0 Code enhancements" +msgstr "4.1.0 Kodförbättringar" + +msgid "`#3049 `__: Use enumeration on drivers and process." +msgstr "`#3049 `__: Använder uppräkning i drivrutiner och processer." + msgid "`#3054 `__: Change error message when edges_sql is empty" -msgstr "`#1640 `__: pgr_withPoints misslyckas när points_sql är tom" +msgstr "`#3054 `__: Ändrar felmeddelandet när edges_sql är tomt" -#, fuzzy msgid "`#3055 `__: bdDijkstra: use the shortest_path process and driver" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3055 `__: bdDijkstra: använder processen och drivrutinen shortest_path" -#, fuzzy msgid "`#3056 `__: edwardMoore: use the shortest_path process and driver" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3056 `__: edwardMoore: använder processen och drivrutinen shortest_path" -#, fuzzy msgid "`#3060 `__: dagShortestPath: use the shortest_path process and driver" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3060 `__: dagShortestPath: använder processen och drivrutinen shortest_path" -#, fuzzy msgid "`#3064 `__: Astar: create and use a process and driver for Astar" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3064 `__: Astar: skapar och använder en process och drivrutin för Astar" -#, fuzzy msgid "`#3075 `__: Spanning tree: create and use a process and driver" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3075 `__: Uppspännande träd: skapar och använder en process och drivrutin" -#, fuzzy msgid "`#3086 `__: MaxFlow: create and use a process and driver" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3086 `__: MaxFlow: skapar och använder en process och drivrutin" -#, fuzzy msgid "`#3089 `__: edgeDisjoint and bellmanFord use shortestPath driver and process" -msgstr "`#2934 `__: pgr_transitiveClosure" +msgstr "`#3089 `__: edgeDisjoint och bellmanFord använder drivrutinen och processen shortestPath" -#, fuzzy msgid "`#3100 `__: Coloring: create and use a process & driver" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3100 `__: Färgläggning: skapar och använder en process och drivrutin" -#, fuzzy msgid "`#3113 `__: Components: Integrate into existing process/driver pair" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3113 `__: Komponenter: integrerar i befintligt par med process och drivrutin" -msgid "Bug Fixes" -msgstr "Buggfixar" +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "`#3129 `__: breadthFirstSearch: omorganiserar till traversering" -#, fuzzy -msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" -msgstr "`#2924 `__: pgr_edgeColoring" +msgid "`#3131 `__: binaryBreadthFirstSearch: Integrate into existing process/driver pair" +msgstr "`#3131 `__: binaryBreadthFirstSearch: integrerar i befintligt par med process och drivrutin" -msgid "Summary of changes by function" -msgstr "Sammanfattning av förändringar per funktion" +msgid "`#3154 `__: betweennessCentrality: use allpairs/process and driver" +msgstr "`#3154 `__: betweennessCentrality: använder allpairs/process och drivrutin" -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +#, fuzzy +msgid "`#3163 `__: KSP & KSP WithPoints Use ShortestPath driver files" +msgstr "`#3060 `__: dagShortestPath: använder processen och drivrutinen shortest_path" #, fuzzy -msgid "Fix the way it builds the graph" -msgstr "ger grafens bandbredd." +msgid "`#3170 `__: pgr_hawickCircuits: wrong Boost function referenced" +msgstr "`#3140 `__: pgr_makeBiconnectedPlanar" + +msgid "4.1.0 Bug Fixes" +msgstr "4.1.0 Felrättningar" + +msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" +msgstr "`#3101 `__: pgr_edgeColoring bygger inte grafen korrekt" + +msgid "4.1.0 Requirements" +msgstr "4.1.0 Krav" + +msgid "`#3120 `__: Up min requirements: Boost to 1.74 Postgres to 14 cmake to 3.22." +msgstr "`#3120 `__: Höjer minimikraven: Boost till 1.74, Postgres till 14 och cmake till 3.22." msgid "All releases" msgstr "Alla utgåvor" @@ -4415,7 +4625,7 @@ 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." +msgstr "Ett annat routningsproblem kan uppstå när det finns en kant i en oriktad graf vars borttagning ökar antalet sammanhängande 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." @@ -5156,7 +5366,7 @@ 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" +msgstr ":doc:`sampledata`: en liten graf som används i dokumentationsexemplen" msgid "Using `osm2pgrouting `__" msgstr "Använda `osm2pgrouting `__" @@ -5857,9 +6067,6 @@ msgstr ":doc:`pgr_withPointsKSP`" msgid "Returns set of |generic-result|" msgstr "Returnerar uppsättning av |generic-result|" -msgid "``path_id``" -msgstr "``path_id``" - msgid "Path identifier." msgstr "Identifierare för sökväg." @@ -6010,23 +6217,20 @@ msgstr "Beroenden för kompilering" 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 "C and C++0x compilers" -msgstr "C- och C++0x-kompilatorer" - -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 "C++ standard" +msgstr "C++-standard" -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 "C++17" +msgstr "C++17" -msgid "Postgresql version >= 13" -msgstr "Postgresql-version >= 13" +msgid "Postgresql version >= 14" +msgstr "PostgreSQL-version >= 14" -msgid "The Boost Graph Library (BGL) >= 1.56.0" -msgstr "Boost Graph Library (BGL) >= 1.56.0" +msgid "The Boost Graph Library (BGL) >= 1.74.0" +msgstr "Boost Graph Library (BGL) >= 1.74.0" -msgid "CMake >= 3.12" -msgstr "CMake >= 3.12" +msgid "CMake >= 3.22" +msgstr "CMake >= 3.22" msgid "For user's documentation" msgstr "För användardokumentation" @@ -6286,8 +6490,8 @@ msgstr "Tidigare och nuvarande bidragsgivare:" msgid "Individuals (in alphabetical order)" msgstr "Enskilda personer (i alfabetisk ordning)" -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 "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, Mayur Galhate, 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, Mayur Galhate, 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 "Corporate Sponsors (in alphabetical order)" msgstr "Företagssponsorer (i alfabetisk ordning)" @@ -7009,9 +7213,6 @@ msgstr "Ändring av resultatkolumner: ``seq`` tas bort" msgid "Version 2.5.0" msgstr "Version 2.5.0" -msgid "New experimental function." -msgstr "Ny experimentell funktion." - 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." @@ -7304,10 +7505,10 @@ msgid "When the start vertex and the end vertex are the same, there is no path. msgstr "När startvertex och slutvertex är desamma finns det ingen väg. Agg_cost skulle vara :math:`0`." 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." +msgstr "När start- och sluthornpunkterna är olika och det finns en väg mellan dem utan en *negativ cykel*. agg_cost skulle då vara ett ändligt värde som anger det kortaste avståndet mellan dem." 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." +msgstr "När start- och sluthornpunkterna ä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 hörnpunkter att minska och därför kan agg_cost inte definieras för dem." 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`." @@ -7738,9 +7939,6 @@ msgstr "Returnerar uppsättning av |result-1-1-no-seq|" msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "Returnerar uppsättning av ``(seq, nod, kant, kostnad, agg_cost)``" -msgid "Sequential value starting from ``1``" -msgstr "Sekventiellt värde med början från ``1``" - 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." @@ -8167,9 +8365,6 @@ msgstr "De gröna noderna är återvändsgrändsnoder." 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 "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "``ARRAY[`` |ANY-INTEGER| ``]`` ``" - msgid "**Empty**" msgstr "**Empty**" @@ -8555,7 +8750,7 @@ msgid "Graph where linearity is not symmetrical." msgstr "Graf där linjäriteten inte är symmetrisk." 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." +msgstr "När grafen bearbetas som en riktad graf är linjäriteten inte symmetrisk och grafen kan därför inte dras ihop." 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." @@ -8626,104 +8821,410 @@ msgstr "Edge :math:`1 \\rightarrow 3` har information om kostnad och de noder so msgid "Create the contracted graph." msgstr "Skapa den kontraherade grafen." -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "``pgr_cuthillMckeeOrdering`` - Experimentell" +msgid "``pgr_coreNumbers`` - Experimental" +msgstr "``pgr_coreNumbers`` – Experimentell" -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 "``pgr_coreNumbers`` - Computes the core number of each vertex in an undirected graph using k-core decomposition." +msgstr "``pgr_coreNumbers`` – Beräknar kärntalet för varje hörnpunkt i en oriktad graf med k-kärnuppdelning." -msgid "Version 3.4.0" -msgstr "Version 3.4.0" +msgid "Version 4.1.0" +msgstr "Version 4.1.0" -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 "The **core number** of a vertex is the largest value :math:`k` such that the vertex **belongs to the** :math:`k`-core of the graph." +msgstr "**Kärntalet** för en hörnpunkt är det största värdet :math:`k` så att hörnpunkten **tillhör** grafens :math:`k`-kärna." -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 "The :math:`k`-core of a graph is the maximal subgraph in which every vertex has degree at least :math:`k` within that subgraph. K-core decomposition iteratively removes vertices of degree less than :math:`k` until no such vertices remain, increasing :math:`k` at each stage. The process assigns one core number to every vertex." +msgstr "En grafs :math:`k`-kärna är den maximala delgraf där varje hörnpunkt har grad minst :math:`k` inom delgrafen. K-kärndecomposition tar iterativt bort hörnpunkter med grad mindre än :math:`k` tills inga sådana återstår och ökar :math:`k` i varje steg. Processen tilldelar varje hörnpunkt ett kärntal." -msgid "The implementation is for **undirected** graphs." -msgstr "Implementationen är för **undirected** grafer." +msgid "The core number says how deeply a vertex sits inside the graph:" +msgstr "Kärntalet anger hur djupt inne i grafen en hörnpunkt ligger:" -msgid "The bandwidth minimization problems are considered NP-complete problems." -msgstr "Problemen med att minimera bandbredden anses vara NP-kompletta problem." +msgid "Core :math:`1` vertices are peeled in the first step. They are terminal nodes of the peeled graph, adjacent to at most one other vertex in the induced subgraph." +msgstr "Hörnpunkter med kärntal :math:`1` skalas bort i det första steget. De är slutnoder i den avskalade grafen och gränsar till högst en annan hörnpunkt i den inducerade delgrafen." -msgid "The running time complexity is: :math:`O(m log(m)|V|)`" -msgstr "Körtidskomplexiteten är: :math:`O(m log(m)|V|)`" +msgid "Core :math:`2` vertices survive that step. They lie on cycles, or on the chains joining them." +msgstr "Hörnpunkter med kärntal :math:`2` överlever det steget. De ligger på cykler eller på kedjorna som binder samman dem." -msgid "where :math:`|V|` is the number of vertices," -msgstr "där :math:`|V|` är antalet toppar," +msgid "Core :math:`3` and above mark dense regions where every vertex keeps three or more neighbors however much of the graph is peeled away." +msgstr "Kärntal :math:`3` och högre markerar täta områden där varje hörnpunkt behåller tre eller fler grannar, oavsett hur mycket av grafen som skalas bort." -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 "Parallel edges between the same pair of vertices are collapsed into a single edge before the peeling starts, so edge multiplicity does not inflate core numbers." +msgstr "Parallella kanter mellan samma par av hörnpunkter slås ihop till en enda kant innan avskalningen börjar, så antalet parallella kanter påverkar inte kärntalen." -msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" -msgstr "pgr_cuthillMckeeOrdering(`Kanter SQL`_)" +msgid "Three parallel edges between two vertices give both vertices core :math:`1`, the same as a single edge." +msgstr "Tre parallella kanter mellan två hörnpunkter ger båda hörnpunkterna kärntalet :math:`1`, precis som en enda kant." -msgid "Returns set of |result_node_order|" -msgstr "Returnerar uppsättning av |result_node_order|" +msgid "Self loop: a vertex is not a neighbor of its own vertex, so it is dropped before peeling and does not contribute to that vertex's degree." +msgstr "Självslinga: en hörnpunkt är inte granne med sig själv, så slingan tas bort före avskalningen och bidrar inte till hörnpunktens grad." -msgid "Graph ordering of pgRouting :doc:`sampledata`" -msgstr "Grafisk ordning av pgRouting :doc:`sampledata`" +msgid "A vertex whose only edge is a self loop has no real neighbors left, So the core number is 0." +msgstr "En hörnpunkt vars enda kant är en självslinga har inga verkliga grannar kvar, så kärntalet är 0." -msgid "Returns set of ``(seq, node)``" -msgstr "Returnerar uppsättning av ``(seq, node)``" +msgid "Loops and parallel edges are removed." +msgstr "Slingor och parallella kanter tas bort." -msgid "Sequence of the order starting from 1." -msgstr "Ordningsföljd med början från 1." +msgid "All vertices are kept" +msgstr "Alla hörnpunkter behålls" -msgid "New ordering in reverse order." -msgstr "Ny beställning i omvänd ordning." +msgid "Costs are ignored" +msgstr "Kostnader ignoreras" -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "`Boost: Cuthill-McKee Beställning `__" +msgid "Each vertex receives exactly one core number" +msgstr "Varje hörnpunkt får exakt ett kärntal" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "`Wikipedia: Cuthill-McKee-ordning `__" +msgid "Results:" +msgstr "Resultat:" -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr "``pgr_dagShortestPath`` - Experimentell" +msgid "Number of returned rows: :math:`|V|`." +msgstr "Antal returnerade rader: :math:`|V|`." -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 "Ordered by ``node`` ascending." +msgstr "Sorterat stigande efter ``node``." -msgid "pgr_dagShortestPath(Combinations)" -msgstr "pgr_dagShortestPath(Combinations)" +msgid "No rows returned when no edges found. Emits a ``NOTICE``" +msgstr "Inga rader returneras när inga kanter hittas. Avger ett ``NOTICE``" -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 "Running time: :math:`O(|E| + |E| + |V| log |V|)`" +msgstr "Körtid: :math:`O(|E| + |E| + |V| log |V|)`" -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 "Loop and parallel removal: :math:`O(|E|)`" +msgstr "Borttagning av slingor och parallella kanter: :math:`O(|E|)`" -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 "Peeling algorithm: :math:`O(|E|)`" +msgstr "Avskalningsalgoritm: :math:`O(|E|)`" -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 "Sorting: :math:`|V| log |V|`" +msgstr "Sortering: :math:`|V| log |V|`" -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 "pgr_coreNumbers(`Edges SQL`_)" +msgstr "pgr_coreNumbers(`Edges SQL`_)" -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 "Returns set of ``(seq, node, core)``" +msgstr "Returnerar mängden ``(seq, node, core)``" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" -msgstr "Drifttid: :math:`O(| start\\_vids | * (V + E))`" +msgid "Core numbers on a subgraph of :doc:`sampledata`" +msgstr "Kärntal för en delgraf av :doc:`sampledata`" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vid**)" +msgid "Vertices are colored by core number in the diagrams below: ``deepskyblue`` for core :math:`1` and ``green`` for core :math:`2`." +msgstr "Hörnpunkterna färgsätts efter kärntal i diagrammen nedan: ``deepskyblue`` för kärntal :math:`1` och ``green`` för kärntal :math:`2`." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vids**)" +msgid "All returned vertices have core number :math:`1`; they belong to the 1-core but not to any higher core." +msgstr "Alla returnerade hörnpunkter har kärntal :math:`1`; de tillhör 1-kärnan men ingen högre kärna." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vid**)" +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." +msgstr "Hörnpunkterna :math:`5` och :math:`15` är slutnoder i denna delgraf (grad :math:`1`)." -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vids**)" +msgid "Vertices :math:`6`, :math:`7`, and :math:`10` have higher degree here, but peeling degree-:math:`1` vertices first removes the entire subgraph before a 2-core can form." +msgstr "Hörnpunkterna :math:`6`, :math:`7` och :math:`10` har högre grad här, men när hörnpunkter med grad :math:`1` skalas bort först försvinner hela delgrafen innan en 2-kärna kan bildas." -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, `Combinations SQL`_)" +msgid "The following diagram shows edges :math:`\\{1, \\ldots, 7\\}` from :doc:`sampledata`; every vertex label shows ``node (core)``." +msgstr "Följande diagram visar kanterna :math:`\\{1, \\ldots, 7\\}` från :doc:`sampledata`; varje hörnpunkts etikett visar ``node (core)``." + +msgid "The next subgraph uses edges :math:`\\{1, 2, 3, 4\\}`, the same set as the main example of :doc:`pgr_betweennessCentrality`. Every vertex is still core :math:`1` because the structure is a tree-like path with terminal nodes at :math:`5` and :math:`15`." +msgstr "Nästa delgraf använder kanterna :math:`\\{1, 2, 3, 4\\}`, samma mängd som huvudsakliga exemplet för :doc:`pgr_betweennessCentrality`. Varje hörnpunkt har fortfarande kärntal :math:`1`, eftersom strukturen är en trädliknande väg med slutnoderna :math:`5` och :math:`15`." + +msgid "K-core peeling (illustration)" +msgstr "Avskalning av k-kärna (illustration)" + +msgid "On edges :math:`id < 10`, vertices :math:`5` and :math:`15` are removed first because they have degree :math:`1`. After further peeling, vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` remain as the 2-core (shown in green below)." +msgstr "För kanter med :math:`id < 10` tas hörnpunkterna :math:`5` och :math:`15` bort först eftersom de har grad :math:`1`. Efter ytterligare avskalning återstår hörnpunkterna :math:`6`, :math:`7`, :math:`10` och :math:`11` som 2-kärnan (visas i grönt nedan)." + +msgid "Sequential value starting from 1." +msgstr "Löpnummer som börjar på 1." + +msgid "``core``" +msgstr "``core``" + +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "Hörnpunktens kärntal: det största :math:`k` för vilket hörnpunkten tillhör :math:`k`-kärnan." + +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 "Sample network overview" +msgstr "Översikt över exempelnätverk" + +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." +msgstr "Riktat exempelnätverk. ``pgr_coreNumbers`` behandlar varje kant som oriktad, så ``cost`` och ``reverse_cost`` används inte i beräkningen." + +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" +msgstr "Jämförelse med :doc:`pgr_betweennessCentrality` för samma kanter" + +msgid "Both functions use the same ``Edges SQL`` format. The betweenness example on edges :math:`\\{1, 2, 3, 4\\}` measures shortest-path influence; core numbers measure peeling resilience." +msgstr "Båda funktionerna använder samma format för ``Edges SQL``. Exemplet för betweenness på kanterna :math:`\\{1, 2, 3, 4\\}` mäter påverkan på kortaste vägar, medan kärntal mäter motståndskraft mot avskalning." + +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" +msgstr "1) Kärntal för kanterna :math:`\\{1, 2, 3, 4\\}`" + +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." +msgstr "Hörnpunkterna :math:`5` och :math:`15` är slutnoder (kärntal :math:`1`)." + +msgid "Vertex :math:`6` has degree :math:`3` in this subgraph but still has core :math:`1`, because removing :math:`5` and :math:`15` first leaves no subgraph where every vertex has degree at least :math:`2`." +msgstr "Hörnpunkt :math:`6` har grad :math:`3` i denna delgraf men har ändå kärntal :math:`1`, eftersom när :math:`5` och :math:`15` först tas bort återstår ingen delgraf där varje hörnpunkt har grad minst :math:`2`." + +msgid "Compare with :doc:`pgr_betweennessCentrality` on the same edges: vertex :math:`6` has the highest betweenness, but core number does not rank vertices by path importance." +msgstr "Jämför med :doc:`pgr_betweennessCentrality` för samma kanter: hörnpunkt :math:`6` har högst betweenness, men kärntalet rangordnar inte hörnpunkter efter vägars betydelse." + +msgid "Subgraph with core-:math:`2` vertices" +msgstr "Delgraf med hörnpunkter med kärntal :math:`2`" + +msgid "Adding edges :math:`5` through :math:`9` connects the inner vertices into a 2-core. The undirected layout below shows the same network." +msgstr "När kanterna :math:`5` till :math:`9` läggs till kopplas de inre hörnpunkterna samman till en 2-kärna. Den oriktade layouten nedan visar samma nätverk." + +msgid "Undirected view of the sample network" +msgstr "Oriktad vy av exempelnätverket" + +msgid "2) Core numbers on edges :math:`id < 10`" +msgstr "2) Kärntal för kanter med :math:`id < 10`" + +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." +msgstr "Hörnpunkterna :math:`6`, :math:`7`, :math:`10` och :math:`11` har kärntal :math:`2`." + +msgid "Vertices :math:`1`, :math:`3`, :math:`5`, :math:`15`, and :math:`16` are attached by tree-like branches and remain core :math:`1`." +msgstr "Hörnpunkterna :math:`1`, :math:`3`, :math:`5`, :math:`15` och :math:`16` är anslutna via trädliknande grenar och har fortsatt kärntal :math:`1`." + +msgid "Edge :math:`8` (between :math:`7` and :math:`11`) closes a cycle with edges :math:`4`, :math:`2`, and :math:`5`, which is why the inner four vertices survive peeling." +msgstr "Kant :math:`8` (mellan :math:`7` och :math:`11`) sluter en cykel tillsammans med kanterna :math:`4`, :math:`2` och :math:`5`, vilket gör att de fyra inre hörnpunkterna överlever avskalningen." + +msgid "Filtering results in SQL" +msgstr "Filtrera resultat i SQL" + +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." +msgstr "``pgr_coreNumbers`` returnerar alltid varje hörnpunkt. För att endast behålla den täta kärnan omsluter du anropet med en vanlig SQL-fråga." + +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" +msgstr "3) Hörnpunkter med kärntal :math:`\\geq 2` för kanter med :math:`id < 10`" + +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." +msgstr "Satsen ``WHERE core >= 2`` behåller endast hörnpunkterna i 2-kärnan." + +msgid "Use it to export only the hub vertices for further analysis." +msgstr "Använd den för att endast exportera navhörnpunkterna för fortsatt analys." + +msgid "Full sample graph" +msgstr "Fullständig exempelgraf" + +msgid "4) Core numbers on all edges" +msgstr "4) Kärntal för alla kanter" + +msgid "The full network has :math:`17` vertices and maximum core number :math:`2`." +msgstr "Det fullständiga nätverket har :math:`17` hörnpunkter och maximalt kärntal :math:`2`." + +msgid "Terminal branches (vertices :math:`1`, :math:`2`, :math:`3`, :math:`4`, :math:`5`, :math:`9`, :math:`13`, :math:`14`) remain core :math:`1`." +msgstr "Ändgrenar (hörnpunkterna :math:`1`, :math:`2`, :math:`3`, :math:`4`, :math:`5`, :math:`9`, :math:`13`, :math:`14`) har fortsatt kärntal :math:`1`." + +msgid "The 2-core is vertices :math:`6`, :math:`7`, :math:`8`, :math:`10`, :math:`11`, :math:`12`, :math:`15`, :math:`16` and :math:`17`: the central block of the city network. Vertex :math:`9` hangs off :math:`8` by edge :math:`14` alone, so it is peeled first and stays core :math:`1`." +msgstr "2-kärnan består av hörnpunkterna :math:`6`, :math:`7`, :math:`8`, :math:`10`, :math:`11`, :math:`12`, :math:`15`, :math:`16` och :math:`17`: stadens centrala nätblock. Hörnpunkt :math:`9` är endast ansluten till :math:`8` genom kant :math:`14`, så den skalas bort först och har fortsatt kärntal :math:`1`." + +msgid "Small graphs" +msgstr "Små grafer" + +msgid "5) Single edge (two terminal nodes)" +msgstr "5) Enstaka kant (två slutnoder)" + +msgid "Both endpoints have core number :math:`1`." +msgstr "Båda ändpunkterna har kärntal :math:`1`." + +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." +msgstr "Kant :math:`1` från :doc:`sampledata` förbinder hörnpunkterna :math:`5` och :math:`6`." + +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." +msgstr "Varje ändpunkt har grad :math:`1`, så båda skalas bort omedelbart vid :math:`k = 1`." + +msgid "6) Triangle (all vertices core :math:`2`)" +msgstr "6) Triangel (alla hörnpunkter har kärntal :math:`2`)" + +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." +msgstr "I en triangel har varje hörnpunkt grad :math:`2`, så alla tre tillhör 2-kärnan." + +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." +msgstr "Satsen ``VALUES`` bygger en minimal graf med tre kanter direkt i frågan." + +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." +msgstr "Ingen hörnpunkt kan skalas bort före :math:`k = 2`, så varje kärntal är :math:`2`." + +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" +msgstr "7) Fyrkantig cykel från :doc:`sampledata` (alla hörnpunkter har kärntal :math:`2`)" + +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." +msgstr "Kanterna :math:`\\{2, 4, 5, 8\\}` bildar en 4-cykel med hörnpunkterna :math:`\\{6, 7, 10, 11\\}`." + +msgid "This is the 2-core heart of example 2) before branches are attached." +msgstr "Detta är 2-kärnan i exempel 2) innan grenar ansluts." + +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." +msgstr "Varje hörnpunkt har grad :math:`2` i cykeln, så alla kärntal är :math:`2`." + +msgid "8) Star graph (hub and spokes, all core :math:`1`)" +msgstr "8) Stjärngraf (nav och ekrar, alla har kärntal :math:`1`)" + +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." +msgstr "En stjärna har ett centralt nav som är anslutet till lövhörnpunkter. Varje hörnpunkt skalas bort vid :math:`k = 1`." + +msgid "The hub has degree :math:`4`, but removing the four leaves leaves an isolated vertex, so the hub never belongs to a 2-core." +msgstr "Navet har grad :math:`4`, men när de fyra löven tas bort återstår en isolerad hörnpunkt, så navet tillhör aldrig en 2-kärna." + +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." +msgstr "Stjärnliknande återvändsgator i vägnät ger ofta enbart hörnpunkter med kärntal :math:`1`." + +msgid "Empty edge set" +msgstr "Tom kantmängd" + +msgid "9) No edges in the SQL query" +msgstr "9) Inga kanter i SQL-frågan" + +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." +msgstr "När den inre frågan inte returnerar några kanter avges ett meddelande och resultatet är tomt." + +msgid "No exception is raised." +msgstr "Inget undantag utlöses." + +msgid "Core numbers and planarity" +msgstr "Kärntal och planaritet" + +msgid "Vertices with higher core numbers often lie in densely connected regions. The workflow below computes core numbers, filters the 2-core, and checks whether the subgraph can be drawn without edge crossings using :doc:`pgr_isPlanar`." +msgstr "Hörnpunkter med högre kärntal ligger ofta i tät sammankopplade områden. Arbetsflödet nedan beräknar kärntal, filtrerar 2-kärnan och kontrollerar med :doc:`pgr_isPlanar` om delgrafen kan ritas utan korsande kanter." + +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" +msgstr "10) Planaritet för delgrafen med kanter där :math:`id < 10`" + +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" +msgstr "Beräkna först kärntal (exempel 2), filtrera sedan 2-kärnan (exempel 3) och testa därefter planariteten:" + +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." +msgstr "Delgrafen med kanter där :math:`id < 10` är plan (``pgr_isPlanar`` returnerar ``true``)." + +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." +msgstr "De fyra hörnpunkterna med kärntal :math:`2` ligger i den tätaste delen av denna delgraf." + +msgid "Planarity and core number measure different properties: a graph can be planar while still having a mix of core-:math:`1` and core-:math:`2` vertices." +msgstr "Planaritet och kärntal mäter olika egenskaper: en graf kan vara plan även om den innehåller en blandning av hörnpunkter med kärntal :math:`1` och :math:`2`." + +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" +msgstr "11) Komplett graf :math:`K_4` (alla hörnpunkter har kärntal :math:`3`)" + +msgid "The examples above reach at most core :math:`2`, because the :doc:`sampledata` network has degeneracy :math:`2`. Higher cores need a denser graph. In the complete graph :math:`K_4` every vertex is adjacent to the other three, so no vertex can ever be peeled at :math:`k \\leq 3` and the whole graph is its own 3-core." +msgstr "Exemplen ovan når som mest kärntal :math:`2`, eftersom nätverket :doc:`sampledata` har degenerationsgrad :math:`2`. Högre kärntal kräver en tätare graf. I den kompletta grafen :math:`K_4` är varje hörnpunkt granne med de tre andra, så ingen hörnpunkt kan skalas bort vid :math:`k \\leq 3` och hela grafen utgör sin egen 3-kärna." + +msgid "Every vertex has degree :math:`3`, so nothing is removed while peeling at :math:`k = 1`, :math:`2` or :math:`3`: all four vertices have core :math:`3`." +msgstr "Varje hörnpunkt har grad :math:`3`, så inget tas bort vid avskalning för :math:`k = 1`, :math:`2` eller :math:`3`: alla fyra hörnpunkter har kärntal :math:`3`." + +msgid "In general the complete graph :math:`K_n` has core number :math:`n - 1` for every vertex, which is the maximum possible core number on :math:`n` vertices." +msgstr "Allmänt har den kompletta grafen :math:`K_n` kärntalet :math:`n - 1` för varje hörnpunkt, vilket är högsta möjliga kärntal för :math:`n` hörnpunkter." + +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." +msgstr "Degenerationsgraden för denna graf är :math:`3`, jämfört med :math:`2` för nätverket :doc:`sampledata`." + +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" +msgstr "Batagelj, V. och Zaversnik, M. (2003). `En O(m)-algoritm för kärndecomposition av nätverk `__" + +msgid "`Wikipedia: Degeneracy (graph theory) `__" +msgstr "`Wikipedia: Degenerationsgrad (grafteori) `__" + +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "``pgr_cuthillMckeeOrdering`` - Experimentell" + +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 "Version 3.4.0" +msgstr "Version 3.4.0" + +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 "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 "The implementation is for **undirected** graphs." +msgstr "Implementationen är för **undirected** grafer." + +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "Problemen med att minimera bandbredden anses vara NP-kompletta problem." + +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "Körtidskomplexiteten är: :math:`O(m log(m)|V|)`" + +msgid "where :math:`|V|` is the number of vertices," +msgstr "där :math:`|V|` är antalet toppar," + +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 "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "pgr_cuthillMckeeOrdering(`Kanter SQL`_)" + +msgid "Returns set of |result_node_order|" +msgstr "Returnerar uppsättning av |result_node_order|" + +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "Grafisk ordning av pgRouting :doc:`sampledata`" + +msgid "Returns set of ``(seq, node)``" +msgstr "Returnerar uppsättning av ``(seq, node)``" + +msgid "Sequence of the order starting from 1." +msgstr "Ordningsföljd med början från 1." + +msgid "New ordering in reverse order." +msgstr "Ny beställning i omvänd ordning." + +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Cuthill-McKee Beställning `__" + +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Cuthill-McKee-ordning `__" + +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimentell" + +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 "pgr_dagShortestPath(Combinations)" +msgstr "pgr_dagShortestPath(Combinations)" + +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 "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, det vill säga en riktad acyklisk graf." + +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 "Process is valid for weighted directed acyclic graphs only." +msgstr "Processen gäller endast viktade riktade acykliska grafer." + +msgid "Avoids one edge cycle: `reverse_cost` column is used when :math:`cost < 0`." +msgstr "Undviker cykel med en kant: kolumnen `reverse_cost` används när :math:`cost < 0`." + +msgid "If the graph is not DAG, will throw a PostgreSQL `ERROR`." +msgstr "Om grafen inte är en DAG utlöses ett PostgreSQL-`ERROR`." + +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 "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 "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "Drifttid: :math:`O(| start\\_vids | * (V + E))`" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vid**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vid**, **end vids**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vid**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vids**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_dagShortestPath(`Kanter SQL`_, `Combinations SQL`_)" 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" @@ -8737,6 +9238,9 @@ msgstr "Från topparna :math:`\\{5, 10\\}` till topp :math:`11`" 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 "`reverse_cost` column is used when :math:`cost < 0` to avoid edge cycle." +msgstr "Kolumnen `reverse_cost` används när :math:`cost < 0` för att undvika kantcykler." + msgid "Return columns" msgstr "Returnera kolumner" @@ -9046,9 +9550,6 @@ msgstr "pgr_dijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" 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 "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 "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "För **riktade** grafer med kolumnerna ``kostnad`` och ``omvända_kostnader``" @@ -9505,6 +10006,12 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - Rutt som går genom en lista med toppar." +msgid "Version 4.0.2" +msgstr "Version 4.0.2" + +msgid "Fix: bad alloc" +msgstr "Rättar: felaktig minnesallokering" + 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)`." @@ -9589,14 +10096,23 @@ msgstr ":doc:`dijkstra-family`." msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - Returnerar köravståndet från en startnod." +msgid "Standardizing negative distance behaviour" +msgstr "Standardiserar beteendet för negativa avstånd" + +msgid "Throws when :math:`distance < 0`." +msgstr "Utlöser ett fel när :math:`distance < 0`." + +msgid "Standard message and hint." +msgstr "Standardmeddelande och ledtråd." + msgid "pgr_drivingDistance(Single vertex)" -msgstr "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance(Enskilt hörn)" msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "Lagt till resultatkolumnerna ``depth`` och ``start_vid``." msgid "pgr_drivingDistance(Multiple vertices)" -msgstr "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance(Flera hörn)" msgid "Result column name change: ``from_v`` to ``start_vid``." msgstr "Namnbyte på resultatkolumnen: ``from_v`` till ``start_vid``." @@ -9608,13 +10124,13 @@ msgid "Signature change:" msgstr "Ändring av signatur:" msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance(enskilt hörn)" msgid "New official signature:" msgstr "Ny officiell signatur:" msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance(flera hörn)" 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." @@ -9652,9 +10168,6 @@ msgstr "När ``true`` kommer noden endast att visas i den närmaste ``start_vid` 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 "end-before" -msgstr "slut-innan" - 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" @@ -9664,10 +10177,6 @@ msgstr "``pgr_edgeColoring`` - Experimentell" msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "``pgr_edgeColoring`` - Returnerar kantfärgning av oledade och loopfria grafer" -#, fuzzy -msgid "Version 4.1.0" -msgstr "Version 4.0.0" - msgid "Output columns standardized to |result_edge_color|" msgstr "Utgångskolumner standardiserade till |result_edge_color|" @@ -9900,7 +10409,7 @@ msgid "Geometry of the edge." msgstr "Geometri för kanten." 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." +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 "Ignored columns:" msgstr "Ignorerade kolumner:" @@ -9927,7 +10436,7 @@ msgid "POINT geometry of the ending vertex." msgstr "POINT Geometri för den avslutande vertexen." 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." +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 ``startpoint`` och ``endpoint`` visas." msgid "When identifiers of vertices are known" msgstr "När identifierare av toppar är kända" @@ -10319,49 +10828,113 @@ msgstr "``pgr_hawickCircuits`` - Experimentell" 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 "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 "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Heath A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs." +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 "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 "Circuit enumeration in directed graphs, where circuits with parallel arcs are enumerated." +msgstr "" -msgid "The algorithm implementation works only for directed graph" -msgstr "Implementeringen av algoritmen fungerar endast för riktade grafer" +msgid "Each combination of parallel arcs is returned as a different circuit." +msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." -msgstr "Det är en variant av Johnsons algoritm för kretsuppräkning." +#, fuzzy +msgid "Works for directed graphs." +msgstr "Fungerar för oledade grafer." msgid "The algorithm outputs the distinct circuits present in the graph." msgstr "Algoritmen matar ut de olika kretsar som finns i grafen." +msgid "The circuits are elementary: a vertex is not repeated within a circuit, except the starting vertex that closes the circuit." +msgstr "" + +msgid "When no initial vertices are given all circuits are in canonical order of the vertices insertion of the graph: A circuit with vertices ``u``, ``v``: ``u`` starting circuits containing ``v`` will not be listed on ``start_vid = v`` rows." +msgstr "" + +msgid "Different edge ordering gives different canonical ordering." +msgstr "" + +msgid "When start vertices are given, all circuits are returned for each requested vertex it contains, and the results are grouped by ``start_vid``." +msgstr "" + +msgid "The graph passed to the algorithm discard parallel edges with higher costs." +msgstr "" + msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "Tidskomplexitet: :math:`O((V + E) (c + 1))`" -msgid ":math:`|c|` is the number of circuits in the graph." +#, fuzzy +msgid "where :math:`|V|` is the number of vertices in the graph." +msgstr ":math:`|V|` is the number of vertices in the graph." + +#, fuzzy +msgid "where :math:`|c|` is the number of circuits in the graph." msgstr ":math:`|c|` is the number of circuits in the graph." msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "pgr_hawickCircuits(`Kanter SQL`_)" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vid** [, **options**])" +msgstr "pgr_aStarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" + +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vids** [, **options**])" +msgstr "pgr_aStarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" + +#, fuzzy +msgid "**options:** ``[min_depth, max_depth, self_loops, u_turn_on_edge]``" +msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" + +#, fuzzy +msgid "Returns set of |circuits-result|" +msgstr "Returnerar uppsättning av |tsp-result|" + +msgid "All circuits" +msgstr "" + +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_ [, **options**])" +msgstr "pgr_hawickCircuits(`Kanter SQL`_)" + +#, fuzzy +msgid "All the circuits of the pgRouting :doc:`sampledata`" msgstr "Kretsar som finns i pgRouting :doc:`sampledata`" -msgid "Id of the circuit starting from ``1``" -msgstr "Id för kretsen med början från ``1``" +msgid "When no starting vertex is given, all the circuits of the graph are returned. The result has 94 rows, one ``path_id`` for each circuit:" +msgstr "" -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" +#, fuzzy +msgid "Single start vertex" +msgstr "Enstaka toppunkt" -msgid "Identifier of the starting vertex of the circuit." -msgstr "Identifierare av kretsens startvertex." +#, fuzzy +msgid "Circuits that contain vertex :math:`10`" +msgstr "Contracting vertex :math:`3`," -msgid "Identifier of the ending vertex of the circuit." -msgstr "Identifierare för kretsens slutpunkt." +#, fuzzy +msgid "Many start vertices" +msgstr "Från **många** startpunkter" -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." +#, fuzzy +msgid "Circuits that contain vertices :math:`\\{10, 11\\}`" +msgstr "Från toppunkten :math:`5` till toppunkterna :math:`{7, 11\\}`" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "The examples use the following table ``c_example``, that represent a cul_de_sac where the exit is on vertex :math:`5` and the vehicle is on vertex :math:`1` but pointing at the wrong direction of the exit." +msgstr "" + +#, fuzzy +msgid "All possible ways to return to vertex :math:`1`." +msgstr "Dominatorträdet med rotvertex :math:`5`" + +msgid "Exclude self loops." +msgstr "" + +#, fuzzy +msgid "Exclude self loops and U-turn on the same edge." +msgstr "inga självslingor och inga parallella kanter." + +#, fuzzy +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "`Boost: Hawick Circuit Algorithm `__" msgid "``pgr_isPlanar`` - Experimental" @@ -10593,7 +11166,7 @@ msgid "``vertex_id``" msgstr "``vertex_id``" msgid "Identifier of vertex ." -msgstr "Identifierare för toppunkt ." +msgstr "Identifierare för toppunkt." msgid "``idom``" msgstr "``idom``" @@ -10979,6 +11552,78 @@ msgstr "https://en.wikipedia.org/wiki/Line_graph" msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "https://en.wikipedia.org/wiki/Complete_graph" +msgid "``pgr_makeBiconnectedPlanar`` - Experimental" +msgstr "``pgr_makeBiconnectedPlanar`` – Experimentell" + +msgid "``pgr_makeBiconnectedPlanar`` — Returns the set of edges needed to make each connected component of a planar graph biconnected." +msgstr "``pgr_makeBiconnectedPlanar`` – Returnerar mängden kanter som behövs för att göra varje sammanhängande komponent i en plan graf tvåhörnssammanhängande." + +msgid "``pgr_makeBiconnectedPlanar`` identifies the missing edges that need to be added to each connected component of an existing planar graph to make those components biconnected, while ensuring the graph remains planar." +msgstr "``pgr_makeBiconnectedPlanar`` identifierar de saknade kanter som behöver läggas till i varje sammanhängande komponent i en befintlig plan graf för att göra komponenterna tvåhörnssammanhängande och samtidigt se till att grafen förblir plan." + +msgid "A graph is considered **biconnected** if it is connected and cannot be broken into disconnected pieces by deleting any single vertex (it has no articulation points). A planar graph is one that can be drawn in two-dimensional space with no two of its edges crossing." +msgstr "En graf betraktas som **tvåhörnssammanhängande** om den är sammanhängande och inte kan delas i osammanhängande delar genom att en enskild hörnpunkt tas bort (den har inga artikulationspunkter). En plan graf kan ritas i två dimensioner utan att två av dess kanter korsar varandra." + +msgid "If the graph is not connected it will treat each component as an idividual graph." +msgstr "Om grafen inte är sammanhängande behandlas varje komponent som en enskild graf." + +msgid "Run :doc:`pgr_makeConnected` to connect all components." +msgstr "Kör :doc:`pgr_makeConnected` för att koppla samman alla komponenter." + +msgid "When the graph is not planar it will emit an ``ERROR``" +msgstr "När grafen inte är plan avges ett ``ERROR``" + +msgid "Run :doc:`pgr_isPlanar` first." +msgstr "Kör först :doc:`pgr_isPlanar`." + +msgid "All vertices are kept." +msgstr "Alla hörnpunkter behålls." + +msgid "Costs are ignored." +msgstr "Kostnader ignoreras." + +msgid "Returns a list of all new edges needed to make biconected graphs out of each connected component." +msgstr "Returnerar en lista över alla nya kanter som behövs för att göra varje sammanhängande komponent tvåhörnssammanhängande." + +msgid "Empty results when the graph is already biconnected planar." +msgstr "Tomt resultat när grafen redan är tvåhörnssammanhängande och plan." + +msgid "Running time: :math:`O(|V| + |E| + R \\log R)` for each component" +msgstr "Körtid: :math:`O(|V| + |E| + R \\log R)` för varje komponent" + +msgid ":math:`R` is the number of returned edges." +msgstr ":math:`R` är antalet returnerade kanter." + +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "pgr_makeBiconnectedPlanar(`Edges SQL`_)" + +msgid "Returns set of |result-component-make|" +msgstr "Returnerar uppsättning av |result-component-make|" + +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "Lista över kanter som behövs för att göra grafen tvåhörnssammanhängande och plan." + +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." +msgstr "Exempelgraf efter att tvåhörnssammanhängande kanter har lagts till (oliv = ursprungliga kanter, röd streckad = 4 nya kanter)." + +msgid "When a graph contains multiple disconnected components, each component is processed independently. Components (2,4) and (13,14) are already biconnected (0 articulation points) and require no new edges." +msgstr "När en graf innehåller flera osammanhängande komponenter bearbetas varje komponent oberoende. Komponenterna (2,4) och (13,14) är redan tvåhörnssammanhängande (0 artikulationspunkter) och behöver inga nya kanter." + +msgid "4-vertex path graph." +msgstr "Väggraf med 4 hörnpunkter." + +msgid "Create a 4-vertex tree graph." +msgstr "Skapa en trädgraf med 4 hörnpunkter." + +msgid "Get the edges needed to have biconnected planar graph." +msgstr "Hämta de kanter som behövs för en tvåhörnssammanhängande plan graf." + +msgid "Adding the edges to the graph" +msgstr "Lägga till kanterna i grafen" + +msgid "`Boost: make_biconnected_planar `__" +msgstr "`Boost: make_biconnected_planar `__" + msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - Experimentell" @@ -10997,9 +11642,6 @@ msgstr "Algoritmen tar inte hänsyn till geometrisk topologi i beräkningarna." msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "pgr_makeConnected(`Kanter SQL`_)" -msgid "Returns set of |result-component-make|" -msgstr "Returnerar uppsättning av |result-component-make|" - msgid "List of edges that are needed to connect the graph." msgstr "Lista över kanter som behövs för att koppla ihop grafen." @@ -11151,7 +11793,7 @@ msgid "where :math:`U` is the value of the max flow." msgstr "där :math:`U` är värdet på maxflödet." 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`." +msgstr ":math:`U` är den övre gränsen för antalet iterationer. I många verkliga fall är antalet iterationer mycket mindre än :math:`U`." msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vid**)" @@ -11210,6 +11852,42 @@ msgstr "RETURNS FLOAT" 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 "``pgr_maxWeightedMatch`` - Experimental" +msgstr "``pgr_maxWeightedMatch`` – Experimentell" + +msgid "``pgr_maxWeightedMatch`` — Calculates a maximum weighted matching in a graph." +msgstr "``pgr_maxWeightedMatch`` – Beräknar en maximal viktad matchning i en graf." + +msgid "A **maximum weighted matching** in a graph is a matching where the sum of the weights of selected edges is maximized." +msgstr "En **maximal viktad matchning** i en graf är en matchning där summan av de valda kanternas vikter maximeras." + +msgid "Each vertex is matched with at most one other vertex." +msgstr "Varje hörnpunkt matchas med högst en annan hörnpunkt." + +msgid "Maximizes the total edge weight sum." +msgstr "Maximerar den totala summan av kantvikter." + +msgid "There may be many maximum weighted matchings." +msgstr "Det kan finnas många maximala viktade matchningar." + +msgid "Calculates one possible maximum weighted matching in a graph." +msgstr "Beräknar en möjlig maximal viktad matchning i en graf." + +msgid "Running time: :math:`O(V^3)`." +msgstr "Körtid: :math:`O(V^3)`." + +msgid "pgr_maxWeightedMatch(`Edges SQL`_)" +msgstr "pgr_maxWeightedMatch(`Edges SQL`_)" + +msgid "Set of |result-edge|" +msgstr "Mängd av |result-edge|" + +msgid "Maximum weighted matching on a custom 5-vertex graph." +msgstr "Maximal viktad matchning i en anpassad graf med 5 hörnpunkter." + +msgid "`Boost: maximum_weighted_matching `__" +msgstr "`Boost: maximum_weighted_matching `__" + msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - Experimentell" @@ -11405,6 +12083,150 @@ msgstr "Den bästa lösningen som hittades för **lc101** är en restid: 828.94" msgid "This implementation's travel time: 854.54" msgstr "Restid för detta genomförande: 854.54" +msgid "``pgr_planarFaces`` - Experimental" +msgstr "``pgr_planarFaces`` – Experimentell" + +msgid "``pgr_planarFaces`` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "``pgr_planarFaces`` – Identifierar ytorna i en plan inbäddning och listar varje incidens mellan kant och yta för en oriktad graf." + +msgid "In a planar embedding, the graph is drawn in the plane so that edges meet only at vertices. A face is a maximal connected region of the plane bounded by edges." +msgstr "I en plan inbäddning ritas grafen i planet så att kanter endast möts vid hörnpunkter. En yta är ett maximalt sammanhängande område i planet som begränsas av kanter." + +msgid "Every bounded face is a cycle of edges enclosing an interior region. The exterior face, also called the unbounded face, is the region outside the outermost cycle." +msgstr "Varje begränsad yta är en cykel av kanter som omsluter ett inre område. Den yttre ytan, även kallad den obegränsade ytan, är området utanför den yttersta cykeln." + +msgid "Once an embedding is fixed, each undirected edge has a left and a right side when walked in the direction the embedding assigns around each vertex." +msgstr "När en inbäddning är fastställd har varje oriktad kant en vänster- och en högersida när den genomlöps i den riktning som inbäddningen anger runt varje hörnpunkt." + +msgid "In a connected planar undirected graph, each edge separates exactly two faces, so it contributes one row on the left and one on the right." +msgstr "I en sammanhängande plan oriktad graf skiljer varje kant exakt två ytor åt och bidrar därför med en rad till vänster och en till höger." + +msgid "``pgr_planarFaces`` returns those incidences: ``face_id`` names the face, ``edge_id`` is the border edge, and ``side`` is ``1`` (left) or ``2`` (right) relative to the embedding." +msgstr "``pgr_planarFaces`` returnerar dessa incidenser: ``face_id`` namnger ytan, ``edge_id`` är gränskanten och ``side`` är ``1`` (vänster) eller ``2`` (höger) i förhållande till inbäddningen." + +msgid "The function first computes a planar embedding with the Boyer-Myrvold planarity test, then walks faces with Boost ``planar_face_traversal``.i" +msgstr "Funktionen beräknar först en plan inbäddning med planaritetstestet Boyer-Myrvold och genomlöper sedan ytor med Boost ``planar_face_traversal``." + +msgid "Loops and paralell edges are preserved." +msgstr "Slingor och parallella kanter bevaras." + +msgid "They are used to determine the existance of an edge" +msgstr "De används för att avgöra om en kant finns" + +msgid "Run :doc:`pgr_isPlanar` first" +msgstr "Kör först :doc:`pgr_isPlanar`" + +msgid "The result has one row per edge-side pair" +msgstr "Resultatet har en rad per par av kant och sida" + +msgid "Graph with :math:`|E|` edges yields :math:`2|E|` rows." +msgstr "En graf med :math:`|E|` kanter ger :math:`2|E|` rader." + +msgid "Number of faces: * Obeys Euler's formula: :math:`|V| - |E| + |F| = 2` * On a graph with :math:`C` components: :math:`|V| - |E| + |F| = 2C`." +msgstr "Antal ytor: * Följer Eulers formel: :math:`|V| - |E| + |F| = 2` * I en graf med :math:`C` komponenter: :math:`|V| - |E| + |F| = 2C`." + +msgid "Running time: :math:`O(|E| + |V|)`" +msgstr "Körtid: :math:`O(|E| + |V|)`" + +msgid "pgr_planarFaces(`Edges SQL`_)" +msgstr "pgr_planarFaces(`Edges SQL`_)" + +msgid "Returns set of ``(seq, face_id, edge_id, side)``" +msgstr "Returnerar mängden ``(seq, face_id, edge_id, side)``" + +msgid "Faces of the full :doc:`sampledata` graph" +msgstr "Ytor i hela grafen :doc:`sampledata`" + +msgid "The query returns **36 rows**, twice the **18** edges in ``edges``, consistent with :math:`2|E|`." +msgstr "Frågan returnerar **36 rader**, två gånger de **18** kanterna i ``edges``, i enlighet med :math:`2|E|`." + +msgid "``face_id`` runs from **1** through **7** on this network; each id is one face of the embedding, including the unbounded **exterior face** (here ``face_id = 1`` borders the outer layout of the city block)." +msgstr "``face_id`` går från **1** till **7** i detta nätverk; varje id är en yta i inbäddningen, inklusive den obegränsade **yttre ytan** (här gränsar ``face_id = 1`` till stadskvarterets yttre layout)." + +msgid "Every ``edge_id`` appears **twice**, once with ``side = 1`` and once with ``side = 2``." +msgstr "Varje ``edge_id`` förekommer **två gånger**, en gång med ``side = 1`` och en gång med ``side = 2``." + +msgid "Rows follow the counterclockwise walk of each face in the computed embedding." +msgstr "Raderna följer den moturs genomlöpningen av varje yta i den beräknade inbäddningen." + +msgid "Have :math:`3` components then number if faces = :math:`17 - 18 + 7 = 6 = 2 \\times 3`." +msgstr "Med :math:`3` komponenter blir antalet ytor :math:`17 - 18 + 7 = 6 = 2 \\times 3`." + +msgid "``face_id``" +msgstr "``face_id``" + +msgid "Identifier of the face in the computed embedding." +msgstr "Identifierare för ytan i den beräknade inbäddningen." + +msgid "Identifier of the edge that borders the face." +msgstr "Identifierare för kanten som gränsar till ytan." + +msgid "``1`` when the edge borders the face on the left side." +msgstr "``1`` när kanten gränsar till ytan på vänster sida." + +msgid "``2`` when the edge borders the face on the right side." +msgstr "``2`` när kanten gränsar till ytan på höger sida." + +msgid "Non-planar graphs" +msgstr "Icke-plana grafer" + +msgid "Face extraction requires a planar graph. Subgraphs containing a :math:`K_5` or :math:`K_{3,3}` minor cannot be embedded without crossings; ``pgr_planarFaces`` raises ``ERROR: Graph is not planar`` in that case. The :doc:`pgr_isPlanar` documentation shows a non-planar subgraph of ``sampledata`` (edges highlighted in blue in the figure)." +msgstr "Ytextraktion kräver en plan graf. Delgrafer som innehåller en :math:`K_5`- eller :math:`K_{3,3}`-minor kan inte bäddas in utan korsningar; ``pgr_planarFaces`` utlöser då ``ERROR: Graph is not planar``. Dokumentationen för :doc:`pgr_isPlanar` visar en icke-plan delgraf av ``sampledata`` (kanterna är markerade blå i figuren)." + +msgid "Create a :math:`K_5` graph." +msgstr "Skapa en :math:`K_5`-graf." + +msgid "Test planarity: dont execute when is not planar." +msgstr "Testa planaritet: kör inte när grafen inte är plan." + +msgid "Or get an error: (not shown)" +msgstr "Eller få ett fel: (visas inte)" + +msgid "Planarity of loops" +msgstr "Planaritet för slingor" + +msgid "One loop graph with only one vertex:" +msgstr "Graf med en slinga och endast en hörnpunkt:" + +msgid "Two loop graph with only one vertex:" +msgstr "Graf med två slingor och endast en hörnpunkt:" + +msgid "Triangular graphs" +msgstr "Triangulära grafer" + +msgid "Triangular graph (no duplicate edges)" +msgstr "Triangulär graf (inga duplicerade kanter)" + +msgid "Six rows are returned: :math:`2 \\times 3` edges." +msgstr "Sex rader returneras: :math:`2 \\times 3` kanter." + +msgid ":math:`face\\_id = 1` is the interior face." +msgstr ":math:`face\\_id = 1` är den inre ytan." + +msgid ":math:`face\\_id = 2` is the exterior face. face." +msgstr ":math:`face\\_id = 2` är den yttre ytan." + +msgid "Each edge lists ``1`` on one face and ``2`` on the other." +msgstr "Varje kant listar ``1`` på den ena ytan och ``2`` på den andra." + +msgid "Triangular graph (duplicate edges)" +msgstr "Triangulär graf (duplicerade kanter)" + +msgid ":doc:`pgr_isPlanar`" +msgstr ":doc:`pgr_isPlanar`" + +msgid "Boost Graph Library: `Planar Face Traversal `__" +msgstr "Boost Graph Library: `Planar Face Traversal `__" + +msgid "Boost Graph Library: `Boost: Boyer Myrvold planarity `__" +msgstr "Boost Graph Library: `Boost: Boyer Myrvold-planaritet `__" + +msgid "Wikipedia: `Planar graph `__" +msgstr "Wikipedia: `Plan graf `__" + +msgid "Boyer, J. M. and Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity Algorithms by Edge Addition. Journal of Graph Algorithms and Applications, 8(3), 241-273." +msgstr "Boyer, J. M. och Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity Algorithms by Edge Addition. Journal of Graph Algorithms and Applications, 8(3), 241–273." + msgid "``pgr_prim``" msgstr "``pgr_prim``" @@ -11532,7 +12354,7 @@ msgid "``pgr_separateTouching`` - From touching geometries generates geometries msgstr "``pgr_separateTouching`` - Från berörande geometrier genereras geometrier som är korrekt anslutna vid ändpunkterna" 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." +msgstr "Detta är en hjälpfunktion för bearbetning av geometrier som berör varandra men inte delar exakta ändpunkter och som delas upp vid sina skärningspunkter för att förbättra nätverksanslutningen." msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" msgstr "pgr_separateTouching(`Kanter SQL`_, [``tolerance``, ``dryrun``])" @@ -11559,7 +12381,7 @@ 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 "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." +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 hörnpunkter i följd och tilldela varje hörnpunkt den minsta möjliga färg som inte används av dess grannar." 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." @@ -12231,7 +13053,7 @@ msgid "Two combinations" msgstr "Två kombinationer" 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)" +msgstr "Från punkt :math:`1` till hörnpunkt :math:`10` och från hörnpunkt :math:`6` till punkt :math:`3` med högerkörning. (med detaljer)" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_." @@ -12474,7 +13296,7 @@ msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right d msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf." 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." +msgstr "Från punkt :math:`1` till hörnpunkt :math:`10` och från hörnpunkt :math:`6` till punkt :math:`3` med körning på höger sida." 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)`." @@ -12698,11 +13520,14 @@ msgstr "Använd :doc:`pgr_findCloseEdges` i `Points 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 "Planar - Family of functions" +msgstr "Planar – funktionsfamilj" + msgid "Prim - Family of functions" msgstr "Prim - Familj av funktioner" 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." +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 oriktad graf. Detta innebär att den hittar en delmängd av kanterna som bildar ett träd som omfattar varje hörnpunkt och där den sammanlagda vikten för alla trädets kanter minimeras. Algoritmen bygger trädet en hörnpunkt i taget från en godtycklig starthörnpunkt och lägger i varje steg till den billigaste möjliga förbindelsen från trädet till en annan hörnpunkt." 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." @@ -12720,7 +13545,7 @@ msgid "Proposed Functions" msgstr "Föreslagna funktioner" msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr ":doc:`pgr_lineGraph` - Transformationsalgoritm för att skapa en linjegraf." msgid "Reference" msgstr "Referens" @@ -12746,56 +13571,80 @@ msgstr "pgRouting 4.1" msgid "pgRouting 4.0" msgstr "pgRouting 4.0" -#, fuzzy +msgid "pgRouting 4.0.2 Release Notes" +msgstr "Versionsinformation för pgRouting 4.0.2" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "För alla ärenden och pull requests som stängts i denna utgåva, se `GitHub-milstolpen för 4.0.2 `__" + +msgid "4.0.2 Summary of changes by function" +msgstr "4.0.2 Sammanfattning av ändringar per funktion" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "4.0.2 Bug Fixes" +msgstr "4.0.2 Felrättningar" + +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "`#3110 `__: pgr_dijkstraVia kastar std::bad_alloc när en nod inte finns" + +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "`#3091 `__: Vattendragsfunktioner saknar standardiserat beteende vid negativt avstånd" + msgid "pgRouting 4.0.1 Release Notes" -msgstr "Versionsinformation för pgRouting 3.0.1" +msgstr "Versionsinformation för pgRouting 4.0.1" -#, 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 `__" +msgstr "För alla ärenden och pull requests som stängts i denna utgåva, se `GitHub-milstolpen för 4.0.1 `__" + +msgid "Bug Fixes" +msgstr "Buggfixar" 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" -#, fuzzy msgid "`#3034 `__: metrics driver should not be using new" -msgstr "`#2934 `__: pgr_transitiveClosure" +msgstr "`#3034 `__: metricsdrivrutinen bör inte använda new" -#, fuzzy msgid "`#3010 `__: Performance issue with pgr_separateTouching()" -msgstr "`#2874 `__: Befordrad till officiell pgr_separateTouching i version 3.8" +msgstr "`#3010 `__: Prestandaproblem med pgr_separateTouching()" + +msgid "Code enhancements" +msgstr "Förbättringar av koden" -#, fuzzy msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" -msgstr "`#2802 `__: Omorganisering av kod för pgr_contraction" +msgstr "`#3044 `__: Kontrollera och rätta assert.hpp för cppcoreguidelines-explicit-virtual-functions" -#, fuzzy msgid "`#3040 `__: Check and fix cppcoreguidelines-virtual-class-destructor" -msgstr "`#1002 `__: Fixade problem med sammandragning:" +msgstr "`#3040 `__: Kontrollera och rätta cppcoreguidelines-virtual-class-destructor" -#, fuzzy msgid "`#3039 `__: Check and fix cppcoreguidelines-special-member-functions" -msgstr "`#2605 `__: Standardisera utdata för funktioner för spänningsträd" +msgstr "`#3039 `__: Kontrollera och rätta cppcoreguidelines-special-member-functions" -#, fuzzy msgid "`#3038 `__: Check and fix cppcoreguidelines-prefer-member-initializer" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3038 `__: Kontrollera och rätta cppcoreguidelines-prefer-member-initializer" -#, fuzzy msgid "`#3037 `__: Check and fix cppcoreguidelines-init-variables" -msgstr "`#2909 `__: pgr_edgeDisjointPaths" +msgstr "`#3037 `__: Kontrollera och rätta cppcoreguidelines-init-variables" -#, fuzzy msgid "`#3035 `__: Pass by reference on existing drivers" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3035 `__: Skicka genom referens i befintliga drivrutiner" -#, fuzzy msgid "Administration" -msgstr "Begränsningar" +msgstr "Administration" -#, fuzzy msgid "`#3031 `__: pgtap license to Creative commons and License texts standardization" -msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +msgstr "`#3031 `__: pgtap-licens till Creative Commons och standardisering av licenstexter" msgid "pgRouting 4.0.0 Release Notes" msgstr "pgRouting 4.0.0 Release Notes" @@ -12803,8 +13652,8 @@ msgstr "pgRouting 4.0.0 Release Notes" 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 "Build" -msgstr "Skapa" +msgid "4.0.0 Build" +msgstr "4.0.0 Bygge" msgid "C++ standard is std17" msgstr "C++-standarden är std17" @@ -12881,6 +13730,9 @@ msgstr "Doxygen hittas inte" msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "Om du inte vill bygga Doxygen-dokumentation: `-DBUILD_DOXY=OFF`" +msgid "Summary of changes by function" +msgstr "Sammanfattning av förändringar per funktion" + msgid "pgr_aStar" msgstr "pgr_aStar" @@ -12941,9 +13793,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13010,15 +13859,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "Funktioner som befordrats till tjänsteman" @@ -13742,6 +14585,9 @@ msgstr "Versionsinformation för pgRouting 3.7.2" 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 "Build" +msgstr "Skapa" + msgid "`#2713 `__: cmake missing some policies and min version" msgstr "`#2713 `__: cmake saknar vissa policyer och min-version" @@ -14123,9 +14969,6 @@ msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "Oklassificerade" -msgid "pgr_hawickCircuits" -msgstr "pgr_hawickCircuits" - msgid "Flow functions" msgstr "Flödesfunktioner" @@ -14286,10 +15129,10 @@ msgid "Traversal" msgstr "Traversal" msgid "pgr_depthFirstSearch(Multiple vertices)" -msgstr "pgr_depthFirstSearch(Multiple vertices)" +msgstr "pgr_depthFirstSearch(Flera hörn)" msgid "pgr_depthFirstSearch(Single vertex)" -msgstr "pgr_depthFirstSearch(Single vertex)" +msgstr "pgr_depthFirstSearch(Enskilt hörn)" msgid "pgRouting 3.2" msgstr "pgRouting 3.2" @@ -14706,7 +15549,7 @@ msgid "pgr_pickDeliver" msgstr "pgr_pickDeliver" msgid "Chinese Postman family" -msgstr "Chinese Postman family" +msgstr "Kinesiska postiljonsfamiljen" msgid "pgr_chinesePostman" msgstr "pgr_chinesePostman" @@ -14715,16 +15558,16 @@ msgid "pgr_chinesePostmanCost" msgstr "pgr_chinesePostmanCost" msgid "Breadth First Search family" -msgstr "Breadth First Search family" +msgstr "Bredden-först-sökningsfamiljen" msgid "Bellman Ford family" -msgstr "Bellman Ford family" +msgstr "Bellman–Ford-familjen" msgid "Moved to legacy" msgstr "Flyttat till legacy" msgid "pgr_labelGraph - Use the components family of functions instead." -msgstr "pgr_labelGraph - Use the components family of functions instead." +msgstr "pgr_labelGraph – använd i stället funktionsfamiljen components." msgid "Max flow - functions were renamed on v2.5.0" msgstr "Maxflöde - funktioner döptes om i v2.5.0" @@ -14819,9 +15662,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (proposed)" @@ -14979,7 +15819,7 @@ msgid "enhancement:" msgstr "förbättring:" msgid "pgr_version is now on SQL language" -msgstr "pgr_version is now on SQL language" +msgstr "pgr_version finns nu i SQL-språket" msgid "Breaking change on:" msgstr "Bryter förändring på:" @@ -15006,22 +15846,22 @@ msgid "pgr_lineGraph" msgstr "pgr_lineGraph" msgid "pgr_bdastar - use pgr_bdAstar instead" -msgstr "pgr_bdastar - use pgr_bdAstar instead" +msgstr "pgr_bdastar – använd i stället pgr_bdAstar" msgid "Renamed functions" msgstr "Omdöpta funktioner" msgid "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead" -msgstr "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead" +msgstr "pgr_maxFlowPushRelabel – använd i stället pgr_pushRelabel" msgid "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead" -msgstr "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead" +msgstr "pgr_maxFlowEdmondsKarp – använd i stället pgr_edmondsKarp" msgid "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead" -msgstr "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead" +msgstr "pgr_maxFlowBoykovKolmogorov – använd i stället pgr_boykovKolmogorov" msgid "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead" -msgstr "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead" +msgstr "pgr_maximumCardinalityMatching – använd i stället pgr_maxCardinalityMatch" msgid "Deprecated Function" msgstr "Föråldrad funktion" @@ -15072,7 +15912,7 @@ msgid "Deprecated signatures." msgstr "Föråldrade signaturer." msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" -msgstr "pgr_bddijkstra - use pgr_bdDijkstra instead" +msgstr "pgr_bddijkstra – använd i stället pgr_bdDijkstra" msgid "pgr_pointsToVids" msgstr "pgr_pointsToVids" @@ -15174,7 +16014,7 @@ msgid "pgr_contractGraph" msgstr "pgr_contractGraph" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" -msgstr "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" +msgstr "pgr_tsp – använd i stället pgr_TSP eller pgr_eucledianTSP" msgid "pgr_aStar - use pgr_aStar instead" msgstr "pgr_aStar - use pgr_aStar instead" @@ -15303,28 +16143,28 @@ msgid "pgr_withPointsCost(Many to Many)" msgstr "pgr_withPointsCost(Many to Many)" msgid "pgr_withPointsDD(single vertex)" -msgstr "pgr_withPointsDD(single vertex)" +msgstr "pgr_withPointsDD(enskilt hörn)" msgid "pgr_withPointsDD(multiple vertices)" -msgstr "pgr_withPointsDD(multiple vertices)" +msgstr "pgr_withPointsDD(flera hörn)" msgid "pgr_apspWarshall use pgr_floydWarshall instead" -msgstr "pgr_apspWarshall use pgr_floydWarshall instead" +msgstr "pgr_apspWarshall använder i stället pgr_floydWarshall" msgid "pgr_apspJohnson use pgr_Johnson instead" -msgstr "pgr_apspJohnson use pgr_Johnson instead" +msgstr "pgr_apspJohnson använder i stället pgr_Johnson" msgid "pgr_kDijkstraCost use pgr_dijkstraCost instead" -msgstr "pgr_kDijkstraCost use pgr_dijkstraCost instead" +msgstr "pgr_kDijkstraCost använder i stället pgr_dijkstraCost" msgid "pgr_kDijkstraPath use pgr_dijkstra instead" -msgstr "pgr_kDijkstraPath use pgr_dijkstra instead" +msgstr "pgr_kDijkstraPath använder i stället pgr_dijkstra" msgid "Renamed and Deprecated Function" msgstr "Omdöpta och utfasade funktioner" msgid "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix" -msgstr "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix" +msgstr "pgr_makeDistanceMatrix har bytt namn till _pgr_makeDistanceMatrix" msgid "pgRouting 2.1" msgstr "pgRouting 2.1" @@ -15342,28 +16182,28 @@ msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra(One to One)" 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." +msgstr "Funktionen pgr_alphaShape kan nu skapa bättre (multi)polygoner med hål och alfa-parameter." 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 "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." +msgstr "pgr_pointToEdgeNode – omvandlar en punktgeometri till ett vertex_id baserat på närmaste kant." 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." +msgstr "pgr_flipEdges – vänder kanterna i en matris av geometrier så att de ansluter från ände till ände." 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." +msgstr "pgr_textToPoints – omvandlar en sträng med x,y;x,y;...-positioner till punktgeometrier." msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." -msgstr "pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgstr "pgr_pointsToVids – omvandlar en matris av punktgeometrier till vertex-id:n." msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." -msgstr "pgr_pointsToDMatrix - Create a distance matrix from an array of points." +msgstr "pgr_pointsToDMatrix – skapar en avståndsmatris från en matris av punkter." 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." +msgstr "pgr_vidsToDMatrix – skapar en avståndsmatris från en matris av vertex_id." msgid "Added proposed functions from GSoc Projects:" msgstr "Lagt till föreslagna funktioner från GSoc Projects:" @@ -15687,13 +16527,13 @@ msgid "``reverse_category``" msgstr "``reverse_category``" msgid ":math:`x` coordinate of the starting vertex of the geometry." -msgstr ":math:`x` coordinate of the starting vertex of the geometry." +msgstr ":math:`x`-koordinaten för geometrins starthörn." 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 ":math:`y` coordinate of the ending vertex of the geometry." -msgstr ":math:`y` coordinate of the ending vertex of the geometry." +msgstr ":math:`y`-koordinaten för geometrins sluthörn." 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))``." @@ -16086,7 +16926,7 @@ msgid "On both sides for point **6**." msgstr "På båda sidor för punkt **6**." 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:" +msgstr "Representationen i databasen följer `Points SQL`_-beskrivningen och för detta exempel:" msgid "Driving side" msgstr "Körning på sidan" @@ -16251,22 +17091,66 @@ msgid "Depending on the name:" msgstr "Beroende på namnet:" msgid "pgr_withPoints is pgr_dijkstra **with points**" -msgstr "pgr_withPoints is pgr_dijkstra **with points**" +msgstr "pgr_withPoints är pgr_dijkstra **med punkter**" msgid "pgr_withPointsCost is pgr_dijkstraCost **with points**" -msgstr "pgr_withPointsCost is pgr_dijkstraCost **with points**" +msgstr "pgr_withPointsCost är pgr_dijkstraCost **med punkter**" msgid "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**" -msgstr "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**" +msgstr "pgr_withPointsCostMatrix är pgr_dijkstraCostMatrix **med punkter**" msgid "pgr_withPointsKSP is pgr_ksp **with points**" -msgstr "pgr_withPointsKSP is pgr_ksp **with points**" +msgstr "pgr_withPointsKSP är pgr_ksp **med punkter**" msgid "pgr_withPointsDD is pgr_drivingDistance **with points**" -msgstr "pgr_withPointsDD is pgr_drivingDistance **with points**" +msgstr "pgr_withPointsDD är pgr_drivingDistance **med punkter**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" -msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" +msgstr "pgr_withPointsvia är pgr_dijkstraVia **med punkter**" + +#~ msgid ":doc:`pgr_hawickCircuits`" +#~ msgstr ":doc:`pgr_hawickCircuits`" + +#~ msgid "end-before" +#~ msgstr "slut-innan" + +#~ 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 "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 "The algorithm implementation works only for directed graph" +#~ msgstr "Implementeringen av algoritmen fungerar endast för riktade grafer" + +#~ 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 "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 "C and C++0x compilers" +#~ msgstr "C- och C++0x-kompilatorer" + +#~ 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 "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 "CMake >= 3.12" +#~ msgstr "CMake >= 3.12" + +#, fuzzy +#~ msgid "Planar" +#~ msgstr "pgr_isPlanar" + +#, fuzzy +#~ msgid ":doc:`pgr_isPlanar` - Returns whether the graph is planar." +#~ msgstr "`true` när grafen är planar." + +#~ msgid "Planar Family" +#~ msgstr "Planar familj" #~ msgid "No changes yet" #~ msgstr "Inga ändringar ännu" @@ -16655,12 +17539,6 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Functionality might not change. (But still can)" #~ msgstr "Funktionaliteten kanske inte ändras. (Men kan fortfarande göra det)" -#~ msgid "Possible server crash" -#~ msgstr "Möjlig serverkrasch" - -#~ msgid "These functions might create a server crash" -#~ msgstr "Dessa funktioner kan orsaka en serverkrasch" - #~ msgid "Might need c/c++ coding." #~ msgstr "Kan behöva c/c++-kodning." @@ -17141,9 +18019,6 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "The Boost Graph Library (BGL). Version >= 1.56" #~ msgstr "Boost Graph Library (BGL). Version >= 1.56" -#~ msgid "CMake >= 3.2" -#~ msgstr "CMake >= 3.2" - #~ msgid "optional dependencies" #~ msgstr "valfria beroenden" diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index 0a81c236945..52058810722 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: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-10-24 01:29+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) \n" @@ -348,6 +348,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - 通过有限制的顶点/点路由。" msgid "Experimental" msgstr ":doc:`experimental`" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "实验性函数" @@ -2485,6 +2491,125 @@ msgstr "图必须是连通的。" msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "表示具有以下列的有向图的 Edges SQL" +#, fuzzy +msgid "Circuits - Family of Functions" +msgstr "Prim - 函数族" + +#, fuzzy +msgid "The following functions work on circuits of directed graphs." +msgstr "该函数适用于 **有向** 图。" + +#, fuzzy +msgid ":doc:`pgr_hawickCircuits` - Hawick's circuits algorithm." +msgstr "``pgr_hawickCircuits`` — 使用 Hawick 电路算法返回电路列表。" + +#, fuzzy +msgid "``start vid``" +msgstr "``start_vid``" + +msgid "A vertex of the circuits: - All the circuits that contain the vertex are returned. - When ``0`` all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``start vids``" +msgstr "``start_vid``" + +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" + +msgid "Vertices of the circuits: for each requested vertex: - All the circuits that contain the vertex are returned: - When empty all the circuits are returned in canonical order." +msgstr "" + +#, fuzzy +msgid "``min_depth``" +msgstr "``max_depth``" + +msgid "Minimum number of vertices in a circuit. * Exclude 2 edge circuits by increasing this number." +msgstr "" + +#, fuzzy +msgid "``9223372036854775807``" +msgstr ":math:`9223372036854775807`" + +#, fuzzy +msgid "Maximum number of vertices in a circuit." +msgstr "是作为输入给出的边数。" + +msgid "``self_loops``" +msgstr "" + +#, fuzzy +msgid "When ``true`` self loops are included in the results." +msgstr "如果为 ``true`` ，结果将包括路径中的点。" + +#, fuzzy +msgid "When ``false`` self loops are excluded from the results." +msgstr "当为 ``false`` 时，执行计算。" + +msgid "Self loops are included or excluded regardless of ``min_depth`` and ``max_depth``." +msgstr "" + +#, fuzzy +msgid "``u_turn_on_edge``" +msgstr "``U_turn_on_edge``" + +msgid "A u-turn on an edge is a 2 edge circuit that uses the same ``id`` on both directions of the edge." +msgstr "" + +#, fuzzy +msgid "When ``true``: u-turns are part of the results." +msgstr "当 ``true`` 时仅返回不违反限制的路径" + +msgid "When ``false``: u-turns are discarded when the circuit can be formed with two different edges; a u-turn is kept when it is the only option, that is, when the two vertices are connected by a single edge." +msgstr "" + +msgid "Self loops are not affected." +msgstr "" + +msgid "Sequential value starting from ``1``" +msgstr "从 ``1`` 开始的顺序值" + +msgid "``path_id``" +msgstr "``path_id``" + +msgid "Id of the circuit starting from ``1``" +msgstr "电路id从 ``1`` 开始" + +#, fuzzy +msgid "Relative position in the circuit. Has value **0** for the beginning of a circuit" +msgstr "路径中的相对位置。 路径开头的值为 **1** 。" + +msgid "Identifier of the starting vertex of the circuit." +msgstr "电路起始顶点的标识符。" + +msgid "Identifier of the ending vertex of the circuit." +msgstr "电路结束顶点的标识符。" + +msgid "``pred``" +msgstr "``pred``" + +#, fuzzy +msgid "Identifier of the node that precedes ``node`` in the circuit." +msgstr "电路起始顶点的标识符。" + +#, fuzzy +msgid "When ``node`` is the first node of the circuit, it has the same value as ``node``." +msgstr "当 `node` 等于 `start_vid` 时，它的值就是 `node` 。" + +msgid "Identifier of the node in the path from a vid to next vid." +msgstr "从 vid 到下一个 vid 的路径中节点的标识符。" + +#, fuzzy +msgid "Identifier of the edge used to arrive from ``pred`` to ``node``. - ``-1`` when :math:`depth = 0`." +msgstr "从 ``pred`` 到达 ``node`` 所使用的 ``edge`` 的标识符。" + +#, fuzzy +msgid "Cost to traverse from ``pred`` to ``node`` using ``edge``. - ``0`` when :math:`depth = 0`." +msgstr "从使用 ``edge`` 的 ``node`` 遍历到路径序列中的下一个节点的成本。" + +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost：Hawick 电路算法 `__" + msgid "Coloring - Family of functions" msgstr "着色 - 函数族" @@ -3043,9 +3168,6 @@ msgstr "返回集合 |result-spantree|" msgid ":math:`depth-1` is the depth of ``pred``" msgstr ":math:`depth-1` is the depth of ``pred``" -msgid "``pred``" -msgstr "``pred``" - msgid "Predecessor of ``node``." msgstr "``node`` 的前驱。" @@ -3070,6 +3192,10 @@ msgstr ":doc:`pgr_maxFlowMinCost` - 边缘上的流量和成本详细信息。" msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." msgstr ":doc:`pgr_maxFlowMinCost_Cost` - 仅最小成本计算。" +#, fuzzy +msgid ":doc:`pgr_maxWeightedMatch` - Calculates a maximum weighted matching in a graph." +msgstr ":doc:`pgr_maxCardinalityMatch` - 计算图中的最大基数匹配。" + msgid ":doc:`chinesePostmanProblem-family`" msgstr ":doc:`chinesePostmanProblem-family`" @@ -3124,9 +3250,32 @@ msgstr ":doc:`pgr_betweennessCentrality` - 使用布兰德斯算法计算相对 msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr ":doc:`pgr_withPoints` - 从/到图表上任意点的路线。" +#, fuzzy +msgid ":doc:`pgr_coreNumbers` - Computes the core number of each vertex." +msgstr ":doc:`pgr_dijkstraNearCost` - 获取最近顶点的成本。" + msgid ":doc:`TRSP-family`" msgstr ":doc:`TRSP-family`" +#, fuzzy +msgid ":doc:`planar-family`" +msgstr ":doc:`aStar-family`" + +#, fuzzy +msgid ":doc:`pgr_isPlanar` - Returns a boolean depending upon the planarity of the graph." +msgstr "``pgr_isPlanar`` — 根据图的平面性返回布尔值。" + +#, fuzzy +msgid ":doc:`pgr_makeBiconnectedPlanar` - Returns edges to add to a planar graph to make each connected component biconnected." +msgstr ":doc:`pgr_makeConnected` - 使图形连接的边的详细信息。" + +msgid ":doc:`pgr_planarFaces` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +#, fuzzy +msgid ":doc:`circuits-family`" +msgstr ":doc:`metrics-family`" + msgid "categories" msgstr "类别" @@ -3145,12 +3294,6 @@ msgstr ":doc:`pgr_dagShortestPath`" msgid ":doc:`pgr_edwardMoore`" msgstr ":doc:`pgr_edwardMoore`" -msgid "Planar Family" -msgstr "平面图算法族" - -msgid ":doc:`pgr_isPlanar`" -msgstr ":doc:`pgr_isPlanar`" - msgid "Miscellaneous Algorithms" msgstr "其他算法" @@ -3163,9 +3306,6 @@ msgstr ":doc:`pgr_stoerWagner`" msgid ":doc:`pgr_transitiveClosure`" msgstr ":doc:`pgr_transitiveClosure`" -msgid ":doc:`pgr_hawickCircuits`" -msgstr ":doc:`pgr_hawickCircuits`" - msgid "Flow - Family of functions" msgstr "Flow - 函数族" @@ -3557,7 +3697,96 @@ msgid "To see all issues & pull requests closed by this release see the `Github msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" #, fuzzy -msgid "Code enhancements" +msgid "4.1.0 Build" +msgstr "Bug修复" + +#, fuzzy +msgid "PostgreSQL:" +msgstr "``postgreSQL``" + +#, fuzzy +msgid "Minimum requirement: 14" +msgstr "最低要求：" + +msgid "Boost library:" +msgstr "" + +#, fuzzy +msgid "Minimum requirement: 1.74" +msgstr "最低要求：" + +msgid "cmake:" +msgstr "" + +#, fuzzy +msgid "Minimum requirement: 3.22" +msgstr "最低要求：" + +msgid "4.1.0 Summary of changes by function" +msgstr "" + +#, fuzzy +msgid "pgr_coreNumbers" +msgstr "pgr_nodeNetwork" + +msgid "New experimental function." +msgstr "新实验性功能。" + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" + +#, fuzzy +msgid "Fix the way it builds the graph" +msgstr "边不是图的一部分：" + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + +msgid "New optional parameters: ``min_depth``, ``max_depth``, ``self_loops`` and ``u_turn_on_edge``." +msgstr "" + +#, fuzzy +msgid "New signatures to select starting vertices." +msgstr "起始顶点的标识符数组。" + +#, fuzzy +msgid "Deprecated signature: ``pgr_hawickCircuits(text)``." +msgstr "已废弃的签名。" + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar" +msgstr "pgr_makeConnected" + +#, fuzzy +msgid "pgr_maxWeightedMatch" +msgstr "pgr_maxCardinalityMatch" + +#, fuzzy +msgid "pgr_planarFaces" +msgstr "pgr_isPlanar" + +#, fuzzy +msgid "4.1.0 New experimental functions." +msgstr "新实验性函数" + +#, fuzzy +msgid "`#3136 `__: pgr_maxWeightedMatch" +msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +msgid "`#3140 `__: pgr_makeBiconnectedPlanar" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +msgid "`#3142 `__: pgr_coreNumbers" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +msgid "`#3143 `__: pgr_planarFaces" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +msgid "4.1.0 Code enhancements" msgstr "代码改进" #, fuzzy @@ -3604,22 +3833,41 @@ msgstr "`#2683 `__: pgr_trsp msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "`#2683 `__: pgr_trsp" -msgid "Bug Fixes" +#, fuzzy +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +msgid "`#3131 `__: binaryBreadthFirstSearch: Integrate into existing process/driver pair" +msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +msgid "`#3154 `__: betweennessCentrality: use allpairs/process and driver" +msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +msgid "`#3163 `__: KSP & KSP WithPoints Use ShortestPath driver files" +msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +msgid "`#3170 `__: pgr_hawickCircuits: wrong Boost function referenced" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +msgid "4.1.0 Bug Fixes" msgstr "Bug修复" #, fuzzy msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" msgstr "`#2683 `__: pgr_trsp" -msgid "Summary of changes by function" -msgstr "" - -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +#, fuzzy +msgid "4.1.0 Requirements" +msgstr "代码改进" #, fuzzy -msgid "Fix the way it builds the graph" -msgstr "边不是图的一部分：" +msgid "`#3120 `__: Up min requirements: Boost to 1.74 Postgres to 14 cmake to 3.22." +msgstr "`#1850 `__: 将 Boost 最低版本更改为 1.56" msgid "All releases" msgstr "所有版本" @@ -6032,9 +6280,6 @@ msgstr ":doc:`pgr_withPoints`" msgid "Returns set of |generic-result|" msgstr "返回 |generic-result| 的集合" -msgid "``path_id``" -msgstr "``path_id``" - msgid "Path identifier." msgstr "路径标识符。" @@ -6190,25 +6435,22 @@ msgstr "编译依赖" msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "为了能够编译 pgRouting，请确保满足以下依赖项：" -msgid "C and C++0x compilers" -msgstr "C 和 C++0x编译器" - -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 "C++ standard" +msgstr "" -msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" -msgstr "使用 Boost 1.75 进行编译需要具有 C++ 14 标准支持的 C++ 编译器" +msgid "C++17" +msgstr "" #, fuzzy -msgid "Postgresql version >= 13" +msgid "Postgresql version >= 14" msgstr "PostgreSQL version 9.3" #, fuzzy -msgid "The Boost Graph Library (BGL) >= 1.56.0" +msgid "The Boost Graph Library (BGL) >= 1.74.0" msgstr "Boost 图库 (BGL)。 版本 >= 1.56" #, fuzzy -msgid "CMake >= 3.12" +msgid "CMake >= 3.22" msgstr "CMake >= 3.2" msgid "For user's documentation" @@ -6480,7 +6722,7 @@ msgid "Individuals (in alphabetical order)" 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" +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, Mayur Galhate, 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 "Corporate Sponsors (in alphabetical order)" @@ -7211,9 +7453,6 @@ msgstr "结果列更改：删除了 ``seq``" msgid "Version 2.5.0" msgstr "版本2.5.0" -msgid "New experimental function." -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 "那些属于多于一个双连通分量的顶点被称为关节点，或者等效地称为割点。关节点是指那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。" @@ -7965,9 +8204,6 @@ msgstr "返回 |result-1-1-no-seq| 的集合" msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" msgstr "返回集合 ``(seq, node, edge, cost, agg_cost)``" -msgid "Sequential value starting from ``1``" -msgstr "从 ``1`` 开始的顺序值" - 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`` 表示路径的最后一个节点。" @@ -8394,9 +8630,6 @@ msgstr "绿色节点为断头节点。" msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." msgstr "节点 :math:`3` 是节点 :math:`1` 收缩后的死结节点。" -msgid "``ARRAY[`` |ANY-INTEGER| ``]``" -msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" - msgid "**Empty**" msgstr "**Empty**" @@ -8853,20 +9086,351 @@ msgstr "边线 :math:`1 \\rightarrow 3` 包含成本值及被收缩节点信息 msgid "Create the contracted graph." msgstr "创建收缩图。" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "pgr_cuthillMckeeOrdering`` - 实验性" +#, fuzzy +msgid "``pgr_coreNumbers`` - Experimental" +msgstr "``pgr_pickDeliver`` - 实验性" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" -msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" +msgid "``pgr_coreNumbers`` - Computes the core number of each vertex in an undirected graph using k-core decomposition." +msgstr "" -msgid "Version 3.4.0" -msgstr "版本 3.4.0" +#, fuzzy +msgid "Version 4.1.0" +msgstr "Version 4.0.0" -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 "The **core number** of a vertex is the largest value :math:`k` such that the vertex **belongs to the** :math:`k`-core of the graph." +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." -msgstr "顶点的搜索顺序基本上是广度优先，只不过在每一步中，相邻的顶点会按照度数递增的顺序排列在队列中。" +msgid "The :math:`k`-core of a graph is the maximal subgraph in which every vertex has degree at least :math:`k` within that subgraph. K-core decomposition iteratively removes vertices of degree less than :math:`k` until no such vertices remain, increasing :math:`k` at each stage. The process assigns one core number to every vertex." +msgstr "" + +msgid "The core number says how deeply a vertex sits inside the graph:" +msgstr "" + +msgid "Core :math:`1` vertices are peeled in the first step. They are terminal nodes of the peeled graph, adjacent to at most one other vertex in the induced subgraph." +msgstr "" + +msgid "Core :math:`2` vertices survive that step. They lie on cycles, or on the chains joining them." +msgstr "" + +msgid "Core :math:`3` and above mark dense regions where every vertex keeps three or more neighbors however much of the graph is peeled away." +msgstr "" + +msgid "Parallel edges between the same pair of vertices are collapsed into a single edge before the peeling starts, so edge multiplicity does not inflate core numbers." +msgstr "" + +msgid "Three parallel edges between two vertices give both vertices core :math:`1`, the same as a single edge." +msgstr "" + +msgid "Self loop: a vertex is not a neighbor of its own vertex, so it is dropped before peeling and does not contribute to that vertex's degree." +msgstr "" + +msgid "A vertex whose only edge is a self loop has no real neighbors left, So the core number is 0." +msgstr "" + +#, fuzzy +msgid "Loops and parallel edges are removed." +msgstr "相邻边被移除。" + +#, fuzzy +msgid "All vertices are kept" +msgstr "所有车辆都是平等的。" + +#, fuzzy +msgid "Costs are ignored" +msgstr ":math:`0` 值被忽略" + +msgid "Each vertex receives exactly one core number" +msgstr "" + +#, fuzzy +msgid "Results:" +msgstr "结果" + +#, fuzzy +msgid "Number of returned rows: :math:`|V|`." +msgstr "所需路径的数量。" + +#, fuzzy +msgid "Ordered by ``node`` ascending." +msgstr "``node`` 升序" + +msgid "No rows returned when no edges found. Emits a ``NOTICE``" +msgstr "" + +#, fuzzy +msgid "Running time: :math:`O(|E| + |E| + |V| log |V|)`" +msgstr "运行时间： :math:`O(E * (E + V * logV))`" + +msgid "Loop and parallel removal: :math:`O(|E|)`" +msgstr "" + +#, fuzzy +msgid "Peeling algorithm: :math:`O(|E|)`" +msgstr "运行时间： :math:`O(|V|)`" + +#, fuzzy +msgid "Sorting: :math:`|V| log |V|`" +msgstr "最坏的情况： :math:`O(| V | * | E |)`" + +#, fuzzy +msgid "pgr_coreNumbers(`Edges SQL`_)" +msgstr "pgr_prim(`Edges SQL`_)" + +#, fuzzy +msgid "Returns set of ``(seq, node, core)``" +msgstr "返回 ``(seq, node)`` 的集合" + +#, fuzzy +msgid "Core numbers on a subgraph of :doc:`sampledata`" +msgstr "下面是 :doc:`sampledata` 的子图：" + +msgid "Vertices are colored by core number in the diagrams below: ``deepskyblue`` for core :math:`1` and ``green`` for core :math:`2`." +msgstr "" + +msgid "All returned vertices have core number :math:`1`; they belong to the 1-core but not to any higher core." +msgstr "" + +#, fuzzy +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." +msgstr "设 :math:`v` 和 :math:`u` 为图上的节点：" + +msgid "Vertices :math:`6`, :math:`7`, and :math:`10` have higher degree here, but peeling degree-:math:`1` vertices first removes the entire subgraph before a 2-core can form." +msgstr "" + +msgid "The following diagram shows edges :math:`\\{1, \\ldots, 7\\}` from :doc:`sampledata`; every vertex label shows ``node (core)``." +msgstr "" + +msgid "The next subgraph uses edges :math:`\\{1, 2, 3, 4\\}`, the same set as the main example of :doc:`pgr_betweennessCentrality`. Every vertex is still core :math:`1` because the structure is a tree-like path with terminal nodes at :math:`5` and :math:`15`." +msgstr "" + +msgid "K-core peeling (illustration)" +msgstr "" + +msgid "On edges :math:`id < 10`, vertices :math:`5` and :math:`15` are removed first because they have degree :math:`1`. After further peeling, vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` remain as the 2-core (shown in green below)." +msgstr "" + +#, fuzzy +msgid "Sequential value starting from 1." +msgstr "从 **1** 开始的顺序值。" + +#, fuzzy +msgid "``core``" +msgstr "``color``" + +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "" + +msgid "The examples of this section are based on the :doc:`sampledata` network." +msgstr "本节的示例基于 :doc:`sampledata` 网络。" + +msgid "Sample network overview" +msgstr "" + +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." +msgstr "" + +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" +msgstr "" + +msgid "Both functions use the same ``Edges SQL`` format. The betweenness example on edges :math:`\\{1, 2, 3, 4\\}` measures shortest-path influence; core numbers measure peeling resilience." +msgstr "" + +#, fuzzy +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" +msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图。" + +#, fuzzy +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." +msgstr "设 :math:`v` 和 :math:`u` 为图上的节点：" + +msgid "Vertex :math:`6` has degree :math:`3` in this subgraph but still has core :math:`1`, because removing :math:`5` and :math:`15` first leaves no subgraph where every vertex has degree at least :math:`2`." +msgstr "" + +msgid "Compare with :doc:`pgr_betweennessCentrality` on the same edges: vertex :math:`6` has the highest betweenness, but core number does not rank vertices by path importance." +msgstr "" + +msgid "Subgraph with core-:math:`2` vertices" +msgstr "" + +msgid "Adding edges :math:`5` through :math:`9` connects the inner vertices into a 2-core. The undirected layout below shows the same network." +msgstr "" + +#, fuzzy +msgid "Undirected view of the sample network" +msgstr "无向simple图" + +#, fuzzy +msgid "2) Core numbers on edges :math:`id < 10`" +msgstr "边集 :math:`E`" + +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." +msgstr "" + +msgid "Vertices :math:`1`, :math:`3`, :math:`5`, :math:`15`, and :math:`16` are attached by tree-like branches and remain core :math:`1`." +msgstr "" + +msgid "Edge :math:`8` (between :math:`7` and :math:`11`) closes a cycle with edges :math:`4`, :math:`2`, and :math:`5`, which is why the inner four vertices survive peeling." +msgstr "" + +msgid "Filtering results in SQL" +msgstr "" + +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." +msgstr "" + +#, fuzzy +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" +msgstr "3) 从 :math:`12` 到 :math:`10` 的路径" + +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." +msgstr "" + +msgid "Use it to export only the hub vertices for further analysis." +msgstr "" + +#, fuzzy +msgid "Full sample graph" +msgstr "有向simple图" + +msgid "4) Core numbers on all edges" +msgstr "" + +msgid "The full network has :math:`17` vertices and maximum core number :math:`2`." +msgstr "" + +msgid "Terminal branches (vertices :math:`1`, :math:`2`, :math:`3`, :math:`4`, :math:`5`, :math:`9`, :math:`13`, :math:`14`) remain core :math:`1`." +msgstr "" + +msgid "The 2-core is vertices :math:`6`, :math:`7`, :math:`8`, :math:`10`, :math:`11`, :math:`12`, :math:`15`, :math:`16` and :math:`17`: the central block of the city network. Vertex :math:`9` hangs off :math:`8` by edge :math:`14` alone, so it is peeled first and stays core :math:`1`." +msgstr "" + +#, fuzzy +msgid "Small graphs" +msgstr "主图" + +msgid "5) Single edge (two terminal nodes)" +msgstr "" + +msgid "Both endpoints have core number :math:`1`." +msgstr "" + +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." +msgstr "" + +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." +msgstr "" + +#, fuzzy +msgid "6) Triangle (all vertices core :math:`2`)" +msgstr "顶点集 :math:`V`" + +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." +msgstr "" + +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." +msgstr "" + +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." +msgstr "" + +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" +msgstr "" + +#, fuzzy +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." +msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`\\{5, 10, 12\\}`" + +msgid "This is the 2-core heart of example 2) before branches are attached." +msgstr "" + +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." +msgstr "" + +msgid "8) Star graph (hub and spokes, all core :math:`1`)" +msgstr "" + +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." +msgstr "" + +msgid "The hub has degree :math:`4`, but removing the four leaves leaves an isolated vertex, so the hub never belongs to a 2-core." +msgstr "" + +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." +msgstr "" + +#, fuzzy +msgid "Empty edge set" +msgstr "容量边缘" + +msgid "9) No edges in the SQL query" +msgstr "" + +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." +msgstr "" + +#, fuzzy +msgid "No exception is raised." +msgstr "迁移部分已创建。" + +msgid "Core numbers and planarity" +msgstr "" + +msgid "Vertices with higher core numbers often lie in densely connected regions. The workflow below computes core numbers, filters the 2-core, and checks whether the subgraph can be drawn without edge crossings using :doc:`pgr_isPlanar`." +msgstr "" + +#, fuzzy +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" +msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图。" + +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" +msgstr "" + +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." +msgstr "" + +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." +msgstr "" + +msgid "Planarity and core number measure different properties: a graph can be planar while still having a mix of core-:math:`1` and core-:math:`2` vertices." +msgstr "" + +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" +msgstr "" + +msgid "The examples above reach at most core :math:`2`, because the :doc:`sampledata` network has degeneracy :math:`2`. Higher cores need a denser graph. In the complete graph :math:`K_4` every vertex is adjacent to the other three, so no vertex can ever be peeled at :math:`k \\leq 3` and the whole graph is its own 3-core." +msgstr "" + +msgid "Every vertex has degree :math:`3`, so nothing is removed while peeling at :math:`k = 1`, :math:`2` or :math:`3`: all four vertices have core :math:`3`." +msgstr "" + +msgid "In general the complete graph :math:`K_n` has core number :math:`n - 1` for every vertex, which is the maximum possible core number on :math:`n` vertices." +msgstr "" + +#, fuzzy +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." +msgstr "本节的示例基于 :doc:`sampledata` 网络。" + +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" +msgstr "" + +#, fuzzy +msgid "`Wikipedia: Degeneracy (graph theory) `__" +msgstr "`维基百科:支配树 `__" + +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +msgstr "pgr_cuthillMckeeOrdering`` - 实验性" + +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" + +msgid "Version 3.4.0" +msgstr "版本 3.4.0" + +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 "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 "The implementation is for **undirected** graphs." msgstr "该实现适用于 **无向** 图。" @@ -8919,15 +9483,24 @@ msgstr "pgr_dagShortestPath(组合)" 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 "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +#, fuzzy +msgid "This implementation can only be used with a directed graph with no cycles i.e. directed acyclic 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 "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +#, fuzzy +msgid "Process is valid for weighted directed acyclic graphs only." msgstr "该过程仅对加权有向无环图有效。 否则它会抛出警告。" +msgid "Avoids one edge cycle: `reverse_cost` column is used when :math:`cost < 0`." +msgstr "" + +#, fuzzy +msgid "If the graph is not DAG, will throw a PostgreSQL `ERROR`." +msgstr "当图形为两方时" + msgid "The `agg_cost` the non included values `(v, v)` is `0`" msgstr "`agg_cost`中未包括的值`(v, v)` 的成本为`0`" @@ -8964,6 +9537,9 @@ msgstr "从顶点 :math:`\\{5, 10\\}` 到顶点 :math:`11`" msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "在 **无向** 图上，从顶点 :math:`\\{5, 15\\} ` 到顶点 :math:`\\{11, 17\\}`" +msgid "`reverse_cost` column is used when :math:`cost < 0` to avoid edge cycle." +msgstr "" + msgid "Return columns" msgstr "返回列" @@ -9273,9 +9849,6 @@ msgstr "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "在 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" -msgid "The examples of this section are based on the :doc:`sampledata` network." -msgstr "本节的示例基于 :doc:`sampledata` 网络。" - msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **有向** 图" @@ -9732,6 +10305,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - 经过顶点列表的路径。" +#, fuzzy +msgid "Version 4.0.2" +msgstr "Version 4.0.0" + +msgid "Fix: bad alloc" +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}` 之间找到最短路径。" @@ -9816,6 +10396,15 @@ msgstr ":doc:`dijkstra-family`。" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "pgr_drivingDistance(Single vertex)" @@ -9879,9 +10468,6 @@ msgstr "``true`` 时，节点只会出现在最近的 ``start_vid`` 列表中。 msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "``false`` 时，类似于使用单个顶点签名的多次调用。" -msgid "end-before" -msgstr "" - msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "在无向图上，从顶点 :math:`{11, 16\\}` 开始的距离为 :math:`3.0`" @@ -9891,10 +10477,6 @@ msgstr "``pgr_edgeColoring`` - 实验性" msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "``pgr_edgeColoring`` - 返回无向图和无环图的边着色" -#, fuzzy -msgid "Version 4.1.0" -msgstr "Version 4.0.0" - #, fuzzy msgid "Output columns standardized to |result_edge_color|" msgstr "输出列是 |ksp-result|" @@ -10549,49 +11131,113 @@ msgstr "``pgr_hawickCircuits`` - 实验性" msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr "``pgr_hawickCircuits`` — 使用 Hawick 电路算法返回电路列表。" -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 "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Heath A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs." +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 "Circuit enumeration in directed graphs, where circuits with parallel arcs are enumerated." +msgstr "" -msgid "The algorithm implementation works only for directed graph" -msgstr "该算法实现仅适用于有向图" +msgid "Each combination of parallel arcs is returned as a different circuit." +msgstr "" -msgid "It is a variation of Johnson's algorithm for circuit enumeration." -msgstr "这是对于电路枚举的一种格式，基于Johnson的算法。" +#, fuzzy +msgid "Works for directed graphs." +msgstr "适用于无向图。" msgid "The algorithm outputs the distinct circuits present in the graph." msgstr "该算法输出图中存在的不同电路。" +msgid "The circuits are elementary: a vertex is not repeated within a circuit, except the starting vertex that closes the circuit." +msgstr "" + +msgid "When no initial vertices are given all circuits are in canonical order of the vertices insertion of the graph: A circuit with vertices ``u``, ``v``: ``u`` starting circuits containing ``v`` will not be listed on ``start_vid = v`` rows." +msgstr "" + +msgid "Different edge ordering gives different canonical ordering." +msgstr "" + +msgid "When start vertices are given, all circuits are returned for each requested vertex it contains, and the results are grouped by ``start_vid``." +msgstr "" + +msgid "The graph passed to the algorithm discard parallel edges with higher costs." +msgstr "" + msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "时间复杂度： :math:`O((V + E) (c + 1))`" -msgid ":math:`|c|` is the number of circuits in the graph." +#, fuzzy +msgid "where :math:`|V|` is the number of vertices in the graph." +msgstr ":math:`|V|` 是图中的顶点数。" + +#, fuzzy +msgid "where :math:`|c|` is the number of circuits in the graph." msgstr ":math:`|c|` 是图中电路的数目。" msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "pgr_hawickCircuits(`Edges SQL`_)" -msgid "Circuits present in the pgRouting :doc:`sampledata`" +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vid** [, **options**])" +msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" + +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_, **start vids** [, **options**])" +msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" + +#, fuzzy +msgid "**options:** ``[min_depth, max_depth, self_loops, u_turn_on_edge]``" +msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" + +#, fuzzy +msgid "Returns set of |circuits-result|" +msgstr "返回 |tsp-result| 的集合" + +msgid "All circuits" +msgstr "" + +#, fuzzy +msgid "pgr_hawickCircuits(`Edges SQL`_ [, **options**])" +msgstr "pgr_hawickCircuits(`Edges SQL`_)" + +#, fuzzy +msgid "All the circuits of the pgRouting :doc:`sampledata`" msgstr "pgRouting :doc:`sampledata` 中存在的电路" -msgid "Id of the circuit starting from ``1``" -msgstr "电路id从 ``1`` 开始" +msgid "When no starting vertex is given, all the circuits of the graph are returned. The result has 94 rows, one ``path_id`` for each circuit:" +msgstr "" -msgid "Relative position in the path. Has value ``0`` for beginning of the path" -msgstr "在路径中的相对位置。数值 ``0`` 表示路径的起点" +#, fuzzy +msgid "Single start vertex" +msgstr "单个顶点" -msgid "Identifier of the starting vertex of the circuit." -msgstr "电路起始顶点的标识符。" +#, fuzzy +msgid "Circuits that contain vertex :math:`10`" +msgstr "收缩顶点 :math:`3`," -msgid "Identifier of the ending vertex of the circuit." -msgstr "电路结束顶点的标识符。" +#, fuzzy +msgid "Many start vertices" +msgstr "从 **多** 起始顶点" -msgid "Identifier of the node in the path from a vid to next vid." -msgstr "从 vid 到下一个 vid 的路径中节点的标识符。" +#, fuzzy +msgid "Circuits that contain vertices :math:`\\{10, 11\\}`" +msgstr "从顶点 :math:`5` 到顶点 :math:`\\{7, 11\\}`" -msgid "`Boost: Hawick Circuit Algorithm `__" +msgid "The examples use the following table ``c_example``, that represent a cul_de_sac where the exit is on vertex :math:`5` and the vehicle is on vertex :math:`1` but pointing at the wrong direction of the exit." +msgstr "" + +#, fuzzy +msgid "All possible ways to return to vertex :math:`1`." +msgstr "具有根顶点 :math:`5` 的支配树" + +msgid "Exclude self loops." +msgstr "" + +#, fuzzy +msgid "Exclude self loops and U-turn on the same edge." +msgstr "无自循环，无平行边。" + +#, fuzzy +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "`Boost：Hawick 电路算法 `__" msgid "``pgr_isPlanar`` - Experimental" @@ -11197,26 +11843,114 @@ msgstr "从原始图中添加边" msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "将所有不参与折线图过程的边添加到新表中" -msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "一些获取边新标识符的管理任务" +msgid "Some administrative tasks to get new identifiers for the edges" +msgstr "一些获取边新标识符的管理任务" + +msgid "Add the newly calculated edges" +msgstr "添加新计算的边" + +msgid "Using the routing graph" +msgstr "使用路由图" + +msgid "When using this method for routing with soft restrictions there will be uturns" +msgstr "当使用这种方法进行具有软限制的路由时，将会出现 uturn" + +msgid "Routing from :math:`5` to :math:`1`" +msgstr "路由从 :math:`5` 到 :math:`1`" + +msgid "https://en.wikipedia.org/wiki/Line_graph" +msgstr "https://en.wikipedia.org/wiki/Line_graph" + +msgid "https://en.wikipedia.org/wiki/Complete_graph" +msgstr "https://en.wikipedia.org/wiki/Complete_graph" + +#, fuzzy +msgid "``pgr_makeBiconnectedPlanar`` - Experimental" +msgstr "``pgr_makeConnected`` - 实验性" + +msgid "``pgr_makeBiconnectedPlanar`` — Returns the set of edges needed to make each connected component of a planar graph biconnected." +msgstr "" + +msgid "``pgr_makeBiconnectedPlanar`` identifies the missing edges that need to be added to each connected component of an existing planar graph to make those components biconnected, while ensuring the graph remains planar." +msgstr "" + +msgid "A graph is considered **biconnected** if it is connected and cannot be broken into disconnected pieces by deleting any single vertex (it has no articulation points). A planar graph is one that can be drawn in two-dimensional space with no two of its edges crossing." +msgstr "" + +msgid "If the graph is not connected it will treat each component as an idividual graph." +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_makeConnected` to connect all components." +msgstr "使用 :doc:`pgr_connectedComponents`" + +#, fuzzy +msgid "When the graph is not planar it will emit an ``ERROR``" +msgstr "当图形为两方时" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first." +msgstr ":doc:`pgr_isPlanar`" + +#, fuzzy +msgid "All vertices are kept." +msgstr "所有车辆都是平等的。" + +#, fuzzy +msgid "Costs are ignored." +msgstr ":math:`0` 值被忽略" + +msgid "Returns a list of all new edges needed to make biconected graphs out of each connected component." +msgstr "" + +#, fuzzy +msgid "Empty results when the graph is already biconnected planar." +msgstr "当图形不是平面时为 `false`。" + +#, fuzzy +msgid "Running time: :math:`O(|V| + |E| + R \\log R)` for each component" +msgstr "运行时间： :math:`O(E * (E + V * logV))`" + +#, fuzzy +msgid ":math:`R` is the number of returned edges." +msgstr ":math:`k` 是使用的颜色数量。" + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "pgr_makeConnected(`Edges SQL`_)" + +msgid "Returns set of |result-component-make|" +msgstr "返回结果 |result-component-make|" + +#, fuzzy +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "连接图形所需的边线列表。" -msgid "Add the newly calculated edges" -msgstr "添加新计算的边" +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." +msgstr "" -msgid "Using the routing graph" -msgstr "使用路由图" +msgid "When a graph contains multiple disconnected components, each component is processed independently. Components (2,4) and (13,14) are already biconnected (0 articulation points) and require no new edges." +msgstr "" -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "当使用这种方法进行具有软限制的路由时，将会出现 uturn" +#, fuzzy +msgid "4-vertex path graph." +msgstr "准备图" -msgid "Routing from :math:`5` to :math:`1`" -msgstr "路由从 :math:`5` 到 :math:`1`" +#, fuzzy +msgid "Create a 4-vertex tree graph." +msgstr "创建收缩图。" -msgid "https://en.wikipedia.org/wiki/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +#, fuzzy +msgid "Get the edges needed to have biconnected planar graph." +msgstr "连接图形所需的边线列表。" -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +#, fuzzy +msgid "Adding the edges to the graph" +msgstr "图的桥" + +#, fuzzy +msgid "`Boost: make_biconnected_planar `__" +msgstr "`Boost: 使图连通 `__" msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - 实验性" @@ -11236,9 +11970,6 @@ msgstr "该算法在计算中不考虑遍历成本。" msgid "pgr_makeConnected(`Edges SQL`_)" msgstr "pgr_makeConnected(`Edges SQL`_)" -msgid "Returns set of |result-component-make|" -msgstr "返回结果 |result-component-make|" - msgid "List of edges that are needed to connect the graph." msgstr "连接图形所需的边线列表。" @@ -11450,6 +12181,50 @@ msgstr "RETURNS FLOAT" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "从source(s) 到target(s)的最小成本最大流量" +#, fuzzy +msgid "``pgr_maxWeightedMatch`` - Experimental" +msgstr "``pgr_dagShortestPath`` - 实验性" + +#, fuzzy +msgid "``pgr_maxWeightedMatch`` — Calculates a maximum weighted matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` — 计算图中的最大基数匹配。." + +msgid "A **maximum weighted matching** in a graph is a matching where the sum of the weights of selected edges is maximized." +msgstr "" + +msgid "Each vertex is matched with at most one other vertex." +msgstr "" + +msgid "Maximizes the total edge weight sum." +msgstr "" + +#, fuzzy +msgid "There may be many maximum weighted matchings." +msgstr "可能有很多最大匹配。" + +#, fuzzy +msgid "Calculates one possible maximum weighted matching in a graph." +msgstr "计算图中一种可能的最大基数匹配。" + +#, fuzzy +msgid "Running time: :math:`O(V^3)`." +msgstr "运行时间： :math:`O( V ^ 3)`" + +#, fuzzy +msgid "pgr_maxWeightedMatch(`Edges SQL`_)" +msgstr "pgr_maxCardinalityMatch(`Edges SQL`_)" + +#, fuzzy +msgid "Set of |result-edge|" +msgstr "返回集合 |result-edge|" + +msgid "Maximum weighted matching on a custom 5-vertex graph." +msgstr "" + +#, fuzzy +msgid "`Boost: maximum_weighted_matching `__" +msgstr "`Boost: 最大匹配 `__" + msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - 实验性" @@ -11645,6 +12420,169 @@ msgstr "找到的 **lc101** 的最佳解是行程时间：828.94" msgid "This implementation's travel time: 854.54" msgstr "此实施的行程时间：854.54" +#, fuzzy +msgid "``pgr_planarFaces`` - Experimental" +msgstr "``pgr_isPlanar`` - 实验性" + +msgid "``pgr_planarFaces`` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + +msgid "In a planar embedding, the graph is drawn in the plane so that edges meet only at vertices. A face is a maximal connected region of the plane bounded by edges." +msgstr "" + +msgid "Every bounded face is a cycle of edges enclosing an interior region. The exterior face, also called the unbounded face, is the region outside the outermost cycle." +msgstr "" + +msgid "Once an embedding is fixed, each undirected edge has a left and a right side when walked in the direction the embedding assigns around each vertex." +msgstr "" + +msgid "In a connected planar undirected graph, each edge separates exactly two faces, so it contributes one row on the left and one on the right." +msgstr "" + +msgid "``pgr_planarFaces`` returns those incidences: ``face_id`` names the face, ``edge_id`` is the border edge, and ``side`` is ``1`` (left) or ``2`` (right) relative to the embedding." +msgstr "" + +msgid "The function first computes a planar embedding with the Boyer-Myrvold planarity test, then walks faces with Boost ``planar_face_traversal``.i" +msgstr "" + +#, fuzzy +msgid "Loops and paralell edges are preserved." +msgstr "相邻边被移除。" + +msgid "They are used to determine the existance of an edge" +msgstr "" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first" +msgstr ":doc:`pgr_isPlanar`" + +msgid "The result has one row per edge-side pair" +msgstr "" + +msgid "Graph with :math:`|E|` edges yields :math:`2|E|` rows." +msgstr "" + +msgid "Number of faces: * Obeys Euler's formula: :math:`|V| - |E| + |F| = 2` * On a graph with :math:`C` components: :math:`|V| - |E| + |F| = 2C`." +msgstr "" + +#, fuzzy +msgid "Running time: :math:`O(|E| + |V|)`" +msgstr "运行时间： :math:`O(E + V)`" + +#, fuzzy +msgid "pgr_planarFaces(`Edges SQL`_)" +msgstr "pgr_isPlanar(`Edges SQL`)" + +#, fuzzy +msgid "Returns set of ``(seq, face_id, edge_id, side)``" +msgstr "返回集合 ``(seq, vertex_id, idom)``" + +#, fuzzy +msgid "Faces of the full :doc:`sampledata` graph" +msgstr "pgRouting :doc:`sampledata` 中存在的电路" + +msgid "The query returns **36 rows**, twice the **18** edges in ``edges``, consistent with :math:`2|E|`." +msgstr "" + +msgid "``face_id`` runs from **1** through **7** on this network; each id is one face of the embedding, including the unbounded **exterior face** (here ``face_id = 1`` borders the outer layout of the city block)." +msgstr "" + +msgid "Every ``edge_id`` appears **twice**, once with ``side = 1`` and once with ``side = 2``." +msgstr "" + +msgid "Rows follow the counterclockwise walk of each face in the computed embedding." +msgstr "" + +msgid "Have :math:`3` components then number if faces = :math:`17 - 18 + 7 = 6 = 2 \\times 3`." +msgstr "" + +#, fuzzy +msgid "``face_id``" +msgstr "``end_id``" + +#, fuzzy +msgid "Identifier of the face in the computed embedding." +msgstr "边的第一个端点顶点的标识符。" + +#, fuzzy +msgid "Identifier of the edge that borders the face." +msgstr "作为桥的边的标识符。" + +#, fuzzy +msgid "``1`` when the edge borders the face on the left side." +msgstr "当图中不存在边时为 :math:`-1`" + +#, fuzzy +msgid "``2`` when the edge borders the face on the right side." +msgstr "当图中不存在边时为 :math:`-1`" + +msgid "Non-planar graphs" +msgstr "" + +msgid "Face extraction requires a planar graph. Subgraphs containing a :math:`K_5` or :math:`K_{3,3}` minor cannot be embedded without crossings; ``pgr_planarFaces`` raises ``ERROR: Graph is not planar`` in that case. The :doc:`pgr_isPlanar` documentation shows a non-planar subgraph of ``sampledata`` (edges highlighted in blue in the figure)." +msgstr "" + +#, fuzzy +msgid "Create a :math:`K_5` graph." +msgstr "创建收缩图。" + +msgid "Test planarity: dont execute when is not planar." +msgstr "" + +msgid "Or get an error: (not shown)" +msgstr "" + +msgid "Planarity of loops" +msgstr "" + +#, fuzzy +msgid "One loop graph with only one vertex:" +msgstr "单一孤立路段组成的网络组件。" + +#, fuzzy +msgid "Two loop graph with only one vertex:" +msgstr "单一孤立路段组成的网络组件。" + +#, fuzzy +msgid "Triangular graphs" +msgstr "主图" + +msgid "Triangular graph (no duplicate edges)" +msgstr "" + +msgid "Six rows are returned: :math:`2 \\times 3` edges." +msgstr "" + +msgid ":math:`face\\_id = 1` is the interior face." +msgstr "" + +msgid ":math:`face\\_id = 2` is the exterior face. face." +msgstr "" + +msgid "Each edge lists ``1`` on one face and ``2`` on the other." +msgstr "" + +msgid "Triangular graph (duplicate edges)" +msgstr "" + +msgid ":doc:`pgr_isPlanar`" +msgstr ":doc:`pgr_isPlanar`" + +#, fuzzy +msgid "Boost Graph Library: `Planar Face Traversal `__" +msgstr "`Boost: A* search `__" + +#, fuzzy +msgid "Boost Graph Library: `Boost: Boyer Myrvold planarity `__" +msgstr "`Boost: Boyer-Myrvold 算法 `__" + +#, fuzzy +msgid "Wikipedia: `Planar graph `__" +msgstr "维基百科: `Line Graph `__" + +msgid "Boyer, J. M. and Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity Algorithms by Edge Addition. Journal of Graph Algorithms and Applications, 8(3), 241-273." +msgstr "" + msgid "``pgr_prim``" msgstr "``pgr_prim``" @@ -13027,6 +13965,10 @@ msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 函数" 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\\}` 的路线。" +#, fuzzy +msgid "Planar - Family of functions" +msgstr "Prim - 函数族" + msgid "Prim - Family of functions" msgstr "Prim - 函数族" @@ -13076,6 +14018,41 @@ msgstr "pgRouting 4.0" msgid "pgRouting 4.0" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.0.2 Release Notes" +msgstr "pgRouting 3.0.1 发布说明" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +#, fuzzy +msgid "4.0.2 Bug Fixes" +msgstr "Bug修复" + +#, fuzzy +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "`#1640 `__: pgr_withPoints 在 points_sql 为空时失败" + +#, fuzzy +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "`#2683 `__: pgr_trsp" + #, fuzzy msgid "pgRouting 4.0.1 Release Notes" msgstr "pgRouting 3.0.1 发布说明" @@ -13084,6 +14061,9 @@ msgstr "pgRouting 3.0.1 发布说明" 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 "Bug Fixes" +msgstr "Bug修复" + #, fuzzy msgid "`#2966 `__: pgr_withPoints does not pick optimal route when fraction = 1" msgstr "`#2683 `__: pgr_trsp" @@ -13096,6 +14076,10 @@ msgstr "`#2683 `__: pgr_trsp msgid "`#3010 `__: Performance issue with pgr_separateTouching()" msgstr "`#2874 `__: pgr_separateTouching 在3.8版本中被提升为官方函数" +#, fuzzy +msgid "Code enhancements" +msgstr "代码改进" + #, fuzzy msgid "`#3044 `__: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions" msgstr "`#2802 `__:pgr_contraction 函数进行了代码重构" @@ -13136,7 +14120,8 @@ msgstr "pgRouting 3.1.0 发布说明" 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 "Build" +#, fuzzy +msgid "4.0.0 Build" msgstr "构建" msgid "C++ standard is std17" @@ -13223,6 +14208,9 @@ msgstr "" msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`" msgstr "" +msgid "Summary of changes by function" +msgstr "" + msgid "pgr_aStar" msgstr "pgr_aStar" @@ -13283,9 +14271,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13352,15 +14337,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "正式版功能函数" @@ -14265,6 +15244,9 @@ msgstr "pgRouting 3.7.2 发布说明" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列表 `__" +msgid "Build" +msgstr "构建" + #, fuzzy msgid "`#2713 `__: cmake missing some policies and min version" msgstr "`#2713 `__ cMake 缺少一些策略和最低版本要求" @@ -14686,9 +15668,6 @@ msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "未分类" -msgid "pgr_hawickCircuits" -msgstr "pgr_hawickCircuits" - msgid "Flow functions" msgstr "流程函数" @@ -15412,9 +16391,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (提议)" @@ -16885,6 +17861,44 @@ msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" +#~ msgid ":doc:`pgr_hawickCircuits`" +#~ msgstr ":doc:`pgr_hawickCircuits`" + +#~ 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 "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 algorithm implementation works only for directed graph" +#~ msgstr "该算法实现仅适用于有向图" + +#~ msgid "It is a variation of Johnson's algorithm for circuit enumeration." +#~ msgstr "这是对于电路枚举的一种格式，基于Johnson的算法。" + +#~ msgid "Relative position in the path. Has value ``0`` for beginning of the path" +#~ msgstr "在路径中的相对位置。数值 ``0`` 表示路径的起点" + +#~ msgid "C and C++0x compilers" +#~ msgstr "C 和 C++0x编译器" + +#~ 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 "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +#~ msgstr "使用 Boost 1.75 进行编译需要具有 C++ 14 标准支持的 C++ 编译器" + +#, fuzzy +#~ msgid "Planar" +#~ msgstr "pgr_isPlanar" + +#, fuzzy +#~ msgid ":doc:`pgr_isPlanar` - Returns whether the graph is planar." +#~ msgstr "当图形是平面时为 `true`。" + +#~ msgid "Planar Family" +#~ msgstr "平面图算法族" + #, fuzzy #~ msgid "pgRouting 4.0.0-alpha1 Release Notes" #~ msgstr "pgRouting 4.0.0 发布说明"