diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index 19236fa461d..b097b5de4ea 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-09-28 18:14+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 "" @@ -3047,6 +3053,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 +3107,24 @@ 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 "categories" msgstr "" @@ -3119,12 +3143,6 @@ msgstr "" msgid ":doc:`pgr_edwardMoore`" msgstr "" -msgid "Planar Family" -msgstr "" - -msgid ":doc:`pgr_isPlanar`" -msgstr "" - msgid "Miscellaneous Algorithms" msgstr "" @@ -3527,7 +3545,72 @@ 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 "" + +#, 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 +3646,25 @@ 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 "4.1.0 Bug Fixes" +msgstr "" -msgid "Fix the way it builds the graph" +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" @@ -5996,22 +6085,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 +6358,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 +7081,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 "" @@ -8612,409 +8695,719 @@ 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" -msgstr "" +#, fuzzy +msgid "``core``" +msgstr "``color``" -msgid "Making **start_vids** the same as **end_vids**" +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." msgstr "" -msgid "`Boost: DAG shortest paths `__" +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Sample network overview" msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" - -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." msgstr "" -msgid "Error messages adjustment." +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" msgstr "" -msgid "New signature with only Edges SQL." +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 "Calculates the degree of the vertices of an undirected graph" +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" msgstr "" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." msgstr "" -msgid "A loop contributes 2 to a vertex's degree." +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 "A vertex with degree 0 is called an isolated 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 "Isolated vertex is not part of the result" +msgid "Subgraph with core-:math:`2` vertices" msgstr "" -msgid "Vertex not participating on the subgraph is considered and 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 "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgid "Undirected view of the sample network" msgstr "" -msgid "The code can be used as base code for the particular application requirements." +msgid "2) Core numbers on edges :math:`id < 10`" msgstr "" -msgid "No ordering is performed." +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." msgstr "" -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +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 "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +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 "RETURNS SETOF |result-degree|" +msgid "Filtering results in SQL" msgstr "" -msgid "Edges" +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." msgstr "" -msgid "example" +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" msgstr "" -msgid "Get the degree of the vertices defined on the edges table" +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." msgstr "" -msgid "Edges and Vertices" +msgid "Use it to export only the hub vertices for further analysis." msgstr "" -msgid "Extracting the vertex information" +msgid "Full sample graph" msgstr "" -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgid "4) Core numbers on all edges" 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 full network has :math:`17` vertices and maximum core number :math:`2`." msgstr "" -msgid "Calculate the degree of the nodes:" +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 "`Vertex SQL`_" +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 "`Vertex SQL`_ as described below" +msgid "Small graphs" msgstr "" -msgid "``dryrun``" -msgstr "``dryrun``" - -msgid "When true do not process and get in a NOTICE the resulting query." +msgid "5) Single edge (two terminal nodes)" msgstr "" -msgid "For the `Edges and Vertices`_ signature:" +msgid "Both endpoints have core number :math:`1`." msgstr "" -msgid "For the `Edges`_ signature:" +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." msgstr "" -msgid "Vertex SQL" +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." msgstr "" -msgid "``in_edges``" -msgstr "``in_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgid "6) Triangle (all vertices core :math:`2`)" msgstr "" -msgid "When missing, ``out_edges`` must exist." +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." msgstr "" -msgid "``out_edges``" -msgstr "``out_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." msgstr "" -msgid "When missing, ``in_edges`` must exist." +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." msgstr "" -msgid "Vertex identifier" +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" msgstr "" -msgid "``degree``" -msgstr "``degree``" +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." +msgstr "" -msgid "Number of edges that are incident to the vertex ``id``" +msgid "This is the 2-core heart of example 2) before branches are attached." msgstr "" -msgid "Degree of a loop" +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." msgstr "" -msgid "Using the `Edges`_ signature." +msgid "8) Star graph (hub and spokes, all core :math:`1`)" msgstr "" -msgid "Using the `Edges and Vertices`_ signature." +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." msgstr "" -msgid "Degree of a sub graph" +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 "For the following is a subgraph of the :doc:`sampledata`:" +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." msgstr "" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgid "Empty edge set" msgstr "" -msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgid "9) No edges in the SQL query" msgstr "" -msgid "The vertices not participating on the edge are considered isolated" +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." msgstr "" -msgid "their degree is 0 in the subgraph and" +msgid "No exception is raised." msgstr "" -msgid "their degree is not shown in the output." +msgid "Core numbers and planarity" msgstr "" -msgid "Using a vertex table" +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 "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" msgstr "" -msgid "Extract the vertex information and save into a table:" +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" msgstr "" -msgid "Dry run execution" +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." msgstr "" -msgid "The results can be used as base code to make a refinement based on the backend development needs." +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 "Finding dead ends" +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" msgstr "" -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgid "The 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 "The degree of a dead end is 1." +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 "Finding linear vertices" +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 degree of a linear vertex is 2." +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." msgstr "" -msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" msgstr "" -msgid ":doc:`pgr_extractVertices`" +msgid "`Wikipedia: Degeneracy (graph theory) `__" msgstr "" -msgid "``pgr_depthFirstSearch`` - Proposed" +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" -msgid "Version 3.3.0" +msgid "Version 3.4.0" msgstr "" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgid "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 implementation works for both **directed** and **undirected** graphs." +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 "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" msgstr "" -msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgid "where :math:`|V|` is the number of vertices," msgstr "" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgid ":math:`m` is the maximum degree of the vertices in the graph." msgstr "" -msgid "The returned values are ordered in ascending order of `start_vid`." +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" msgstr "" -msgid "Depth First Search Running time: :math:`O(E + V)`" +msgid "Returns set of |result_node_order|" msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "Graph ordering of pgRouting :doc:`sampledata`" msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "Returns set of ``(seq, node)``" msgstr "" -msgid "**options:** ``[directed, max_depth]``" +msgid "Sequence of the order starting from 1." msgstr "" -msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgid "New ordering in reverse order." msgstr "" -msgid "`Boost: Depth First Search `__" +msgid "`Boost: Cuthill-McKee Ordering `__" msgstr "" -msgid "`Boost: Undirected DFS `__" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" -msgid "`Wikipedia: Depth First Search algorithm `__" +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +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 "Version 3.5.0" +msgid "pgr_dagShortestPath(Combinations)" msgstr "" -msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +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 "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgid "This implementation can only be used with a directed graph with no cycles i.e. directed acyclic graph." msgstr "" -msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +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 "Version 3.1.0" +msgid "Process is valid for weighted directed acyclic graphs only." msgstr "" -msgid "pgr_dijkstra(Combinations)" +msgid "Avoids one edge cycle: `reverse_cost` column is used when :math:`cost < 0`." msgstr "" -msgid "Version 2.2.0" +msgid "If the graph is not DAG, will throw a PostgreSQL `ERROR`." msgstr "" -msgid "pgr_dijkstra(One to Many)" +msgid "The `agg_cost` the non included values `(v, v)` is `0`" msgstr "" -msgid "pgr_dijkstra(Many to One)" +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "pgr_dijkstra(Many to Many)" +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" msgstr "" -msgid "Signature change on pgr_dijkstra(One to One)" +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:" +msgstr "" + +msgid "`Vertex SQL`_" +msgstr "" + +msgid "`Vertex SQL`_ as described below" +msgstr "" + +msgid "``dryrun``" +msgstr "``dryrun``" + +msgid "When true do not process and get in a NOTICE the resulting query." +msgstr "" + +msgid "For the `Edges and Vertices`_ signature:" +msgstr "" + +msgid "For the `Edges`_ signature:" +msgstr "" + +msgid "Vertex SQL" +msgstr "" + +msgid "``in_edges``" +msgstr "``in_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgstr "" + +msgid "When missing, ``out_edges`` must exist." +msgstr "" + +msgid "``out_edges``" +msgstr "``out_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgstr "" + +msgid "When missing, ``in_edges`` must exist." +msgstr "" + +msgid "Vertex identifier" +msgstr "" + +msgid "``degree``" +msgstr "``degree``" + +msgid "Number of edges that are incident to the vertex ``id``" +msgstr "" + +msgid "Degree of a loop" +msgstr "" + +msgid "Using the `Edges`_ signature." +msgstr "" + +msgid "Using the `Edges and Vertices`_ signature." +msgstr "" + +msgid "Degree of a sub graph" +msgstr "" + +msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgstr "" + +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr "" + +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgstr "" + +msgid "The vertices not participating on the edge are considered isolated" +msgstr "" + +msgid "their degree is 0 in the subgraph and" +msgstr "" + +msgid "their degree is not shown in the output." +msgstr "" + +msgid "Using a vertex table" +msgstr "" + +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgstr "" + +msgid "Extract the vertex information and save into a table:" +msgstr "" + +msgid "Dry run execution" +msgstr "" + +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgstr "" + +msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgstr "" + +msgid "Finding dead ends" +msgstr "" + +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgstr "" + +msgid "The degree of a dead end is 1." +msgstr "" + +msgid "Finding linear vertices" +msgstr "" + +msgid "The degree of a linear vertex is 2." +msgstr "" + +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "" + +msgid ":doc:`pgr_extractVertices`" +msgstr "" + +msgid "``pgr_depthFirstSearch`` - Proposed" +msgstr "" + +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "" + +msgid "Version 3.3.0" +msgstr "" + +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "" + +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "" + +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgstr "" + +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgstr "" + +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgstr "" + +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "" + +msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgstr "" + +msgid "The returned values are ordered in ascending order of `start_vid`." +msgstr "" + +msgid "Depth First Search Running time: :math:`O(E + V)`" +msgstr "" + +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "" + +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "" + +msgid "**options:** ``[directed, max_depth]``" +msgstr "" + +msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." +msgstr "" + +msgid "`Boost: Depth First Search `__" +msgstr "" + +msgid "`Boost: Undirected DFS `__" +msgstr "" + +msgid "`Wikipedia: Depth First Search algorithm `__" +msgstr "" + +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgstr "" + +msgid "Version 3.5.0" +msgstr "" + +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "" + +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgstr "" + +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgstr "" + +msgid "Version 3.1.0" +msgstr "" + +msgid "pgr_dijkstra(Combinations)" +msgstr "" + +msgid "Version 2.2.0" +msgstr "" + +msgid "pgr_dijkstra(One to Many)" +msgstr "" + +msgid "pgr_dijkstra(Many to One)" +msgstr "" + +msgid "pgr_dijkstra(Many to Many)" +msgstr "" + +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -9032,9 +9425,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 +9881,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 +9971,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 "" @@ -9650,9 +10055,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 "" @@ -10964,6 +11366,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 +11456,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 +11666,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 +11897,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 +13335,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 +13386,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 +13434,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 +13467,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 +13545,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 +13608,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -12983,15 +13674,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 +14400,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 "" @@ -14792,9 +15480,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -16240,3 +16925,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..e5a3145f072 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-09-28 18:14+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" @@ -3052,6 +3058,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 +3113,28 @@ 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 "" + msgid "categories" msgstr "Categorías" @@ -3124,12 +3153,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" @@ -3534,7 +3557,82 @@ 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." + +#, 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 +3679,33 @@ 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 "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" @@ -6016,22 +6125,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 +6404,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 +7127,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." @@ -8638,131 +8744,473 @@ 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 vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." -msgstr "Básicamente, se asigna a los vértices un orden de búsqueda breadth-first, con la salvedad de que, en cada paso, los vértices adyacentes se colocan en la cola por orden creciente de grado." +msgid "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." -msgstr "La implementación es para grafos **no dirigidos**." +msgid "The core number says how deeply a vertex sits inside the graph:" +msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." -msgstr "Los problemas de minimización del ancho de banda se consideran problemas NP-completos." +msgid "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|)`" -msgstr "Tiempo de ejecución es: :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," -msgstr "donde :math:`|V|` es el número de vértices," +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." -msgstr ":math:`m` es el grado máximo de los vértices en el grafo." +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`_)" -msgstr "pgr_cuthillMckeeOrdering(`SQL de aristas`_)" +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|" -msgstr "Regresa el conjunto de |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`" -msgstr "Ordenamiento del grafo de los :doc:`sampledata` de pgRouting" +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)``" -msgstr "Regresa el conjunto de ``(seq, node)``" +#, fuzzy +msgid "Loops and parallel edges are removed." +msgstr "Sin auto ciclos ni aristas paralelas." -msgid "Sequence of the order starting from 1." -msgstr "Valor secuencial a partir de 1." +#, fuzzy +msgid "All vertices are kept" +msgstr "Todos los vehículos son iguales." -msgid "New ordering in reverse order." -msgstr "Nuevo ordenamiento es en orden inverso." +#, fuzzy +msgid "Costs are ignored" +msgstr "Costos negativos son ignorados." -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "`Boost: Ordernamiento Cuthill-McKee `__" +msgid "Each vertex receives exactly one core number" +msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "`Wikipedia: Ordenamiento Cuthill-McKee `__" +#, fuzzy +msgid "Results:" +msgstr "Resultados" -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr "``pgr_dagShortestPath`` - Experimental" +#, fuzzy +msgid "Number of returned rows: :math:`|V|`." +msgstr "Cantidad de rutas requeridas." -msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." -msgstr "``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de caminos más cortos DAG implementado por Boost.Graph." +#, fuzzy +msgid "Ordered by ``node`` ascending." +msgstr "``node`` ascendente" -msgid "pgr_dagShortestPath(Combinations)" -msgstr "pgr_dagShortestPath(Combinaciones)" +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``)." -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``)." +#, fuzzy +msgid "Running time: :math:`O(|E| + |E| + |V| log |V|)`" +msgstr "Tiempo de ejecución: :math:`O(E * (E + V * logV))`" -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 "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." -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." +#, fuzzy +msgid "Peeling algorithm: :math:`O(|E|)`" +msgstr "Tiempo de ejecución: :math:`O(|V|)`" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." -msgstr "El proceso solo es válido para grafos acíclicos dirigidos ponderados, de lo contrario lanzará advertencias." +#, fuzzy +msgid "Sorting: :math:`|V| log |V|`" +msgstr "Peor caso: :math:`O(| V | * | E |)`" -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`" +#, fuzzy +msgid "pgr_coreNumbers(`Edges SQL`_)" +msgstr "pgr_prim(`SQL de aristas`_)" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" -msgstr "El ``agg_cost`` de los valores no incluídos ``(u, v)`` es :math: `\\infty`" +#, fuzzy +msgid "Returns set of ``(seq, node, core)``" +msgstr "Regresa el conjunto de ``(seq, node)``" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" -msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V + E))`" +#, fuzzy +msgid "Core numbers on a subgraph of :doc:`sampledata`" +msgstr "Para el siguiente sub-grafo de :doc:`sampledata`:" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destino**)" +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**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destinos**)" +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**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destino**)" +#, 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 "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destinos**)" +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`_)" -msgstr "pgr_dagShortestPath(`SQL de aristas`_, `SQL de combinaciones`_)" +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" -msgstr "Del vértice :math:`5` al vértice :math:`11` en un grafo **dirigido**" +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\\}`" -msgstr "Desde el vértice :math:`5` a los vértices :math:`\\{ 7, 11\\}`" +msgid "K-core peeling (illustration)" +msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" -msgstr "Desde los vértices :math:`\\{5, 10\\}` al vértice :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" -msgstr "Desde los vértices :math:`\\{5, 15\\}` a los vértices :math:`\\{11, 17\\}` en un grafo **no dirigido**" +#, fuzzy +msgid "Sequential value starting from 1." +msgstr "Valor secuencial a partir de **1**." -msgid "Return columns" -msgstr "Columnas de Resultados" +#, fuzzy +msgid "``core``" +msgstr "``color``" -msgid "Making **start_vids** the same as **end_vids**" -msgstr "Haciendo **vértices de salida** igual que **vértices destino**" +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "" -msgid "`Boost: DAG shortest paths `__" -msgstr "`Boost: Caminos mas cortos en DAG `__" +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 "https://en.wikipedia.org/wiki/Topological_sorting" -msgstr "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Sample network overview" +msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +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." + +msgid "The implementation is for **undirected** graphs." +msgstr "La implementación es para grafos **no dirigidos**." + +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "Los problemas de minimización del ancho de banda se consideran problemas NP-completos." + +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`" + +msgid "where :math:`|V|` is the number of vertices," +msgstr "donde :math:`|V|` es el número de vértices," + +msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgstr ":math:`m` es el grado máximo de los vértices en el grafo." + +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "pgr_cuthillMckeeOrdering(`SQL de aristas`_)" + +msgid "Returns set of |result_node_order|" +msgstr "Regresa el conjunto de |result_node_order|" + +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "Ordenamiento del grafo de los :doc:`sampledata` de pgRouting" + +msgid "Returns set of ``(seq, node)``" +msgstr "Regresa el conjunto de ``(seq, node)``" + +msgid "Sequence of the order starting from 1." +msgstr "Valor secuencial a partir de 1." + +msgid "New ordering in reverse order." +msgstr "Nuevo ordenamiento es en orden inverso." + +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Ordernamiento Cuthill-McKee `__" + +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Ordenamiento Cuthill-McKee `__" + +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimental" + +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgstr "``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de caminos más cortos DAG implementado por Boost.Graph." + +msgid "pgr_dagShortestPath(Combinations)" +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``)." + +#, 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." + +#, 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`" + +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgstr "El ``agg_cost`` de los valores no incluídos ``(u, v)`` es :math: `\\infty`" + +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V + E))`" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destino**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destinos**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destino**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destinos**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, `SQL de combinaciones`_)" + +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgstr "Del vértice :math:`5` al vértice :math:`11` en un grafo **dirigido**" + +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "Desde el vértice :math:`5` a los vértices :math:`\\{ 7, 11\\}`" + +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +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" + +msgid "Making **start_vids** the same as **end_vids**" +msgstr "Haciendo **vértices de salida** igual que **vértices destino**" + +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: Caminos mas cortos en DAG `__" + +msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgstr "https://en.wikipedia.org/wiki/Topological_sorting" + +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 "``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el número de aristas incidentes en el vértice." @@ -9058,9 +9506,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 +9966,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 +10057,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)" @@ -9681,10 +10142,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|" @@ -10977,38 +11434,126 @@ msgstr "" msgid "Which can be removed" msgstr "" -msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" -msgstr "" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgstr "" + +msgid "Complete routing graph" +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 "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." -msgid "Complete routing graph" -msgstr "" +#, fuzzy +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "pgr_makeConnected(`SQL de aristas`_)" -msgid "Add edges from the original graph" -msgstr "" +msgid "Returns set of |result-component-make|" +msgstr "Regresa conjunto de |result-component-make|" -msgid "Add all the edges that are not involved in the line graph process to the new table" -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 "Some administrative tasks to get new identifiers for the edges" +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." msgstr "" -msgid "Add the newly calculated edges" +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 "Using the routing graph" -msgstr "" +#, fuzzy +msgid "4-vertex path graph." +msgstr "Prepara el grafo" -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "" +#, fuzzy +msgid "Create a 4-vertex tree graph." +msgstr "Crear el grafo contraído." -msgid "Routing from :math:`5` to :math:`1`" -msgstr "" +#, 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/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +#, fuzzy +msgid "Adding the edges to the graph" +msgstr "Los puentes del grafo" -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +#, fuzzy +msgid "`Boost: make_biconnected_planar `__" +msgstr "`Boost: conectar `__" msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - Experimental" @@ -11028,9 +11573,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 +11783,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 +12022,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 +13555,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 +13608,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 +13651,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 +13666,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 +13708,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 +13787,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 +13850,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13121,15 +13916,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 +14667,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" @@ -15025,9 +15817,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 +17294,26 @@ 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 "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..342c52b4acc 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-09-28 18:14+0000\n" +"PO-Revision-Date: 2026-09-30 02:39+0000\n" "Last-Translator: Teramoto Ikuhiro \n" "Language-Team: Japanese \n" "Language: ja\n" @@ -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 "実験段階関数" @@ -1088,7 +1094,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 +1125,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,220 +1164,223 @@ 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 "" @@ -3110,6 +3119,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 +3174,25 @@ 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 "" + msgid "categories" msgstr "" @@ -3184,12 +3212,6 @@ msgstr "" msgid ":doc:`pgr_edwardMoore`" msgstr "" -msgid "Planar Family" -msgstr "" - -msgid ":doc:`pgr_isPlanar`" -msgstr "" - msgid "Miscellaneous Algorithms" msgstr "" @@ -3594,7 +3616,74 @@ 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 "" + +#, 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 +3719,25 @@ 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 "4.1.0 Bug Fixes" +msgstr "" -msgid "Fix the way it builds the graph" +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" @@ -6154,22 +6249,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 +6527,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)" @@ -7171,10 +7264,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 "" @@ -8851,144 +8940,465 @@ msgstr "" msgid "Create the contracted graph." msgstr "次のクエリを実行します。" -msgid "``pgr_cuthillMckeeOrdering`` - Experimental" +#, 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 "" -msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +#, 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 "Version 3.4.0" +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 "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 says how deeply a vertex sits inside 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 "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 implementation is for **undirected** graphs." +msgid "Core :math:`2` vertices survive that step. They lie on cycles, or on the chains joining them." msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +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 "The running time complexity is: :math:`O(m log(m)|V|)`" +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 "where :math:`|V|` is the number of vertices," +msgid "Three parallel edges between two vertices give both vertices core :math:`1`, the same as a single edge." msgstr "" -msgid ":math:`m` is the maximum degree of the vertices in the graph." +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 "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +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 |result_node_order|" +msgid "Loops and parallel edges are removed." msgstr "" -msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgid "All vertices are kept" msgstr "" #, fuzzy -msgid "Returns set of ``(seq, node)``" -msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" +msgid "Costs are ignored" +msgstr ":math:`0` 値は無視されます" + +msgid "Each vertex receives exactly one core number" +msgstr "" #, fuzzy -msgid "Sequence of the order starting from 1." -msgstr "開始ノードの識別子。" +msgid "Results:" +msgstr "結果として返却されるカラム" -msgid "New ordering in reverse order." +msgid "Number of returned rows: :math:`|V|`." msgstr "" -msgid "`Boost: Cuthill-McKee Ordering `__" +msgid "Ordered by ``node`` ascending." msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgid "No rows returned when no edges found. Emits a ``NOTICE``" msgstr "" -msgid "``pgr_dagShortestPath`` - Experimental" +msgid "Running time: :math:`O(|E| + |E| + |V| log |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 "Loop and parallel removal: :math:`O(|E|)`" msgstr "" -msgid "pgr_dagShortestPath(Combinations)" +msgid "Peeling algorithm: :math:`O(|E|)`" 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 "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 "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgid "Vertices are colored by core number in the diagrams below: ``deepskyblue`` for core :math:`1` and ``green`` for core :math:`2`." 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 "All returned vertices have core number :math:`1`; they belong to the 1-core but not to any higher core." msgstr "" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." msgstr "" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" +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 `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgid "The following diagram shows edges :math:`\\{1, \\ldots, 7\\}` from :doc:`sampledata`; every vertex label shows ``node (core)``." msgstr "" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +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 "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "p" +msgid "Sequential value starting from 1." +msgstr "**1** 始まりの順序値。" #, fuzzy -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "p" +msgid "``core``" +msgstr "``color``" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" -msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgid "Sample network overview" msgstr "" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." msgstr "" -msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +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 "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" msgstr "" -#, fuzzy -msgid "Return columns" -msgstr "結果として返却されるカラム" +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." +msgstr "" -msgid "Making **start_vids** the same as **end_vids**" +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 "`Boost: DAG shortest paths `__" +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 "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Subgraph with core-:math:`2` vertices" msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +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 "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgid "Undirected view of the sample network" msgstr "" -msgid "Error messages adjustment." +#, 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 "New signature with only Edges SQL." +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 "" + +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 "" + +#, fuzzy +msgid "Returns set of ``(seq, node)``" +msgstr "``(seq, node, cost, agg_cost)`` の1セットを返却します" + +#, fuzzy +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 "" + +#, 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." +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 "" + +#, fuzzy +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "p" + +#, fuzzy +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "p" + +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 "結果として返却されるカラム" + +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" @@ -9283,9 +9693,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 +10153,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 +10244,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 "" @@ -9907,10 +10330,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 "" @@ -11236,6 +11655,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 +11751,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 +11961,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 +12197,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 +13686,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 +13739,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 +13787,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 +13821,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 +13901,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 +13964,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13300,15 +14030,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 +14766,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 "" @@ -15124,9 +15851,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -16581,3 +17305,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..6632425f9f1 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-09-28 18:14+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 "" @@ -3058,6 +3064,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 +3123,27 @@ 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 "" + msgid "categories" msgstr "" @@ -3135,12 +3163,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 "" @@ -3545,7 +3567,73 @@ 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 "" + +#, 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 +3669,25 @@ 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 "4.1.0 Bug Fixes" +msgstr "" -msgid "Fix the way it builds the graph" +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" @@ -6104,24 +6198,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 +6474,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 +7210,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 "" @@ -8779,365 +8867,680 @@ 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 "" + +msgid "Sequential value starting from 1." msgstr "" #, fuzzy -msgid "Return columns" -msgstr "결과 컬럼" +msgid "``core``" +msgstr "``color``" -msgid "Making **start_vids** the same as **end_vids**" +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." msgstr "" -msgid "`Boost: DAG shortest paths `__" +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Sample network overview" msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" - -msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgid "Directed sample network. ``pgr_coreNumbers`` treats every edge as undirected, so ``cost`` and ``reverse_cost`` are not used in the calculation." msgstr "" -msgid "Error messages adjustment." +msgid "Comparing with :doc:`pgr_betweennessCentrality` on the same edges" msgstr "" -msgid "New signature with only Edges SQL." +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 "Calculates the degree of the vertices of an undirected graph" +msgid "1) Core numbers on edges :math:`\\{1, 2, 3, 4\\}`" msgstr "" -msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." msgstr "" -msgid "A loop contributes 2 to a vertex's degree." +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 "A vertex with degree 0 is called an isolated 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 "Isolated vertex is not part of the result" +msgid "Subgraph with core-:math:`2` vertices" msgstr "" -msgid "Vertex not participating on the subgraph is considered and 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 "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgid "Undirected view of the sample network" msgstr "" -msgid "The code can be used as base code for the particular application requirements." +msgid "2) Core numbers on edges :math:`id < 10`" msgstr "" -msgid "No ordering is performed." +msgid "Vertices :math:`6`, :math:`7`, :math:`10`, and :math:`11` have core :math:`2`." msgstr "" -msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +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 "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" +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 "RETURNS SETOF |result-degree|" +msgid "Filtering results in SQL" msgstr "" -msgid "Edges" +msgid "``pgr_coreNumbers`` always returns every vertex. To keep only the dense core, wrap the call in a standard SQL query." msgstr "" -msgid "example" +msgid "3) Vertices with core :math:`\\geq 2` on edges :math:`id < 10`" msgstr "" -msgid "Get the degree of the vertices defined on the edges table" +msgid "The ``WHERE core >= 2`` clause keeps only the 2-core vertices." msgstr "" -#, fuzzy -msgid "Edges and Vertices" -msgstr "색인과 표" - -msgid "Extracting the vertex information" +msgid "Use it to export only the hub vertices for further analysis." msgstr "" -msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgid "Full sample graph" 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 "4) Core numbers on all edges" msgstr "" -msgid "Calculate the degree of the nodes:" +msgid "The full network has :math:`17` vertices and maximum core number :math:`2`." msgstr "" -msgid "`Vertex SQL`_" +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 "`Vertex SQL`_ as described below" +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 "``dryrun``" -msgstr "``dryrun``" - -msgid "When true do not process and get in a NOTICE the resulting query." +msgid "Small graphs" msgstr "" -msgid "For the `Edges and Vertices`_ signature:" +msgid "5) Single edge (two terminal nodes)" msgstr "" -msgid "For the `Edges`_ signature:" +msgid "Both endpoints have core number :math:`1`." msgstr "" -msgid "Vertex SQL" +msgid "Edge :math:`1` from :doc:`sampledata` connects vertices :math:`5` and :math:`6`." msgstr "" -msgid "``in_edges``" -msgstr "``in_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgid "Each endpoint has degree :math:`1`, so both are peeled immediately at :math:`k = 1`." msgstr "" -msgid "When missing, ``out_edges`` must exist." +msgid "6) Triangle (all vertices core :math:`2`)" msgstr "" -msgid "``out_edges``" -msgstr "``out_edges``" - -msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgid "In a triangle every vertex has degree :math:`2`, so all three belong to the 2-core." msgstr "" -msgid "When missing, ``in_edges`` must exist." +msgid "The ``VALUES`` clause builds a minimal three-edge graph inline." msgstr "" -msgid "Vertex identifier" +msgid "No vertex can be peeled before :math:`k = 2`, so every core number is :math:`2`." msgstr "" -msgid "``degree``" -msgstr "``degree``" - -msgid "Number of edges that are incident to the vertex ``id``" +msgid "7) Square cycle from :doc:`sampledata` (all vertices core :math:`2`)" msgstr "" -msgid "Degree of a loop" +msgid "Edges :math:`\\{2, 4, 5, 8\\}` form a 4-cycle on vertices :math:`\\{6, 7, 10, 11\\}`." msgstr "" -msgid "Using the `Edges`_ signature." +msgid "This is the 2-core heart of example 2) before branches are attached." msgstr "" -msgid "Using the `Edges and Vertices`_ signature." +msgid "Every vertex has degree :math:`2` in the cycle, so all core numbers are :math:`2`." msgstr "" -msgid "Degree of a sub graph" +msgid "8) Star graph (hub and spokes, all core :math:`1`)" msgstr "" -msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgid "A star has a central hub connected to leaf vertices. Every vertex is peeled at :math:`k = 1`." msgstr "" -msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +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 ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgid "Star-like cul-de-sac layouts in road networks often produce core :math:`1` vertices throughout." msgstr "" -msgid "The vertices not participating on the edge are considered isolated" +msgid "Empty edge set" msgstr "" -msgid "their degree is 0 in the subgraph and" +msgid "9) No edges in the SQL query" msgstr "" -msgid "their degree is not shown in the output." +msgid "When the inner query returns no edges, a notice is emitted and the result is empty." msgstr "" -msgid "Using a vertex table" +msgid "No exception is raised." msgstr "" -msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgid "Core numbers and planarity" msgstr "" -msgid "Extract the vertex information and save into a table:" +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 "Dry run execution" +msgid "10) Planarity of the subgraph with edges :math:`id < 10`" msgstr "" -msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgid "First compute core numbers (example 2)), then filter the 2-core (example 3)), then test planarity:" msgstr "" -msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgid "The subgraph with edges :math:`id < 10` is planar (``pgr_isPlanar`` returns ``true``)." msgstr "" -msgid "Finding dead ends" +msgid "The four vertices with core :math:`2` lie in the densest part of this subgraph." msgstr "" -msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgid "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 "The degree of a dead end is 1." +msgid "11) Complete graph :math:`K_4` (all vertices core :math:`3`)" msgstr "" -#, fuzzy -msgid "Finding linear vertices" -msgstr ":doc:`pgr_withPointsCostMatrix`" - -msgid "The degree of a linear vertex is 2." +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 "If there is a vertices table already built using the ``pgr_extractVertices``" +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 ":doc:`pgr_extractVertices`" -msgstr ":doc:`pgr_extractVertices`" - -msgid "``pgr_depthFirstSearch`` - Proposed" +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 "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgid "The degeneracy of this graph is :math:`3`, compared with :math:`2` for the :doc:`sampledata` network." msgstr "" -msgid "Version 3.3.0" +msgid "Batagelj, V. and Zaversnik, M. (2003). `An O(m) Algorithm for Cores Decomposition of Networks `__" msgstr "" -msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgid "`Wikipedia: Degeneracy (graph theory) `__" msgstr "" -msgid "The implementation works for both **directed** and **undirected** graphs." +msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" -msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgid "Version 3.4.0" msgstr "" -msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +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 "It does not produce the shortest path from a root vertex to a target vertex." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." msgstr "" -msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "The returned values are ordered in ascending order of `start_vid`." +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" -msgid "Depth First Search Running time: :math:`O(E + V)`" +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "where :math:`|V|` is the number of vertices," msgstr "" -msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid ":math:`m` is the maximum degree of the vertices in the graph." msgstr "" -msgid "**options:** ``[directed, max_depth]``" +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 "결과 컬럼" + +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 "" + +#, fuzzy +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:" +msgstr "" + +msgid "`Vertex SQL`_" +msgstr "" + +msgid "`Vertex SQL`_ as described below" +msgstr "" + +msgid "``dryrun``" +msgstr "``dryrun``" + +msgid "When true do not process and get in a NOTICE the resulting query." +msgstr "" + +msgid "For the `Edges and Vertices`_ signature:" +msgstr "" + +msgid "For the `Edges`_ signature:" +msgstr "" + +msgid "Vertex SQL" +msgstr "" + +msgid "``in_edges``" +msgstr "``in_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgstr "" + +msgid "When missing, ``out_edges`` must exist." +msgstr "" + +msgid "``out_edges``" +msgstr "``out_edges``" + +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgstr "" + +msgid "When missing, ``in_edges`` must exist." +msgstr "" + +msgid "Vertex identifier" +msgstr "" + +msgid "``degree``" +msgstr "``degree``" + +msgid "Number of edges that are incident to the vertex ``id``" +msgstr "" + +msgid "Degree of a loop" +msgstr "" + +msgid "Using the `Edges`_ signature." +msgstr "" + +msgid "Using the `Edges and Vertices`_ signature." +msgstr "" + +msgid "Degree of a sub graph" +msgstr "" + +msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgstr "" + +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr "" + +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgstr "" + +msgid "The vertices not participating on the edge are considered isolated" +msgstr "" + +msgid "their degree is 0 in the subgraph and" +msgstr "" + +msgid "their degree is not shown in the output." +msgstr "" + +msgid "Using a vertex table" +msgstr "" + +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgstr "" + +msgid "Extract the vertex information and save into a table:" +msgstr "" + +msgid "Dry run execution" +msgstr "" + +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgstr "" + +msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgstr "" + +msgid "Finding dead ends" +msgstr "" + +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgstr "" + +msgid "The degree of a dead end is 1." +msgstr "" + +#, fuzzy +msgid "Finding linear vertices" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "The degree of a linear vertex is 2." +msgstr "" + +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "" + +msgid ":doc:`pgr_extractVertices`" +msgstr ":doc:`pgr_extractVertices`" + +msgid "``pgr_depthFirstSearch`` - Proposed" +msgstr "" + +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "" + +msgid "Version 3.3.0" +msgstr "" + +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "" + +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "" + +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgstr "" + +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgstr "" + +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgstr "" + +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "" + +msgid "The aggregate cost of traversal is not guaranteed to be minimal." +msgstr "" + +msgid "The returned values are ordered in ascending order of `start_vid`." +msgstr "" + +msgid "Depth First Search Running time: :math:`O(E + V)`" +msgstr "" + +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "" + +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "" + +msgid "**options:** ``[directed, max_depth]``" msgstr "" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." @@ -9207,9 +9610,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 +10069,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 +10160,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`" @@ -9830,10 +10246,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 "" @@ -11156,6 +11568,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 +11662,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 +11872,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 +12105,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 +13565,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 +13617,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 +13665,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 +13699,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 +13777,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 +13840,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13198,15 +13908,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 +14650,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 "" @@ -15065,9 +15772,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -16539,3 +17243,10 @@ msgstr "" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" + +#~ 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..0c0dd61f8ae 100644 --- a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-09-28 18:14+0000\n" "PO-Revision-Date: 2025-12-08 08:47+0000\n" "Last-Translator: Daniel Nylander \n" "Language-Team: Swedish \n" @@ -339,6 +339,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictio 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" @@ -3048,6 +3054,10 @@ msgstr ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." +#, fuzzy +msgid ":doc:`pgr_maxWeightedMatch` - Calculates a maximum weighted matching in a graph." +msgstr ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." + msgid ":doc:`chinesePostmanProblem-family`" msgstr ":doc:`chinesePostmanProblem-family`" @@ -3099,9 +3109,28 @@ msgstr ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centr msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr ":doc:`pgr_bandwidth` - Beräknar bandbredden för en graf." +#, fuzzy +msgid ":doc:`pgr_coreNumbers` - Computes the core number of each vertex." +msgstr ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." + 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`` - Returnerar ett boolean beroende på grafens planaritet." + +#, fuzzy +msgid ":doc:`pgr_makeBiconnectedPlanar` - Returns edges to add to a planar graph to make each connected component biconnected." +msgstr ":doc:`pgr_makeConnected` - Details of edges to make graph connected." + +msgid ":doc:`pgr_planarFaces` - Identifies the faces of a planar embedding and lists every edge-face incidence for an undirected graph." +msgstr "" + msgid "categories" msgstr "kategorier" @@ -3120,12 +3149,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" @@ -3528,7 +3551,84 @@ 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" +#, fuzzy +msgid "4.1.0 Build" +msgstr "Buggfixar" + +#, fuzzy +msgid "PostgreSQL:" +msgstr "``postgreSQL``" + +#, fuzzy +msgid "Minimum requirement: 14" +msgstr "Uttryckliga minimikrav:" + +msgid "Boost library:" +msgstr "" + +#, fuzzy +msgid "Minimum requirement: 1.74" +msgstr "Uttryckliga minimikrav:" + +msgid "cmake:" +msgstr "" + +#, fuzzy +msgid "Minimum requirement: 3.22" +msgstr "Uttryckliga minimikrav:" + +#, fuzzy +msgid "4.1.0 Summary of changes by function" +msgstr "Sammanfattning av förändringar per funktion" + +#, fuzzy +msgid "pgr_coreNumbers" +msgstr "pgr_nodeNetwork" + +msgid "New experimental function." +msgstr "Ny experimentell funktion." + +msgid "pgr_edgeColoring" +msgstr "pgr_edgeColoring" + +#, fuzzy +msgid "Fix the way it builds the graph" +msgstr "ger grafens bandbredd." + +#, 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 "Nya experimentella funktioner." + +#, 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 "Förbättringar av koden" #, fuzzy @@ -3575,22 +3675,33 @@ msgstr "`#3025 `__: Ordnings msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "`#3025 `__: Ordningsfunktioner standardiserade" -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 "`#3025 `__: Ordningsfunktioner standardiserade" + +#, fuzzy +msgid "`#3154 `__: betweennessCentrality: use allpairs/process and driver" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" + +#, fuzzy +msgid "4.1.0 Bug Fixes" msgstr "Buggfixar" #, fuzzy msgid "`#3101 `__: pgr_edgeColoring not building graph correctly" msgstr "`#2924 `__: pgr_edgeColoring" -msgid "Summary of changes by function" -msgstr "Sammanfattning av förändringar per funktion" - -msgid "pgr_edgeColoring" -msgstr "pgr_edgeColoring" +#, fuzzy +msgid "4.1.0 Requirements" +msgstr "Förbättringar av koden" #, fuzzy -msgid "Fix the way it builds the graph" -msgstr "ger grafens bandbredd." +msgid "`#3120 `__: Up min requirements: Boost to 1.74 Postgres to 14 cmake to 3.22." +msgstr "`#1850 `__: Ändra Boost min-version till 1.56" msgid "All releases" msgstr "Alla utgåvor" @@ -6010,23 +6121,24 @@ 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" +#, fuzzy +msgid "C++ standard" +msgstr "C++-standarden är std17" -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 "" -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 "Boost Graph Library (BGL) >= 1.56.0" -msgid "CMake >= 3.12" -msgstr "CMake >= 3.12" +#, fuzzy +msgid "CMake >= 3.22" +msgstr "CMake >= 3.2" msgid "For user's documentation" msgstr "För användardokumentation" @@ -6286,7 +6398,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" +#, 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, 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, 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)" @@ -7009,9 +7122,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." @@ -8626,128 +8736,471 @@ 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" +#, fuzzy +msgid "``pgr_coreNumbers`` - Experimental" +msgstr "``pgr_pickDeliver`` - 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 "" -msgid "Version 3.4.0" -msgstr "Version 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 "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 "" -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 "" -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 "" -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 "" -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 "" -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 "" -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 "" -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 "" -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 "" -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 "" -msgid "Returns set of ``(seq, node)``" -msgstr "Returnerar uppsättning av ``(seq, node)``" +#, fuzzy +msgid "Loops and parallel edges are removed." +msgstr "Intilliggande kanter tas bort." -msgid "Sequence of the order starting from 1." -msgstr "Ordningsföljd med början från 1." +#, fuzzy +msgid "All vertices are kept" +msgstr "Alla fordon är likvärdiga." -msgid "New ordering in reverse order." -msgstr "Ny beställning i omvänd ordning." +#, fuzzy +msgid "Costs are ignored" +msgstr "Negativa kostnader ignoreras." -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "`Boost: Cuthill-McKee Beställning `__" +msgid "Each vertex receives exactly one core number" +msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "`Wikipedia: Cuthill-McKee-ordning `__" +#, fuzzy +msgid "Results:" +msgstr "Resultat" -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr "``pgr_dagShortestPath`` - Experimentell" +#, fuzzy +msgid "Number of returned rows: :math:`|V|`." +msgstr "Antal nödvändiga sökvägar." -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." +#, fuzzy +msgid "Ordered by ``node`` ascending." +msgstr "``nod`` stigande" -msgid "pgr_dagShortestPath(Combinations)" -msgstr "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``)." -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``)." +#, fuzzy +msgid "Running time: :math:`O(|E| + |E| + |V| log |V|)`" +msgstr "Drifttid: :math:`O(E * (E + V * logV))`" -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 "" -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." +#, fuzzy +msgid "Peeling algorithm: :math:`O(|E|)`" +msgstr "Speltid: :math:`O(|V|)`" -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." +#, fuzzy +msgid "Sorting: :math:`|V| log |V|`" +msgstr "Sämsta fall: :math:`O(| V | * | E |)`" -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`" +#, fuzzy +msgid "pgr_coreNumbers(`Edges SQL`_)" +msgstr "pgr_prim(`Kanter 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`" +#, fuzzy +msgid "Returns set of ``(seq, node, core)``" +msgstr "Returnerar uppsättning av ``(seq, node)``" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" -msgstr "Drifttid: :math:`O(| start\\_vids | * (V + E))`" +#, fuzzy +msgid "Core numbers on a subgraph of :doc:`sampledata`" +msgstr "För följande ä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 "" -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 "" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_dagShortestPath(`Kanter SQL`_, **start vids**, **end vid**)" +#, fuzzy +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." +msgstr "Låt :math:`v` och :math:`u` vara noder i grafen:" -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 "" -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 "" -msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" -msgstr "Från toppunkten :math:`5` till toppunkten :math:`11` på en **riktad** graf" +msgid "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\\}`" -msgstr "Från toppunkten :math:`5` till toppunkterna :math:`{7, 11\\}`" +msgid "K-core peeling (illustration)" +msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" -msgstr "Från topparna :math:`\\{5, 10\\}` till topp :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" -msgstr "Från topparna :math:`\\{5, 15\\}` till topparna :math:`\\{11, 17\\}` i en **omdirigerad** graf" +#, fuzzy +msgid "Sequential value starting from 1." +msgstr "Sekventiellt värde med början från **1**." -msgid "Return columns" -msgstr "Returnera kolumner" +#, fuzzy +msgid "``core``" +msgstr "``color``" -msgid "Making **start_vids** the same as **end_vids**" -msgstr "Gör **start_vids** till samma sak som **end_vids**" +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "" -msgid "`Boost: DAG shortest paths `__" -msgstr "`Boost: DAG kortaste vägar `__" +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 "https://en.wikipedia.org/wiki/Topological_sorting" -msgstr "https://en.wikipedia.org/wiki/Topological_sorting" +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 "För en riktad delgraf med kanter :math:`\\{1, 2, 3, 4\\}`." + +#, fuzzy +msgid "Vertices :math:`5` and :math:`15` are terminal (core :math:`1`)." +msgstr "Låt :math:`v` och :math:`u` vara noder i grafen:" + +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 "Ogirigerad enkel graf" + +#, fuzzy +msgid "2) Core numbers on edges :math:`id < 10`" +msgstr "uppsättningen kanter :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) Väg från :math:`12` till :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 "Riktad enkel graf" + +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 "Huvudgraf" + +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 "uppsättningen av hörn :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 "Från topparna :math:`{11, 3, 17\\}` till topparna :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 "Kapacitet kanter" + +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 "Migrationsavsnittet skapas." + +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 "För en riktad delgraf med kanter :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 "Exemplen i detta avsnitt är baserade på :doc:`sampledata`-nätverket." + +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: dominatorträd `__" + +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``)." + +#, fuzzy +msgid "This implementation can only be used with a directed graph with no cycles i.e. directed acyclic graph." +msgstr "Denna implementation kan endast användas med en **riktad** graf utan cykler, dvs. en riktad acyklisk graf." + +msgid "The 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." + +#, fuzzy +msgid "Process is valid for weighted directed acyclic graphs only." +msgstr "Processen är endast giltig för viktade riktade acykliska grafer. annars kommer den att ge varningar." + +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 "När grafen är tvådelad" + +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" + +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "Från toppunkten :math:`5` till toppunkterna :math:`{7, 11\\}`" + +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +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 "" + +msgid "Return columns" +msgstr "Returnera kolumner" + +msgid "Making **start_vids** the same as **end_vids**" +msgstr "Gör **start_vids** till samma sak som **end_vids**" + +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: DAG kortaste vägar `__" + +msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgstr "https://en.wikipedia.org/wiki/Topological_sorting" msgid "``pgr_degree``" msgstr "``pgr_degree``" @@ -9046,9 +9499,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 +9955,13 @@ 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." +#, 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 "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,6 +10046,15 @@ 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 "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "pgr_drivingDistance(Single vertex)" @@ -9664,10 +10130,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|" @@ -10952,32 +11414,120 @@ msgstr "Routing kan nu göras med hjälp av originalvertices id med :doc:`pgr_di msgid "Complete routing graph" msgstr "Komplett routningsgraf" -msgid "Add edges from the original graph" -msgstr "Lägg till kanter från den ursprungliga grafen" +msgid "Add edges from the original graph" +msgstr "Lägg till kanter från den ursprungliga grafen" + +msgid "Add all the edges that are not involved in the line graph process to the new table" +msgstr "Lägg till alla kanter som inte är involverade i linjediagramprocessen i den nya tabellen" + +msgid "Some administrative tasks to get new identifiers for the edges" +msgstr "Vissa administrativa uppgifter för att få nya identifierare för kanterna" + +msgid "Add the newly calculated edges" +msgstr "Lägg till de nyligen beräknade kanterna" + +msgid "Using the routing graph" +msgstr "Använda routningsgrafen" + +msgid "When using this method for routing with soft restrictions there will be uturns" +msgstr "När du använder den här metoden för routning med mjuka begränsningar kommer det att finnas uturns" + +msgid "Routing from :math:`5` to :math:`1`" +msgstr "Routning från :math:`5` till :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`` - Experimentell" + +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 "Använda :doc:`pgr_connectedComponents`" + +#, fuzzy +msgid "When the graph is not planar it will emit an ``ERROR``" +msgstr "När grafen är tvådelad" + +#, fuzzy +msgid "Run :doc:`pgr_isPlanar` first." +msgstr ":doc:`pgr_isPlanar`" + +#, fuzzy +msgid "All vertices are kept." +msgstr "Alla fordon är likvärdiga." + +#, fuzzy +msgid "Costs are ignored." +msgstr "Negativa kostnader ignoreras." + +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` när grafen inte är planar." + +#, fuzzy +msgid "Running time: :math:`O(|V| + |E| + R \\log R)` for each component" +msgstr "Drifttid: :math:`O(E * (E + V * logV))`" + +#, fuzzy +msgid ":math:`R` is the number of returned edges." +msgstr ":math:`k` is the number of colors used." + +#, fuzzy +msgid "pgr_makeBiconnectedPlanar(`Edges SQL`_)" +msgstr "pgr_makeConnected(`Kanter SQL`_)" + +msgid "Returns set of |result-component-make|" +msgstr "Returnerar uppsättning av |result-component-make|" -msgid "Add all the edges that are not involved in the line graph process to the new table" -msgstr "Lägg till alla kanter som inte är involverade i linjediagramprocessen i den nya tabellen" +#, fuzzy +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "Lista över kanter som behövs för att koppla ihop grafen." -msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "Vissa administrativa uppgifter för att få nya identifierare för kanterna" +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." +msgstr "" -msgid "Add the newly calculated edges" -msgstr "Lägg till de nyligen beräknade kanterna" +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 "Using the routing graph" -msgstr "Använda routningsgrafen" +#, fuzzy +msgid "4-vertex path graph." +msgstr "Förbered grafen" -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "När du använder den här metoden för routning med mjuka begränsningar kommer det att finnas uturns" +#, fuzzy +msgid "Create a 4-vertex tree graph." +msgstr "Skapa den kontraherade grafen." -msgid "Routing from :math:`5` to :math:`1`" -msgstr "Routning från :math:`5` till :math:`1`" +#, fuzzy +msgid "Get the edges needed to have biconnected planar graph." +msgstr "Lista över kanter som behövs för att koppla ihop grafen." -msgid "https://en.wikipedia.org/wiki/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +#, fuzzy +msgid "Adding the edges to the graph" +msgstr "Bryggorna i grafen" -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +#, fuzzy +msgid "`Boost: make_biconnected_planar `__" +msgstr "`Boost: skapa anslutning `__" msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - Experimentell" @@ -10997,9 +11547,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." @@ -11210,6 +11757,50 @@ 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)" +#, fuzzy +msgid "``pgr_maxWeightedMatch`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimentell" + +#, fuzzy +msgid "``pgr_maxWeightedMatch`` — Calculates a maximum weighted matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` - Beräknar en matchning med maximal kardinalitet 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 "" + +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 "Det kan finnas många maximala matchningar." + +#, fuzzy +msgid "Calculates one possible maximum weighted matching in a graph." +msgstr "Beräknar en möjlig matchning med maximal kardinalitet i en graf." + +#, fuzzy +msgid "Running time: :math:`O(V^3)`." +msgstr "Speltid: :math:`O( V ^ 3)`" + +#, fuzzy +msgid "pgr_maxWeightedMatch(`Edges SQL`_)" +msgstr "pgr_maxCardinalityMatch(`Kanter SQL`_)" + +#, fuzzy +msgid "Set of |result-edge|" +msgstr "Returnerar uppsättning av |result-edge|" + +msgid "Maximum weighted matching on a custom 5-vertex graph." +msgstr "" + +#, fuzzy +msgid "`Boost: maximum_weighted_matching `__" +msgstr "`Boost: maximum_matching `__" + msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - Experimentell" @@ -11405,6 +11996,169 @@ 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" +#, fuzzy +msgid "``pgr_planarFaces`` - Experimental" +msgstr "``pgr_isPlanar`` - Experimentell" + +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 "Intilliggande kanter tas bort." + +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 "Speltid: :math:`O(E + V)`" + +#, fuzzy +msgid "pgr_planarFaces(`Edges SQL`_)" +msgstr "pgr_isPlanar(`Kanter SQL`)" + +#, fuzzy +msgid "Returns set of ``(seq, face_id, edge_id, side)``" +msgstr "Returnerar uppsättning av ``(seq, vertex_id, idom)``" + +#, fuzzy +msgid "Faces of the full :doc:`sampledata` graph" +msgstr "Kretsar som finns i 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 "Identifierare för den första slutpunktsvertexen på kanten." + +#, fuzzy +msgid "Identifier of the edge that borders the face." +msgstr "Identifierar den kant som är en bro." + +#, fuzzy +msgid "``1`` when the edge borders the face on the left side." +msgstr ":math:`-1` when the edge does not exist in the graph" + +#, fuzzy +msgid "``2`` when the edge borders the face on the right side." +msgstr ":math:`-1` when the edge does not exist in the graph" + +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 "Skapa den kontraherade grafen." + +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 "En grafkomponent med endast ett segment." + +#, fuzzy +msgid "Two loop graph with only one vertex:" +msgstr "En grafkomponent med endast ett segment." + +#, fuzzy +msgid "Triangular graphs" +msgstr "Huvudgraf" + +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*-sökning `__" + +#, fuzzy +msgid "Boost Graph Library: `Boost: Boyer Myrvold planarity `__" +msgstr "`Boost: Boyer Myrvold `__" + +#, fuzzy +msgid "Wikipedia: `Planar graph `__" +msgstr "wikipedia: `Linjediagram `__" + +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``" @@ -12698,6 +13452,10 @@ 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." +#, fuzzy +msgid "Planar - Family of functions" +msgstr "Prim - Familj av funktioner" + msgid "Prim - Family of functions" msgstr "Prim - Familj av funktioner" @@ -12746,6 +13504,42 @@ 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 3.0.1" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" + +#, fuzzy +msgid "4.0.2 Summary of changes by function" +msgstr "Sammanfattning av förä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" + +#, fuzzy +msgid "4.0.2 Bug Fixes" +msgstr "Buggfixar" + +#, fuzzy +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "`#1640 `__: pgr_withPoints misslyckas när points_sql är tom" + +#, fuzzy +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" + #, fuzzy msgid "pgRouting 4.0.1 Release Notes" msgstr "Versionsinformation för pgRouting 3.0.1" @@ -12754,6 +13548,9 @@ msgstr "Versionsinformation för pgRouting 3.0.1" msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" +msgid "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" @@ -12765,6 +13562,9 @@ msgstr "`#2934 `__: pgr_tran msgid "`#3010 `__: Performance issue with pgr_separateTouching()" msgstr "`#2874 `__: Befordrad till officiell pgr_separateTouching i version 3.8" +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" @@ -12803,7 +13603,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" +#, fuzzy +msgid "4.0.0 Build" msgstr "Skapa" msgid "C++ standard is std17" @@ -12881,6 +13682,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 +13745,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13010,15 +13811,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 +14537,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" @@ -14819,9 +15617,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (proposed)" @@ -16268,6 +17063,29 @@ msgstr "pgr_withPointsDD is pgr_drivingDistance **with points**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" +#~ 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 +17473,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 +17953,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..79e8cbf17fd 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-09-28 18:14+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 "实验性函数" @@ -3070,6 +3076,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 +3134,28 @@ 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 "" + msgid "categories" msgstr "类别" @@ -3145,12 +3174,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 "其他算法" @@ -3557,7 +3580,82 @@ 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 "边不是图的一部分：" + +#, 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 +3702,33 @@ 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 "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 "所有版本" @@ -6190,25 +6299,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 +6586,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 +7317,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 "那些属于多于一个双连通分量的顶点被称为关节点，或者等效地称为割点。关节点是指那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。" @@ -8853,134 +8956,477 @@ 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 implementation is for **undirected** graphs." -msgstr "该实现适用于 **无向** 图。" +msgid "The core number says how deeply a vertex sits inside the graph:" +msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." -msgstr "带宽最小化问题被认为是NP完全问题。" +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|)`" -msgstr "运行时间复杂度为： :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," -msgstr "其中 :math:`|V|` 是顶点数，" +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." -msgstr ":math:`m` 是图中顶点的最大度数。" +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`_)" -msgstr "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|" -msgstr "返回集合 |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`" -msgstr "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)``" -msgstr "返回 ``(seq, node)`` 的集合" +#, fuzzy +msgid "Loops and parallel edges are removed." +msgstr "相邻边被移除。" -msgid "Sequence of the order starting from 1." -msgstr "从1开始的顺序序列。" +#, fuzzy +msgid "All vertices are kept" +msgstr "所有车辆都是平等的。" -msgid "New ordering in reverse order." -msgstr "新的逆序排列。" +#, fuzzy +msgid "Costs are ignored" +msgstr ":math:`0` 值被忽略" -msgid "`Boost: Cuthill-McKee Ordering `__" -msgstr "`Boost: Cuthill-McKee 排序 `__" +msgid "Each vertex receives exactly one core number" +msgstr "" -msgid "`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "`Wikipedia: Cuthill-McKee 排序 `__" +#, fuzzy +msgid "Results:" +msgstr "结果" -msgid "``pgr_dagShortestPath`` - Experimental" -msgstr "``pgr_dagShortestPath`` - 实验性" +#, fuzzy +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." -msgstr "``pgr_dagShortestPath`` — 返回加权有向无环图（DAG）中的最短路径。特别是使用 Boost.Graph 实现的 DAG 最短路径算法。" +#, fuzzy +msgid "Ordered by ``node`` ascending." +msgstr "``node`` 升序" -msgid "pgr_dagShortestPath(Combinations)" -msgstr "pgr_dagShortestPath(组合)" +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``)." -msgstr "有向无环图（DAG）的最短路径是一种图搜索算法，用于解决加权有向无环图的最短路径问题，找到从起始顶点 (``start_vid``) 到结束顶点 (``end_vid``) 的最短路径。" +#, fuzzy +msgid "Running time: :math:`O(|E| + |E| + |V| log |V|)`" +msgstr "运行时间： :math:`O(E * (E + V * logV))`" -msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." -msgstr "这个实现只能用于 **有向** 图，且没有循环，即有向无环图。" +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." -msgstr "该算法依靠对 DAG 进行拓扑排序来对顶点进行线性排序，因此比 Dijkstra 或 Bellman-Ford 算法更有效率。" +#, fuzzy +msgid "Peeling algorithm: :math:`O(|E|)`" +msgstr "运行时间： :math:`O(|V|)`" -msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." -msgstr "该过程仅对加权有向无环图有效。 否则它会抛出警告。" +#, fuzzy +msgid "Sorting: :math:`|V| log |V|`" +msgstr "最坏的情况： :math:`O(| V | * | E |)`" -msgid "The `agg_cost` the non included values `(v, v)` is `0`" -msgstr "`agg_cost`中未包括的值`(v, v)` 的成本为`0`" +#, fuzzy +msgid "pgr_coreNumbers(`Edges SQL`_)" +msgstr "pgr_prim(`Edges SQL`_)" -msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" -msgstr "`agg_cost`中未包括的值 `(u, v)`是数学符号中的 :math:`\\infty`" +#, fuzzy +msgid "Returns set of ``(seq, node, core)``" +msgstr "返回 ``(seq, node)`` 的集合" -msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" -msgstr "运行时间： :math:`O(| start\\_vids | * (V + E))`" +#, fuzzy +msgid "Core numbers on a subgraph of :doc:`sampledata`" +msgstr "下面是 :doc:`sampledata` 的子图：" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "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**)" -msgstr "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**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +#, fuzzy +msgid "Vertices :math:`5` and :math:`15` are terminal nodes in this subgraph (degree :math:`1`)." +msgstr "设 :math:`v` 和 :math:`u` 为图上的节点：" -msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "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`_)" -msgstr "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" -msgstr "在 **有向** 图上，从顶点 :math:`5` 到顶点 :math:`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 vertex :math:`5` to vertices :math:`\\{7, 11\\}`" -msgstr "从顶点 :math:`5` 到顶点 :math:`\\{7, 11\\}`" +msgid "K-core peeling (illustration)" +msgstr "" -msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" -msgstr "从顶点 :math:`\\{5, 10\\}` 到顶点 :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" -msgstr "在 **无向** 图上，从顶点 :math:`\\{5, 15\\} ` 到顶点 :math:`\\{11, 17\\}`" +#, fuzzy +msgid "Sequential value starting from 1." +msgstr "从 **1** 开始的顺序值。" -msgid "Return columns" -msgstr "返回列" +#, fuzzy +msgid "``core``" +msgstr "``color``" -msgid "Making **start_vids** the same as **end_vids**" -msgstr "使 **start_vids** 与 **end_vids** 相同" +msgid "Core number of the vertex: the largest :math:`k` for which the vertex belongs to the :math:`k`-core." +msgstr "" -msgid "`Boost: DAG shortest paths `__" -msgstr "`Boost: DAG最短路径DAG 最短路径 `__" +msgid "The examples of this section are based on the :doc:`sampledata` network." +msgstr "本节的示例基于 :doc:`sampledata` 网络。" -msgid "https://en.wikipedia.org/wiki/Topological_sorting" -msgstr "https://en.wikipedia.org/wiki/Topological_sorting" +msgid "Sample network overview" +msgstr "" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +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`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." -msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" +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 "该实现适用于 **无向** 图。" + +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "带宽最小化问题被认为是NP完全问题。" + +msgid "The running time complexity is: :math:`O(m log(m)|V|)`" +msgstr "运行时间复杂度为： :math:`O(m log(m)|V|)`" + +msgid "where :math:`|V|` is the number of vertices," +msgstr "其中 :math:`|V|` 是顶点数，" + +msgid ":math:`m` is the maximum degree of the vertices in the graph." +msgstr ":math:`m` 是图中顶点的最大度数。" + +msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" +msgstr "pgr_cuthillMckeeOrdering(`Edges SQL`_)" + +msgid "Returns set of |result_node_order|" +msgstr "返回集合 |result_node_order|" + +msgid "Graph ordering of pgRouting :doc:`sampledata`" +msgstr "pgRouting :doc:`sampledata` 的图形排序" + +msgid "Returns set of ``(seq, node)``" +msgstr "返回 ``(seq, node)`` 的集合" + +msgid "Sequence of the order starting from 1." +msgstr "从1开始的顺序序列。" + +msgid "New ordering in reverse order." +msgstr "新的逆序排列。" + +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Cuthill-McKee 排序 `__" + +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Cuthill-McKee 排序 `__" + +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``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 "``pgr_dagShortestPath`` — 返回加权有向无环图（DAG）中的最短路径。特别是使用 Boost.Graph 实现的 DAG 最短路径算法。" + +msgid "pgr_dagShortestPath(Combinations)" +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``) 的最短路径。" + +#, 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 算法更有效率。" + +#, 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`" + +msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" +msgstr "`agg_cost`中未包括的值 `(u, v)`是数学符号中的 :math:`\\infty`" + +msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" +msgstr "运行时间： :math:`O(| start\\_vids | * (V + E))`" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" + +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" + +msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" +msgstr "在 **有向** 图上，从顶点 :math:`5` 到顶点 :math:`11`" + +msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" +msgstr "从顶点 :math:`5` 到顶点 :math:`\\{7, 11\\}`" + +msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" +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 "返回列" + +msgid "Making **start_vids** the same as **end_vids**" +msgstr "使 **start_vids** 与 **end_vids** 相同" + +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: DAG最短路径DAG 最短路径 `__" + +msgid "https://en.wikipedia.org/wiki/Topological_sorting" +msgstr "https://en.wikipedia.org/wiki/Topological_sorting" + +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 "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" msgid "Error messages adjustment." msgstr "错误信息调整。" @@ -9273,9 +9719,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 +10175,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 +10266,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)" @@ -9891,10 +10350,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|" @@ -11188,35 +11643,123 @@ msgstr "哪些可以删除" msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "现在可以使用 :doc:`pgr_dijkstra` 使用原始顶点 id 来完成路由" -msgid "Complete routing graph" -msgstr "完整的路由图" +msgid "Complete routing graph" +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 "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 "Add edges from the original graph" -msgstr "从原始图中添加边" +msgid "Returns set of |result-component-make|" +msgstr "返回结果 |result-component-make|" -msgid "Add all the edges that are not involved in the line graph process to the new table" -msgstr "将所有不参与折线图过程的边添加到新表中" +#, fuzzy +msgid "List of edges that are needed to make the graph biconnected planar." +msgstr "连接图形所需的边线列表。" -msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "一些获取边新标识符的管理任务" +msgid "Sample graph after adding biconnecting edges (olive = original edges, red dashed = 4 new biconnecting edges)." +msgstr "" -msgid "Add the newly calculated 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 "Using the routing graph" -msgstr "使用路由图" +#, fuzzy +msgid "4-vertex path graph." +msgstr "准备图" -msgid "When using this method for routing with soft restrictions there will be uturns" -msgstr "当使用这种方法进行具有软限制的路由时，将会出现 uturn" +#, fuzzy +msgid "Create a 4-vertex tree graph." +msgstr "创建收缩图。" -msgid "Routing from :math:`5` to :math:`1`" -msgstr "路由从 :math:`5` 到 :math:`1`" +#, fuzzy +msgid "Get the edges needed to have biconnected planar graph." +msgstr "连接图形所需的边线列表。" -msgid "https://en.wikipedia.org/wiki/Line_graph" -msgstr "https://en.wikipedia.org/wiki/Line_graph" +#, fuzzy +msgid "Adding the edges to the graph" +msgstr "图的桥" -msgid "https://en.wikipedia.org/wiki/Complete_graph" -msgstr "https://en.wikipedia.org/wiki/Complete_graph" +#, fuzzy +msgid "`Boost: make_biconnected_planar `__" +msgstr "`Boost: 使图连通 `__" msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - 实验性" @@ -11236,9 +11779,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 +11990,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 +12229,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 +13774,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 +13827,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 +13870,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 +13885,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 +13929,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 +14017,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 +14080,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13352,15 +14146,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 +15053,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 缺少一些策略和最低版本要求" @@ -15412,9 +16203,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 +17673,26 @@ msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" +#~ 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 发布说明"