Skip to content

Commit df4b417

Browse files
cvvergaraweblate
authored andcommitted
Translated using Weblate (Swedish)
Currently translated at 91.6% (4932 of 5379 strings) Translation: pgRouting/pgRouting Translate-URL: https://weblate.osgeo.org/projects/pgrouting/pgrouting-develop/sv/
1 parent 65ee94a commit df4b417

File tree

1 file changed

+21
-21
lines changed

1 file changed

+21
-21
lines changed

locale/sv/LC_MESSAGES/pgrouting_doc_strings.po

Lines changed: 21 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -8,8 +8,8 @@ msgstr ""
88
"Project-Id-Version: pgRouting v4.0\n"
99
"Report-Msgid-Bugs-To: \n"
1010
"POT-Creation-Date: 2025-10-08 19:15+0000\n"
11-
"PO-Revision-Date: 2025-09-22 16:29+0000\n"
12-
"Last-Translator: Daniel Nylander <[email protected]>\n"
11+
"PO-Revision-Date: 2025-10-10 21:10+0000\n"
12+
"Last-Translator: Celia Virginia Vergara Castillo <[email protected]>\n"
1313
"Language-Team: Swedish <https://weblate.osgeo.org/projects/pgrouting/"
1414
"pgrouting-develop/sv/>\n"
1515
"Language: sv\n"
@@ -279,14 +279,14 @@ msgid ""
279279
"Prim%27s_algorithm>`__"
280280
msgstr ""
281281
"`Wikipedia: Prims algoritm <https://en.wikipedia.org/wiki/"
282-
"Prim%27s_algoritm>`__"
282+
"Prim%27s_algorithm>`__"
283283

284284
msgid ""
285285
"`Wikipedia: Kruskal's algorithm <https://en.wikipedia.org/wiki/"
286286
"Kruskal's_algorithm>`__"
287287
msgstr ""
288-
"`Wikipedia: Kruskals algoritm <https://en.wikipedia.org/wiki/Kruskal:"
289-
"s_algoritm>`__"
288+
"`Wikipedia: Kruskals algoritm <https://en.wikipedia.org/wiki/"
289+
"Kruskal's_algorithm>`__"
290290

291291
msgid "Indices and tables"
292292
msgstr "Index och tabeller"
@@ -1905,7 +1905,7 @@ msgstr ""
19051905
"html>`__"
19061906

19071907
msgid "https://en.wikipedia.org/wiki/A*_search_algorithm"
1908-
msgstr "https://en.wikipedia.org/wiki/A*_search_algoritm"
1908+
msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm"
19091909

19101910
msgid "All Pairs - Family of Functions"
19111911
msgstr "Alla par - Familj av funktioner"
@@ -7988,7 +7988,7 @@ msgid ""
79887988
"wiki/Dijkstra%27s_algorithm>`__):"
79897989
msgstr ""
79907990
"Lös exempelproblemet hämtat från `wikipedia <https://en.wikipedia.org/wiki/"
7991-
"Dijkstra%27s_algoritm>`__):"
7991+
"Dijkstra%27s_algorithm>`__):"
79927992

79937993
msgid "Problem is to find the shortest path from :math:`1` to :math:`5`."
79947994
msgstr ""
@@ -10680,8 +10680,8 @@ msgid ""
1068010680
"wikipedia: `Biconnected component <https://en.wikipedia.org/wiki/"
1068110681
"Biconnected_component>`__"
1068210682
msgstr ""
10683-
"wikipedia: \"Sammankopplad komponent <https://en.wikipedia.org/wiki/"
10684-
"Biconnected_component>"
10683+
"wikipedia: `Sammankopplad komponent <https://en.wikipedia.org/wiki/"
10684+
"Biconnected_component>`__"
1068510685

1068610686
#, fuzzy
1068710687
msgid "``pgr_bandwidth`` - Experimental"
@@ -11155,7 +11155,7 @@ msgstr ""
1115511155
"bellman_ford_shortest.html>`__"
1115611156

1115711157
msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"
11158-
msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algoritm"
11158+
msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"
1115911159

1116011160
msgid "``pgr_betweennessCentrality`` - Experimental"
1116111161
msgstr "``pgr_betweennessCentrality`` - Experimentell"
@@ -11446,7 +11446,7 @@ msgstr "https://cp-algorithms.com/graph/01_bfs.html"
1144611446
msgid ""
1144711447
"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants"
1144811448
msgstr ""
11449-
"https://en.wikipedia.org/wiki/Dijkstra%27s_algoritm#Specialiserade_varianter"
11449+
"https://en.wikipedia.org/wiki/Dijkstra%27s_algoritm#Specialized_variants"
1145011450

1145111451
msgid "``pgr_bipartite`` - Experimental"
1145211452
msgstr "``pgr_bipartite`` - Experimentell"
@@ -11834,8 +11834,8 @@ msgid ""
1183411834
"wikipedia: `Connected component <https://en.wikipedia.org/wiki/"
1183511835
"Connected_component_(graph_theory)>`__"
1183611836
msgstr ""
11837-
"wikipedia: sammanhängande komponent <https://en.wikipedia.org/wiki/"
11838-
"Connected_component_(grafteori)>`__"
11837+
"wikipedia: `sammanhängande komponent <https://en.wikipedia.org/wiki/"
11838+
"Connected_component_(graph_theory)>`__"
1183911839

1184011840
msgid "``pgr_contraction``"
1184111841
msgstr "``pgr_kontraktion``"
@@ -13104,7 +13104,7 @@ msgid ""
1310413104
"Cuthill%E2%80%93McKee_algorithm>`__"
1310513105
msgstr ""
1310613106
"`Wikipedia: Cuthill-McKee-ordning <https://en.wikipedia.org/wiki/"
13107-
"Cuthill%E2%80%93McKee_algoritm>`__"
13107+
"Cuthill%E2%80%93McKee_algorithm>`__"
1310813108

1310913109
msgid "``pgr_dagShortestPath`` - Experimental"
1311013110
msgstr "``pgr_dagShortestPath`` - Experimentell"
@@ -13793,7 +13793,7 @@ msgstr ""
1379313793
"dijkstra_shortest_paths.html>`__"
1379413794

1379513795
msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
13796-
msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algoritm"
13796+
msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
1379713797

1379813798
msgid "``pgr_dijkstraCost``"
1379913799
msgstr "``pgr_dijkstraCost``"
@@ -14148,7 +14148,7 @@ msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned"
1414814148
msgstr "När ``false``: ``cap`` gräns per ``Start vid`` kommer att returneras"
1414914149

1415014150
msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
14151-
msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algoritm"
14151+
msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
1415214152

1415314153
#, fuzzy
1415414154
msgid "``pgr_dijkstraNearCost``"
@@ -14670,7 +14670,7 @@ msgstr ""
1467014670
"edmonds_karp_max_flow.html>`__"
1467114671

1467214672
msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm"
14673-
msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algoritm"
14673+
msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm"
1467414674

1467514675
msgid "``pgr_edwardMoore`` - Experimental"
1467614676
msgstr "``pgr_edwardMoore`` - Experimentell"
@@ -15783,7 +15783,7 @@ msgid ""
1578315783
"Dominator_(graph_theory)>`__"
1578415784
msgstr ""
1578515785
"`Wikipedia: dominatorträd <https://en.wikipedia.org/wiki/"
15786-
"Dominator_(grafteori)>`__"
15786+
"Dominator_(graph_theory)>`__"
1578715787

1578815788
msgid "``pgr_lineGraph`` - Proposed"
1578915789
msgstr "``pgr_lineGraph`` - Föreslagen"
@@ -16527,7 +16527,7 @@ msgstr ""
1652716527
msgid ""
1652816528
"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm"
1652916529
msgstr ""
16530-
"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algoritm"
16530+
"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm"
1653116531

1653216532
msgid "``pgr_maxFlowMinCost`` - Experimental"
1653316533
msgstr "``pgr_maxFlowMinCost`` - Experimentell"
@@ -17286,7 +17286,7 @@ msgstr ""
1728617286
"stoer_wagner_min_cut.html>`__"
1728717287

1728817288
msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm"
17289-
msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algoritm"
17289+
msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm"
1729017290

1729117291
msgid "``pgr_strongComponents``"
1729217292
msgstr "``pgr_strongComponents``"
@@ -18847,7 +18847,7 @@ msgid ""
1884718847
"Prim%27s_algorithm>`__"
1884818848
msgstr ""
1884918849
"Wikipedia: `Prims algoritm <https://en.wikipedia.org/wiki/"
18850-
"Prim%27s_algoritm>`__"
18850+
"Prim%27s_algorithm>`__"
1885118851

1885218852
msgid "Proposed Functions"
1885318853
msgstr "Föreslagna funktioner"

0 commit comments

Comments
 (0)